Quadratic eigenvalue problems.
Walsh, Timothy Francis; Day, David Minot
2007-04-01
In this report we will describe some nonlinear eigenvalue problems that arise in the areas of solid mechanics, acoustics, and coupled structural acoustics. We will focus mostly on quadratic eigenvalue problems, which are a special case of nonlinear eigenvalue problems. Algorithms for solving the quadratic eigenvalue problem will be presented, along with some example calculations.
The Born transmission eigenvalue problem
NASA Astrophysics Data System (ADS)
Cakoni, Fioralba; Colton, David; Rezac, Jacob D.
2016-10-01
In this paper we study the distribution of transmission eigenvalues in the complex plane for obstacles whose contrast is small in magnitude. We use a first order approximation of the refractive index to derive and study an approximate interior transmission problem. In the case of spherically stratified media, we prove existence and discreteness of transmission eigenvalues and derive a condition under which the complex part of transmission eigenvalues cannot lie in a strip parallel to the real axis. For obstacles with general shape, we demonstrate that if transmission eigenvalues exist then they form a discrete set.
Solving Large-scale Eigenvalue Problems in SciDACApplications
Yang, Chao
2005-06-29
Large-scale eigenvalue problems arise in a number of DOE applications. This paper provides an overview of the recent development of eigenvalue computation in the context of two SciDAC applications. We emphasize the importance of Krylov subspace methods, and point out its limitations. We discuss the value of alternative approaches that are more amenable to the use of preconditioners, and report the progression using the multi-level algebraic sub-structuring techniques to speed up eigenvalue calculation. In addition to methods for linear eigenvalue problems, we also examine new approaches to solving two types of non-linear eigenvalue problems arising from SciDAC applications.
NASA Astrophysics Data System (ADS)
Chung, Won Sang
2014-07-01
In this paper a new q-deformed oscillator algebra with an integer number eigenvalue and a half odd integer number eigenvalue is proposed. For this algebra, the associated energy spectrum and thermodynamic behavior is discussed.
Highly indefinite multigrid for eigenvalue problems
Borges, L.; Oliveira, S.
1996-12-31
Eigenvalue problems are extremely important in understanding dynamic processes such as vibrations and control systems. Large scale eigenvalue problems can be very difficult to solve, especially if a large number of eigenvalues and the corresponding eigenvectors need to be computed. For solving this problem a multigrid preconditioned algorithm is presented in {open_quotes}The Davidson Algorithm, preconditioning and misconvergence{close_quotes}. Another approach for solving eigenvalue problems is by developing efficient solutions for highly indefinite problems. In this paper we concentrate on the use of new highly indefinite multigrid algorithms for the eigenvalue problem.
Bounds for the eigenvalues of the continuous algebraic Riccati equation
NASA Astrophysics Data System (ADS)
Liu, Jianzhou; Zhang, Juan
2011-10-01
By using singular value decomposition and majorisation inequalities, we propose new upper and lower bounds for summations of eigenvalues (including the trace) of the solution of the continuous algebraic Riccati equation. These bounds improve and extend some of the previous results. Finally, we give corresponding numerical examples to illustrate the effectiveness of our results.
Covariance expressions for eigenvalue and eigenvector problems
NASA Astrophysics Data System (ADS)
Liounis, Andrew J.
There are a number of important scientific and engineering problems whose solutions take the form of an eigenvalue--eigenvector problem. Some notable examples include solutions to linear systems of ordinary differential equations, controllability of linear systems, finite element analysis, chemical kinetics, fitting ellipses to noisy data, and optimal estimation of attitude from unit vectors. In many of these problems, having knowledge of the eigenvalue and eigenvector Jacobians is either necessary or is nearly as important as having the solution itself. For instance, Jacobians are necessary to find the uncertainty in a computed eigenvalue or eigenvector estimate. This uncertainty, which is usually represented as a covariance matrix, has been well studied for problems similar to the eigenvalue and eigenvector problem, such as singular value decomposition. There has been substantially less research on the covariance of an optimal estimate originating from an eigenvalue-eigenvector problem. In this thesis we develop two general expressions for the Jacobians of eigenvalues and eigenvectors with respect to the elements of their parent matrix. The expressions developed make use of only the parent matrix and the eigenvalue and eigenvector pair under consideration. In addition, they are applicable to any general matrix (including complex valued matrices, eigenvalues, and eigenvectors) as long as the eigenvalues are simple. Alongside this, we develop expressions that determine the uncertainty in a vector estimate obtained from an eigenvalue-eigenvector problem given the uncertainty of the terms of the matrix. The Jacobian expressions developed are numerically validated with forward finite, differencing and the covariance expressions are validated using Monte Carlo analysis. Finally, the results from this work are used to determine covariance expressions for a variety of estimation problem examples and are also applied to the design of a dynamical system.
ARPACK: Solving large scale eigenvalue problems
NASA Astrophysics Data System (ADS)
Lehoucq, Rich; Maschhoff, Kristi; Sorensen, Danny; Yang, Chao
2013-11-01
ARPACK is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems. The package is designed to compute a few eigenvalues and corresponding eigenvectors of a general n by n matrix A. It is most appropriate for large sparse or structured matrices A where structured means that a matrix-vector product w
A full multigrid method for eigenvalue problems
NASA Astrophysics Data System (ADS)
Chen, Hongtao; Xie, Hehu; Xu, Fei
2016-10-01
In this paper, a full (nested) multigrid scheme is proposed to solve eigenvalue problems. The idea here is to use a correction method to transform the eigenvalue problem solving to a series of corresponding boundary value problem solving and eigenvalue problems defined on a very low-dimensional finite element space. The boundary value problems which are defined on a sequence of multilevel finite element spaces can be solved by some multigrid iteration steps. The computational work of this new scheme can reach the same optimal order as solving the corresponding boundary value problem by the full multigrid method. Therefore, this type of full multigrid method improves the overfull efficiency of the eigenvalue problem solving.
Nonlinear eigenvalue problems in smectics
Marchenko, V. I. Podolyak, E. R.
2010-01-15
The asymptotic forms of strains in a smectic around the linear distributions of multipole force are determined. The law of a decrease in strains is specified by the indices, which are eigenvalues of nonlinear equations describing the angular dependence of the strains.
Sensitivity analysis and approximation methods for general eigenvalue problems
NASA Technical Reports Server (NTRS)
Murthy, D. V.; Haftka, R. T.
1986-01-01
Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.
Numerical solution of large nonsymmetric eigenvalue problems
NASA Technical Reports Server (NTRS)
Saad, Youcef
1988-01-01
Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.
Eigenvalue and eigenvector sensitivity and approximate analysis for repeated eigenvalue problems
NASA Technical Reports Server (NTRS)
Hou, Gene J. W.; Kenny, Sean P.
1991-01-01
A set of computationally efficient equations for eigenvalue and eigenvector sensitivity analysis are derived, and a method for eigenvalue and eigenvector approximate analysis in the presence of repeated eigenvalues is presented. The method developed for approximate analysis involves a reparamaterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations of changes in both the eigenvalues and eigenvectors associated with the repeated eigenvalue problem. Examples are given to demonstrate the application of such equations for sensitivity and approximate analysis.
Preconditioned techniques for large eigenvalue problems
NASA Astrophysics Data System (ADS)
Wu, Kesheng
1997-11-01
This research focuses on finding a large number of eigenvalues and eigen-vectors of a sparse symmetric or Hermitian matrix, for example, finding 1000 eigenpairs of a 100,000 × 100,000 matrix. These eigenvalue problems are challenging because the matrix size is too large for traditional QR based algorithms and the number of desired eigenpairs is too large for most common sparse eigenvalue algorithms. In this thesis, we approach this problem in two steps. First, we identify a sound preconditioned eigenvalue procedure for computing multiple eigenpairs. Second, we improve the basic algorithm through new preconditioning schemes and spectrum transformations. Through careful analysis, we see that both the Arnoldi and Davidson methods have an appropriate structure for computing a large number of eigenpairs with preconditioning. We also study three variations of these two basic algorithms. Without preconditioning, these methods are mathematically equivalent but they differ in numerical stability and complexity. However, the Davidson method is much more successful when preconditioned. Despite its success, the preconditioning scheme in the Davidson method is seen as flawed because the preconditioner becomes ill-conditioned near convergence. After comparison with other methods, we find that the effectiveness of the Davidson method is due to its preconditioning step being an inexact Newton method. We proceed to explore other Newton methods for eigenvalue problems to develop preconditioning schemes without the same flaws. We found that the simplest and most effective preconditioner is to use the Conjugate Gradient method to approximately solve equations generated by the Newton methods. Also, a different strategy of enhancing the performance of the Davidson method is to alternate between the regular Davidson iteration and a polynomial method for eigenvalue problems. To use these polynomials, the user must decide which intervals of the spectrum the polynomial should suppress. We
Sparse Regression as a Sparse Eigenvalue Problem
NASA Technical Reports Server (NTRS)
Moghaddam, Baback; Gruber, Amit; Weiss, Yair; Avidan, Shai
2008-01-01
We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization
Murphy, W D; Bernabe, M L
1978-08-01
The Prony method is extended to handle the nonsymmetric algebraic eigenvalue problem and improved to search automatically for the number of dominant eigenvalues. A simple iterative algorithm is given to compute the associated eigenvectors. Resolution studies using the QR method are made in order to determine the accuracy of the matrix approximation. Numerical results are given for both simple well defined resonators and more complex advanced designs containing multiple propagation geometries and misaligned mirrors.
Solving large sparse eigenvalue problems on supercomputers
NASA Technical Reports Server (NTRS)
Philippe, Bernard; Saad, Youcef
1988-01-01
An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.
Preconditioned Krylov subspace methods for eigenvalue problems
Wu, Kesheng; Saad, Y.; Stathopoulos, A.
1996-12-31
Lanczos algorithm is a commonly used method for finding a few extreme eigenvalues of symmetric matrices. It is effective if the wanted eigenvalues have large relative separations. If separations are small, several alternatives are often used, including the shift-invert Lanczos method, the preconditioned Lanczos method, and Davidson method. The shift-invert Lanczos method requires direct factorization of the matrix, which is often impractical if the matrix is large. In these cases preconditioned schemes are preferred. Many applications require solution of hundreds or thousands of eigenvalues of large sparse matrices, which pose serious challenges for both iterative eigenvalue solver and preconditioner. In this paper we will explore several preconditioned eigenvalue solvers and identify the ones suited for finding large number of eigenvalues. Methods discussed in this paper make up the core of a preconditioned eigenvalue toolkit under construction.
Differential eigenvalue problems in which the parameter appears nonlinearly
NASA Technical Reports Server (NTRS)
Bridges, T. J.; Morris, P. J.
1984-01-01
Several methods are examined for determining the eigenvalues of a system of equations in which the parameter appears nonlinearly. The equations are the result of the discretization of differential eigenvalue problems using a finite Chebyshev series. Two global methods are considered which determine the spectrum of eigenvalues without an initial estimate. A local iteration scheme with cubic convergence is presented. Calculations are performed for a model second order differential problem and the Orr-Sommerfeld problem for plane Poiseuille flow.
Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems
NASA Technical Reports Server (NTRS)
Johnson, Duane
1996-01-01
Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.
An Implementation and Evaluation of the AMLS Method for SparseEigenvalue Problems
Gao, Weiguo; Li, Xiaoye S.; Yang, Chao; Bai, Zhaojun
2006-02-14
We describe an efficient implementation and present aperformance study of an algebraic multilevel sub-structuring (AMLS)method for sparse eigenvalue problems. We assess the time and memoryrequirements associated with the key steps of the algorithm, and compareitwith the shift-and-invert Lanczos algorithm in computational cost. Oureigenvalue problems come from two very different application areas: theaccelerator cavity design and the normal mode vibrational analysis of thepolyethylene particles. We show that the AMLS method, when implementedcarefully, is very competitive with the traditional method in broadapplication areas, especially when large numbers of eigenvalues aresought.
EvArnoldi: A New Algorithm for Large-Scale Eigenvalue Problems.
Tal-Ezer, Hillel
2016-05-19
Eigenvalues and eigenvectors are an essential theme in numerical linear algebra. Their study is mainly motivated by their high importance in a wide range of applications. Knowledge of eigenvalues is essential in quantum molecular science. Solutions of the Schrödinger equation for the electrons composing the molecule are the basis of electronic structure theory. Electronic eigenvalues compose the potential energy surfaces for nuclear motion. The eigenvectors allow calculation of diople transition matrix elements, the core of spectroscopy. The vibrational dynamics molecule also requires knowledge of the eigenvalues of the vibrational Hamiltonian. Typically in these problems, the dimension of Hilbert space is huge. Practically, only a small subset of eigenvalues is required. In this paper, we present a highly efficient algorithm, named EvArnoldi, for solving the large-scale eigenvalues problem. The algorithm, in its basic formulation, is mathematically equivalent to ARPACK ( Sorensen , D. C. Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations ; Springer , 1997 ; Lehoucq , R. B. ; Sorensen , D. C. SIAM Journal on Matrix Analysis and Applications 1996 , 17 , 789 ; Calvetti , D. ; Reichel , L. ; Sorensen , D. C. Electronic Transactions on Numerical Analysis 1994 , 2 , 21 ) (or Eigs of Matlab) but significantly simpler. PMID:27015379
TWO-GRID METHODS FOR MAXWELL EIGENVALUE PROBLEMS
ZHOU, J.; HU, X.; ZHONG, L.; SHU, S.; CHEN, L.
2015-01-01
Two new two-grid algorithms are proposed for solving the Maxwell eigenvalue problem. The new methods are based on the two-grid methodology recently proposed by Xu and Zhou [Math. Comp., 70 (2001), pp. 17–25] and further developed by Hu and Cheng [Math. Comp., 80 (2011), pp. 1287–1301] for elliptic eigenvalue problems. The new two-grid schemes reduce the solution of the Maxwell eigenvalue problem on a fine grid to one linear indefinite Maxwell equation on the same fine grid and an original eigenvalue problem on a much coarser grid. The new schemes, therefore, save total computational cost. The error estimates reveals that the two-grid methods maintain asymptotically optimal accuracy, and the numerical experiments presented confirm the theoretical results. PMID:26190866
Recent advances in numerical analysis of structural eigenvalue problems
NASA Technical Reports Server (NTRS)
Gupta, K. K.
1973-01-01
A wide range of eigenvalue problems encountered in practical structural engineering analyses is defined, in which the structures are assumed to be discretized by any suitable technique such as the finite-element method. A review of the usual numerical procedures for the solution of such eigenvalue problems is presented and is followed by an extensive account of recently developed eigenproblem solution procedures. Particular emphasis is placed on the new numerical algorithms and associated computer programs based on the Sturm sequence method. Eigenvalue algorithms developed for efficient solution of natural frequency and buckling problems of structures are presented, as well as some eigenvalue procedures formulated in connection with the solution of quadratic matrix equations associated with free vibration analysis of structures. A new algorithm is described for natural frequency analysis of damped structural systems.
An eigenvalue method for solving transient heat conduction problems
NASA Technical Reports Server (NTRS)
Shih, T. M.; Skladany, J. T.
1983-01-01
The eigenvalue method, which has been used by researchers in structure mechanics, is applied to problems in heat conduction. Its formulation is decribed in terms of an examination of transient heat conduction in a square slab. Taking advantage of the availability of the exact solution, we compare the accuracy and other numerical properties of the eigenvalue method with those of existing numerical schemes. The comparsion shows that, overall, the eigenvalue method appears to be fairly attractive. Furthermore, only a few dominant eigenvalues and their corresponding eigenvectors need to be computed and retained to yield reasonably high accuracy. Greater savings are attained in the computation time for a transient problem with long time duration and a large computational domain.
On 2D bisection method for double eigenvalue problems
Ji, X.
1996-06-01
The two-dimensional bisection method presented in (SIAM J. Matrix Anal. Appl. 13(4), 1085 (1992)) is efficient for solving a class of double eigenvalue problems. This paper further extends the 2D bisection method of full matrix cases and analyses its stability. As in a single parameter case, the 2D bisection method is very stable for the tridiagonal matrix triples satisfying the symmetric-definite condition. Since the double eigenvalue problems arise from two-parameter boundary value problems, an estimate of the discretization error in eigenpairs is also given. Some numerical examples are included. 42 refs., 1 tab.
An analytically solvable eigenvalue problem for the linear elasticity equations.
Day, David Minot; Romero, Louis Anthony
2004-07-01
Analytic solutions are useful for code verification. Structural vibration codes approximate solutions to the eigenvalue problem for the linear elasticity equations (Navier's equations). Unfortunately the verification method of 'manufactured solutions' does not apply to vibration problems. Verification books (for example [2]) tabulate a few of the lowest modes, but are not useful for computations of large numbers of modes. A closed form solution is presented here for all the eigenvalues and eigenfunctions for a cuboid solid with isotropic material properties. The boundary conditions correspond physically to a greased wall.
A multilevel finite element method for Fredholm integral eigenvalue problems
NASA Astrophysics Data System (ADS)
Xie, Hehu; Zhou, Tao
2015-12-01
In this work, we proposed a multigrid finite element (MFE) method for solving the Fredholm integral eigenvalue problems. The main motivation for such studies is to compute the Karhunen-Loève expansions of random fields, which play an important role in the applications of uncertainty quantification. In our MFE framework, solving the eigenvalue problem is converted to doing a series of integral iterations and eigenvalue solving in the coarsest mesh. Then, any existing efficient integration scheme can be used for the associated integration process. The error estimates are provided, and the computational complexity is analyzed. It is noticed that the total computational work of our method is comparable with a single integration step in the finest mesh. Several numerical experiments are presented to validate the efficiency of the proposed numerical method.
ERIC Educational Resources Information Center
Nyman, Melvin A.; Lapp, Douglas A.; St. John, Dennis; Berry, John S.
2010-01-01
This paper discusses student difficulties in grasping concepts from Linear Algebra--in particular, the connection of eigenvalues and eigenvectors to other important topics in linear algebra. Based on our prior observations from student interviews, we propose technology-enhanced instructional approaches that might positively impact student…
Dynamic Restarting Schemes for Eigenvalue Problems
Wu, Kesheng; Simon, Horst D.
1999-03-10
In studies of restarted Davidson method, a dynamic thick-restart scheme was found to be excellent in improving the overall effectiveness of the eigen value method. This paper extends the study of the dynamic thick-restart scheme to the Lanczos method for symmetric eigen value problems and systematically explore a range of heuristics and strategies. We conduct a series of numerical tests to determine their relative strength and weakness on a class of electronic structure calculation problems.
NASA Astrophysics Data System (ADS)
Plestenjak, Bor; Gheorghiu, Călin I.; Hochstenbach, Michiel E.
2015-10-01
In numerous science and engineering applications a partial differential equation has to be solved on some fairly regular domain that allows the use of the method of separation of variables. In several orthogonal coordinate systems separation of variables applied to the Helmholtz, Laplace, or Schrödinger equation leads to a multiparameter eigenvalue problem (MEP); important cases include Mathieu's system, Lamé's system, and a system of spheroidal wave functions. Although multiparameter approaches are exploited occasionally to solve such equations numerically, MEPs remain less well known, and the variety of available numerical methods is not wide. The classical approach of discretizing the equations using standard finite differences leads to algebraic MEPs with large matrices, which are difficult to solve efficiently. The aim of this paper is to change this perspective. We show that by combining spectral collocation methods and new efficient numerical methods for algebraic MEPs it is possible to solve such problems both very efficiently and accurately. We improve on several previous results available in the literature, and also present a MATLAB toolbox for solving a wide range of problems.
Finite element method for eigenvalue problems in electromagnetics
NASA Technical Reports Server (NTRS)
Reddy, C. J.; Deshpande, Manohar D.; Cockrell, C. R.; Beck, Fred B.
1994-01-01
Finite element method (FEM) has been a very powerful tool to solve many complex problems in electromagnetics. The goal of the current research at the Langley Research Center is to develop a combined FEM/method of moments approach to three-dimensional scattering/radiation problem for objects with arbitrary shape and filled with complex materials. As a first step toward that goal, an exercise is taken to establish the power of FEM, through closed boundary problems. This paper demonstrates the developed of FEM tools for two- and three-dimensional eigenvalue problems in electromagnetics. In section 2, both the scalar and vector finite elements have been used for various waveguide problems to demonstrate the flexibility of FEM. In section 3, vector finite element method has been extended to three-dimensional eigenvalue problems.
A Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer
Hwang, Seong Jae; Collins, Maxwell D.; Ravi, Sathya N.; Ithapu, Vamsi K.; Adluru, Nagesh; Johnson, Sterling C.; Singh, Vikas
2016-01-01
Eigenvalue problems are ubiquitous in computer vision, covering a very broad spectrum of applications ranging from estimation problems in multi-view geometry to image segmentation. Few other linear algebra problems have a more mature set of numerical routines available and many computer vision libraries leverage such tools extensively. However, the ability to call the underlying solver only as a “black box” can often become restrictive. Many ‘human in the loop’ settings in vision frequently exploit supervision from an expert, to the extent that the user can be considered a subroutine in the overall system. In other cases, there is additional domain knowledge, side or even partial information that one may want to incorporate within the formulation. In general, regularizing a (generalized) eigenvalue problem with such side information remains difficult. Motivated by these needs, this paper presents an optimization scheme to solve generalized eigenvalue problems (GEP) involving a (nonsmooth) regularizer. We start from an alternative formulation of GEP where the feasibility set of the model involves the Stiefel manifold. The core of this paper presents an end to end stochastic optimization scheme for the resultant problem. We show how this general algorithm enables improved statistical analysis of brain imaging data where the regularizer is derived from other ‘views’ of the disease pathology, involving clinical measurements and other image-derived representations. PMID:27081374
NASA Astrophysics Data System (ADS)
Kulshreshtha, Kshitij; Nataraj, Neela
2005-08-01
The paper deals with a parallel implementation of a mixed finite element method of approximation of eigenvalues and eigenvectors of fourth order eigenvalue problems with variable/constant coefficients. The implementation has been done in Silicon Graphics Origin 3800, a four processor Intel Xeon Symmetric Multiprocessor and a beowulf cluster of four Intel Pentium III PCs. The generalised eigenvalue problem obtained after discretization using the mixed finite element method is solved using the package LANSO. The numerical results obtained are compared with existing results (if available). The time, speedup comparisons in different environments for some examples of practical and research interest and importance are also given.
Multitasking the Davidson algorithm for the large, sparse eigenvalue problem
Umar, V.M.; Fischer, C.F. )
1989-01-01
The authors report how the Davidson algorithm, developed for handling the eigenvalue problem for large and sparse matrices arising in quantum chemistry, was modified for use in atomic structure calculations. To date these calculations have used traditional eigenvalue methods, which limit the range of feasible calculations because of their excessive memory requirements and unsatisfactory performance attributed to time-consuming and costly processing of zero valued elements. The replacement of a traditional matrix eigenvalue method by the Davidson algorithm reduced these limitations. Significant speedup was found, which varied with the size of the underlying problem and its sparsity. Furthermore, the range of matrix sizes that can be manipulated efficiently was expended by more than one order or magnitude. On the CRAY X-MP the code was vectorized and the importance of gather/scatter analyzed. A parallelized version of the algorithm obtained an additional 35% reduction in execution time. Speedup due to vectorization and concurrency was also measured on the Alliant FX/8.
Numerical methods on some structured matrix algebra problems
Jessup, E.R.
1996-06-01
This proposal concerned the design, analysis, and implementation of serial and parallel algorithms for certain structured matrix algebra problems. It emphasized large order problems and so focused on methods that can be implemented efficiently on distributed-memory MIMD multiprocessors. Such machines supply the computing power and extensive memory demanded by the large order problems. We proposed to examine three classes of matrix algebra problems: the symmetric and nonsymmetric eigenvalue problems (especially the tridiagonal cases) and the solution of linear systems with specially structured coefficient matrices. As all of these are of practical interest, a major goal of this work was to translate our research in linear algebra into useful tools for use by the computational scientists interested in these and related applications. Thus, in addition to software specific to the linear algebra problems, we proposed to produce a programming paradigm and library to aid in the design and implementation of programs for distributed-memory MIMD computers. We now report on our progress on each of the problems and on the programming tools.
Nonlinear Eigenvalue Problems in Elliptic Variational Inequalities: a local study
Conrad, F.; Brauner, C.; Issard-Roch, F.; Nicolaenko, B.
1985-01-01
The authors consider a class of Nonlinear Eigenvalue Problems (N.L.E.P.) associated with Elliptic Variational Inequalities (E.V.I.). First the authors introduce the main tools for a local study of branches of solutions; the authors extend the linearization process required in the case of equations. Next the authors prove the existence of arcs of solutions close to regular vs singular points, and determine their local behavior up to the first order. Finally, the authors discuss the connection between their regularity condition and some stability concept. 37 references, 6 figures.
Eigenvalue problem of the Liouvillian of open quantum systems
Hatano, Naomichi; Petrosky, Tomio
2015-03-10
It is argued that the Liouvillian that appears in the Liouville-von Neumann equation for open quantum systems can have complex eigenvalues. Attention is paid to the question whether the Liouvillian has an eigenvalue that are not given by the difference of the two Hamiltonian eigenvalues.
NASA Astrophysics Data System (ADS)
Wang, Youming; Chen, Xuefeng; He, Zhengjia
2011-02-01
Structural eigenvalues have been broadly applied in modal analysis, damage detection, vibration control, etc. In this paper, the interpolating multiwavelets are custom designed based on stable completion method to solve structural eigenvalue problems. The operator-orthogonality of interpolating multiwavelets gives rise to highly sparse multilevel stiffness and mass matrices of structural eigenvalue problems and permits the incremental computation of the eigenvalue solution in an efficient manner. An adaptive inverse iteration algorithm using the interpolating multiwavelets is presented to solve structural eigenvalue problems. Numerical examples validate the accuracy and efficiency of the proposed algorithm.
NASA Technical Reports Server (NTRS)
Kenny, Sean P.; Hou, Gene J. W.
1994-01-01
A method for eigenvalue and eigenvector approximate analysis for the case of repeated eigenvalues with distinct first derivatives is presented. The approximate analysis method developed involves a reparameterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations to changes in the eigenvalues and the eigenvectors associated with the repeated eigenvalue problem. This work also presents a numerical technique that facilitates the definition of an eigenvector derivative for the case of repeated eigenvalues with repeated eigenvalue derivatives (of all orders). Examples are given which demonstrate the application of such equations for sensitivity and approximate analysis. Emphasis is placed on the application of sensitivity analysis to large-scale structural and controls-structures optimization problems.
Numerical Solution of the k-Eigenvalue Problem
NASA Astrophysics Data System (ADS)
Hamilton, Steven Paul
2011-12-01
Obtaining solutions to the k-eigenvalue form of the radiation transport equation is an important topic in the design and analysis of nuclear reactors. Although this has been an area of active interest in the nuclear engineering community for several decades, to date no truly satisfactory solution strategies exist. In general, existing techniques are either slow to converge for difficult problems or suffer from stability and robustness issues that can cause solvers to diverge for some problems. This work provides a comparison between a variety of methods and introduces a new strategy based on the Davidson method that has been used in other fields for many years but never for this problem. The Davidson method offers an alternative to the nested iteration structure inherent to standard approaches and allows expensive linear solvers to be replaced by a potentially cheap preconditioner. To fill the role of this preconditioner, a strategy based on a multigrid treatment of the energy variable is developed. Numerical experiments using the 2-D NEWT transport package are presented, demonstrating the effectiveness of the proposed strategy.
Discrete Ordinate Quadrature Selection for Reactor-based Eigenvalue Problems
Jarrell, Joshua J; Evans, Thomas M; Davidson, Gregory G
2013-01-01
In this paper we analyze the effect of various quadrature sets on the eigenvalues of several reactor-based problems, including a two-dimensional (2D) fuel pin, a 2D lattice of fuel pins, and a three-dimensional (3D) reactor core problem. While many quadrature sets have been applied to neutral particle discrete ordinate transport calculations, the Level Symmetric (LS) and the Gauss-Chebyshev product (GC) sets are the most widely used in production-level reactor simulations. Other quadrature sets, such as Quadruple Range (QR) sets, have been shown to be more accurate in shielding applications. In this paper, we compare the LS, GC, QR, and the recently developed linear-discontinuous finite element (LDFE) sets, as well as give a brief overview of other proposed quadrature sets. We show that, for a given number of angles, the QR sets are more accurate than the LS and GC in all types of reactor problems analyzed (2D and 3D). We also show that the LDFE sets are more accurate than the LS and GC sets for these problems. We conclude that, for problems where tens to hundreds of quadrature points (directions) per octant are appropriate, QR sets should regularly be used because they have similar integration properties as the LS and GC sets, have no noticeable impact on the speed of convergence of the solution when compared with other quadrature sets, and yield more accurate results. We note that, for very high-order scattering problems, the QR sets exactly integrate fewer angular flux moments over the unit sphere than the GC sets. The effects of those inexact integrations have yet to be analyzed. We also note that the LDFE sets only exactly integrate the zeroth and first angular flux moments. Pin power comparisons and analyses are not included in this paper and are left for future work.
Numerical study of three-parameter matrix eigenvalue problem by Rayleigh quotient method
NASA Astrophysics Data System (ADS)
Bora, Niranjan; Baruah, Arun Kumar
2016-06-01
In this paper, an attempt is done to find approximate eigenvalues and the corresponding eigenvectors of three-parameter matrix eigenvalue problem by extending Rayleigh Quotient Iteration Method (RQIM), which is generally used to solve generalized eigenvalue problems of the form Ax = λBx. Convergence criteria of RQIM will be derived in terms of matrix 2-norm. We will test the computational efficiency of the Method analytically with the help of numerical examples. All calculations are done in MATLAB software.
A parallel algorithm for the non-symmetric eigenvalue problem
Dongarra, J.; Sidani, M. |
1991-12-01
This paper describes a parallel algorithm for computing the eigenvalues and eigenvectors of a non-symmetric matrix. The algorithm is based on a divide-and-conquer procedure and uses an iterative refinement technique.
Eigenvalue inequalities for the buckling problem of the drifting Laplacian on Ricci solitons
NASA Astrophysics Data System (ADS)
Du, Feng; Mao, Jing; Wang, Qiaoling; Wu, Chuanxi
2016-04-01
In this paper, we investigate the buckling problem of the drifting Laplacian and get a general inequality for its eigenvalues on a bounded connected domain in complete Ricci solitons supporting a special function. By applying this general inequality, we obtain some universal inequalities for eigenvalues of the same problem on bounded connected domains in the Gaussian shrinking solitons and some general product solitons.
Thick-Restart Laczos Method for Symmetric Eigenvalue Problems
1999-01-01
This software package implements the thick-restart Lanczos method. It can be used on either a single address space machine or distributed parallel machine. The user can choose to implement or use a matrix-vector multiplication routine in any form convenient. Most of the arithmetic computations in the software are done through calls to BLAS and LAPACK. The software is written in Fortran 90. Because Fortran 90 offers many utility functions such functions such as dynamic memorymore » management, timing functions, random number generator and so on, the program is easily portable to different machines without modifying the source code. It can also be easily accessed from other language such as C or C-+. Since the software is highly modularized, it is relatively easy to adopt it for different type of situations. For example if the eigenvalue problem may have some symmetry and only a portion of the physical domain is discretized, then the dot-product routine needs to be modified. In this software, this modification is limited to one subroutine. It also can be instructed to write checkpoint files so that it can be restarted at a later time.« less
NASA Technical Reports Server (NTRS)
Costiner, Sorin; Taasan, Shlomo
1994-01-01
This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.
Efficient solutions to the NDA-NCA low-order eigenvalue problem
Willert, J. A.; Kelley, C. T.
2013-07-01
Recent algorithmic advances combine moment-based acceleration and Jacobian-Free Newton-Krylov (JFNK) methods to accelerate the computation of the dominant eigenvalue in a k-eigenvalue calculation. In particular, NDA-NCA [1], builds a sequence of low-order (LO) diffusion-based eigenvalue problems in which the solution converges to the true eigenvalue solution. Within NDA-NCA, the solution to the LO k-eigenvalue problem is computed by solving a system of nonlinear equation using some variant of Newton's method. We show that we can speed up the solution to the LO problem dramatically by abandoning the JFNK method and exploiting the structure of the Jacobian matrix. (authors)
Willert, Jeffrey; Park, H.; Taitano, William
2015-11-01
High-order/low-order (or moment-based acceleration) algorithms have been used to significantly accelerate the solution to the neutron transport k-eigenvalue problem over the past several years. Recently, the nonlinear diffusion acceleration algorithm has been extended to solve fixed-source problems with anisotropic scattering sources. In this paper, we demonstrate that we can extend this algorithm to k-eigenvalue problems in which the scattering source is anisotropic and a significant acceleration can be achieved. Lastly, we demonstrate that the low-order, diffusion-like eigenvalue problem can be solved efficiently using a technique known as nonlinear elimination.
Willert, Jeffrey; Park, H.; Taitano, William
2015-10-12
High-order/low-order (or moment-based acceleration) algorithms have been used to significantly accelerate the solution to the neutron transport k-eigenvalue problem over the past several years. Recently, the nonlinear diffusion acceleration algorithm has been extended to solve fixed-source problems with anisotropic scattering sources. In this paper, we demonstrate that we can extend this algorithm to k-eigenvalue problems in which the scattering source is anisotropic and a significant acceleration can be achieved. Lastly, we demonstrate that the low-order, diffusion-like eigenvalue problem can be solved efficiently using a technique known as nonlinear elimination.
A Note on a Continued Fraction Technique for Certain Eigenvalue Problems. Classroom Notes
ERIC Educational Resources Information Center
Robin, W.
2004-01-01
A criterion (formula) for the termination of a continued fraction expansion leading to the solution of a standard differential eigenvalue problem from mathematical physics is presented. The criterion generates the eigenvalues in any specific case and is illustrated by elementary examples yielding well-known polynomial eigenfunctions. This…
Nease, Brian R. Ueki, Taro
2009-12-10
A time series approach has been applied to the nuclear fission source distribution generated by Monte Carlo (MC) particle transport in order to calculate the non-fundamental mode eigenvalues of the system. The novel aspect is the combination of the general technical principle of projection pursuit for multivariate data with the neutron multiplication eigenvalue problem in the nuclear engineering discipline. Proof is thoroughly provided that the stationary MC process is linear to first order approximation and that it transforms into one-dimensional autoregressive processes of order one (AR(1)) via the automated choice of projection vectors. The autocorrelation coefficient of the resulting AR(1) process corresponds to the ratio of the desired mode eigenvalue to the fundamental mode eigenvalue. All modern MC codes for nuclear criticality calculate the fundamental mode eigenvalue, so the desired mode eigenvalue can be easily determined. This time series approach was tested for a variety of problems including multi-dimensional ones. Numerical results show that the time series approach has strong potential for three dimensional whole reactor core. The eigenvalue ratio can be updated in an on-the-fly manner without storing the nuclear fission source distributions at all previous iteration cycles for the mean subtraction. Lastly, the effects of degenerate eigenvalues are investigated and solutions are provided.
The eigenvalue spectrum of the Orr-Sommerfeld problem
NASA Technical Reports Server (NTRS)
Antar, B. N.
1976-01-01
A numerical investigation of the temporal eigenvalue spectrum of the ORR-Sommerfeld equation is presented. Two flow profiles are studied, the plane Poiseuille flow profile and the Blasius boundary layer (parallel): flow profile. In both cases a portion of the complex c-plane bounded by 0 less than or equal to CR sub r 1 and -1 less than or equal to ci sub i 0 is searched and the eigenvalues within it are identified. The spectra for the plane Poiseuille flow at alpha = 1.0 and R = 100, 1000, 6000, and 10000 are determined and compared with existing results where possible. The spectrum for the Blasius boundary layer flow at alpha = 0.308 and R = 998 was found to be infinite and discrete. Other spectra for the Blasius boundary layer at various Reynolds numbers seem to confirm this result. The eigenmodes belonging to these spectra were located and discussed.
Numerical linear algebra for reconstruction inverse problems
NASA Astrophysics Data System (ADS)
Nachaoui, Abdeljalil
2004-01-01
Our goal in this paper is to discuss various issues we have encountered in trying to find and implement efficient solvers for a boundary integral equation (BIE) formulation of an iterative method for solving a reconstruction problem. We survey some methods from numerical linear algebra, which are relevant for the solution of this class of inverse problems. We motivate the use of our constructing algorithm, discuss its implementation and mention the use of preconditioned Krylov methods.
Cai, Yunfeng; Bai, Zhaojun; Pask, John E.; Sukumar, N.
2013-12-15
The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing a nonorthogonal basis for ab initio electronic structure calculations. We propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative diagonalization of such eigenvalue problems. In partition-of-unity finite-element (PUFE) pseudopotential density-functional calculations, employing a nonorthogonal basis, we show that the hybrid preconditioned block steepest descent method is a cost-effective eigensolver, outperforming current state-of-the-art global preconditioning schemes, and comparably efficient for the ill-conditioned generalized eigenvalue problems produced by PUFE as the locally optimal block preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.
A numerical method for eigenvalue problems in modeling liquid crystals
Baglama, J.; Farrell, P.A.; Reichel, L.; Ruttan, A.; Calvetti, D.
1996-12-31
Equilibrium configurations of liquid crystals in finite containments are minimizers of the thermodynamic free energy of the system. It is important to be able to track the equilibrium configurations as the temperature of the liquid crystals decreases. The path of the minimal energy configuration at bifurcation points can be computed from the null space of a large sparse symmetric matrix. We describe a new variant of the implicitly restarted Lanczos method that is well suited for the computation of extreme eigenvalues of a large sparse symmetric matrix, and we use this method to determine the desired null space. Our implicitly restarted Lanczos method determines adoptively a polynomial filter by using Leja shifts, and does not require factorization of the matrix. The storage requirement of the method is small, and this makes it attractive to use for the present application.
Gene Golub; Kwok Ko
2009-03-30
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.
Eigenvalue Problems for Vibrating Structures Coupled with Quiescent Fluids with Free Surface
NASA Astrophysics Data System (ADS)
AMABILI, M.
2000-03-01
Vibrations of plates, shells and plate-shell systems coupled with sloshing, quiescent and inviscid fluid have been advantageously studied by inserting the sloshing condition into the eigenvalue problem. Here a formulation of this particular eigenvalue problem for symmetric matrices is obtained. In fact, in the previous studies, this technique has given eigenvalue problems for non-symmetric matrices for which the problem of the existence of complex eigenvalues arises. The present analysis deals with compressible and incompressible fluids and the discretization of the system is obtained by using the Rayleigh-Ritz method. The Rayleigh quotient of the system is manipulated to obtain expressions suitable for symmetric formulations of the eigenvalue problem. In particular, the Rayleigh quotient is transformed into a simpler expression where the potential energies of the compressible fluid and free surface waves do not appear. The method is applied to a vertical, simply supported, circular cylindrical shell partially filled by an incompressible sloshing liquid. A case with large interaction between sloshing and bulging modes is considered and interesting phenomena are observed.
A comparison of acceleration methods for solving the neutron transport k-eigenvalue problem
Willert, Jeffrey; Park, H.; Knoll, D.A.
2014-10-01
Over the past several years a number of papers have been written describing modern techniques for numerically computing the dominant eigenvalue of the neutron transport criticality problem. These methods fall into two distinct categories. The first category of methods rewrite the multi-group k-eigenvalue problem as a nonlinear system of equations and solve the resulting system using either a Jacobian-Free Newton–Krylov (JFNK) method or Nonlinear Krylov Acceleration (NKA), a variant of Anderson Acceleration. These methods are generally successful in significantly reducing the number of transport sweeps required to compute the dominant eigenvalue. The second category of methods utilize Moment-Based Acceleration (or High-Order/Low-Order (HOLO) Acceleration). These methods solve a sequence of modified diffusion eigenvalue problems whose solutions converge to the solution of the original transport eigenvalue problem. This second class of methods is, in our experience, always superior to the first, as most of the computational work is eliminated by the acceleration from the LO diffusion system. In this paper, we review each of these methods. Our computational results support our claim that the choice of which nonlinear solver to use, JFNK or NKA, should be secondary. The primary computational savings result from the implementation of a HOLO algorithm. We display computational results for a series of challenging multi-dimensional test problems.
A comparison of acceleration methods for solving the neutron transport k-eigenvalue problem
NASA Astrophysics Data System (ADS)
Willert, Jeffrey; Park, H.; Knoll, D. A.
2014-10-01
Over the past several years a number of papers have been written describing modern techniques for numerically computing the dominant eigenvalue of the neutron transport criticality problem. These methods fall into two distinct categories. The first category of methods rewrite the multi-group k-eigenvalue problem as a nonlinear system of equations and solve the resulting system using either a Jacobian-Free Newton-Krylov (JFNK) method or Nonlinear Krylov Acceleration (NKA), a variant of Anderson Acceleration. These methods are generally successful in significantly reducing the number of transport sweeps required to compute the dominant eigenvalue. The second category of methods utilize Moment-Based Acceleration (or High-Order/Low-Order (HOLO) Acceleration). These methods solve a sequence of modified diffusion eigenvalue problems whose solutions converge to the solution of the original transport eigenvalue problem. This second class of methods is, in our experience, always superior to the first, as most of the computational work is eliminated by the acceleration from the LO diffusion system. In this paper, we review each of these methods. Our computational results support our claim that the choice of which nonlinear solver to use, JFNK or NKA, should be secondary. The primary computational savings result from the implementation of a HOLO algorithm. We display computational results for a series of challenging multi-dimensional test problems.
Ovtchinnikov, Evgueni E.; Xanthis, Leonidas S.
2000-01-01
We present a methodology for the efficient numerical solution of eigenvalue problems of full three-dimensional elasticity for thin elastic structures, such as shells, plates and rods of arbitrary geometry, discretized by the finite element method. Such problems are solved by iterative methods, which, however, are known to suffer from slow convergence or even convergence failure, when the thickness is small. In this paper we show an effective way of resolving this difficulty by invoking a special preconditioning technique associated with the effective dimensional reduction algorithm (EDRA). As an example, we present an algorithm for computing the minimal eigenvalue of a thin elastic plate and we show both theoretically and numerically that it is robust with respect to both the thickness and discretization parameters, i.e. the convergence does not deteriorate with diminishing thickness or mesh refinement. This robustness is sine qua non for the efficient computation of large-scale eigenvalue problems for thin elastic structures. PMID:10655469
Numerical stability in problems of linear algebra.
NASA Technical Reports Server (NTRS)
Babuska, I.
1972-01-01
Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.
Maximum/Minimum Problems Solved Using an Algebraic Way
ERIC Educational Resources Information Center
Modica, Erasmo
2010-01-01
This article describes some problems of the maximum/minimum type, which are generally solved using calculus at secondary school, but which here are solved algebraically. We prove six algebraic properties and then apply them to this kind of problem. This didactic approach allows pupils to solve these problems even at the beginning of secondary…
NASA Astrophysics Data System (ADS)
Cakoni, Fioralba; Haddar, Houssem
2013-10-01
In inverse scattering theory, transmission eigenvalues can be seen as the extension of the notion of resonant frequencies for impenetrable objects to the case of penetrable dielectrics. The transmission eigenvalue problem is a relatively late arrival to the spectral theory of partial differential equations. Its first appearance was in 1986 in a paper by Kirsch who was investigating the denseness of far-field patterns for scattering solutions of the Helmholtz equation or, in more modern terminology, the injectivity of the far-field operator [1]. The paper of Kirsch was soon followed by a more systematic study by Colton and Monk in the context of developing the dual space method for solving the inverse scattering problem for acoustic waves in an inhomogeneous medium [2]. In this paper they showed that for a spherically stratified media transmission eigenvalues existed and formed a discrete set. Numerical examples were also given showing that in principle transmission eigenvalues could be determined from the far-field data. This first period of interest in transmission eigenvalues was concluded with papers by Colton et al in 1989 [3] and Rynne and Sleeman in 1991 [4] showing that for an inhomogeneous medium (not necessarily spherically stratified) transmission eigenvalues, if they existed, formed a discrete set. For the next seventeen years transmission eigenvalues were ignored. This was mainly due to the fact that, with the introduction of various sampling methods to determine the shape of an inhomogeneous medium from far-field data, transmission eigenvalues were something to be avoided and hence the fact that transmission eigenvalues formed at most a discrete set was deemed to be sufficient. In addition, questions related to the existence of transmission eigenvalues or the structure of associated eigenvectors were recognized as being particularly difficult due to the nonlinearity of the eigenvalue problem and the special structure of the associated transmission
NASA Technical Reports Server (NTRS)
Wunsche, A.
1993-01-01
The eigenvalue problem of the operator a + zeta(boson creation operator) is solved for arbitrarily complex zeta by applying a nonunitary operator to the vacuum state. This nonunitary approach is compared with the unitary approach leading for the absolute value of zeta less than 1 to squeezed coherent states.
Parallel algorithms for 2-D cylindrical transport equations of Eigenvalue problem
Wei, J.; Yang, S.
2013-07-01
In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that the designed parallel algorithm can reach perfect speedup, it has good practicality and scalability. (authors)
NASA Astrophysics Data System (ADS)
Cakoni, Fioralba; Haddar, Houssem
2013-10-01
In inverse scattering theory, transmission eigenvalues can be seen as the extension of the notion of resonant frequencies for impenetrable objects to the case of penetrable dielectrics. The transmission eigenvalue problem is a relatively late arrival to the spectral theory of partial differential equations. Its first appearance was in 1986 in a paper by Kirsch who was investigating the denseness of far-field patterns for scattering solutions of the Helmholtz equation or, in more modern terminology, the injectivity of the far-field operator [1]. The paper of Kirsch was soon followed by a more systematic study by Colton and Monk in the context of developing the dual space method for solving the inverse scattering problem for acoustic waves in an inhomogeneous medium [2]. In this paper they showed that for a spherically stratified media transmission eigenvalues existed and formed a discrete set. Numerical examples were also given showing that in principle transmission eigenvalues could be determined from the far-field data. This first period of interest in transmission eigenvalues was concluded with papers by Colton et al in 1989 [3] and Rynne and Sleeman in 1991 [4] showing that for an inhomogeneous medium (not necessarily spherically stratified) transmission eigenvalues, if they existed, formed a discrete set. For the next seventeen years transmission eigenvalues were ignored. This was mainly due to the fact that, with the introduction of various sampling methods to determine the shape of an inhomogeneous medium from far-field data, transmission eigenvalues were something to be avoided and hence the fact that transmission eigenvalues formed at most a discrete set was deemed to be sufficient. In addition, questions related to the existence of transmission eigenvalues or the structure of associated eigenvectors were recognized as being particularly difficult due to the nonlinearity of the eigenvalue problem and the special structure of the associated transmission
Using parallel banded linear system solvers in generalized eigenvalue problems
NASA Technical Reports Server (NTRS)
Zhang, Hong; Moss, William F.
1994-01-01
Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.
Using parallel banded linear system solvers in generalized eigenvalue problems
NASA Technical Reports Server (NTRS)
Zhang, Hong; Moss, William F.
1993-01-01
Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.
Periodic-parabolic eigenvalue problems with a large parameter and degeneration
NASA Astrophysics Data System (ADS)
Daners, Daniel; Thornett, Christopher
2016-07-01
We consider a periodic-parabolic eigenvalue problem with a non-negative potential λm vanishing on a non-cylindrical domain Dm satisfying conditions similar to those for the parabolic maximum principle. We show that the limit as λ → ∞ leads to a periodic-parabolic problem on Dm having a periodic-parabolic principal eigenvalue and eigenfunction which are unique in some sense. We substantially improve a result from [Du and Peng, Trans. Amer. Math. Soc. 364 (2012), p. 6039-6070]. At the same time we offer a different approach based on a periodic-parabolic initial boundary value problem. The results are motivated by an analysis of the asymptotic behaviour of positive solutions to semilinear logistic periodic-parabolic problems with temporal and spacial degeneracies.
Hintermueller, M.; Kao, C.-Y.; Laurain, A.
2012-02-15
This paper focuses on the study of a linear eigenvalue problem with indefinite weight and Robin type boundary conditions. We investigate the minimization of the positive principal eigenvalue under the constraint that the absolute value of the weight is bounded and the total weight is a fixed negative constant. Biologically, this minimization problem is motivated by the question of determining the optimal spatial arrangement of favorable and unfavorable regions for a species to survive. For rectangular domains with Neumann boundary condition, it is known that there exists a threshold value such that if the total weight is below this threshold value then the optimal favorable region is like a section of a disk at one of the four corners; otherwise, the optimal favorable region is a strip attached to the shorter side of the rectangle. Here, we investigate the same problem with mixed Robin-Neumann type boundary conditions and study how this boundary condition affects the optimal spatial arrangement.
Solving Large Scale Nonlinear Eigenvalue Problem in Next-Generation Accelerator Design
Liao, Ben-Shan; Bai, Zhaojun; Lee, Lie-Quan; Ko, Kwok; /SLAC
2006-09-28
A number of numerical methods, including inverse iteration, method of successive linear problem and nonlinear Arnoldi algorithm, are studied in this paper to solve a large scale nonlinear eigenvalue problem arising from finite element analysis of resonant frequencies and external Q{sub e} values of a waveguide loaded cavity in the next-generation accelerator design. They present a nonlinear Rayleigh-Ritz iterative projection algorithm, NRRIT in short and demonstrate that it is the most promising approach for a model scale cavity design. The NRRIT algorithm is an extension of the nonlinear Arnoldi algorithm due to Voss. Computational challenges of solving such a nonlinear eigenvalue problem for a full scale cavity design are outlined.
Applications of elliptic operator theory to the isotropic interior transmission eigenvalue problem
NASA Astrophysics Data System (ADS)
Lakshtanov, E.; Vainberg, B.
2013-10-01
The paper concerns the isotropic interior transmission eigenvalue (ITE) problem. This problem is not elliptic, but we show that, using the Dirichlet-to-Neumann map, it can be reduced to an elliptic one. This leads to the discreteness of the spectrum as well as to certain results on a possible location of the transmission eigenvalues. If the index of refraction \\sqrt{n(x)} is real, then we obtain a result on the existence of infinitely many positive ITEs and the Weyl-type lower bound on its counting function. All the results are obtained under the assumption that n(x) - 1 does not vanish at the boundary of the obstacle or it vanishes identically, but its normal derivative does not vanish at the boundary. We consider the classical transmission problem as well as the case when the inhomogeneous medium contains an obstacle. Some results on the discreteness and localization of the spectrum are obtained for complex valued n(x).
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…
On the Shape Sensitivity of the First Dirichlet Eigenvalue for Two-Phase Problems
Dambrine, M.; Kateb, D.
2011-02-15
We consider a two-phase problem in thermal conductivity: inclusions filled with a material of conductivity {sigma}{sub 1} are layered in a body of conductivity {sigma}{sub 2}. We address the shape sensitivity of the first eigenvalue associated with Dirichlet boundary conditions when both the boundaries of the inclusions and the body can be modified. We prove a differentiability result and provide the expressions of the first and second order derivatives. We apply the results to the optimal design of an insulated body. We prove the stability of the optimal design thanks to a second order analysis. We also continue the study of an extremal eigenvalue problem for a two-phase conductor in a ball initiated by Conca et al. (Appl. Math. Optim. 60(2):173-184, 2009) and pursued in Conca et al. (CANUM 2008, ESAIM Proc., vol. 27, pp. 311-321, EDP Sci., Les Ulis, 2009).
Clifford algebra approach to the coincidence problem for planar lattices.
Rodríguez, M A; Aragón, J L; Verde-Star, L
2005-03-01
The problem of coincidences of planar lattices is analyzed using Clifford algebra. It is shown that an arbitrary coincidence isometry can be decomposed as a product of coincidence reflections and this allows planar coincidence lattices to be characterized algebraically. The cases of square, rectangular and rhombic lattices are worked out in detail. One of the aims of this work is to show the potential usefulness of Clifford algebra in crystallography. The power of Clifford algebra for expressing geometric ideas is exploited here and the procedure presented can be generalized to higher dimensions.
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
Jessup, E.R.
1991-12-01
Divide and conquer techniques based on rank-one updating have proven fast, accurate, and efficient in parallel for the real symmetric tridiagonal and unitary eigenvalue problems and for the bidiagonal singular value problem. Although the divide and conquer mechanism can also be adapted to the real nonsymmetric eigenproblem in a straightforward way, most of the desirable characteristics of the other algorithms are lost. In this paper, we examine the problems of accuracy and efficiency that can stand in the way of a nonsymmetric divide and conquer eigensolver based on low-rank updating. 31 refs., 2 figs.
NASA Astrophysics Data System (ADS)
Alzahrani, Faris S.; Abbas, Ibrahim A.
2016-08-01
The present paper is devoted to the study of a two-dimensional thermal shock problem with weak, normal and strong conductivity using the eigenvalue approach. The governing equations are taken in the context of the new consideration of heat conduction with fractional order generalized thermoelasticity with the Lord-Shulman model (LS model). The bounding surface of the half-space is taken to be traction free and subjected to a time-dependent thermal shock. The Laplace and the exponential Fourier transform techniques are used to obtain the analytical solutions in the transformed domain by the eigenvalue approach. Numerical computations have been done for copper-like material for weak, normal and strong conductivity and the results are presented graphically to estimate the effects of the fractional order parameter.
NASA Astrophysics Data System (ADS)
Castro, María Eugenia; Díaz, Javier; Muñoz-Caro, Camelia; Niño, Alfonso
2011-09-01
We present a system of classes, SHMatrix, to deal in a unified way with the computation of eigenvalues and eigenvectors in real symmetric and Hermitian matrices. Thus, two descendant classes, one for the real symmetric and other for the Hermitian cases, override the abstract methods defined in a base class. The use of the inheritance relationship and polymorphism allows handling objects of any descendant class using a single reference of the base class. The system of classes is intended to be the core element of more sophisticated methods to deal with large eigenvalue problems, as those arising in the variational treatment of realistic quantum mechanical problems. The present system of classes allows computing a subset of all the possible eigenvalues and, optionally, the corresponding eigenvectors. Comparison with well established solutions for analogous eigenvalue problems, as those included in LAPACK, shows that the present solution is competitive against them. Program summaryProgram title: SHMatrix Catalogue identifier: AEHZ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHZ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 2616 No. of bytes in distributed program, including test data, etc.: 127 312 Distribution format: tar.gz Programming language: Standard ANSI C++. Computer: PCs and workstations. Operating system: Linux, Windows. Classification: 4.8. Nature of problem: The treatment of problems involving eigensystems is a central topic in the quantum mechanical field. Here, the use of the variational approach leads to the computation of eigenvalues and eigenvectors of real symmetric and Hermitian Hamiltonian matrices. Realistic models with several degrees of freedom leads to large (sometimes very large) matrices. Different techniques, such as divide
Construction of exact solutions to eigenvalue problems by the asymptotic iteration method
NASA Astrophysics Data System (ADS)
Ciftci, Hakan; Hall, Richard L.; Saad, Nasser
2005-02-01
We apply the asymptotic iteration method (AIM) (Ciftci, Hall and Saad 2003 J. Phys. A: Math. Gen. 36 11807) to solve new classes of second-order homogeneous linear differential equation. In particular, solutions are found for a general class of eigenvalue problems which includes Schrödinger problems with Coulomb, harmonic oscillator or Pöschl-Teller potentials, as well as the special eigenproblems studied recently by Bender et al (2001 J. Phys. A: Math. Gen. 34 9835) and generalized in the present paper to arbitrary dimension.
The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem
NASA Technical Reports Server (NTRS)
Jones, Mark T.; Patrick, Merrell L.
1989-01-01
The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.
Existence of eigenvalues of problem with shift for an equation of parabolic-hyperbolic type
NASA Astrophysics Data System (ADS)
Tengayeva, Aizhan; Dildabek, Gulnar
2016-08-01
In the present paper, a spectral problem for an operator of parabolic-hyperbolic type of I kind with non-classical boundary conditions is considered. The problem is considered in a standard domain. The parabolic part of the space is a rectangle. And the hyperbolic part of the space coincides with a characteristic triangle. We consider a problem with the local boundary condition in the domain of parabolicity and with the boundary condition with displacement in the domain of hyperbolicity. We prove the strong solvability of the considered problem. The main aim of the paper is the research of spectral properties of the problem. The existence of eigenvalues of the problem is proved.
Inhibiting Interference from Prior Knowledge: Arithmetic Intrusions in Algebra Word Problem Solving
ERIC Educational Resources Information Center
Khng, Kiat Hui; Lee, Kerry
2009-01-01
In Singapore, 6-12 year-old students are taught to solve algebra word problems with a mix of arithmetic and pre-algebraic strategies; 13-17 year-olds are typically encouraged to replace these strategies with letter-symbolic algebra. We examined whether algebra problem-solving proficiency amongst beginning learners of letter-symbolic algebra is…
Recurrence relation for the 6j-symbol of suq(2) as a symmetric eigenvalue problem
NASA Astrophysics Data System (ADS)
Khavkine, Igor
2015-08-01
A well-known recurrence relation for the 6j-symbol of the quantum group suq(2) is realized as a tridiagonal, symmetric eigenvalue problem. This formulation can be used to implement an efficient numerical evaluation algorithm, taking advantage of existing specialized numerical packages. For convenience, all formulas relevant for such an implementation are collected in Appendix A. This realization is a byproduct of an alternative proof of the recurrence relation, which generalizes a classical (q = 1) result of Schulten and Gordon and uses the diagrammatic spin network formalism of Temperley-Lieb recoupling theory to simplify intermediate calculations.
On the eigenvalue problems of Poiseuille flows in a circular pipe
NASA Astrophysics Data System (ADS)
Maserumule, Motodi Samuel
In this work we introduce a novel formulation of Sexl's equations obtained by expanding three dimensional infinitesimal disturbances about the axisymmetric Hagen-Poiseuille flow in a pipe of circular cross section. The formulation is based on a representation theorem of solenoidal vector fields due to Schmitt and von Wahl [53]. We use the new formulation to prove that the linear nonaxisymmetric eigenvalue problem associated with Hagen-Poiseuille flow has infinitely many eigenfunctions which form a complete set. The method of proof includes the DiPrima-Habetler completeness theorem [14]. A nontrivial transformation that links the new formulation with the formulation used by Salwen et al [50] is presented. The relationship between axisymmetric eigenfunctions associated with Hagen-Poiseuille flow and their counterparts associated with parabolic Poiseuille flow is explored by means of a numerical study. We use a modified Chebyshev tau numerical scheme to compute eigenvalues and eigenfunctions of the two problems. The parabolic Poiseuille flow is easier to deal with because of the absence of a singularity in the differential equations. An exact solution to the axisymmetric parabolic Poiseuille flow problem is presented for the first time.
Wang, C.; Abdel-Khalik, H. S.
2012-07-01
The construction of surrogate models for high fidelity models is now considered an important objective in support of all engineering activities which require repeated execution of the simulation, such as verification studies, validation exercises, and uncertainty quantification. The surrogate must be computationally inexpensive to allow its repeated execution, and must be computationally accurate in order for its predictions to be credible. This manuscript introduces a new surrogate construction approach that reduces the dimensionality of the state solution via a range-finding algorithm from linear algebra. It then employs a proper orthogonal decomposition-like approach to solve for the reduced state. The algorithm provides an upper bound on the error resulting from the reduction. Different from the state-of-the-art, the new approach allows the user to define the desired accuracy a priori which controls the maximum allowable reduction. We demonstrate the utility of this approach using an eigenvalue radiation diffusion model, where the accuracy is selected to match machine precision. Results indicate that significant reduction is possible for typical reactor assembly models, which are currently considered expensive given the need to employ very fine mesh many group calculations to ensure the highest possible fidelity for the downstream core calculations. Given the potential for significant reduction in the computational cost, we believe it is possible to rethink the manner in which homogenization theory is currently employed in reactor design calculations. (authors)
Ji, Xingzhi )
1994-03-01
This paper is concerned with the eigenvalues of Sturm-Liouville problems with periodic and semi-periodic boundary conditions to be approximated by a shooting algorithm. The proposed technique is based on the application of the Floquet theory. Convergence analysis and a general guideline to provide starting values for computed eigenvalues are presented. Some numerical results are also reported. 18 refs., 1 fig., 3 tabs.
Stathopoulos, A.; Fischer, C.F.; Saad, Y.
1994-12-31
The solution of the large, sparse, symmetric eigenvalue problem, Ax = {lambda}x, is central to many scientific applications. Among many iterative methods that attempt to solve this problem, the Lanczos and the Generalized Davidson (GD) are the most widely used methods. The Lanczos method builds an orthogonal basis for the Krylov subspace, from which the required eigenvectors are approximated through a Rayleigh-Ritz procedure. Each Lanczos iteration is economical to compute but the number of iterations may grow significantly for difficult problems. The GD method can be considered a preconditioned version of Lanczos. In each step the Rayleigh-Ritz procedure is solved and explicit orthogonalization of the preconditioned residual ((M {minus} {lambda}I){sup {minus}1}(A {minus} {lambda}I)x) is performed. Therefore, the GD method attempts to improve convergence and robustness at the expense of a more complicated step.
Boundary Concentration for Eigenvalue Problems Related to the Onset of Superconductivity
NASA Astrophysics Data System (ADS)
del Pino, Manuel; Felmer, Patricio L.; Sternberg, Peter
We examine the asymptotic behavior of the eigenvalue μ(h) and corresponding eigenfunction associated with the variational problem
NASA Technical Reports Server (NTRS)
Pak, Chan-gi; Lung, Shu
2009-01-01
Modern airplane design is a multidisciplinary task which combines several disciplines such as structures, aerodynamics, flight controls, and sometimes heat transfer. Historically, analytical and experimental investigations concerning the interaction of the elastic airframe with aerodynamic and in retia loads have been conducted during the design phase to determine the existence of aeroelastic instabilities, so called flutter .With the advent and increased usage of flight control systems, there is also a likelihood of instabilities caused by the interaction of the flight control system and the aeroelastic response of the airplane, known as aeroservoelastic instabilities. An in -house code MPASES (Ref. 1), modified from PASES (Ref. 2), is a general purpose digital computer program for the analysis of the closed-loop stability problem. This program used subroutines given in the International Mathematical and Statistical Library (IMSL) (Ref. 3) to compute all of the real and/or complex conjugate pairs of eigenvalues of the Hessenberg matrix. For high fidelity configuration, these aeroelastic system matrices are large and compute all eigenvalues will be time consuming. A subspace iteration method (Ref. 4) for complex eigenvalues problems with nonsymmetric matrices has been formulated and incorporated into the modified program for aeroservoelastic stability (MPASES code). Subspace iteration method only solve for the lowest p eigenvalues and corresponding eigenvectors for aeroelastic and aeroservoelastic analysis. In general, the selection of p is ranging from 10 for wing flutter analysis to 50 for an entire aircraft flutter analysis. The application of this newly incorporated code is an experiment known as the Aerostructures Test Wing (ATW) which was designed by the National Aeronautic and Space Administration (NASA) Dryden Flight Research Center, Edwards, California to research aeroelastic instabilities. Specifically, this experiment was used to study an instability
NASA Astrophysics Data System (ADS)
Ramos, Miguel; Tavares, Hugo; Terracini, Susanna
2016-04-01
Let {Ω subset {R}^N} be an open bounded domain and {m in {N}}. Given {k_1,ldots,k_m in {N}}, we consider a wide class of optimal partition problems involving Dirichlet eigenvalues of elliptic operators, of the following form inf{F({λ_{k1}}(ω_1),ldots,λ_{k_m}(ω_m)): (ω_1,ldots, ω_m) in {P}_m(Ω)}, where {λ_{k_i}(ω_i)} denotes the k i -th eigenvalue of {(-Δ,H10(ω_i))} counting multiplicities, and {{P}_m(Ω)} is the set of all open partitions of {Ω}, namely {P}_m(Ω)={(ω_1, ldots, ω_m):ω_i subset Ω open, ωi \\capω_j=emptyset forall i ≠ j }. While the existence of a quasi-open optimal partition {(ω_1,ldots, ω_m)} follows from a general result by Bucur, Buttazzo and Henrot [Adv Math Sci Appl 8(2):571-579, 1998], the aim of this paper is to associate with such minimal partitions and their eigenfunctions some suitable extremality conditions and to exploit them, proving as well the Lipschitz continuity of some eigenfunctions, and the regularity of the partition in the sense that the free boundary {\\cup_{i=1}^m partial ωi \\cap Ω} is, up to a residual set, locally a {C^{1,α}} hypersurface. This last result extends the ones in the paper by Caffarelli and Lin [J Sci Comput 31(1-2):5-18, 2007] to the case of higher eigenvalues.
Inverse Modelling Problems in Linear Algebra Undergraduate Courses
ERIC Educational Resources Information Center
Martinez-Luaces, Victor E.
2013-01-01
This paper will offer an analysis from a theoretical point of view of mathematical modelling, applications and inverse problems of both causation and specification types. Inverse modelling problems give the opportunity to establish connections between theory and practice and to show this fact, a simple linear algebra example in two different…
Multigrid method applied to the solution of an elliptic, generalized eigenvalue problem
Alchalabi, R.M.; Turinsky, P.J.
1996-12-31
The work presented in this paper is concerned with the development of an efficient MG algorithm for the solution of an elliptic, generalized eigenvalue problem. The application is specifically applied to the multigroup neutron diffusion equation which is discretized by utilizing the Nodal Expansion Method (NEM). The underlying relaxation method is the Power Method, also known as the (Outer-Inner Method). The inner iterations are completed using Multi-color Line SOR, and the outer iterations are accelerated using Chebyshev Semi-iterative Method. Furthermore, the MG algorithm utilizes the consistent homogenization concept to construct the restriction operator, and a form function as a prolongation operator. The MG algorithm was integrated into the reactor neutronic analysis code NESTLE, and numerical results were obtained from solving production type benchmark problems.
Optical reflection from planetary surfaces as an operator-eigenvalue problem
Wildey, R.L.
1986-01-01
The understanding of quantum mechanical phenomena has come to rely heavily on theory framed in terms of operators and their eigenvalue equations. This paper investigates the utility of that technique as related to the reciprocity principle in diffuse reflection. The reciprocity operator is shown to be unitary and Hermitian; hence, its eigenvectors form a complete orthonormal basis. The relevant eigenvalue is found to be infinitely degenerate. A superposition of the eigenfunctions found from solution by separation of variables is inadequate to form a general solution that can be fitted to a one-dimensional boundary condition, because the difficulty of resolving the reciprocity operator into a superposition of independent one-dimensional operators has yet to be overcome. A particular lunar application in the form of a failed prediction of limb-darkening of the full Moon from brightness versus phase illustrates this problem. A general solution is derived which fully exploits the determinative powers of the reciprocity operator as an unresolved two-dimensional operator. However, a solution based on a sum of one-dimensional operators, if possible, would be much more powerful. A close association is found between the reciprocity operator and the particle-exchange operator of quantum mechanics, which may indicate the direction for further successful exploitation of the approach based on the operational calculus. ?? 1986 D. Reidel Publishing Company.
Algebraic solution of the synthesis problem for coded sequences
Leukhin, Anatolii N
2005-08-31
The algebraic solution of a 'complex' problem of synthesis of phase-coded (PC) sequences with the zero level of side lobes of the cyclic autocorrelation function (ACF) is proposed. It is shown that the solution of the synthesis problem is connected with the existence of difference sets for a given code dimension. The problem of estimating the number of possible code combinations for a given code dimension is solved. It is pointed out that the problem of synthesis of PC sequences is related to the fundamental problems of discrete mathematics and, first of all, to a number of combinatorial problems, which can be solved, as the number factorisation problem, by algebraic methods by using the theory of Galois fields and groups. (fourth seminar to the memory of d.n. klyshko)
NASA Astrophysics Data System (ADS)
Smirnov, Yu. G.; Valovik, D. V.
2016-10-01
The paper focuses on a transmission eigenvalue problem for Maxwell's equations with cubic nonlinearity that describes the propagation of transverse magnetic waves along the boundaries of a dielectric layer filled with nonlinear (Kerr) medium. Using an original approach, it is proved that even for small values of the nonlinearity coefficient, the nonlinear problem has infinitely many nonperturbative solutions (eigenvalues and eigenwaves), whereas the corresponding linear problem always has a finite number of solutions. This fact implies the theoretical existence of a novel type of eigenwaves that do not reduce to the linear ones in the limit in which the nonlinear coefficient reduces to zero. Asymptotic distribution of the eigenvalues is found, periodicity of the eigenfunctions is proved, the exact formula for the period is found, and the zeros of the eigenfunctions are determined.
Graph theory approach to the eigenvalue problem of large space structures
NASA Technical Reports Server (NTRS)
Reddy, A. S. S. R.; Bainum, P. M.
1981-01-01
Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.
Parallel computing study for the large-scale generalized eigenvalue problems in modal analysis
NASA Astrophysics Data System (ADS)
Fan, XuanHua; Chen, Pu; Wu, RuiAn; Xiao, ShiFu
2014-03-01
In this paper we study the algorithms and their parallel implementation for solving large-scale generalized eigenvalue problems in modal analysis. Three predominant subspace algorithms, i.e., Krylov-Schur method, implicitly restarted Arnoldi method and Jacobi-Davidson method, are modified with some complementary techniques to make them suitable for modal analysis. Detailed descriptions of the three algorithms are given. Based on these algorithms, a parallel solution procedure is established via the PANDA framework and its associated eigensolvers. Using the solution procedure on a machine equipped with up to 4800 processors, the parallel performance of the three predominant methods is evaluated via numerical experiments with typical engineering structures, where the maximum testing scale attains twenty million degrees of freedom. The speedup curves for different cases are obtained and compared. The results show that the three methods are good for modal analysis in the scale of ten million degrees of freedom with a favorable parallel scalability.
An Extremal Eigenvalue Problem for a Two-Phase Conductor in a Ball
Conca, Carlos Mahadevan, Rajesh Sanz, Leon
2009-10-15
The pioneering works of Murat and Tartar (Topics in the mathematical modeling of composite materials. PNLDE 31. Birkhaeuser, Basel, 1997) go a long way in showing, in general, that problems of optimal design may not admit solutions if microstructural designs are excluded from consideration. Therefore, assuming, tactilely, that the problem of minimizing the first eigenvalue of a two-phase conducting material with the conducting phases to be distributed in a fixed proportion in a given domain has no true solution in general domains, Cox and Lipton only study conditions for an optimal microstructural design (Cox and Lipton in Arch. Ration. Mech. Anal. 136:101-117, 1996). Although, the problem in one dimension has a solution (cf. Krein in AMS Transl. Ser. 2(1):163-187, 1955) and, in higher dimensions, the problem set in a ball can be deduced to have a radially symmetric solution (cf. Alvino et al. in Nonlinear Anal. TMA 13(2):185-220, 1989), these existence results have been regarded so far as being exceptional owing to complete symmetry. It is still not clear why the same problem in domains with partial symmetry should fail to have a solution which does not develop microstructure and respecting the symmetry of the domain. We hope to revive interest in this question by giving a new proof of the result in a ball using a simpler symmetrization result from Alvino and Trombetti (J. Math. Anal. Appl. 94:328-337, 1983)
Hwang, F-N Wei, Z-H Huang, T-M Wang Weichung
2010-04-20
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers, preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schroedinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors.
Student Difficulties in Mathematizing Word Problems in Algebra
ERIC Educational Resources Information Center
Jupri, Al; Drijvers, Paul
2016-01-01
To investigate student difficulties in solving word problems in algebra, we carried out a teaching experiment involving 51 Indonesian students (12/13 year-old) who used a digital mathematics environment. The findings were backed up by an interview study, in which eighteen students (13/14 year-old) were involved. The perspective of mathematization,…
How Problem Solving Can Develop an Algebraic Perspective of Mathematics
ERIC Educational Resources Information Center
Windsor, Will
2011-01-01
SProblem solving has a long and successful history in mathematics education and is valued by many teachers as a way to engage and facilitate learning within their classrooms. The potential benefit for using problem solving in the development of algebraic thinking is that "it may broaden and develop students' mathematical thinking beyond the…
Ideal basis sets for the Dirac Coulomb problem: Eigenvalue bounds and convergence proofs
NASA Astrophysics Data System (ADS)
Munger, Charles Thomas
2007-02-01
Basis sets are developed for the Dirac Coulomb Hamiltonian for which the resulting numerical eigenvalues and eigenfunctions are proved mathematically to have all the following properties: to converge to the exact eigenfunctions and eigenvalues, with necessary and sufficient conditions for convergence being known; to have neither missing nor spurious states; to maintain the Coulomb symmetries between eigenvalues and eigenfunctions of the opposite sign of the Dirac quantum number κ; to have positive eigenvalues bounded from below by the corresponding exact eigenvalues; and to have negative eigenvalues bounded from above by -mc2. All these properties are maintained using functions that may be analytic or nonanalytic (e.g., Slater functions or splines); that match the noninteger power dependence of the exact eigenfunctions at the origin, or that do not; or that extend to +∞ as do the exact eigenfunctions, or that vanish outside a cavity of large radius R (convergence then occurring after a second limit, R →∞). The same basis sets can be used without modification for potentials other than the Coulomb, such as the potential of a finite distribution of nuclear charge, or a screened Coulomb potential; the error in a numerical eigenvalue is shown to be second order in the departure of the potential from the Coulomb. In certain bases of Sturmian functions the numerical eigenvalues can be related to the zeros of the Pollaczek polynomials.
Inverse modelling problems in linear algebra undergraduate courses
NASA Astrophysics Data System (ADS)
Martinez-Luaces, Victor E.
2013-10-01
This paper will offer an analysis from a theoretical point of view of mathematical modelling, applications and inverse problems of both causation and specification types. Inverse modelling problems give the opportunity to establish connections between theory and practice and to show this fact, a simple linear algebra example in two different presentations will be discussed. Finally, several results will be presented and some conclusions proposed.
A stabilized finite element method for the two-field and three-field Stokes eigenvalue problems
NASA Astrophysics Data System (ADS)
Türk, Önder; Boffi, Daniele; Codina, Ramon
2016-10-01
In this paper, the stabilized finite element approximation of the Stokes eigenvalue problems is considered for both the two-field (displacement-pressure) and the three-field (stress-displacement-pressure) formulations. The method presented is based on a subgrid scale concept, and depends on the approximation of the unresolvable scales of the continuous solution. In general, subgrid scale techniques consist in the addition of a residual based term to the basic Galerkin formulation. The application of a standard residual based stabilization method to a linear eigenvalue problem leads to a quadratic eigenvalue problem in discrete form which is physically inconvenient. As a distinguished feature of the present study, we take the space of the unresolved subscales orthogonal to the finite element space, which promises a remedy to the above mentioned complication. In essence, we put forward that only if the orthogonal projection is used, the residual is simplified and the use of term by term stabilization is allowed. Thus, we do not need to put the whole residual in the formulation, and the linear eigenproblem form is recovered properly. We prove that the method applied is convergent, and present the error estimates for the eigenvalues and the eigenfunctions. We report several numerical tests in order to illustrate that the theoretical results are validated.
A nonlinear eigenvalue problem for self-similar spherical force-free magnetic fields
Lerche, I.; Low, B. C.
2014-10-15
An axisymmetric force-free magnetic field B(r, θ) in spherical coordinates is defined by a function r sin θB{sub φ}=Q(A) relating its azimuthal component to its poloidal flux-function A. The power law r sin θB{sub φ}=aA|A|{sup 1/n}, n a positive constant, admits separable fields with A=(A{sub n}(θ))/(r{sup n}) , posing a nonlinear boundary-value problem for the constant parameter a as an eigenvalue and A{sub n}(θ) as its eigenfunction [B. C. Low and Y. Q Lou, Astrophys. J. 352, 343 (1990)]. A complete analysis is presented of the eigenvalue spectrum for a given n, providing a unified understanding of the eigenfunctions and the physical relationship between the field's degree of multi-polarity and rate of radial decay via the parameter n. These force-free fields, self-similar on spheres of constant r, have basic astrophysical applications. As explicit solutions they have, over the years, served as standard benchmarks for testing 3D numerical codes developed to compute general force-free fields in the solar corona. The study presented includes a set of illustrative multipolar field solutions to address the magnetohydrodynamics (MHD) issues underlying the observation that the solar corona has a statistical preference for negative and positive magnetic helicities in its northern and southern hemispheres, respectively; a hemispherical effect, unchanging as the Sun's global field reverses polarity in successive eleven-year cycles. Generalizing these force-free fields to the separable form B=(H(θ,φ))/(r{sup n+2}) promises field solutions of even richer topological varieties but allowing for φ-dependence greatly complicates the governing equations that have remained intractable. The axisymmetric results obtained are discussed in relation to this generalization and the Parker Magnetostatic Theorem. The axisymmetric solutions are mathematically related to a family of 3D time-dependent ideal MHD solutions for a polytropic fluid of index γ = 4/3 as
Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem
Du, X.; Liu, T.; Ji, W.; Xu, X. G.; Brown, F. B.
2013-07-01
Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER{sub GPU} code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)
NASA Astrophysics Data System (ADS)
Jalali, Tahmineh
2014-12-01
The multiple multipoles (MMP) method is used to solve a nonlinear eigenvalue problem for analysis of a 2D metallic and dielectric photonic crystal. Simulation space is implemented in the first Brillouin zone, in order to obtain band structure and modal fields and in the supercell to calculate waveguide modes. The Bloch theorem is used to implement fictitious periodic boundary conditions for the first Brillouin zone and supercell. This method successfully computes the transmission and reflection coefficients of photonic crystal waveguide without significant error for termination of the computational space. To validate our code, the band structure of a cubic lattice is simulated and results are compared with results of the plane wave expansion method. The proposed method is shown to be applicable to photonic crystals of irregular shape and frequency dependent (independent) materials, such as dielectric or dispersive material, and experimental data for different lattice structures. Numerical calculations show that the MMP method is stable, accurate and fast and can be used on personal computers.
NASA Astrophysics Data System (ADS)
Hamed, Haikel Ben; Bennacer, Rachid
2008-08-01
This work consists in evaluating algebraically and numerically the influence of a disturbance on the spectral values of a diagonalizable matrix. Thus, two approaches will be possible; to use the theorem of disturbances of a matrix depending on a parameter, due to Lidskii and primarily based on the structure of Jordan of the no disturbed matrix. The second approach consists in factorizing the matrix system, and then carrying out a numerical calculation of the roots of the disturbances matrix characteristic polynomial. This problem can be a standard model in the equations of the continuous media mechanics. During this work, we chose to use the second approach and in order to illustrate the application, we choose the Rayleigh-Bénard problem in Darcy media, disturbed by a filtering through flow. The matrix form of the problem is calculated starting from a linear stability analysis by a finite elements method. We show that it is possible to break up the general phenomenon into other elementary ones described respectively by a disturbed matrix and a disturbance. A good agreement between the two methods was seen. To cite this article: H.B. Hamed, R. Bennacer, C. R. Mecanique 336 (2008).
Constructing a Coherent Problem Model to Facilitate Algebra Problem Solving in a Chemistry Context
ERIC Educational Resources Information Center
Ngu, Bing Hiong; Yeung, Alexander Seeshing; Phan, Huy P.
2015-01-01
An experiment using a sample of 11th graders compared text editing and worked examples approaches in learning to solve dilution and molarity algebra word problems in a chemistry context. Text editing requires students to assess the structure of a word problem by specifying whether the problem text contains sufficient, missing, or irrelevant…
Algebraic multigrid methods applied to problems in computational structural mechanics
NASA Technical Reports Server (NTRS)
Mccormick, Steve; Ruge, John
1989-01-01
The development of algebraic multigrid (AMG) methods and their application to certain problems in structural mechanics are described with emphasis on two- and three-dimensional linear elasticity equations and the 'jacket problems' (three-dimensional beam structures). Various possible extensions of AMG are also described. The basic idea of AMG is to develop the discretization sequence based on the target matrix and not the differential equation. Therefore, the matrix is analyzed for certain dependencies that permit the proper construction of coarser matrices and attendant transfer operators. In this manner, AMG appears to be adaptable to structural analysis applications.
An application of computer algebra system Cadabra to scientific problems of physics
NASA Astrophysics Data System (ADS)
Sevastianov, L. A.; Kulyabov, D. S.; Kokotchikova, M. G.
2009-12-01
In this article we present two examples solved in a new problem-oriented computer algebra system Cadabra. Solution of the same examples in widespread universal computer algebra system Maple turn out to be more difficult.
NASA Technical Reports Server (NTRS)
Warming, Robert F.; Beam, Richard M.
1986-01-01
A hyperbolic initial-boundary-value problem can be approximated by a system of ordinary differential equations (ODEs) by replacing the spatial derivatives by finite-difference approximations. The resulting system of ODEs is called a semidiscrete approximation. A complication is the fact that more boundary conditions are required for the spatially discrete approximation than are specified for the partial differential equation. Consequently, additional numerical boundary conditions are required and improper treatment of these additional conditions can lead to instability. For a linear initial-boundary-value problem (IBVP) with homogeneous analytical boundary conditions, the semidiscrete approximation results in a system of ODEs of the form du/dt = Au whose solution can be written as u(t) = exp(At)u(O). Lax-Richtmyer stability requires that the matrix norm of exp(At) be uniformly bounded for O less than or = t less than or = T independent of the spatial mesh size. Although the classical Lax-Richtmyer stability definition involves a conventional vector norm, there is no known algebraic test for the uniform boundedness of the matrix norm of exp(At) for hyperbolic IBVPs. An alternative but more complicated stability definition is used in the theory developed by Gustafsson, Kreiss, and Sundstrom (GKS). The two methods are compared.
The Word Problem for Solvable Lie Algebras and Groups
NASA Astrophysics Data System (ADS)
Kharlampovich, O. G.
1990-02-01
The variety of groups Z\\mathfrak{N}_2\\mathfrak{A} is given by the identity \\displaystyle \\lbrack\\lbrack x_1,\\,x_2\\rbrack,\\,\\lbrack x_3,\\,x_4\\rbrack,\\,\\lbrack x_5,\\, x_6\\rbrack,\\, x_7\\rbrack = 1,and the analogous variety of Lie algebras is given by the identity \\displaystyle (x_1x_2)(x_3x_4)(x_5x_6)x_7=0.Previously the author proved the unsolvability of the word problem for any variety of groups (respectively: Lie algebras) containing Z\\mathfrak{N}_2\\mathfrak{A}, and its solvability for any subvariety of \\mathfrak{N}_2\\mathfrak{A}. Here the word problem is investigated in varieties of Lie algebras over a field of characteristic zero and in varieties of groups contained in Z\\mathfrak{N}_2\\mathfrak{A}. It is proved that in the lattice of subvarieties of Z\\mathfrak{N}_2\\mathfrak{A} there exist arbitrary long chains in which the varieties with solvable and unsolvable word problems alternate. In particular, the variety Z\\mathfrak{N}_2\\mathfrak{A}\\cap\\mathfrak{N}_2\\mathfrak{N}_c has a solvable word problem for any c, while the variety \\mathfrak{Y}_2, given within Z\\mathfrak{N}_2\\mathfrak{A} by the identity \\displaystyle \\lbrack\\lbrack x_1,\\,\\dots,\\,x_{2c+2}\\rbrack,\\,\\lbrack y_1,\\,\\dots,\\,y_{2c+2}\\rbrack,\\lbrack z_1,\\,\\dots,\\,z_{2c}\\rbrack\\rbrack = 1,in the case of groups and by the identity \\displaystyle (x_1\\dotsb x_{2c+2})(y_1\\dotsb y_{2c+2})(z_1\\dotsb z_{2c})=0in the case of Lie algebras, has an unsolvable word problem. It is also proved that in Z\\mathfrak{N}_2\\mathfrak{A} there exists an infinite series of minimal varieties with an unsolvable word problem, i.e. varieties whose proper subvarieties all have solvable word problems.Bibliography: 17 titles.
A boundary integral algorithm for the Laplace Dirichlet-Neumann mixed eigenvalue problem
NASA Astrophysics Data System (ADS)
Akhmetgaliyev, Eldar; Bruno, Oscar P.; Nigam, Nilima
2015-10-01
We present a novel integral-equation algorithm for evaluation of Zaremba eigenvalues and eigenfunctions, that is, eigenvalues and eigenfunctions of the Laplace operator with mixed Dirichlet-Neumann boundary conditions; of course, (slight modifications of) our algorithms are also applicable to the pure Dirichlet and Neumann eigenproblems. Expressing the eigenfunctions by means of an ansatz based on the single layer boundary operator, the Zaremba eigenproblem is transformed into a nonlinear equation for the eigenvalue μ. For smooth domains the singular structure at Dirichlet-Neumann junctions is incorporated as part of our corresponding numerical algorithm-which otherwise relies on use of the cosine change of variables, trigonometric polynomials and, to avoid the Gibbs phenomenon that would arise from the solution singularities, the Fourier Continuation method (FC). The resulting numerical algorithm converges with high order accuracy without recourse to use of meshes finer than those resulting from the cosine transformation. For non-smooth (Lipschitz) domains, in turn, an alternative algorithm is presented which achieves high-order accuracy on the basis of graded meshes. In either case, smooth or Lipschitz boundary, eigenvalues are evaluated by searching for zero minimal singular values of a suitably stabilized discrete version of the single layer operator mentioned above. (The stabilization technique is used to enable robust non-local zero searches.) The resulting methods, which are fast and highly accurate for high- and low-frequencies alike, can solve extremely challenging two-dimensional Dirichlet, Neumann and Zaremba eigenproblems with high accuracies in short computing times-enabling, in particular, evaluation of thousands of eigenvalues and corresponding eigenfunctions for a given smooth or non-smooth geometry with nearly full double-precision accuracy.
Non-commutative holomorphic functions in elements of a Lie algebra and the absolute basis problem
NASA Astrophysics Data System (ADS)
Dosi, Anar A.
2009-12-01
We study the absolute basis problem in algebras of holomorphic functions in non-commuting variables generating a finite-dimensional nilpotent Lie algebra \\mathfrak{g}. This is motivated by J. L. Taylor's programme of non-commutative holomorphic functional calculus in the Lie algebra framework.
The spatial isomorphism problem for close separable nuclear C*-algebras
Christensen, Erik; Sinclair, Allan M.; Smith, Roger R.; White, Stuart A.; Winter, Wilhelm
2010-01-01
The Kadison–Kastler problem asks whether close C*-algebras on a Hilbert space must be spatially isomorphic. We establish this when one of the algebras is separable and nuclear. We also apply our methods to the study of near inclusions of C*-algebras. PMID:20080723
NASA Technical Reports Server (NTRS)
Walden, H.
1974-01-01
Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (also referred to as the membrane eigenvalue problem for the vibration equation) on the unit spherical surface are developed. Two specific types of spherical surface domains are considered: (1) the interior of a spherical triangle, i.e., the region bounded by arcs of three great circles, and (2) the exterior of a great circle arc extending for less than pi radians on the sphere (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is derived. The symmetric (generally five-point) finite difference equations that develop are written in matrix form and then solved by the iterative method of point successive overrelaxation. Upon convergence of this iterative method, the fundamental eigenvalue is approximated by iteration utilizing the power method as applied to the finite Rayleigh quotient.
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.
ERIC Educational Resources Information Center
McNeil, Nicole M.; Rittle-Johnson, Bethany; Hattikudur, Shanta; Petersen, Lori A.
2010-01-01
This study examined if solving arithmetic problems hinders undergraduates' accuracy on algebra problems. The hypothesis was that solving arithmetic problems would hinder accuracy because it activates an operational view of equations, even in educated adults who have years of experience with algebra. In three experiments, undergraduates (N = 184)…
Primary School Students' Strategies in Early Algebra Problem Solving Supported by an Online Game
ERIC Educational Resources Information Center
van den Heuvel-Panhuizen, Marja; Kolovou, Angeliki; Robitzsch, Alexander
2013-01-01
In this study we investigated the role of a dynamic online game on students' early algebra problem solving. In total 253 students from grades 4, 5, and 6 (10-12 years old) used the game at home to solve a sequence of early algebra problems consisting of contextual problems addressing covarying quantities. Special software monitored the…
Bottcher, C.; Strayer, M.R.; Werby, M.F.
1993-10-01
The Helmholtz-Poincare Wave Equation (H-PWE) arises in many areas of classical wave scattering theory. In particular it can be found for the cases of acoustical scattering from submerged bounded objects and electromagnetic scattering from objects. The extended boundary integral equations (EBIE) method is derived from considering both the exterior and interior solutions of the H-PWE`s. This coupled set of expressions has the advantage of not only offering a prescription for obtaining a solution for the exterior scattering problem, but it also obviates the problem of irregular values corresponding to fictitious interior eigenvalues. Once the coupled equations are derived, they can by obtained in matrix form be expanding all relevant terms in partial wave expansions, including a biorthogonal expansion of the Green function. However some freedom of choice in the choice of the surface expansion is available since the unknown surface quantities may be expanded in a variety of ways to long as closure is obtained. Out of many possible choices, we develop an optimal method to obtain such expansions which is based on the optimum eigenfunctions related to the surface of the object. In effect, we convert part of the problem (that associated with the Fredholms integral equation of the first kind) an eigenvalue problem of a related Hermition operator. The methodology will be explained in detail and examples will be presented.
Massively Parallel, Three-Dimensional Transport Solutions for the k-Eigenvalue Problem
Davidson, Gregory G; Evans, Thomas M; Jarrell, Joshua J; Pandya, Tara M; Slaybaugh, R
2014-01-01
We have implemented a new multilevel parallel decomposition in the Denovo dis- crete ordinates radiation transport code. In concert with Krylov subspace iterative solvers, the multilevel decomposition allows concurrency over energy in addition to space-angle, enabling scalability beyond the limits imposed by the traditional KBA space-angle partitioning. Furthermore, a new Arnoldi-based k-eigenvalue solver has been implemented. The added phase-space concurrency combined with the high- performance Krylov and Arnoldi solvers has enabled weak scaling to O(100K) cores on the Jaguar XK6 supercomputer. The multilevel decomposition provides sucient parallelism to scale to exascale computing and beyond.
Complex eigenvalue extraction in NASTRAN by the tridiagonal reduction (FEER) method
NASA Technical Reports Server (NTRS)
Newman, M.; Mann, F. I.
1977-01-01
An extension of the Tridiagonal Reduction (FEER) method to complex eigenvalue analysis in NASTRAN is described. As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum are extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order is much lower than that of the full size problem. The reduction process is effected automatically, and thus avoids the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admits mass, damping and stiffness matrices which are unrestricted in character, i.e., they may be real, complex, symmetric or unsymmetric, singular or non-singular.
Neural network iterative diagonalization method to solve eigenvalue problems in quantum mechanics.
Yu, Hua-Gen
2015-06-01
We propose a multi-layer feed-forward neural network iterative diagonalization method (NNiDM) to compute some eigenvalues and eigenvectors of large sparse complex symmetric or Hermitian matrices. The NNiDM algorithm is developed by using the complex (or real) guided spectral transform Lanczos (cGSTL) method, thick restart technique, and multi-layered basis contraction scheme. Artificial neurons (or nodes) are defined by a set of formally orthogonal Lanczos polynomials, where the biases and weights are dynamically determined through a series of cGSTL iterations and small matrix diagonalizations. The algorithm starts with one random vector. The last output layer produces wanted eigenvalues and eigenvectors near a given reference value via a linear transform diagonalization approach. Since the algorithm uses the spectral transform technique, it is capable of computing interior eigenstates in dense spectrum regions. The general NNiDM algorithm is applied for calculating energies, widths, and wavefunctions of two typical molecules HO2 and CH4 as examples. PMID:25959361
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.
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.
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.
Working Memory and Literacy as Predictors of Performance on Algebraic Word Problems
ERIC Educational Resources Information Center
Lee, Kerry; Ng, Swee-Fong; Ng, Ee-Lynn; Lim, Zee-Ying
2004-01-01
Previous studies on individual differences in mathematical abilities have shown that working memory contributes to early arithmetic performance. In this study, we extended the investigation to algebraic word problem solving. A total of 151 10-year-olds were administered algebraic word problems and measures of working memory, intelligence quotient…
ERIC Educational Resources Information Center
Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Hollenbeck, Kurstin N.; Hamlett, Carol L.; Seethaler, Pamela M.
2011-01-01
The purpose of this study was to explore the utility of a dynamic assessment (DA) of algebraic learning in predicting third graders' development of mathematics word-problem difficulty. In the fall, 122 third-grade students were assessed on a test of math word-problem skill and DA of algebraic learning. In the spring, they were assessed on…
Constructing a coherent problem model to facilitate algebra problem solving in a chemistry context
NASA Astrophysics Data System (ADS)
Hiong Ngu, Bing; Seeshing Yeung, Alexander; Phan, Huy P.
2015-04-01
An experiment using a sample of 11th graders compared text editing and worked examples approaches in learning to solve dilution and molarity algebra word problems in a chemistry context. Text editing requires students to assess the structure of a word problem by specifying whether the problem text contains sufficient, missing, or irrelevant information for reaching a solution. Worked examples direct students to follow steps toward the solution, and its emphasis is on computation instead of the formation of a coherent problem model. Text editing yielded higher scores in a transfer test (which shared the same solution procedure as in the acquisition problems but differed in contexts), but not a similar test (which resembled acquisition problems in terms of both solution procedure and context). Results provide some theoretical support and practical implications for using text editing to develop a coherent problem model to facilitate problem-solving skills in chemistry.
Unified derivation of exact solutions to the relativistic Coulomb problem: Lie algebraic approach
NASA Astrophysics Data System (ADS)
Panahi, H.; Baradaran, M.; Savadi, A.
2015-10-01
Exact algebraic solutions of the D-dimensional Dirac and Klein-Gordon equations for the Coulomb potential are obtained in a unified treatment. It is shown that two cases are reducible to the same basic equation, which can be solved exactly. Using the Lie algebraic approach, the general exact solutions of the problem are obtained within the framework of representation theory of the sl(2) Lie algebra.
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…
NASA Astrophysics Data System (ADS)
Brinkmeier, Maik; Nackenhorst, Udo
2008-03-01
The transient dynamic response of rolling tires is of essential importance for comfort questions, e.g. noise radiation. Whereas finite element models are well established for stationary rolling simulations, it lacks computational methods for the treatment of the high frequency response. One challenge is the large mode density of tire structures that is up to the acoustic frequency domain and another lies on the physically correct description of rolling (gyroscopic) structures. Despite that the eigenvalue analysis of gyroscopic systems, described by complex-valued quadratic eigenvalue systems, seems to be well understood in general, specific problems arise for the computability of large scale three-dimensional tire models. In this presentation an overall computational strategy for the high frequency response of FE-tire models is outlined, where special emphasis is placed upon the efficient numerical treatment of the complex-valued eigenproblems for large scale gyroscopic systems. The practicability of the proposed approach will be demonstrated by the analysis of detailed finite element tire models. The physical interpretation of the computational results is also discussed in detail.
Turinsky, P.J.; Al-Chalabi, R.M.K.; Engrand, P.; Sarsour, H.N.; Faure, F.X.; Guo, W.
1994-06-01
NESTLE is a FORTRAN77 code that solves the few-group neutron diffusion equation utilizing the Nodal Expansion Method (NEM). NESTLE can solve the eigenvalue (criticality); eigenvalue adjoint; external fixed-source steady-state; or external fixed-source. or eigenvalue initiated transient problems. The code name NESTLE originates from the multi-problem solution capability, abbreviating Nodal Eigenvalue, Steady-state, Transient, Le core Evaluator. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two or four energy groups can be utilized, with all energy groups being thermal groups (i.e. upscatter exits) if desired. Core geometries modelled include Cartesian and Hexagonal. Three, two and one dimensional models can be utilized with various symmetries. The non-linear iterative strategy associated with the NEM method is employed. An advantage of the non-linear iterative strategy is that NSTLE can be utilized to solve either the nodal or Finite Difference Method representation of the few-group neutron diffusion equation.
ERIC Educational Resources Information Center
Usman, Ahmed Ibrahim
2015-01-01
Knowledge and understanding of mathematical operations serves as a pre-reequisite for the successful translation of algebraic word problems. This study explored pre-service teachers' ability to recognize mathematical operations as well as use of those capabilities in constructing algebraic expressions, equations, and their solutions. The outcome…
NASA Astrophysics Data System (ADS)
Movassagh, Ramis
2016-02-01
We prove that the complex conjugate (c.c.) eigenvalues of a smoothly varying real matrix attract (Eq. 15). We offer a dynamical perspective on the motion and interaction of the eigenvalues in the complex plane, derive their governing equations and discuss applications. C.c. pairs closest to the real axis, or those that are ill-conditioned, attract most strongly and can collide to become exactly real. As an application we consider random perturbations of a fixed matrix M. If M is Normal, the total expected force on any eigenvalue is shown to be only the attraction of its c.c. (Eq. 24) and when M is circulant the strength of interaction can be related to the power spectrum of white noise. We extend this by calculating the expected force (Eq. 41) for real stochastic processes with zero-mean and independent intervals. To quantify the dominance of the c.c. attraction, we calculate the variance of other forces. We apply the results to the Hatano-Nelson model and provide other numerical illustrations. It is our hope that the simple dynamical perspective herein might help better understanding of the aggregation and low density of the eigenvalues of real random matrices on and near the real line respectively. In the appendix we provide a Matlab code for plotting the trajectories of the eigenvalues.
Powell, Sarah R; Fuchs, Lynn S
2014-08-01
According to national mathematics standards, algebra instruction should begin at kindergarten and continue through elementary school. Most often, teachers address algebra in the elementary grades with problems related to solving equations or understanding functions. With 789 2(nd)- grade students, we administered (a) measures of calculations and word problems in the fall and (b) an assessment of pre-algebraic reasoning, with items that assessed solving equations and functions, in the spring. Based on the calculation and word-problem measures, we placed 148 students into 1 of 4 difficulty status categories: typically performing, calculation difficulty, word-problem difficulty, or difficulty with calculations and word problems. Analyses of variance were conducted on the 148 students; path analytic mediation analyses were conducted on the larger sample of 789 students. Across analyses, results corroborated the finding that word-problem difficulty is more strongly associated with difficulty with pre-algebraic reasoning. As an indicator of later algebra difficulty, word-problem difficulty may be a more useful predictor than calculation difficulty, and students with word-problem difficulty may require a different level of algebraic reasoning intervention than students with calculation difficulty.
Powell, Sarah R; Fuchs, Lynn S
2014-08-01
According to national mathematics standards, algebra instruction should begin at kindergarten and continue through elementary school. Most often, teachers address algebra in the elementary grades with problems related to solving equations or understanding functions. With 789 2(nd)- grade students, we administered (a) measures of calculations and word problems in the fall and (b) an assessment of pre-algebraic reasoning, with items that assessed solving equations and functions, in the spring. Based on the calculation and word-problem measures, we placed 148 students into 1 of 4 difficulty status categories: typically performing, calculation difficulty, word-problem difficulty, or difficulty with calculations and word problems. Analyses of variance were conducted on the 148 students; path analytic mediation analyses were conducted on the larger sample of 789 students. Across analyses, results corroborated the finding that word-problem difficulty is more strongly associated with difficulty with pre-algebraic reasoning. As an indicator of later algebra difficulty, word-problem difficulty may be a more useful predictor than calculation difficulty, and students with word-problem difficulty may require a different level of algebraic reasoning intervention than students with calculation difficulty. PMID:25309044
Some properties of eigenvalues and generalized eigenvectors of one boundary-value problem
NASA Astrophysics Data System (ADS)
Olgar, Hayati; Mukhtarov, Oktay; Aydemir, Kadriye
2016-08-01
We investigate a discontinuous boundary value problem which consists of a Sturm-Liouville equation with piece-wise continuous potential together with eigenparameter-dependent boundary conditions and supplementary transmission conditions. We establish some spectral properties of the considered problem. In particular it is shown that the generalized eigen-functions form a Riesz basis of the adequate Hilbert space.
Acceleration of k-Eigenvalue / Criticality Calculations using the Jacobian-Free Newton-Krylov Method
Dana Knoll; HyeongKae Park; Chris Newman
2011-02-01
We present a new approach for the $k$--eigenvalue problem using a combination of classical power iteration and the Jacobian--free Newton--Krylov method (JFNK). The method poses the $k$--eigenvalue problem as a fully coupled nonlinear system, which is solved by JFNK with an effective block preconditioning consisting of the power iteration and algebraic multigrid. We demonstrate effectiveness and algorithmic scalability of the method on a 1-D, one group problem and two 2-D two group problems and provide comparison to other efforts using silmilar algorithmic approaches.
Perturbation of eigenvalues of preconditioned Navier-Stokes operators
Elman, H.C.
1996-12-31
We study the sensitivity of algebraic eigenvalue problems associated with matrices arising from linearization and discretization of the steady-state Navier-Stokes equations. In particular, for several choices of preconditioners applied to the system of discrete equations, we derive upper bounds on perturbations of eigenvalues as functions of the viscosity and discretization mesh size. The bounds suggest that the sensitivity of the eigenvalues is at worst linear in the inverse of the viscosity and quadratic in the inverse of the mesh size, and that scaling can be used to decrease the sensitivity in some cases. Experimental results supplement these results and confirm the relatively mild dependence on viscosity. They also indicate a dependence on the mesh size of magnitude smaller than the analysis suggests.
An Evaluation of Interventions to Facilitate Algebra Problem Solving
ERIC Educational Resources Information Center
Mayfield, Kristin H.; Glenn, Irene M.
2008-01-01
Three participants were trained on 6 target algebra skills and subsequently received a series of 5 instructional interventions (cumulative practice, tiered feedback, feedback plus solution sequence instruction, review practice, and transfer training) in a multiple baseline across skills design. The effects of the interventions on the performance…
Excel Spreadsheets for Algebra: Improving Mental Modeling for Problem Solving
ERIC Educational Resources Information Center
Engerman, Jason; Rusek, Matthew; Clariana, Roy
2014-01-01
This experiment investigates the effectiveness of Excel spreadsheets in a high school algebra class. Students in the experiment group convincingly outperformed the control group on a post lesson assessment. The student responses, teacher observations involving Excel spreadsheet revealed that it operated as a mindtool, which formed the users'…
Application of symbolic and algebraic manipulation software in solving applied mechanics problems
NASA Technical Reports Server (NTRS)
Tsai, Wen-Lang; Kikuchi, Noboru
1993-01-01
As its name implies, symbolic and algebraic manipulation is an operational tool which not only can retain symbols throughout computations but also can express results in terms of symbols. This report starts with a history of symbolic and algebraic manipulators and a review of the literatures. With the help of selected examples, the capabilities of symbolic and algebraic manipulators are demonstrated. These applications to problems of applied mechanics are then presented. They are the application of automatic formulation to applied mechanics problems, application to a materially nonlinear problem (rigid-plastic ring compression) by finite element method (FEM) and application to plate problems by FEM. The advantages and difficulties, contributions, education, and perspectives of symbolic and algebraic manipulation are discussed. It is well known that there exist some fundamental difficulties in symbolic and algebraic manipulation, such as internal swelling and mathematical limitation. A remedy for these difficulties is proposed, and the three applications mentioned are solved successfully. For example, the closed from solution of stiffness matrix of four-node isoparametrical quadrilateral element for 2-D elasticity problem was not available before. Due to the work presented, the automatic construction of it becomes feasible. In addition, a new advantage of the application of symbolic and algebraic manipulation found is believed to be crucial in improving the efficiency of program execution in the future. This will substantially shorten the response time of a system. It is very significant for certain systems, such as missile and high speed aircraft systems, in which time plays an important role.
Hanson, S J; Gagliardi, A D; Hanson, C
2009-08-01
Brain measures often show highly structured temporal dynamics that synchronize when observers are doing the same task. The standard method for analysis of brain imaging signals (e.g. fMRI) uses the GLM for each voxel indexed against a specified experimental design but does not explicitly involve temporal dynamics. Consequently, the design variables that determine the functional brain areas are those correlated with the design variation rather than the common or conserved brain areas across subjects with the same temporal dynamics given the same stimulus conditions. This raises an important theoretical question: Are temporal dynamics conserved across individuals experiencing the same stimulus task? This general question can be framed in a dynamical systems context and further be posed as an eigenvalue problem about the conservation of synchrony across all brains simultaneously. We show that solving the problem results in a non-arbitrary measure of temporal dynamics across brains that scales over any number of subjects, stabilizes with increasing sample size, and varies systematically across tasks and stimulus conditions.
Inverse eigenvalue problems in vibration absorption: Passive modification and active control
NASA Astrophysics Data System (ADS)
Mottershead, John E.; Ram, Yitshak M.
2006-01-01
The abiding problem of vibration absorption has occupied engineering scientists for over a century and there remain abundant examples of the need for vibration suppression in many industries. For example, in the automotive industry the resolution of noise, vibration and harshness (NVH) problems is of extreme importance to customer satisfaction. In rotorcraft it is vital to avoid resonance close to the blade passing speed and its harmonics. An objective of the greatest importance, and extremely difficult to achieve, is the isolation of the pilot's seat in a helicopter. It is presently impossible to achieve the objectives of vibration absorption in these industries at the design stage because of limitations inherent in finite element models. Therefore, it is necessary to develop techniques whereby the dynamic of the system (possibly a car or a helicopter) can be adjusted after it has been built. There are two main approaches: structural modification by passive elements and active control. The state of art of the mathematical theory of vibration absorption is presented and illustrated for the benefit of the reader with numerous simple examples.
An Eigenvalue Analysis of finite-difference approximations for hyperbolic IBVPs
NASA Technical Reports Server (NTRS)
Warming, Robert F.; Beam, Richard M.
1989-01-01
The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L(sub 2) stability on a finite domain.
An eigenvalue analysis of finite-difference approximations for hyperbolic IBVPs
NASA Technical Reports Server (NTRS)
Warming, Robert F.; Beam, Richard M.
1990-01-01
The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L (sub 2) stability on a finite domain.
The 16th Hilbert problem restricted to circular algebraic limit cycles
NASA Astrophysics Data System (ADS)
Llibre, Jaume; Ramírez, Rafael; Ramírez, Valentín; Sadovskaia, Natalia
2016-04-01
We prove the following two results. First every planar polynomial vector field of degree S with S invariant circles is Darboux integrable without limit cycles. Second a planar polynomial vector field of degree S admits at most S - 1 invariant circles which are algebraic limit cycles. In particular we solve the 16th Hilbert problem restricted to algebraic limit cycles given by circles, because a planar polynomial vector field of degree S has at most S - 1 algebraic limit cycles given by circles, and this number is reached.
The Poincaré problem, algebraic integrability and dicritical divisors
NASA Astrophysics Data System (ADS)
Galindo, C.; Monserrat, F.
We solve the Poincaré problem for plane foliations with only one dicritical divisor. Moreover, in this case, we give a simple algorithm that decides whether a foliation has a rational first integral and computes it in the affirmative case. We also provide an algorithm to compute a rational first integral of prefixed genus g≠1 of any type of plane foliation F. When the number of dicritical divisors dic(F) is larger than 2, this algorithm depends on suitable families of invariant curves. When dic(F)=2, it proves that the degree of the rational first integral can be bounded only in terms of g, the degree of F and the local analytic type of the dicritical singularities of F. The degree d of a general integral invariant curve is less than or equal to 4. Therefore, the Poincaré problem is solved in this case. There exists a valueλ∈Z>0such thatPF:=|λΔF|is a pencil and the rational mapP2⋯→P1that it defines is a rational first integral ofF. Moreover λ is the minimum of the set{α∈Z>0|dim|αΔF|⩾1}. The above clause (b) supports a very simple algorithm, our forthcoming Algorithm 2, which decides about the existence of a rational first integral of F (and computes it in the positive case) whenever dic(F)=1. Other alternative algorithms are treated in Section 4. Our remaining main results are: Assume thatFhas a rational first integral of genus g. Then, there exists a bound on the degree of the first integral depending only on the degree ofF, the genus g and the local analytic type of the dicritical singularities ofF. There exists an algorithm to decide whetherFhas a rational first integral of genus g (and to compute it, in the affirmative case) whose inputs are: g, a homogeneous 1-form definingFand the minimal resolution of the dicritical singularities ofF. Assume thatFhas a rational first integral of genus g. Then there exists a bound on the degree of the first integral which depends on the degree ofF, the genus g, the local analytic type of the
ERIC Educational Resources Information Center
Hernandez, Andrea C.
2013-01-01
This dissertation analyzes differences found in Spanish-speaking middle school and high school students in algebra-based problem solving. It identifies the accuracy differences between word problems presented in English, Spanish and numerically based problems. The study also explores accuracy differences between each subgroup of Spanish-speaking…
Kalchev, D.; Ketelsen, C.; Vassilevski, P. S.
2013-11-07
Our paper proposes an adaptive strategy for reusing a previously constructed coarse space by algebraic multigrid to construct a two-level solver for a problem with nearby characteristics. Furthermore, a main target application is the solution of the linear problems that appear throughout a sequence of Markov chain Monte Carlo simulations of subsurface flow with uncertain permeability field. We demonstrate the efficacy of the method with extensive set of numerical experiments.
The Effect of using two variables when there are two unknowns in solving algebraic word problems
NASA Astrophysics Data System (ADS)
Mathews, Susann M.
1997-09-01
This article reports an experiment in which Algebra I students learned to translate word problems with two unknowns from the prose representation to symbolic representation using two variables (one to represent each unknown) when they first started solving word problems with two unknowns. Their performance on a test of word problems with two unknowns was compared with the results on the same test taken by students who had learned to solve word problems with two unknowns the traditional way, using only one variable to translate from prose to an algebraic equation. Four algebra teachers and 181 of their students participated in the study. A block-randomised factorial design was used. An analysis of covariance showed a statistically significant difference in the mean scores of the experimental group and the control group on this word problem test with the experimental group scoring substantially higher.
NASA Astrophysics Data System (ADS)
Luukko, P. J. J.; Räsänen, E.
2013-03-01
We present a code for solving the single-particle, time-independent Schrödinger equation in two dimensions. Our program utilizes the imaginary time propagation (ITP) algorithm, and it includes the most recent developments in the ITP method: the arbitrary order operator factorization and the exact inclusion of a (possibly very strong) magnetic field. Our program is able to solve thousands of eigenstates of a two-dimensional quantum system in reasonable time with commonly available hardware. The main motivation behind our work is to allow the study of highly excited states and energy spectra of two-dimensional quantum dots and billiard systems with a single versatile code, e.g., in quantum chaos research. In our implementation we emphasize a modern and easily extensible design, simple and user-friendly interfaces, and an open-source development philosophy. Catalogue identifier: AENR_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AENR_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License version 3 No. of lines in distributed program, including test data, etc.: 11310 No. of bytes in distributed program, including test data, etc.: 97720 Distribution format: tar.gz Programming language: C++ and Python. Computer: Tested on x86 and x86-64 architectures. Operating system: Tested under Linux with the g++ compiler. Any POSIX-compliant OS with a C++ compiler and the required external routines should suffice. Has the code been vectorised or parallelized?: Yes, with OpenMP. RAM: 1 MB or more, depending on system size. Classification: 7.3. External routines: FFTW3 (http://www.fftw.org), CBLAS (http://netlib.org/blas), LAPACK (http://www.netlib.org/lapack), HDF5 (http://www.hdfgroup.org/HDF5), OpenMP (http://openmp.org), TCLAP (http://tclap.sourceforge.net), Python (http://python.org), Google Test (http://code.google.com/p/googletest/) Nature of problem: Numerical calculation
The Schrodinger Eigenvalue March
ERIC Educational Resources Information Center
Tannous, C.; Langlois, J.
2011-01-01
A simple numerical method for the determination of Schrodinger equation eigenvalues is introduced. It is based on a marching process that starts from an arbitrary point, proceeds in two opposite directions simultaneously and stops after a tolerance criterion is met. The method is applied to solving several 1D potential problems including symmetric…
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…
ERIC Educational Resources Information Center
Lee, Kerry; Ng, Ee Lynn; Ng, Swee Fong
2009-01-01
Solving algebraic word problems involves multiple cognitive phases. The authors used a multitask approach to examine the extent to which working memory and executive functioning are associated with generating problem models and producing solutions. They tested 255 11-year-olds on working memory (Counting Recall, Letter Memory, and Keep Track),…
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
ERIC Educational Resources Information Center
Ngu, Bing Hiong; Yeung, Alexander Seeshing
2012-01-01
Holyoak and Koh (1987) and Holyoak (1984) propose four critical tasks for analogical transfer to occur in problem solving. A study was conducted to test this hypothesis by comparing a multiple components (MC) approach against worked examples (WE) in helping students to solve algebra word problems in chemistry classes. The MC approach incorporated…
NASA Astrophysics Data System (ADS)
Bagué, Anne; Fuster, Daniel; Popinet, Stéphane; Scardovelli, Ruben; Zaleski, Stéphane
2010-09-01
The temporal instability of parallel two-phase mixing layers is studied with a linear stability code by considering a composite error function base flow. The eigenfunctions of the linear problem are used to initialize the velocity and volume fraction fields for direct numerical simulations of the incompressible Navier-Stokes equations with the open-source GERRIS flow solver. We compare the growth rate of the most unstable mode from the linear stability problem and from the simulation results at moderate and large density and viscosity ratios in order to validate the code for a wide range of physical parameters. The efficiency of the adaptive mesh refinement scheme is also discussed.
On Development of a Problem Based Learning System for Linear Algebra with Simple Input Method
NASA Astrophysics Data System (ADS)
Yokota, Hisashi
2011-08-01
Learning how to express a matrix using a keyboard inputs requires a lot of time for most of college students. Therefore, for a problem based learning system for linear algebra to be accessible for college students, it is inevitable to develop a simple method for expressing matrices. Studying the two most widely used input methods for expressing matrices, a simpler input method for expressing matrices is obtained. Furthermore, using this input method and educator's knowledge structure as a concept map, a problem based learning system for linear algebra which is capable of assessing students' knowledge structure and skill is developed.
NASA Astrophysics Data System (ADS)
Chuluunbaatar, O.; Gusev, A. A.; Vinitsky, S. I.; Abrashkevich, A. G.
2009-08-01
differential equations with the help of the KANTBP programs [1,2]. Solution method: The parametric self-adjoined Sturm-Liouville problem with the parametric third type boundary conditions is solved by the finite element method using high-order accuracy approximations [15]. The generalized algebraic eigenvalue problem AF=EBF with respect to a pair of unknown ( E,F) arising after the replacement of the differential problem by the finite-element approximation is solved by the subspace iteration method using the SSPACE program [16]. First derivatives of the eigenfunctions with respect to the parameter which contained in potential matrix elements of the coupled system equations are obtained by solving the inhomogeneous algebraic equations. As a test desk, the program is applied to the calculation of the potential matrix elements for an integrable 2D-model of three identical particles on a line with pair zero-range potentials described in [1,17,18], a 3D-model of a hydrogen atom in a homogeneous magnetic field described in [14,19] and a hydrogen atom on a three-dimensional sphere [20]. Restrictions: The computer memory requirements depend on: the number and order of finite elements; the number of points; and the number of eigenfunctions required. Restrictions due to dimension sizes may be easily alleviated by altering PARAMETER statements (see sections below and listing for details). The user must also supply DOUBLE PRECISION functions POTCCL and POTCC1 for evaluating potential function U(ρ,z) of Eq. (1) and its first derivative with respect to parameter ρ. The user should supply DOUBLE PRECISION functions F1FUNC and F2FUNC that evaluate functions f(z) and f(z) of Eq. (1). The user must also supply subroutine BOUNCF for evaluating the parametric third type boundary conditions. Running time: The running time depends critically upon: the number and order of finite elements; the number of points on interval [z,z]; and the number of eigenfunctions required. The test run which
An efficient algorithm for the contig ordering problem under algebraic rearrangement distance.
Lu, Chin Lung
2015-11-01
Assembling a genome from short reads currently obtained by next-generation sequencing techniques often results in a collection of contigs, whose relative position and orientation along the genome being sequenced are unknown. Given two sets of contigs, the contig ordering problem is to order and orient the contigs in each set such that the genome rearrangement distance between the resulting sets of ordered and oriented contigs is minimized. In this article, we utilize the permutation groups in algebra to propose a near-linear time algorithm for solving the contig ordering problem under algebraic rearrangement distance, where the algebraic rearrangement distance between two sets of ordered and oriented contigs is the minimum weight of applicable rearrangement operations required to transform one set into the other. PMID:26247343
CREUTZ, M.
2006-01-26
It is popular to discuss low energy physics in lattice gauge theory ill terms of the small eigenvalues of the lattice Dirac operator. I play with some ensuing pitfalls in the interpretation of these eigenvalue spectra. In short, thinking about the eigenvalues of the Dirac operator in the presence of gauge fields can give some insight, for example the elegant Banks-Casher picture for chiral symmetry breaking. Nevertheless, care is necessary because the problem is highly non-linear. This manifests itself in the non-intuitive example of how adding flavors enhances rather than suppresses low eigenvalues. Issues involving zero mode suppression represent one facet of a set of connected unresolved issues. Are there non-perturbative ambiguities in quantities such as the topological susceptibility? How essential are rough gauge fields, i.e. gauge fields on which the winding number is ambiguous? How do these issues interplay with the quark masses? I hope the puzzles presented here will stimulate more thought along these lines.
Application of algebraic reconstruction techniques to geophysical problems
NASA Astrophysics Data System (ADS)
Peterson, J. E., Jr.
1986-04-01
Algebraic Reconstruction Techniques (ART), introduced in medical radiology, are extended in this study to seismic travel time data. The algorithms based on these techniques, developed initially for use with X-rays, must be modified for acoustic wave data. The convergence properties of these algorithms to an adequate solution and the reliability of this solution are also investigated. The algorithms developed are initially tested on synthetically derived travel time data. Travel time data from simplistic velocity models are used to determine the general behavior of the algorithms and to estimate the reliability of the reconstructed velocity field. More complex models simulate realistic velocity distributions. Results from these studies provide critical guidelines for the inversion of real travel time data. The study also investigates the amount of detail that may be determined by this method with realistic structures. Two high quality travel time data sets are inverted using ART. The experiments were carried out at the Retsof salt mine in New York and at the underground radioactive waste repository study site in Sweden (Stripa). The Stripa data set is unique in that it consists of two suites of travel time measurements; one taken while the medium was being heated by a simulated waste canister, and the other some months after the heat had been turned off. This tests the use of ART as a monitoring technique using seismic waves.
Boyd, J.P.
1996-06-01
We make several observations about eigenvalue problems using, as examples, Laplace`s tidal equations and the differential equation satisfied by the associated Legendre functions. Whatever the discretization, only some of the eigenvalues of the N-dimensional matrix eigenvalue problem will be good approximations to those of the differential equation-usually the N/2 eigenvalues of smallest magnitude. For the tidal problem, however, the {open_quotes}good{close_quotes} eigenvalues are scattered, so our first point is: It is important to plot the {open_quotes}drift{close_quotes} of eigenvalues with changes in resolution. We suggest plotting the difference between a low resolution eigenvalue and the nearest high resolution eigenvalue, divided by the magnitude of the eigenvalue or the intermodal separation, whichever is smaller. Second, as a final safeguard, it is important to look at the Chebyshev coefficients of the mode: We show a numerically computed {open_quotes}anti-Kelvin{close_quotes} wave which has little eigenvalue drift, but is completely spurious as is obvious from its spectral series. Third, inverting the roles of parameters can drastically modify the spectrum; Legendre`s equation may have either an infinite number of discrete modes or only a handful, depending on which parameter is the eigenvalue. Fourth, when the modes are singular but decay to zero at the endpoints (as is true of tides), a tanh-mapping can retrieve the usual exponential accuracy of spectral methods. Fifth, the pseudospectral method is more reliable than deriving a banded Galerkin matrix by means of recurrence relations; the pseudospectral code is simple to check, whereas it is easy to make an untestable mistake with the intricate algebra required for the Galerkin method. Sixth, we offer a brief cautionary tale about overlooked modes. All these cautions are applicable to all forms of spatial discretization including finite difference and finite element methods. 22 refs., 6 figs., 3 tabs.
Alternative Representations for Algebraic Problem Solving: When Are Graphs Better than Equations?
ERIC Educational Resources Information Center
Mielicki, Marta K.; Wiley, Jennifer
2016-01-01
Successful algebraic problem solving entails adaptability of solution methods using different representations. Prior research has suggested that students are more likely to prefer symbolic solution methods (equations) over graphical ones, even when graphical methods should be more efficient. However, this research has not tested how representation…
ERIC Educational Resources Information Center
Lee, Kerry; Khng, Kiat Hui; Ng, Swee Fong; Ng Lan Kong, Jeremy
2013-01-01
In Singapore, primary school students are taught to use bar diagrams to represent known and unknown values in algebraic word problems. However, little is known about students' understanding of these graphical representations. We investigated whether students use and think of the bar diagrams in a concrete or a more abstract fashion. We also…
Muehlhoff, Rainer
2011-02-15
Existence and uniqueness of advanced and retarded fundamental solutions (Green's functions) and of global solutions to the Cauchy problem is proved for a general class of first order linear differential operators on vector bundles over globally hyperbolic Lorentzian manifolds. This is a core ingredient to CAR-/CCR-algebraic constructions of quantum field theories on curved spacetimes, particularly for higher spin field equations.
Arithmetic/Algebraic Problem-Solving and the Representation of Two Unknown Quantities
ERIC Educational Resources Information Center
Filloy, Eugenio; Rojano, Teresa; Solares, Armando
2004-01-01
We deal with the study of the senses and the meanings generated in the representation of the unknowns in the resolution of word problems involving two unknown quantities. The discussed cases show the difficulties that the students beginning the algebra learning have to deal with when using the equality between "unknown things". For them, applying…
Effects of Graphic Organiser on Students' Achievement in Algebraic Word Problems
ERIC Educational Resources Information Center
Owolabi, Josiah; Adaramati, Tobiloba Faith
2015-01-01
This study investigated the effects of graphic organiser and gender on students' academic achievement in algebraic word problem. Three research questions and three null hypotheses were used in guiding this study. Quasi experimental research was employed and Non-equivalent pre and post test design was used. The study involved the Senior Secondary…
ERIC Educational Resources Information Center
Walkington, Candace; Sherman, Milan; Petrosino, Anthony
2012-01-01
This study critically examines a key justification used by educational stakeholders for placing mathematics in context--the idea that contextualization provides students with access to mathematical ideas. We present interviews of 24 ninth grade students from a low-performing urban school solving algebra story problems, some of which were…
Henson, V E
2003-02-06
The purpose of this research project was to investigate, design, and implement new algebraic multigrid (AMG) algorithms to enable the effective use of AMG in large-scale multiphysics simulation codes. These problems are extremely large; storage requirements and excessive run-time make direct solvers infeasible. The problems are highly ill-conditioned, so that existing iterative solvers either fail or converge very slowly. While existing AMG algorithms have been shown to be robust and stable for a large class of problems, there are certain problems of great interest to the Laboratory for which no effective algorithm existed prior to this research.
ERIC Educational Resources Information Center
Powell, Sarah R.; Fuchs, Lynn S.
2014-01-01
According to national mathematics standards, algebra instruction should begin at kindergarten and continue through elementary school. Most often, teachers address algebra in the elementary grades with problems related to solving equations or understanding functions. With 789 second-grade students, we administered: (1) measures of calculations and…
Trade-offs between grounded and abstract representations: evidence from algebra problem solving.
Koedinger, Kenneth R; Alibali, Martha W; Nathan, Mitchell J
2008-03-01
This article explores the complementary strengths and weaknesses of grounded and abstract representations in the domain of early algebra. Abstract representations, such as algebraic symbols, are concise and easy to manipulate but are distanced from any physical referents. Grounded representations, such as verbal descriptions of situations, are more concrete and familiar, and they are more similar to physical objects and everyday experience. The complementary computational characteristics of grounded and abstract representations lead to trade-offs in problem-solving performance. In prior research with high school students solving relatively simple problems, Koedinger and Nathan (2004) demonstrated performance benefits of grounded representations over abstract representations-students were better at solving simple story problems than the analogous equations. This article extends this prior work to examine both simple and more complex problems in two samples of college students. On complex problems with two references to the unknown, a "symbolic advantage" emerged, such that students were better at solving equations than analogous story problems. Furthermore, the previously observed "verbal advantage" on simple problems was replicated. We thus provide empirical support for a trade-off between grounded, verbal representations, which show advantages on simpler problems, and abstract, symbolic representations, which show advantages on more complex problems.
Algebraic Approach to the Minimum-Cost Multi-Impulse Orbit-Transfer Problem
NASA Astrophysics Data System (ADS)
Avendaño, M.; Martín-Molina, V.; Martín-Morales, J.; Ortigas-Galindo, J.
2016-08-01
We present a purely algebraic formulation (i.e. polynomial equations only) of the minimum-cost multi-impulse orbit transfer problem without time constraints, while keeping all the variables with a precise physical meaning. We apply general algebraic techniques to solve these equations (resultants, Gr\\"obner bases, etc.) in several situations of practical interest of different degrees of generality. For instance, we provide a proof of the optimality of the Hohmann transfer for the minimum fuel 2-impulse circular to circular orbit transfer problem, and we provide a general formula for the optimal 2-impulse in-plane transfer between two rotated elliptical orbits under a mild symmetry assumption on the two points where the impulses are applied (which we conjecture that can be removed).
Quantum Algorithms for Problems in Number Theory, Algebraic Geometry, and Group Theory
NASA Astrophysics Data System (ADS)
van Dam, Wim; Sasaki, Yoshitaka
2013-09-01
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same problem appears to be intractable on classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article will review the current state of quantum algorithms, focusing on algorithms for problems with an algebraic flavor that achieve an apparent superpolynomial speedup over classical computation.
NASA Astrophysics Data System (ADS)
Liu, Tianyu; Du, Xining; Ji, Wei; Xu, X. George; Brown, Forrest B.
2014-06-01
For nuclear reactor analysis such as the neutron eigenvalue calculations, the time consuming Monte Carlo (MC) simulations can be accelerated by using graphics processing units (GPUs). However, traditional MC methods are often history-based, and their performance on GPUs is affected significantly by the thread divergence problem. In this paper we describe the development of a newly designed event-based vectorized MC algorithm for solving the neutron eigenvalue problem. The code was implemented using NVIDIA's Compute Unified Device Architecture (CUDA), and tested on a NVIDIA Tesla M2090 GPU card. We found that although the vectorized MC algorithm greatly reduces the occurrence of thread divergence thus enhancing the warp execution efficiency, the overall simulation speed is roughly ten times slower than the history-based MC code on GPUs. Profiling results suggest that the slow speed is probably due to the memory access latency caused by the large amount of global memory transactions. Possible solutions to improve the code efficiency are discussed.
Fuchs, Lynn S; Compton, Donald L; Fuchs, Douglas; Hollenbeck, Kurstin N; Hamlett, Carol L; Seethaler, Pamela M
2011-01-01
The purpose of this study was to explore the utility of a dynamic assessment (DA) of algebraic learning in predicting third graders' development of mathematics word-problem difficulty. In the fall, 122 third-grade students were assessed on a test of math word-problem skill and DA of algebraic learning. In the spring, they were assessed on word-problem performance. Logistic regression was conducted to contrast two models. One relied exclusively on the fall test of math word-problem skill to predict word-problem difficulty on the spring outcome (less than the 25th percentile). The second model relied on a combination of the fall test of math word-problem skill and the fall DA to predict the same outcome. Holding sensitivity at 87.5%, the universal screener alone resulted in a high proportion of false positives, which was practically reduced when DA was included in the prediction model. Findings are discussed in terms of a two-stage process for screening students within a responsiveness-to-intervention prevention model.
Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Hollenbeck, Kurstin N.; Hamlett, Carol L.; Seethaler, Pamela M.
2011-01-01
The purpose of this study was to explore the utility of a dynamic assessment (DA) of algebraic learning in predicting third graders’ development of mathematics word-problem difficulty. In the fall, 122 third-grade students were assessed on a test of math word-problem skill and DA of algebraic learning. In the spring, they were assessed on word-problem performance. Logistic regression was conducted to contrast two models. One relied exclusively on the fall test of math word-problem skill to predict word-problem difficulty on the spring outcome (less than the 25th percentile). The second model relied on a combination of the fall test of math word-problem skill and the fall DA to predict the same outcome. Holding sensitivity at 87.5%, the universal screener alone resulted in a high proportion of false positives, which was practically reduced when DA was included in the prediction model. Findings are discussed in terms of a two-stage process for screening students within a responsiveness-to-intervention prevention model. PMID:21685352
Kulkarni, A.K.; Paranjape, S.D.; Kumar, V.; Sahni, D.C.
1994-12-31
Nonmonotonic variation of the {open_quotes}C{close_quotes} eigenvalue (average number of secondaries per collision) with increasing {alpha}, the strength of forward scattering, has been observed earlier for one-dimensional infinite homogeneous slabs and infinitely long homogeneous cylinders. The authors have developed the Integral Transform (IT) method, an accurate semi-analytical method to obtain the C eigenvalue for a homogeneous cylinder (two-dimensional system). They are thus able to detect any nonmonotonic variation of C (with {alpha}) using the Sahni and Sjoestrand criterion. Along with the IT method, the authors also present the results obtained by the well-known numerical techniques like the discrete ordinates method using a high quadrature order and the Monte Carlo method for the same problem. The S{sub N} results show disagreement with the other two methods when one of the dimensions is very small (<0.05{lambda}{sub t}). They believe that even the 16th order quadrature set cannot integrate the angular flux accurately in these extreme situations. 12 refs., 9 tabs.
Marek, A; Blum, V; Johanni, R; Havu, V; Lang, B; Auckenthaler, T; Heinecke, A; Bungartz, H-J; Lederer, H
2014-05-28
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structure theory and many other areas of computational science. The computational effort formally scales as O(N(3)) with the size of the investigated problem, N (e.g. the electron count in electronic structure theory), and thus often defines the system size limit that practical calculations cannot overcome. In many cases, more than just a small fraction of the possible eigenvalue/eigenvector pairs is needed, so that iterative solution strategies that focus only on a few eigenvalues become ineffective. Likewise, it is not always desirable or practical to circumvent the eigenvalue solution entirely. We here review some current developments regarding dense eigenvalue solvers and then focus on the Eigenvalue soLvers for Petascale Applications (ELPA) library, which facilitates the efficient algebraic solution of symmetric and Hermitian eigenvalue problems for dense matrices that have real-valued and complex-valued matrix entries, respectively, on parallel computer platforms. ELPA addresses standard as well as generalized eigenvalue problems, relying on the well documented matrix layout of the Scalable Linear Algebra PACKage (ScaLAPACK) library but replacing all actual parallel solution steps with subroutines of its own. For these steps, ELPA significantly outperforms the corresponding ScaLAPACK routines and proprietary libraries that implement the ScaLAPACK interface (e.g. Intel's MKL). The most time-critical step is the reduction of the matrix to tridiagonal form and the corresponding backtransformation of the eigenvectors. ELPA offers both a one-step tridiagonalization (successive Householder transformations) and a two-step transformation that is more efficient especially towards larger matrices and larger numbers of CPU cores. ELPA is based on the MPI standard, with an early hybrid MPI-OpenMPI implementation available as well. Scalability beyond 10,000 CPU cores for problem
Marek, A; Blum, V; Johanni, R; Havu, V; Lang, B; Auckenthaler, T; Heinecke, A; Bungartz, H-J; Lederer, H
2014-05-28
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structure theory and many other areas of computational science. The computational effort formally scales as O(N(3)) with the size of the investigated problem, N (e.g. the electron count in electronic structure theory), and thus often defines the system size limit that practical calculations cannot overcome. In many cases, more than just a small fraction of the possible eigenvalue/eigenvector pairs is needed, so that iterative solution strategies that focus only on a few eigenvalues become ineffective. Likewise, it is not always desirable or practical to circumvent the eigenvalue solution entirely. We here review some current developments regarding dense eigenvalue solvers and then focus on the Eigenvalue soLvers for Petascale Applications (ELPA) library, which facilitates the efficient algebraic solution of symmetric and Hermitian eigenvalue problems for dense matrices that have real-valued and complex-valued matrix entries, respectively, on parallel computer platforms. ELPA addresses standard as well as generalized eigenvalue problems, relying on the well documented matrix layout of the Scalable Linear Algebra PACKage (ScaLAPACK) library but replacing all actual parallel solution steps with subroutines of its own. For these steps, ELPA significantly outperforms the corresponding ScaLAPACK routines and proprietary libraries that implement the ScaLAPACK interface (e.g. Intel's MKL). The most time-critical step is the reduction of the matrix to tridiagonal form and the corresponding backtransformation of the eigenvectors. ELPA offers both a one-step tridiagonalization (successive Householder transformations) and a two-step transformation that is more efficient especially towards larger matrices and larger numbers of CPU cores. ELPA is based on the MPI standard, with an early hybrid MPI-OpenMPI implementation available as well. Scalability beyond 10,000 CPU cores for problem
ERIC Educational Resources Information Center
Fuchs, Lynn S.; Zumeta, Rebecca O.; Schumacher, Robin Finelli; Powell, Sarah R.; Seethaler, Pamela M.; Hamlett, Carol L.; Fuchs, Douglas
2010-01-01
The purpose of this study was to assess the effects of schema-broadening instruction (SBI) on second graders' word-problem-solving skills and their ability to represent the structure of word problems using algebraic equations. Teachers (n = 18) were randomly assigned to conventional word-problem instruction or SBI word-problem instruction, which…
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.
ERIC Educational Resources Information Center
Mayer, Richard E.
In Experiments 1 and 2 subjects read a series of standard algebra story problems, and were asked to recall each problem. In Experiment 3, subjects were asked to construct problems based on certain situations (such as "train leaving stations"). Results indicated that "relational propositions" (such as "the rate in still water is 12 mph more than…
Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations
NASA Technical Reports Server (NTRS)
Sorensen, Danny C.
1996-01-01
Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.
Voila: A visual object-oriented iterative linear algebra problem solving environment
Edwards, H.C.; Hayes, L.J.
1994-12-31
Application of iterative methods to solve a large linear system of equations currently involves writing a program which calls iterative method subprograms from a large software package. These subprograms have complex interfaces which are difficult to use and even more difficult to program. A problem solving environment specifically tailored to the development and application of iterative methods is needed. This need will be fulfilled by Voila, a problem solving environment which provides a visual programming interface to object-oriented iterative linear algebra kernels. Voila will provide several quantum improvements over current iterative method problem solving environments. First, programming and applying iterative methods is considerably simplified through Voila`s visual programming interface. Second, iterative method algorithm implementations are independent of any particular sparse matrix data structure through Voila`s object-oriented kernels. Third, the compile-link-debug process is eliminated as Voila operates as an interpreter.
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.
Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Hollenbeck, Kurstin N.; Craddock, Caitlin F.; Hamlett, Carol L.
2008-01-01
Dynamic assessment (DA) involves helping students learn a task and indexing responsiveness to that instruction as a measure of learning potential. The purpose of this study was to explore the utility of a DA of algebraic learning in predicting 3rd graders’ development of mathematics problem solving. In the fall, 122 3rd-grade students were assessed on language, nonverbal reasoning, attentive behavior, calculations, word-problem skill, and DA. On the basis of random assignment, students received 16 weeks of validated instruction on word problems or received 16 weeks of conventional instruction on word problems. Then, students were assessed on word-problem measures proximal and distal to instruction. Structural equation measurement models showed that DA measured a distinct dimension of pretreatment ability and that proximal and distal word-problem measures were needed to account for outcome. Structural equation modeling showed that instruction (conventional vs. validated) was sufficient to account for math word-problem outcome proximal to instruction; by contrast, language, pretreatment math skill, and DA were needed to forecast learning on word-problem outcomes more distal to instruction. Findings are discussed in terms of responsiveness-to-intervention models for preventing and identifying learning disabilities. PMID:19884957
AEST: Adaptive Eigenvalue Stability Code
NASA Astrophysics Data System (ADS)
Zheng, L.-J.; Kotschenreuther, M.; Waelbroeck, F.; van Dam, J. W.; Berk, H.
2002-11-01
An adaptive eigenvalue linear stability code is developed. The aim is on one hand to include the non-ideal MHD effects into the global MHD stability calculation for both low and high n modes and on the other hand to resolve the numerical difficulty involving MHD singularity on the rational surfaces at the marginal stability. Our code follows some parts of philosophy of DCON by abandoning relaxation methods based on radial finite element expansion in favor of an efficient shooting procedure with adaptive gridding. The δ W criterion is replaced by the shooting procedure and subsequent matrix eigenvalue problem. Since the technique of expanding a general solution into a summation of the independent solutions employed, the rank of the matrices involved is just a few hundreds. This makes easier to solve the eigenvalue problem with non-ideal MHD effects, such as FLR or even full kinetic effects, as well as plasma rotation effect, taken into account. To include kinetic effects, the approach of solving for the distribution function as a local eigenvalue ω problem as in the GS2 code will be employed in the future. Comparison of the ideal MHD version of the code with DCON, PEST, and GATO will be discussed. The non-ideal MHD version of the code will be employed to study as an application the transport barrier physics in tokamak discharges.
The Effect of Using the TI-92 on Basic College Algebra Students' Ability To Solve Word Problems.
ERIC Educational Resources Information Center
Runde, Dennis C.
As part of an effort to improve community college algebra students' ability to solve word problems, a study was undertaken at Florida's Manatee Community College to determine the effects of using heuristic instruction (i.e., providing general rules for solving different types of math problems) in combination with the TI-92 calculator. The TI-92…
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…
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.
A review of vector convergence acceleration methods, with applications to linear algebra problems
NASA Astrophysics Data System (ADS)
Brezinski, C.; Redivo-Zaglia, M.
In this article, in a few pages, we will try to give an idea of convergence acceleration methods and extrapolation procedures for vector sequences, and to present some applications to linear algebra problems and to the treatment of the Gibbs phenomenon for Fourier series in order to show their effectiveness. The interested reader is referred to the literature for more details. In the bibliography, due to space limitation, we will only give the more recent items, and, for older ones, we refer to Brezinski and Redivo-Zaglia, Extrapolation methods. (Extrapolation Methods. Theory and Practice, North-Holland, 1991). This book also contains, on a magnetic support, a library (in Fortran 77 language) for convergence acceleration algorithms and extrapolation methods.
Dix, Annika; van der Meer, Elke
2015-04-01
This study investigates cognitive resource allocation dependent on fluid and numerical intelligence in arithmetic/algebraic tasks varying in difficulty. Sixty-six 11th grade students participated in a mathematical verification paradigm, while pupil dilation as a measure of resource allocation was collected. Students with high fluid intelligence solved the tasks faster and more accurately than those with average fluid intelligence, as did students with high compared to average numerical intelligence. However, fluid intelligence sped up response times only in students with average but not high numerical intelligence. Further, high fluid but not numerical intelligence led to greater task-related pupil dilation. We assume that fluid intelligence serves as a domain-general resource that helps to tackle problems for which domain-specific knowledge (numerical intelligence) is missing. The allocation of this resource can be measured by pupil dilation.
A new mathematical evaluation of smoking problem based of algebraic statistical method.
Mohammed, Maysaa J; Rakhimov, Isamiddin S; Shitan, Mahendran; Ibrahim, Rabha W; Mohammed, Nadia F
2016-01-01
Smoking problem is considered as one of the hot topics for many years. In spite of overpowering facts about the dangers, smoking is still a bad habit widely spread and socially accepted. Many people start smoking during their gymnasium period. The discovery of the dangers of smoking gave a warning sign of danger for individuals. There are different statistical methods used to analyze the dangers of smoking. In this study, we apply an algebraic statistical method to analyze and classify real data using Markov basis for the independent model on the contingency table. Results show that the Markov basis based classification is able to distinguish different date elements. Moreover, we check our proposed method via information theory by utilizing the Shannon formula to illustrate which one of these alternative tables is the best in term of independent.
NASA Astrophysics Data System (ADS)
Hendrikse, Anne; Veldhuis, Raymond; Spreeuwers, Luuk
2013-12-01
Second-order statistics play an important role in data modeling. Nowadays, there is a tendency toward measuring more signals with higher resolution (e.g., high-resolution video), causing a rapid increase of dimensionality of the measured samples, while the number of samples remains more or less the same. As a result the eigenvalue estimates are significantly biased as described by the Marčenko Pastur equation for the limit of both the number of samples and their dimensionality going to infinity. By introducing a smoothness factor, we show that the Marčenko Pastur equation can be used in practical situations where both the number of samples and their dimensionality remain finite. Based on this result we derive methods, one already known and one new to our knowledge, to estimate the sample eigenvalues when the population eigenvalues are known. However, usually the sample eigenvalues are known and the population eigenvalues are required. We therefore applied one of the these methods in a feedback loop, resulting in an eigenvalue bias correction method. We compare this eigenvalue correction method with the state-of-the-art methods and show that our method outperforms other methods particularly in real-life situations often encountered in biometrics: underdetermined configurations, high-dimensional configurations, and configurations where the eigenvalues are exponentially distributed.
Endogenous control and task representation: an fMRI study in algebraic problem-solving.
Stocco, Andrea; Anderson, John R
2008-07-01
The roles of prefrontal and anterior cingulate cortices have been widely studied, yet little is known on how they interact to enable complex cognitive abilities. We investigated this issue in a complex yet well-defined symbolic paradigm: algebraic problem solving. In our experimental problems, the demands for retrieving arithmetic facts and maintaining intermediate problem representations were manipulated separately. An analysis of functional brain images acquired while participants were solving the problems confirmed that prefrontal regions were affected by the retrieval of arithmetic facts, but only scarcely by the need to manipulate intermediate forms of the equations, hinting at a specific role in memory retrieval. Hemodynamic activity in the dorsal cingulate, on the contrary, increased monotonically as more information processing steps had to be taken, independent of their nature. This pattern was essentially mimicked in the caudate nucleus, suggesting a related functional role in the control of cognitive actions. We also implemented a computational model within the Adaptive Control of Thought-Rational (ACT-R) cognitive architecture, which was able to reproduce both the behavioral data and the time course of the hemodynamic activity in a number of relevant regions of interest. Therefore, imaging results and computer simulation provide evidence that symbolic cognition can be explained by the functional interaction of medial structures supporting control and serial execution, and prefrontal cortices engaged in the on-line retrieval of specific relevant information. PMID:18284348
LAPACK: Linear algebra software for supercomputers
Bischof, C.H.
1991-01-01
This paper presents an overview of the LAPACK library, a portable, public-domain library to solve the most common linear algebra problems. This library provides a uniformly designed set of subroutines for solving systems of simultaneous linear equations, least-squares problems, and eigenvalue problems for dense and banded matrices. We elaborate on the design methodologies incorporated to make the LAPACK codes efficient on today's high-performance architectures. In particular, we discuss the use of block algorithms and the reliance on the Basic Linear Algebra Subprograms. We present performance results that show the suitability of the LAPACK approach for vector uniprocessors and shared-memory multiprocessors. We also address some issues that have to be dealt with in tuning LAPACK for specific architectures. Lastly, we present results that show that the LAPACK software can be adapted with little effort to distributed-memory environments, and we discuss future efforts resulting from this project. 31 refs., 10 figs., 2 tabs.
SO(4) algebraic approach to the three-body bound state problem in two dimensions
NASA Astrophysics Data System (ADS)
Dmitrašinović, V.; Salom, Igor
2014-08-01
We use the permutation symmetric hyperspherical three-body variables to cast the non-relativistic three-body Schrödinger equation in two dimensions into a set of (possibly decoupled) differential equations that define an eigenvalue problem for the hyper-radial wave function depending on an SO(4) hyper-angular matrix element. We express this hyper-angular matrix element in terms of SO(3) group Clebsch-Gordan coefficients and use the latter's properties to derive selection rules for potentials with different dynamical/permutation symmetries. Three-body potentials acting on three identical particles may have different dynamical symmetries, in order of increasing symmetry, as follows: (1) S3 ⊗ OL(2), the permutation times rotational symmetry, that holds in sums of pairwise potentials, (2) O(2) ⊗ OL(2), the so-called "kinematic rotations" or "democracy symmetry" times rotational symmetry, that holds in area-dependent potentials, and (3) O(4) dynamical hyper-angular symmetry, that holds in hyper-radial three-body potentials. We show how the different residual dynamical symmetries of the non-relativistic three-body Hamiltonian lead to different degeneracies of certain states within O(4) multiplets.
Trade-Offs between Grounded and Abstract Representations: Evidence from Algebra Problem Solving
ERIC Educational Resources Information Center
Koedinger, Kenneth R.; Alibali, Martha W.; Nathan, Mitchell J.
2008-01-01
This article explores the complementary strengths and weaknesses of grounded and abstract representations in the domain of early algebra. Abstract representations, such as algebraic symbols, are concise and easy to manipulate but are distanced from any physical referents. Grounded representations, such as verbal descriptions of situations, are…
ERIC Educational Resources Information Center
Booth, Julie L.; Lange, Karin E.; Koedinger, Kenneth R.; Newton, Kristie J.
2013-01-01
In a series of two in vivo experiments, we examine whether correct and incorrect examples with prompts for self-explanation can be effective for improving students' conceptual understanding and procedural skill in Algebra when combined with guided practice. In Experiment 1, students working with the Algebra I Cognitive Tutor were randomly assigned…
ERIC Educational Resources Information Center
Booth, Julie L.; Lange, Karin E.; Koedinger, Kenneth R.; Newton, Kristie J.
2013-01-01
In a series of two "in vivo" experiments, we examine whether correct and incorrect examples with prompts for self-explanation can be effective for improving students' conceptual understanding and procedural skill in Algebra when combined with guided practice. In Experiment 1, students working with the Algebra I Cognitive Tutor were randomly…
ERIC Educational Resources Information Center
Green, Jan
2009-01-01
In recent years, the learning of algebra by all students has become a significant national priority (Moses & Cobb, 2001; National Council of Teachers of Mathematics, 2000). Algebra is considered to be a foundational topic in mathematics (Usiskin, 1988) and some have argued that an understanding of algebra is fundamental to success in today's…
Acceleration of multiple solution of a boundary value problem involving a linear algebraic system
NASA Astrophysics Data System (ADS)
Gazizov, Talgat R.; Kuksenko, Sergey P.; Surovtsev, Roman S.
2016-06-01
Multiple solution of a boundary value problem that involves a linear algebraic system is considered. New approach to acceleration of the solution is proposed. The approach uses the structure of the linear system matrix. Particularly, location of entries in the right columns and low rows of the matrix, which undergo variation due to the computing in the range of parameters, is used to apply block LU decomposition. Application of the approach is considered on the example of multiple computing of the capacitance matrix by method of moments used in numerical electromagnetics. Expressions for analytic estimation of the acceleration are presented. Results of the numerical experiments for solution of 100 linear systems with matrix orders of 1000, 2000, 3000 and different relations of variated and constant entries of the matrix show that block LU decomposition can be effective for multiple solution of linear systems. The speed up compared to pointwise LU factorization increases (up to 15) for larger number and order of considered systems with lower number of variated entries.
Algebraic approximations for transcendental equations with applications in nanophysics
NASA Astrophysics Data System (ADS)
Barsan, Victor
2015-09-01
Using algebraic approximations of trigonometric or hyperbolic functions, a class of transcendental equations can be transformed in tractable, algebraic equations. Studying transcendental equations this way gives the eigenvalues of Sturm-Liouville problems associated to wave equation, mainly to Schroedinger equation; these algebraic approximations provide approximate analytical expressions for the energy of electrons and phonons in quantum wells, quantum dots (QDs) and quantum wires, in the frame of one-particle models of such systems. The advantage of this approach, compared to the numerical calculations, is that the final result preserves the functional dependence on the physical parameters of the problem. The errors of this method, situated between some few percentages and ?, are carefully analysed. Several applications, for quantum wells, QDs and quantum wires, are presented.
Ellouz, Hanen; Feki, Ines; Jeribi, Aref
2013-11-15
In the present paper, we prove that the family of exponentials associated to the eigenvalues of the perturbed operator T(ε) ≔ T{sub 0} + εT{sub 1} + ε{sup 2}T{sub 2} + … + ε{sup k}T{sub k} + … forms a Riesz basis in L{sup 2}(0, T), T > 0, where ε∈C, T{sub 0} is a closed densely defined linear operator on a separable Hilbert space H with domain D(T{sub 0}) having isolated eigenvalues with multiplicity one, while T{sub 1}, T{sub 2}, … are linear operators on H having the same domain D⊃D(T{sub 0}) and satisfying a specific growing inequality. After that, we generalize this result using a H-Lipschitz function. As application, we consider a non-selfadjoint problem deduced from a perturbation method for sound radiation.
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.
A Problem-Centered Approach to Canonical Matrix Forms
ERIC Educational Resources Information Center
Sylvestre, Jeremy
2014-01-01
This article outlines a problem-centered approach to the topic of canonical matrix forms in a second linear algebra course. In this approach, abstract theory, including such topics as eigenvalues, generalized eigenspaces, invariant subspaces, independent subspaces, nilpotency, and cyclic spaces, is developed in response to the patterns discovered…
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.
Algebra and Problem-Solving in Down Syndrome: A Study with 15 Teenagers
ERIC Educational Resources Information Center
Martinez, Elisabetta Monari; Pellegrini, Katia
2010-01-01
There is a common opinion that mathematics is difficult for persons with Down syndrome, because of a weakness in numeracy and in abstract thinking. Since 1996, some single case studies have suggested that new opportunities in mathematics are possible for these students: some of them learned algebra and also learned to use equations in…
Strategies Used by Second-Year Algebra Students to Solve Problems
ERIC Educational Resources Information Center
Senk, Sharon L.; Thompson, Denisse R.
2006-01-01
This Brief Report describes a secondary analysis of the solutions written by 306 second-year algebra students to four constructed-response items representative of content at this level. The type of solution (symbolic, graphical, or numerical) used most frequently varied by item. Curriculum effects were observed. Students studying from the second…
Zhuk, Sergiy
2013-10-15
In this paper we present Kalman duality principle for a class of linear Differential-Algebraic Equations (DAE) with arbitrary index and time-varying coefficients. We apply it to an ill-posed minimax control problem with DAE constraint and derive a corresponding dual control problem. It turns out that the dual problem is ill-posed as well and so classical optimality conditions are not applicable in the general case. We construct a minimizing sequence u-circumflex{sub {epsilon}} for the dual problem applying Tikhonov method. Finally we represent u-circumflex{sub {epsilon}} in the feedback form using Riccati equation on a subspace which corresponds to the differential part of the DAE.
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.
A vector-multiplication dominated parallel algorithm for the computation of real eigenvalue spectra
NASA Astrophysics Data System (ADS)
Clint, M.
1982-06-01
In order to exploit effectively the power of array and vector processors for the numerical solution of linear algebraic problems it is desirable to express algorithms principally in terms of vector and matrix operations. Algorithms which manipulate vectors and matrices at component level are best suited for execution on single processor hardware. Often, however, it is difficult, if not impossible, to construct efficient versions of such algorithms which are suitable foe execution on parallwl hardware. A method for computing the eigenvalues of real unsymmetric matrices with real eigenvalue spectra is presented. The method is an extension of the one described in ref. [1]. The algorithm makes heavy use of vector inner product evaluations. The manipulation of individual components of vectors and matrices is kept to a minimum. Essentially, the method involves the construction of a sequence of biorthogonal transformation matrices the combined effect of which is to diagonalise the matrix. The eigenvalues of the matrix are diagonal elements of the final diagonalised form. If the eigenvectors of the matrix are also required the algorithm may be extended in a straightforward way. The effectiveness of the algorithm is demonstrated by an application of sequential version to several small matrices and some comments are made about the time complexity of the parallel version.
Computational method for transmission eigenvalues for a spherically stratified medium.
Cheng, Xiaoliang; Yang, Jing
2015-07-01
We consider a computational method for the interior transmission eigenvalue problem that arises in acoustic and electromagnetic scattering. The transmission eigenvalues contain useful information about some physical properties, such as the index of refraction. Instead of the existence and estimation of the spectral property of the transmission eigenvalues, we focus on the numerical calculation, especially for spherically stratified media in R^{3}. Due to the nonlinearity and the special structure of the interior transmission eigenvalue problem, there are not many numerical methods to date. First, we reduce the problem into a second-order ordinary differential equation. Then, we apply the Hermite finite element to the weak formulation of the equation. With proper rewriting of the matrix-vector form, we change the original nonlinear eigenvalue problem into a quadratic eigenvalue problem, which can be written as a linear system and solved by the eigs function in MATLAB. This numerical method is fast, effective, and can calculate as many transmission eigenvalues as needed at a time. PMID:26367151
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.
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…
Asymptotic formula for eigenvalues of one dimensional Dirac system
NASA Astrophysics Data System (ADS)
Ulusoy, Ismail; Penahlı, Etibar
2016-06-01
In this paper, we study the spectral problem for one dimensional Dirac system with Dirichlet boundary conditions. By using Counting lemma, we give an asymptotic formulas of eigenvalues of Dirac system.
A robust multilevel simultaneous eigenvalue solver
NASA Technical Reports Server (NTRS)
Costiner, Sorin; Taasan, Shlomo
1993-01-01
Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.
A Comparison of Two Mathematics Problem-Solving Strategies: Facilitate Algebra-Readiness
ERIC Educational Resources Information Center
Xin, Yan Ping; Zhang, Dake; Park, Joo Young; Tom, Kinsey; Whipple, Amanda; Si, Luo
2011-01-01
The authors compared a conceptual model-based problem-solving (COMPS) approach with a general heuristic instructional approach for teaching multiplication-division word-problem solving to elementary students with learning problems (LP). The results indicate that only the COMPS group significantly improved, from pretests to posttests, their…
ERIC Educational Resources Information Center
Ngu, Bing Hiong; Yeung, Alexander Seeshing
2013-01-01
Text editing directs students' attention to the problem structure as they classify whether the texts of word problems contain sufficient, missing or irrelevant information for working out a solution. Equation worked examples emphasize the formation of a coherent problem structure to generate a solution. Its focus is on the construction of three…
Facilitating Case Reuse during Problem Solving in Algebra-Based Physics
ERIC Educational Resources Information Center
Mateycik, Frances Ann
2010-01-01
This research project investigates students' development of problem solving schemata while using strategies that facilitate the process of using solved examples to assist with a new problem (case reuse). Focus group learning interviews were used to explore students' perceptions and understanding of several problem solving strategies. Individual…
ERIC Educational Resources Information Center
Matthews, Paul G.; Atkinson, Richard C.
This paper reports an experiment designed to test theoretical relations among fast problem solving, more complex and slower problem solving, and research concerning fundamental memory processes. Using a cathode ray tube, subjects were presented with propositions of the form "Y is in list X" which they memorized. In later testing they were asked to…
ERIC Educational Resources Information Center
Ling, Gan We; Ghazali, Munirah
2007-01-01
This descriptive study was aimed at looking into how Primary 5 pupils solve pre-algebra problems concerning patterns and unknown quantities. Specifically, objectives of this study were to describe Primary 5 pupils' solution strategies, modes of representations and justifications in: (a) discovering, describing and using numerical and geometrical…
ERIC Educational Resources Information Center
Chazan, Daniel; Sela, Hagit; Herbst, Patricio
2012-01-01
We illustrate a method, which is modeled on "breaching experiments," for studying tacit norms that govern classroom interaction around particular mathematical content. Specifically, this study explores norms that govern teachers' expectations for the doing of word problems in school algebra. Teacher study groups discussed representations of…
Thinking and Writing Mathematically: "Achilles and the Tortoise" as an Algebraic Word Problem.
ERIC Educational Resources Information Center
Martinez, Joseph G. R.
2001-01-01
Introduces Hogben's adaptation of Zeno's paradox, "Achilles and the Tortoise", as a thinking and writing exercise. Emphasizes engaging students' imagination with creative, thought-provoking problems and involving students in evaluating their word problem-solving strategies. Describes the paradox, logical solutions, and students' mathematical…
ERIC Educational Resources Information Center
González-Calero, José Antonio; Arnau, David; Puig, Luis; Arevalillo-Herráez, Miguel
2015-01-01
The term intensive scaffolding refers to any set of conceptual scaffolding strategies that always allow the user to find the solution to a problem. Despite the many benefits of scaffolding, some negative effects have also been reported. These are mainly related to the possibility that a student solves the problems without actually engaging in…
Maximizing algebraic connectivity in interconnected networks
NASA Astrophysics Data System (ADS)
Shakeri, Heman; Albin, Nathan; Darabi Sahneh, Faryad; Poggi-Corradini, Pietro; Scoglio, Caterina
2016-03-01
Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one interlayer links under budget constraint. We show that for the special multiplex configurations with identical layers, the uniform weight distribution is always optimal. On the other hand, when the two layers are arbitrary, increasing the budget reveals the existence of two different regimes. Up to a certain threshold budget, the second eigenvalue of the supra-Laplacian is simple, the optimal weight distribution is uniform, and the Fiedler vector is constant on each layer. Increasing the budget past the threshold, the optimal weight distribution can be nonuniform. The interesting consequence of this result is that there is no need to solve the optimization problem when the available budget is less than the threshold, which can be easily found analytically.
Maximizing algebraic connectivity in interconnected networks.
Shakeri, Heman; Albin, Nathan; Darabi Sahneh, Faryad; Poggi-Corradini, Pietro; Scoglio, Caterina
2016-03-01
Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one interlayer links under budget constraint. We show that for the special multiplex configurations with identical layers, the uniform weight distribution is always optimal. On the other hand, when the two layers are arbitrary, increasing the budget reveals the existence of two different regimes. Up to a certain threshold budget, the second eigenvalue of the supra-Laplacian is simple, the optimal weight distribution is uniform, and the Fiedler vector is constant on each layer. Increasing the budget past the threshold, the optimal weight distribution can be nonuniform. The interesting consequence of this result is that there is no need to solve the optimization problem when the available budget is less than the threshold, which can be easily found analytically. PMID:27078276
Facilitating case reuse during problem solving in algebra-based physics
NASA Astrophysics Data System (ADS)
Mateycik, Frances Ann
This research project investigates students' development of problem solving schemata while using strategies that facilitate the process of using solved examples to assist with a new problem (case reuse). Focus group learning interviews were used to explore students' perceptions and understanding of several problem solving strategies. Individual clinical interviews were conducted and quantitative examination data were collected to assess students' conceptual understanding, knowledge organization, and problem solving performance on a variety of problem tasks. The study began with a short one-time treatment of two independent, research-based strategies chosen to facilitate case reuse. Exploration of students' perceptions and use of the strategies lead investigators to select one of the two strategies to be implemented over a full semester of focus group interviews. The strategy chosen was structure mapping. Structure maps are defined as visual representations of quantities and their associations. They were created by experts to model the appropriate mental organization of knowledge elements for a given physical concept. Students were asked to use these maps as they were comfortable while problem solving. Data obtained from this phase of our study (Phase I) offered no evidence of improved problem solving schema. The 11 contact hour study was barely sufficient time for students to become comfortable using the maps. A set of simpler strategies were selected for their more explicit facilitation of analogical reasoning, and were used together during two more semester long focus group treatments (Phase II and Phase III of this study). These strategies included the use of a step-by-step process aimed at reducing cognitive load associated with mathematical procedure, direct reflection of principles involved in a given set of problems, and the direct comparison of problem pairs designed to be void of surface similarities (similar objects or object orientations) and sharing
NASA Astrophysics Data System (ADS)
Dargys, A.
2015-02-01
Properties of spin and pseudospin in monolayer graphene are investigated in terms of geometric algebra (GA). Specifically, Cl 3,1 algebra that describes Minkowski relativistic spacetime is used for this purpose. Influence of exchange and spin-orbit (SO) interactions on spin and pseudospin are discussed in detail. It is shown how the eigenvalue problem can be depicted by GA rotors in 3D Euclidean space and solved geometrically. In this first part, the connection between Cl 3,1 algebra and the Hilbert space formulation is established and spin/pseudospin properties in the presence of either exchange or SO interaction are studied. In the second part (2015 Phys. Scr. 90 025808) the effect of simultaneous action of both SO and exchange interactions on spin, pseudospin and Berry phase will be considered within the framework of GA.
Graphic and algebraic solutions of the discordant lead-uranium age problem
Stieff, L.R.; Stern, T.W.
1961-01-01
for the contaminating common Pb206 and Pb207. The linear relationships noted in this graphical procedure have been extended to plots of the mole ratios of total Pb206 U238 ( tN206 N238) vs. total Pb207 U235 ( tN207 N235). This modification permits the calculation of concordant ages for unaltered samples using only the Pb207 Pb206 ratio of the contaminating common lead. If isotopic data are available for two samples of the same age, x and y, from the same or related deposits or outcrops, graphs of the normalized difference ratios [ ( N206 N204)x - ( N206 N204)y ( N238 N204)x -( N238 N204)y] vs. [ ( N207 N204)x - ( N207 N204)y ( N235 N204)x -( N235 N204)y] can give concordant ages corrected for unknown amounts of a common lead with an unknown Pb207/ Pb206 ratio. (If thorium is absent the difference ratios may be normalized with the more abundant index isotope, Pb208.) Similar plots of tho normalized, difference ratios for three genetically related samples (x - y) and(x - z), will give concordant ages corrected, in addition, for either one unknown period of past alteration or initial contamination by an older generation of radiogenic lead of unknown Pb207/Pb206 ratio. Practical numerical solutions for many of tho concordant age calculations are not currently available. However, the algebraic equivalents of these new graphical methods give equations which may be programmed for computing machines. For geologically probable parameters the equations of higher order have two positive real roots that rapidly converge on the exact concordant ages corrected for original radiogenic lead and for loss or gain of lead or uranium. Modifications of these general age equations expanded only to the second degree have been derived for use with desk calculators. These graphical and algebraic methods clearly suggest both the type and minimum number of samples necessary for adequate mathematical analysis of discordant lead isotope age data. This mathematical treatment also makes it clear t
Generalized Eigenvalues for pairs on heritian matrices
NASA Technical Reports Server (NTRS)
Rublein, George
1988-01-01
A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.
Using Dynamic Geometry and Computer Algebra Systems in Problem Based Courses for Future Engineers
ERIC Educational Resources Information Center
Tomiczková, Svetlana; Lávicka, Miroslav
2015-01-01
It is a modern trend today when formulating the curriculum of a geometric course at the technical universities to start from a real-life problem originated in technical praxis and subsequently to define which geometric theories and which skills are necessary for its solving. Nowadays, interactive and dynamic geometry software plays a more and more…
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.
Danker, Jared F; Anderson, John R
2007-04-15
In naturalistic algebra problem solving, the cognitive processes of representation and retrieval are typically confounded, in that transformations of the equations typically require retrieval of mathematical facts. Previous work using cognitive modeling has associated activity in the prefrontal cortex with the retrieval demands of algebra problems and activity in the posterior parietal cortex with the transformational demands of algebra problems, but these regions tend to behave similarly in response to task manipulations (Anderson, J.R., Qin, Y., Sohn, M.-H., Stenger, V.A., Carter, C.S., 2003. An information-processing model of the BOLD response in symbol manipulation tasks. Psychon. Bull. Rev. 10, 241-261; Qin, Y., Carter, C.S., Silk, E.M., Stenger, A., Fissell, K., Goode, A., Anderson, J.R., 2004. The change of brain activation patterns as children learn algebra equation solving. Proc. Natl. Acad. Sci. 101, 5686-5691). With this study we attempt to isolate activity in these two regions by using a multi-step algebra task in which transformation (parietal) is manipulated in the first step and retrieval (prefrontal) is manipulated in the second step. Counter to our initial predictions, both brain regions were differentially active during both steps. We designed two cognitive models, one encompassing our initial assumptions and one in which both processes were engaged during both steps. The first model provided a poor fit to the behavioral and neural data, while the second model fit both well. This simultaneously emphasizes the strong relationship between retrieval and representation in mathematical reasoning and demonstrates that cognitive modeling can serve as a useful tool for understanding task manipulations in neuroimaging experiments. PMID:17355908
Danker, Jared F; Anderson, John R
2007-04-15
In naturalistic algebra problem solving, the cognitive processes of representation and retrieval are typically confounded, in that transformations of the equations typically require retrieval of mathematical facts. Previous work using cognitive modeling has associated activity in the prefrontal cortex with the retrieval demands of algebra problems and activity in the posterior parietal cortex with the transformational demands of algebra problems, but these regions tend to behave similarly in response to task manipulations (Anderson, J.R., Qin, Y., Sohn, M.-H., Stenger, V.A., Carter, C.S., 2003. An information-processing model of the BOLD response in symbol manipulation tasks. Psychon. Bull. Rev. 10, 241-261; Qin, Y., Carter, C.S., Silk, E.M., Stenger, A., Fissell, K., Goode, A., Anderson, J.R., 2004. The change of brain activation patterns as children learn algebra equation solving. Proc. Natl. Acad. Sci. 101, 5686-5691). With this study we attempt to isolate activity in these two regions by using a multi-step algebra task in which transformation (parietal) is manipulated in the first step and retrieval (prefrontal) is manipulated in the second step. Counter to our initial predictions, both brain regions were differentially active during both steps. We designed two cognitive models, one encompassing our initial assumptions and one in which both processes were engaged during both steps. The first model provided a poor fit to the behavioral and neural data, while the second model fit both well. This simultaneously emphasizes the strong relationship between retrieval and representation in mathematical reasoning and demonstrates that cognitive modeling can serve as a useful tool for understanding task manipulations in neuroimaging experiments.
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
ERIC Educational Resources Information Center
Schmidt, Sylvine; Bednarz, Nadine
1997-01-01
Discusses the difficulties observed in the transition from teaching arithmetic to teaching algebra. Future teachers (n=164) were questioned regarding to what extent they were able to shift back and forth between teaching methods within the context of problem solving. Interviews were conducted individually and in a dyad format. (AIM)
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)
NASA Astrophysics Data System (ADS)
Connes, Alain; Kreimer, Dirk
This paper gives a complete selfcontained proof of our result announced in [6] showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on the Riemann-Hilbert problem. We shall first show that for any quantum field theory, the combinatorics of Feynman graphs gives rise to a Hopf algebra which is commutative as an algebra. It is the dual Hopf algebra of the enveloping algebra of a Lie algebra whose basis is labelled by the one particle irreducible Feynman graphs. The Lie bracket of two such graphs is computed from insertions of one graph in the other and vice versa. The corresponding Lie group G is the group of characters of . We shall then show that, using dimensional regularization, the bare (unrenormalized) theory gives rise to a loop
Krylov subspace iteration for eigenvalue response matrix calculations
Roberts, J. A.; Forget, B.
2012-07-01
Recent work has revisited the eigenvalue response matrix method as an approach for reactor core analyses. In its most straightforward form, the method consists of a two-level Eigen problem. An outer Picard iteration updates the k-eigenvalue, while the inner Eigen problem imposes current continuity between coarse meshes. In this paper, several Eigen solvers are evaluated for this inner problem, using several 2-D diffusion benchmarks as test cases. The results indicate both the explicitly-restarted Arnoldi and the Krylov-Schur methods are up to an order of magnitude more efficient than power iteration. This increased efficiency makes the nested eigenvalue formulation more effective than the ILU-preconditioned Newton-Krylov formulation previously studied. (authors)
On the eigenvalues of a "dumb-bell with a thin handle"
NASA Astrophysics Data System (ADS)
Gadyl'shin, R. R.
2005-04-01
We consider the Neumann boundary-value problem of finding the small-parameter asymptotics of the eigenvalues and eigenfunctions for the Laplace operator in a singularly perturbed domain consisting of two bounded domains joined by a thin "handle". The small parameter is the diameter of the cross-section of the handle. We show that as the small parameter tends to zero these eigenvalues converge either to the eigenvalues corresponding to the domains joined or to the eigenvalues of the Dirichlet problem for the Sturm-Liouville operator on the segment to which the thin handle contracts. The main results of this paper are the complete power small-parameter asymptotics of the eigenvalues and the corresponding eigenfunctions and explicit formulae for the first terms of the asymptotics. We consider critical cases generated by the choice of the place where the thin "handle" is joined to the domains, as well as by the multiplicity of the eigenvalues corresponding to the domains joined.
Lehoucq, Richard B.; Salinger, Andrew G.
1999-08-01
We present an approach for determining the linear stability of steady states of PDEs on massively parallel computers. Linearizing the transient behavior around a steady state leads to a generalized eigenvalue problem. The eigenvalues with largest real part are calculated using Arnoldi's iteration driven by a novel implementation of the Cayley transformation to recast the problem as an ordinary eigenvalue problem. The Cayley transformation requires the solution of a linear system at each Arnoldi iteration, which must be done iteratively for the algorithm to scale with problem size. A representative model problem of 3D incompressible flow and heat transfer in a rotating disk reactor is used to analyze the effect of algorithmic parameters on the performance of the eigenvalue algorithm. Successful calculations of leading eigenvalues for matrix systems of order up to 4 million were performed, identifying the critical Grashof number for a Hopf bifurcation.
ERIC Educational Resources Information Center
Lee, Kerry; Ng, Swee Fong; Bull, Rebecca; Pe, Madeline Lee; Ho, Ringo Ho Moon
2011-01-01
Although mathematical pattern tasks are often found in elementary school curricula and are deemed a building block for algebra, a recent report (National Mathematics Advisory Panel, 2008) suggests the resources devoted to its teaching and assessment need to be rebalanced. We examined whether children's developing proficiency in solving algebraic…
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
Bramble, J.H.; Knyazev, A.V.; Pasciak, J.E.
1996-12-31
We consider the problem of computing a modest number of the smallest eigenvalues along with orthogonal bases for the corresponding eigen-spaces of a symmetric positive definite matrix. In our applications, the dimension of a matrix is large and the cost of its inverting is prohibitive. In this paper, we shall develop an effective parallelizable technique for computing these eigenvalues and eigenvectors utilizing subspace iteration and preconditioning. Estimates will be provided which show that the preconditioned method converges linearly and uniformly in the matrix dimension when used with a uniform preconditioner under the assumption that the approximating subspace is close enough to the span of desired eigenvectors.
New algorithms for the symmetric tridiagonal eigenvalue computation
Pan, V. |
1994-12-31
The author presents new algorithms that accelerate the bisection method for the symmetric eigenvalue problem. The algorithms rely on some new techniques, which include acceleration of Newton`s iteration and can also be further applied to acceleration of some other iterative processes, in particular, of iterative algorithms for approximating polynomial zeros.
NASA Astrophysics Data System (ADS)
Nara, T.; Koiwa, K.; Takagi, S.; Oyama, D.; Uehara, G.
2014-05-01
This paper presents an algebraic reconstruction method for dipole-quadrupole sources using magnetoencephalography data. Compared to the conventional methods with the equivalent current dipoles source model, our method can more accurately reconstruct two close, oppositely directed sources. Numerical simulations show that two sources on both sides of the longitudinal fissure of cerebrum are stably estimated. The method is verified using a quadrupolar source phantom, which is composed of two isosceles-triangle-coils with parallel bases.
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.…
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.
Calculating alpha Eigenvalues in a Continuous-Energy Infinite Medium with Monte Carlo
Betzler, Benjamin R.; Kiedrowski, Brian C.; Brown, Forrest B.; Martin, William R.
2012-09-04
The {alpha} eigenvalue has implications for time-dependent problems where the system is sub- or supercritical. We present methods and results from calculating the {alpha}-eigenvalue spectrum for a continuous-energy infinite medium with a simplified Monte Carlo transport code. We formulate the {alpha}-eigenvalue problem, detail the Monte Carlo code physics, and provide verification and results. We have a method for calculating the {alpha}-eigenvalue spectrum in a continuous-energy infinite-medium. The continuous-time Markov process described by the transition rate matrix provides a way of obtaining the {alpha}-eigenvalue spectrum and kinetic modes. These are useful for the approximation of the time dependence of the system.
Multi-input partial eigenvalue assignment for high order control systems with time delay
NASA Astrophysics Data System (ADS)
Zhang, Lei
2016-05-01
In this paper, we consider the partial eigenvalue assignment problem for high order control systems with time delay. Ram et al. (2011) [1] have shown that a hybrid method can be used to solve partial quadratic eigenvalue assignment problem of single-input vibratory system. Based on this theory, a rather simple algorithm for solving multi-input partial eigenvalue assignment for high order control systems with time delay is proposed. Our method can assign the expected eigenvalues and keep the no spillover property. The solution can be implemented with only partial information of the eigenvalues and the corresponding eigenvectors of the matrix polynomial. Numerical examples are given to illustrate the efficiency of our approach.
Perfetti, C.; Martin, W.; Rearden, B.; Williams, M.
2012-07-01
This study introduced two new approaches for calculating the F*(r) importance weighting function for Contributon and CLUTCH eigenvalue sensitivity coefficient calculations, and compared them in terms of accuracy and applicability. The necessary levels of F*(r) mesh refinement and mesh convergence for obtaining accurate eigenvalue sensitivity coefficients were determined for two preliminary problems through two parametric studies, and the results of these studies suggest that a sufficiently accurate F*(r) mesh for calculating eigenvalue sensitivity coefficients can be obtained for these problems with only a small increase in problem runtime. (authors)
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…
Preconditioned iterations to calculate extreme eigenvalues
Brand, C.W.; Petrova, S.
1994-12-31
Common iterative algorithms to calculate a few extreme eigenvalues of a large, sparse matrix are Lanczos methods or power iterations. They converge at a rate proportional to the separation of the extreme eigenvalues from the rest of the spectrum. Appropriate preconditioning improves the separation of the eigenvalues. Davidson`s method and its generalizations exploit this fact. The authors examine a preconditioned iteration that resembles a truncated version of Davidson`s method with a different preconditioning strategy.
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.
An algebraic sub-structuring method for large-scale eigenvaluecalculation
Yang, C.; Gao, W.; Bai, Z.; Li, X.; Lee, L.; Husbands, P.; Ng, E.
2004-05-26
We examine sub-structuring methods for solving large-scalegeneralized eigenvalue problems from a purely algebraic point of view. Weuse the term "algebraic sub-structuring" to refer to the process ofapplying matrix reordering and partitioning algorithms to divide a largesparse matrix into smaller submatrices from which a subset of spectralcomponents are extracted and combined to provide approximate solutions tothe original problem. We are interested in the question of which spectralcomponentsone should extract from each sub-structure in order to producean approximate solution to the original problem with a desired level ofaccuracy. Error estimate for the approximation to the small esteigen pairis developed. The estimate leads to a simple heuristic for choosingspectral components (modes) from each sub-structure. The effectiveness ofsuch a heuristic is demonstrated with numerical examples. We show thatalgebraic sub-structuring can be effectively used to solve a generalizedeigenvalue problem arising from the simulation of an acceleratorstructure. One interesting characteristic of this application is that thestiffness matrix produced by a hierarchical vector finite elements schemecontains a null space of large dimension. We present an efficient schemeto deflate this null space in the algebraic sub-structuringprocess.
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)
Algebraic Bethe ansatz for the Temperley-Lieb spin-1 chain
NASA Astrophysics Data System (ADS)
Nepomechie, Rafael I.; Pimenta, Rodrigo A.
2016-09-01
We use the algebraic Bethe ansatz to obtain the eigenvalues and eigenvectors of the spin-1 Temperley-Lieb open quantum chain with "free" boundary conditions. We exploit the associated reflection algebra in order to prove the off-shell equation satisfied by the Bethe vectors.
A comparison of matrix methods for calculating eigenvalues in acoustically lined ducts
NASA Technical Reports Server (NTRS)
Watson, W.; Lansing, D. L.
1976-01-01
Three approximate methods - finite differences, weighted residuals, and finite elements - were used to solve the eigenvalue problem which arises in finding the acoustic modes and propagation constants in an absorptively lined two-dimensional duct without airflow. The matrix equations derived for each of these methods were solved for the eigenvalues corresponding to various values of wall impedance. Two matrix orders, 20 x 20 and 40 x 40, were used. The cases considered included values of wall admittance for which exact eigenvalues were known and for which several nearly equal roots were present. Ten of the lower order eigenvalues obtained from the three approximate methods were compared with solutions calculated from the exact characteristic equation in order to make an assessment of the relative accuracy and reliability of the three methods. The best results were given by the finite element method using a cubic polynomial. Excellent accuracy was consistently obtained, even for nearly equal eigenvalues, by using a 20 x 20 order matrix.
Stratified source-sampling techniques for Monte Carlo eigenvalue analysis.
Mohamed, A.
1998-07-10
In 1995, at a conference on criticality safety, a special session was devoted to the Monte Carlo ''Eigenvalue of the World'' problem. Argonne presented a paper, at that session, in which the anomalies originally observed in that problem were reproduced in a much simplified model-problem configuration, and removed by a version of stratified source-sampling. In this paper, stratified source-sampling techniques are generalized and applied to three different Eigenvalue of the World configurations which take into account real-world statistical noise sources not included in the model problem, but which differ in the amount of neutronic coupling among the constituents of each configuration. It is concluded that, in Monte Carlo eigenvalue analysis of loosely-coupled arrays, the use of stratified source-sampling reduces the probability of encountering an anomalous result over that if conventional source-sampling methods are used. However, this gain in reliability is substantially less than that observed in the model-problem results.
Kinetic applications of the ArbiTER eigenvalue code
NASA Astrophysics Data System (ADS)
Baver, D. A.; Myra, J. R.; Umansky, M. V.
2014-10-01
ArbiTER is a flexible eigenvalue code designed for linear fluid or kinetic plasma models is various dimensionalities and topologies. This flexibility derives from the use of specialized equation and topology parsers, which permit run-time specification of a particular linearized physics model, geometry, and grid connectivity, which in turn determine how a particular equation set will be discretized. The resulting matrix form of the problem is then solved using the SLEPc eigensolver package, and can be solved either as a generalized eigenvalue problem, or as a matrix solve in the case of source-driven problems. While the ArbiTER code and its predecessor 2DX have demonstrated significant utility in tokamak edge fluid problems due to their inherent flexibility, the primary aim of its development is to solve kinetic eigenvalue problems. To address this goal, we present first results from implementation of a gyrokinetic model in slab geometry. These results are compared to known solutions for limiting cases. Work supported by the U.S. DOE grant DE-SC0006562.
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.
Matrix methods for bare resonator eigenvalue analysis.
Latham, W P; Dente, G C
1980-05-15
Bare resonator eigenvalues have traditionally been calculated using Fox and Li iterative techniques or the Prony method presented by Siegman and Miller. A theoretical framework for bare resonator eigenvalue analysis is presented. Several new methods are given and compared with the Prony method.
Conformal symmetry algebra of the quark potential and degeneracies in the hadron spectra
NASA Astrophysics Data System (ADS)
Kirchbach, M.
2012-10-01
The essence of the potential algebra concept [Y. Alhassid, F. Gürsey, F. Yachello. Phys. Rev. Lett. 50 (1983)] is that quantum mechanical free motions of scalar particles on curved surfaces of given isometry algebras can be mapped on 1D Schrödinger equations with particular potentials. As long as the Laplace-Beltrami operator on a curved surface is proportional to one of the Casimir invariants of the isometry algebra, free motion on the surface is described by means of the eigenvalue problem of that very Casimir operator. In effect, the excitation modes considered are classified according to the irreducible representations of the algebra of interest and are characterized by typical degeneracies. In consequence, also the spectra of the equivalent Schrödinger operators are classified according to the same irreducible representations and carry the same typical degeneracies. A subtle point concerns the representation of the algebra elements which may or may not be unitarily equivalent to the standard one generating classical groups like SO(n), SO(p,q), etc. To be specific, any similarity transformations of an algebra that underlies, say, an orthogonal group, always conserve the commutators among the elements, but a non-unitarily transformed algebra must not generate same group. One can then consider the parameters of the non-unitary similarity transformation as group symmetry breaking scales and seek to identify them with physical observables. We here use the potential algebra concept as a guidance in the search for an interaction describing conformal degeneracies. For this purpose we subject the so(4) ⊂ so(2,4) isometry algebra of the S3 ball to a particular non-unitary similarity transformation and obtain a deformed isometry copy to S3 such that free motion on the copy is equivalent to a cotangent perturbed motion on S3, and to the 1D Schrödinger operator with the trigonometric Rosen-Morse potential as well. The latter presents itself especially well suited for
Super-quantum curves from super-eigenvalue models
NASA Astrophysics Data System (ADS)
Ciosmak, Paweł; Hadasz, Leszek; Manabe, Masahide; Sułkowski, Piotr
2016-10-01
In modern mathematical and theoretical physics various generalizations, in particular supersymmetric or quantum, of Riemann surfaces and complex algebraic curves play a prominent role. We show that such supersymmetric and quantum generalizations can be combined together, and construct supersymmetric quantum curves, or super-quantum curves for short. Our analysis is conducted in the formalism of super-eigenvalue models: we introduce β-deformed version of those models, and derive differential equations for associated α/ β-deformed super-matrix integrals. We show that for a given model there exists an infinite number of such differential equations, which we identify as super-quantum curves, and which are in one-to-one correspondence with, and have the structure of, super-Virasoro singular vectors. We discuss potential applications of super-quantum curves and prospects of other generalizations.
Eigenvalue density of linear stochastic dynamical systems: A random matrix approach
NASA Astrophysics Data System (ADS)
Adhikari, S.; Pastur, L.; Lytova, A.; Du Bois, J.
2012-02-01
Eigenvalue problems play an important role in the dynamic analysis of engineering systems modeled using the theory of linear structural mechanics. When uncertainties are considered, the eigenvalue problem becomes a random eigenvalue problem. In this paper the density of the eigenvalues of a discretized continuous system with uncertainty is discussed by considering the model where the system matrices are the Wishart random matrices. An analytical expression involving the Stieltjes transform is derived for the density of the eigenvalues when the dimension of the corresponding random matrix becomes asymptotically large. The mean matrices and the dispersion parameters associated with the mass and stiffness matrices are necessary to obtain the density of the eigenvalues in the frameworks of the proposed approach. The applicability of a simple eigenvalue density function, known as the Marenko-Pastur (MP) density, is investigated. The analytical results are demonstrated by numerical examples involving a plate and the tail boom of a helicopter with uncertain properties. The new results are validated using an experiment on a vibrating plate with randomly attached spring-mass oscillators where 100 nominally identical samples are physically created and individually tested within a laboratory framework.
On the behavior of the leading eigenvalue of Eigen's evolutionary matrices.
Semenov, Yuri S; Bratus, Alexander S; Novozhilov, Artem S
2014-12-01
We study general properties of the leading eigenvalue w¯(q) of Eigen's evolutionary matrices depending on the replication fidelity q. This is a linear algebra problem that has various applications in theoretical biology, including such diverse fields as the origin of life, evolution of cancer progression, and virus evolution. We present the exact expressions for w¯(q),w¯(')(q),w¯('')(q) for q = 0, 0.5, 1 and prove that the absolute minimum of w¯(q), which always exists, belongs to the interval (0, 0.5]. For the specific case of a single peaked landscape we also find lower and upper bounds on w¯(q), which are used to estimate the critical mutation rate, after which the distribution of the types of individuals in the population becomes almost uniform. This estimate is used as a starting point to conjecture another estimate, valid for any fitness landscape, and which is checked by numerical calculations. The last estimate stresses the fact that the inverse dependence of the critical mutation rate on the sequence length is not a generally valid fact. PMID:25445764
A method to stabilize linear systems using eigenvalue gradient information
NASA Technical Reports Server (NTRS)
Wieseman, C. D.
1985-01-01
Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.
A variational eigenvalue solver on a photonic quantum processor.
Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J; Aspuru-Guzik, Alán; O'Brien, Jeremy L
2014-01-01
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry--calculating the ground-state molecular energy for He-H(+). The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. PMID:25055053
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.
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.
Computational aspects of growth-induced instabilities through eigenvalue analysis
NASA Astrophysics Data System (ADS)
Javili, A.; Dortdivanlioglu, B.; Kuhl, E.; Linder, C.
2015-09-01
The objective of this contribution is to establish a computational framework to study growth-induced instabilities. The common approach towards growth-induced instabilities is to decompose the deformation multiplicatively into its growth and elastic part. Recently, this concept has been employed in computations of growing continua and has proven to be extremely useful to better understand the material behavior under growth. While finite element simulations seem to be capable of predicting the behavior of growing continua, they often cannot naturally capture the instabilities caused by growth. The accepted strategy to provoke growth-induced instabilities is therefore to perturb the solution of the problem, which indeed results in geometric instabilities in the form of wrinkles and folds. However, this strategy is intrinsically subjective as the user is prescribing the perturbations and the simulations are often highly perturbation-dependent. We propose a different strategy that is inherently suitable for this problem, namely eigenvalue analysis. The main advantages of eigenvalue analysis are that first, no arbitrary, artificial perturbations are needed and second, it is, in general, independent of the time step size. Therefore, the solution obtained by this methodology is not subjective and thus, is generic and reproducible. Equipped with eigenvalue analysis, we are able to compute precisely the critical growth to initiate instabilities. Furthermore, this strategy allows us to compare different finite elements for this family of problems. Our results demonstrate that linear elements perform strikingly poorly, as compared to quadratic elements.
Perfetti, Christopher M; Martin, William R; Rearden, Bradley T; Williams, Mark L
2012-01-01
This study introduced three approaches for calculating the importance weighting function for Contributon and CLUTCH eigenvalue sensitivity coefficient calculations, and compared them in terms of accuracy and applicability. The necessary levels of mesh refinement and mesh convergence for obtaining accurate eigenvalue sensitivity coefficients were determined through two parametric studies, and the results of these studies suggest that a sufficiently-accurate mesh for calculating eigenvalue sensitivity coefficients can be obtained for the Contributon and CLUTCH methods with only a small increase in problem runtime.
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
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.
NASA Astrophysics Data System (ADS)
Armstrong, Scott N.
We study the fully nonlinear elliptic equation F(Du,Du,u,x)=f in a smooth bounded domain Ω, under the assumption that the nonlinearity F is uniformly elliptic and positively homogeneous. Recently, it has been shown that such operators have two principal "half" eigenvalues, and that the corresponding Dirichlet problem possesses solutions, if both of the principal eigenvalues are positive. In this paper, we prove the existence of solutions of the Dirichlet problem if both principal eigenvalues are negative, provided the "second" eigenvalue is positive, and generalize the anti-maximum principle of Clément and Peletier [P. Clément, L.A. Peletier, An anti-maximum principle for second-order elliptic operators, J. Differential Equations 34 (2) (1979) 218-229] to homogeneous, fully nonlinear operators.
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…
Investigating a hybrid perturbation-Galerkin technique using computer algebra
NASA Technical Reports Server (NTRS)
Andersen, Carl M.; Geer, James F.
1988-01-01
A two-step hybrid perturbation-Galerkin method is presented for the solution of a variety of differential equations type problems which involve a scalar parameter. The resulting (approximate) solution has the form of a sum where each term consists of the product of two functions. The first function is a function of the independent field variable(s) x, and the second is a function of the parameter lambda. In step one the functions of x are determined by forming a perturbation expansion in lambda. In step two the functions of lambda are determined through the use of the classical Bubnov-Gelerkin method. The resulting hybrid method has the potential of overcoming some of the drawbacks of the perturbation and Bubnov-Galerkin methods applied separately, while combining some of the good features of each. In particular, the results can be useful well beyond the radius of convergence associated with the perturbation expansion. The hybrid method is applied with the aid of computer algebra to a simple two-point boundary value problem where the radius of convergence is finite and to a quantum eigenvalue problem where the radius of convergence is zero. For both problems the hybrid method apparently converges for an infinite range of the parameter lambda. The results obtained from the hybrid method are compared with approximate solutions obtained by other methods, and the applicability of the hybrid method to broader problem areas is discussed.
Perfetti, Christopher M; Martin, William R; Rearden, Bradley T; Williams, Mark L
2012-01-01
Three methods for calculating continuous-energy eigenvalue sensitivity coefficients were developed and implemented into the SHIFT Monte Carlo code within the Scale code package. The methods were used for several simple test problems and were evaluated in terms of speed, accuracy, efficiency, and memory requirements. A promising new method for calculating eigenvalue sensitivity coefficients, known as the CLUTCH method, was developed and produced accurate sensitivity coefficients with figures of merit that were several orders of magnitude larger than those from existing methods.
Arbitrary eigenvalue assignments for linear time-varying multivariable control systems
NASA Technical Reports Server (NTRS)
Nguyen, Charles C.
1987-01-01
The problem of eigenvalue assignments for a class of linear time-varying multivariable systems is considered. Using matrix operators and canonical transformations, it is shown that a time-varying system that is 'lexicography-fixedly controllable' can be made via state feedback to be equivalent to a time-invariant system whose eigenvalues are arbitrarily assignable. A simple algorithm for the design of the state feedback is provided.
Partial eigenvalue assignment and its stability in a time delayed system
NASA Astrophysics Data System (ADS)
Singh, Kumar V.; Dey, Rajeeb; Datta, Biswa N.
2014-01-01
Active vibration control strategy is an effective way to control dangerous vibrations in a structure, caused by resonance and to manipulate the dynamics of vibrational response. Implementation of this strategy requires real-time computations of two feedback control matrices such that a small amount of eigenvalues of the associated quadratic matrix pencil are replaced by suitably chosen ones while the remaining large number of eigenvalues and eigenvectors remain unchanged ensuring the no spill-over. This mathematical problem is referred to as the Quadratic Partial Eigenvalue Assignment problem. The greatest challenge there is to solve the problems using the knowledge of only a small number of eigenvalues and eigenvectors that are computable using state-of-the-art techniques. This paper generalizes the earlier work on partial assignment to constant time-delay systems. Furthermore, a posterior stability analysis is carried out to identify the ranges of the time-delay that maintains the closed-loop assignment while keeping the stability of the infinite number of eigenvalues for the time-delayed systems. The practical features of the proposed methods are that it is implemented in the second-order setting itself using only those small number of eigenvalues and the eigenvectors that are to be assigned and the no spill-over is established by means of mathematical results. The results of our numerical experiments support the validity of our proposed methods.
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.
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.
Advanced Variance Reduction for Global k-Eigenvalue Simulations in MCNP
Edward W. Larsen
2008-06-01
to the correlations between fission source estimates. In the new FMC method, the eigenvalue problem (expressed in terms of the Boltzmann equation) is integrated over the energy and direction variables. Then these equations are multiplied by J special "tent" functions in space and integrated over the spatial variable. This yields J equations that are exactly satisfied by the eigenvalue k and J space-angle-energy moments of the eigenfunction. Multiplying and dividing by suitable integrals of the eigenfunction, one obtains J algebraic equations for k and the space-angle-energy moments of the eigenfunction, which contain nonlinear functionals that depend weakly on the eigenfunction. In the FMC method, information from the standard Monte Carlo solution for each active cycle is used to estimate the functionals, and at the end of each cycle the J equations for k and the space-angle-energy moments of the eigenfunction are solved. Finally, these results are averaged over N active cycles to obtain estimated means and standard deviations for k and the space-angle-energy moments of the eigenfunction. Our limited testing shows that for large single fissile systems such as a commercial reactor core, (i) the FMC estimate of the eigenvalue is at least one order of magnitude more accurate than estimates obtained from the standard Monte Carlo approach, (ii) the FMC estimate of the eigenfunction converges and is several orders of magnitude more accurate than the standard estimate, and (iii) the FMC estimate of the standard deviation in k is at least one order of magnitude closer to the correct standard deviation than the standard estimate. These advances occur because: (i) the Monte Carlo estimates of the nonlinear functionals are much more accurate than the direct Monte Carlo estimates of the eigenfunction, (ii) the system of discrete equations that determines the FMC estimates of k is robust, and (iii) the functionals are only very weakly correlated between different fission
NASA Astrophysics Data System (ADS)
Bai, Zheng-Jian; Datta, Biswa Nath; Wang, Jinwei
2010-04-01
The partial quadratic eigenvalue assignment problem (PQEVAP) concerns reassigning a few undesired eigenvalues of a quadratic matrix pencil to suitably chosen locations and keeping the other large number of eigenvalues and eigenvectors unchanged (no spill-over). The problem naturally arises in controlling dangerous vibrations in structures by means of active feedback control design. For practical viability, the design must be robust, which requires that the norms of the feedback matrices and the condition number of the closed-loop eigenvectors are as small as possible. The problem of computing feedback matrices that satisfy the above two practical requirements is known as the Robust Partial Quadratic Eigenvalue Assignment Problem (RPQEVAP). In this paper, we formulate the RPQEVAP as an unconstrained minimization problem with the cost function involving the condition number of the closed-loop eigenvector matrix and two feedback norms. Since only a small number of eigenvalues of the open-loop quadratic pencil are computable using the state-of-the-art matrix computational techniques and/or measurable in a vibration laboratory, it is imperative that the problem is solved using these small number of eigenvalues and the corresponding eigenvectors. To this end, a class of the feedback matrices are obtained in parametric form, parameterized by a single parametric matrix, and the cost function and the required gradient formulas for the optimization problem are developed in terms of the small number of eigenvalues that are reassigned and their corresponding eigenvectors. The problem is solved directly in quadratic setting without transforming it to a standard first-order control problem and most importantly, the significant "no spill-over property" of the closed-loop eigenvalues and eigenvectors is established by means of a mathematical result. These features make the proposed method practically applicable even for very large structures. Results on numerical experiments show
Fu, Zhongtao; Yang, Wenyu; Yang, Zhen
2013-08-01
In this paper, we present an efficient method based on geometric algebra for computing the solutions to the inverse kinematics problem (IKP) of the 6R robot manipulators with offset wrist. Due to the fact that there exist some difficulties to solve the inverse kinematics problem when the kinematics equations are complex, highly nonlinear, coupled and multiple solutions in terms of these robot manipulators stated mathematically, we apply the theory of Geometric Algebra to the kinematic modeling of 6R robot manipulators simply and generate closed-form kinematics equations, reformulate the problem as a generalized eigenvalue problem with symbolic elimination technique, and then yield 16 solutions. Finally, a spray painting robot, which conforms to the type of robot manipulators, is used as an example of implementation for the effectiveness and real-time of this method. The experimental results show that this method has a large advantage over the classical methods on geometric intuition, computation and real-time, and can be directly extended to all serial robot manipulators and completely automatized, which provides a new tool on the analysis and application of general robot manipulators.
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.
Upgrades to the ArbiTER edge plasma eigenvalue code
NASA Astrophysics Data System (ADS)
Baver, D. A.; Myra, J. R.; Umansky, M. V.
2012-10-01
The Arbitrary Topology Equation Reader, or ArbiTER, is a flexible eigenvalue code that is under continued development for plasma kinetic problems. The preliminary stage of ArbiTER development has demonstrated its capability in handling complicated geometries (such as multiple X-points) as well as simple kinetic problems. Planned upgrades (such as parallelization and unstructured grids) are expected to expand its range of potential applications. In order to handle large eigenvalue problems produced by realistic kinetic problems, parallelization is necessary. ArbiTER uses the SLEPc [1] eigensolver package, which already has parallel capability, however, early versions of the code lack the structures needed to exploit this capability. Integrating parallel SLEPc into the ArbiTER code is therefore a high priority. In addition, we will also present first physics studies using ArbiTER. This will be analysis of surface-localized phenomena such as coaxial modes, which are relevant to RF heating and current drive in devices such as NSTX. Work supported by the U.S. DOE. [4pt] [1] http://www.grycap.upv.es/slepc/
Eigenvalue Detonation of Combined Effects Aluminized Explosives
NASA Astrophysics Data System (ADS)
Capellos, C.; Baker, E. L.; Nicolich, S.; Balas, W.; Pincay, J.; Stiel, L. I.
2007-12-01
Theory and performance for recently developed combined—effects aluminized explosives are presented. Our recently developed combined-effects aluminized explosives (PAX-29C, PAX-30, PAX-42) are capable of achieving excellent metal pushing, as well as high blast energies. Metal pushing capability refers to the early volume expansion work produced during the first few volume expansions associated with cylinder and wall velocities and Gurney energies. Eigenvalue detonation explains the observed detonation states achieved by these combined effects explosives. Cylinder expansion data and thermochemical calculations (JAGUAR and CHEETAH) verify the eigenvalue detonation behavior.
Local Eigenvalue Density for General MANOVA Matrices
NASA Astrophysics Data System (ADS)
Erdős, László; Farrell, Brendan
2013-09-01
We consider random n× n matrices of the form where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are known as MANOVA matrices and which have joint eigenvalue density given by the third classical ensemble, the Jacobi ensemble. We show that, away from the spectral edge, the eigenvalue density converges to the limiting density of the Jacobi ensemble even on the shortest possible scales of order 1/ n (up to log n factors). This result is the analogue of the local Wigner semicircle law and the local Marchenko-Pastur law for general MANOVA matrices.
An Algebraic Construction of the First Integrals of the Stationary KdV Hierarchy
NASA Astrophysics Data System (ADS)
Matsushima, Masatomo; Ohmiya, Mayumi
2009-09-01
The stationary KdV hierarchy is constructed using a kind of recursion operator called Λ-operator. The notion of the maximal solution of the n-th stationary KdV equation is introduced. Using this maximal solution, a specific differential polynomial with the auxiliary spectral parameter called the spectral M-function is constructed as the quadratic form of the fundamental system of the eigenvalue problem for the 2-nd order linear ordinary differential equation which is related to the linearizing operator of the hierarchy. By calculating a perfect square condition of the quadratic form by an elementary algebraic method, the complete set of first integrals of this hierarchy is constructed.
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…
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.
Bases for representations of quantum algebras
NASA Astrophysics Data System (ADS)
Atakishiyev, N. M.; Winternitz, P.
2000-08-01
We derive an explicit expression for the eigenfunctions and the corresponding eigenvalues of the operator [q1/4J+(q) + q-1/4J-(q)] qJ3(q)/2 in an arbitrary irreducible representation of the algebra suq(2). The general form of the intertwining operator AJ(q), which is a q-extension of the classical su(2)-operator aJ, J1aJ = aJJ3, is also found. The matrix elements of AJ(q) are expressed in terms of the dual q-Kravchuk polynomials.
Parallel eigensolver for H(curl) problems using H1-auxiliary space AMG preconditioning
Kolev, T V; Vassilevski, P S
2006-11-15
This report describes an application of the recently developed H{sup 1}-auxiliary space preconditioner for H(curl) problems to the Maxwell eigenvalue problem. The auxiliary space method based on the new (HX) finite element space decomposition introduced in [7], was implemented in the hypre library, [10, 11] under the name AMS. The eigensolver considered in the present paper, referred to as the AME, is an extension of the AMS. It is based on the locally optimal block eigensolver LOBPCG [9] and the parallel AMG (algebraic multigrid) solver BoomerAMG [2] from the hypre library. AME is designed to compute a block of few minimal nonzero eigenvalues and eigenvectors, for general unstructured finite element discretizations utilizing the lowest order Nedelec elements. The main goal of the current report is to document the usage of AME and to illustrate its parallel scalability.
Krylov subspace iterations for the calculation of K-Eigenvalues with sn transport codes
Warsa, J. S.; Wareing, T. A.; Morel, J. E.; McGhee, J. M.; Lehoucq, R. B.
2002-01-01
We apply the Implicitly Restarted Arnoldi Method (IRAM), a Krylov subspace iterative method, to the calculation of k-eigenvalues for criticality problems. We show that the method can be implemented with only modest changes to existing power iteration schemes in an SN transport code. Numerical results on three dimensional unstructured tetrahedral meshes are shown. Although we only compare the IRAM to unaccelerated power iteration, the results indicate that the IRAM is a potentially efficient and powerful technique, especially for problems with dominance ratios approaching unity. Key Words: criticality eigenvalues, Implicitly Restarted Arnoldi Method (IRAM), deterministic transport methods
A finite element algorithm for high-lying eigenvalues with Neumann and Dirichlet boundary conditions
NASA Astrophysics Data System (ADS)
Báez, G.; Méndez-Sánchez, R. A.; Leyvraz, F.; Seligman, T. H.
2014-01-01
We present a finite element algorithm that computes eigenvalues and eigenfunctions of the Laplace operator for two-dimensional problems with homogeneous Neumann or Dirichlet boundary conditions, or combinations of either for different parts of the boundary. We use an inverse power plus Gauss-Seidel algorithm to solve the generalized eigenvalue problem. For Neumann boundary conditions the method is much more efficient than the equivalent finite difference algorithm. We checked the algorithm by comparing the cumulative level density of the spectrum obtained numerically with the theoretical prediction given by the Weyl formula. We found a systematic deviation due to the discretization, not to the algorithm itself.
Koc, Ramazan . E-mail: koc@gantep.edu.tr; Tuetuencueler, Hayriye; Koca, Mehmet; Olgar, Eser
2005-10-01
We consider solutions of the 2 x 2 matrix Hamiltonians of the physical systems within the context of the su (2) and su (1, 1) Lie algebras. Our technique is relatively simple when compared with those of others and treats those Hamiltonians which can be treated in a unified framework of the Sp (4, R) algebra. The systematic study presented here reproduces a number of earlier results in a natural way as well as leads to a novel finding. Possible generalizations of the method are also suggested.
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.
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.
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.
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…
Generalization of Richardson-Gaudin models to rank-2 algebras
Errea, B; Lerma, S; Dukelsky, J; Dimitrova, S S; Pittel, S; Van Isacker, P; Gueorguiev, V G
2006-07-20
A generalization of Richardson-Gaudin models to the rank-2 SO(5) and SO(3,2) algebras is used to describe systems of two kinds of fermions or bosons interacting through a pairing force. They are applied to the proton-neutron neutron isovector pairing model and to the Interacting Boson Model 2, in the transition from vibration to gamma-soft nuclei, respectively. In both cases, the integrals of motion and their eigenvalues are obtained.
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.
NASA Astrophysics Data System (ADS)
Gee, David B.
1986-01-01
This is a comparison study of the abilities of the eigenvalue method as a numerical method in solving the transient heat conduction equation. The eigenvalue method was compared to five other numerical methods; Runge-Kutta, Gears, extrapolation, fully implicit, and Crank-Nicolson. The latter were used to solve three physical problems: (1) a two dimensional slap which takes advantage of the symmetry of the problem; (2) the same slap problem without taking advantage of the symmetry; and (3) a cylindrical problem taking full advantage of symmetry. The scope of the study is to see which methods take less computer time while maintaining sufficient accuracy. The time it takes the computer to totally execute the program was used as the time comparison basis. The accuracy is a comparison of the exact solution to the numerical solution. A root mean square average of all the grid points per time step is used. The results of the study were surprising. The accuracy of the eigenvalue method is not any better than that of the Crank-Nicolson method. The computer times show that the eigenvalue is not the fastest for short transient times. A long transient problem with nonlinear terme was not used.
Eigenvalue translation method for mode calculations.
Gerck, E; Cruz, C H
1979-05-01
A new method is described for the first few modes calculations in a interferometer that has several advantages over the Allmat subroutine, the Prony method, and the Fox and Li method. In the illustrative results shown for some cases it can be seen that the eigenvalue translation method is typically 100-fold times faster than the usual Fox and Li method and ten times faster than Allmat.
Form in Algebra: Reflecting, with Peacock, on Upper Secondary School Teaching.
ERIC Educational Resources Information Center
Menghini, Marta
1994-01-01
Discusses algebra teaching by looking back into the history of algebra and the work of George Peacock, who considered algebra from two points of view: symbolic and instrumental. Claims that, to be meaningful, algebra must be linked to real-world problems. (18 references) (MKR)
Boolean Algebra. Geometry Module for Use in a Mathematics Laboratory Setting.
ERIC Educational Resources Information Center
Brotherton, Sheila; And Others
This module is recommended as an honors unit to follow a unit on logic. There are four basic parts: (1) What is a Boolean Algebra; (2) Using Boolean Algebra to Prove Theorems; (3) Using Boolean Algebra to Simplify Logical Statements; and (4) Circuit Problems with Logic and Boolean Algebra. Of these, sections 1, 2, and 3 are primarily written…
Large Deviations of the Maximum Eigenvalue for Wishart and Gaussian Random Matrices
Majumdar, Satya N.; Vergassola, Massimo
2009-02-13
We present a Coulomb gas method to calculate analytically the probability of rare events where the maximum eigenvalue of a random matrix is much larger than its typical value. The large deviation function that characterizes this probability is computed explicitly for Wishart and Gaussian ensembles. The method is general and applies to other related problems, e.g., the joint large deviation function for large fluctuations of top eigenvalues. Our results are relevant to widely employed data compression techniques, namely, the principal components analysis. Analytical predictions are verified by extensive numerical simulations.
Optimal lower bound for the first eigenvalue of the fourth order equation
NASA Astrophysics Data System (ADS)
Meng, Gang; Yan, Ping
2016-09-01
In this paper we will find optimal lower bound for the first eigenvalue of the fourth order equation with integrable potentials when the L1 norm of potentials is known. We establish the minimization characterization for the first eigenvalue of the measure differential equation, which plays an important role in the extremal problem of ordinary differential equation. The conclusion of this paper will illustrate a new and very interesting phenomenon that the minimizing measures will no longer be located at the center of the interval when the norm is large enough.
Perfetti, C.; Martin, W.; Rearden, B.; Williams, M.
2012-07-01
Three methods for calculating continuous-energy eigenvalue sensitivity coefficients were developed and implemented into the Shift Monte Carlo code within the SCALE code package. The methods were used for two small-scale test problems and were evaluated in terms of speed, accuracy, efficiency, and memory requirements. A promising new method for calculating eigenvalue sensitivity coefficients, known as the CLUTCH method, was developed and produced accurate sensitivity coefficients with figures of merit that were several orders of magnitude larger than those from existing methods. (authors)
Lower bounds for sums of eigenvalues of elliptic operators and systems
Ilyin, Aleksei A
2013-04-30
Two-term lower bounds of Berzin-Li-Yau type are obtained for the sums of eigenvalues of elliptic operators and systems with constant coefficients and Dirichlet boundary conditions. The polyharmonic operator, the Stokes system and its generalizations, the two-dimensional buckling problem, and also the Klein-Gordon operator are considered. Bibliography: 32 titles.
A Decentralized Eigenvalue Computation Method for Spectrum Sensing Based on Average Consensus
NASA Astrophysics Data System (ADS)
Mohammadi, Jafar; Limmer, Steffen; Stańczak, Sławomir
2016-07-01
This paper considers eigenvalue estimation for the decentralized inference problem for spectrum sensing. We propose a decentralized eigenvalue computation algorithm based on the power method, which is referred to as generalized power method GPM; it is capable of estimating the eigenvalues of a given covariance matrix under certain conditions. Furthermore, we have developed a decentralized implementation of GPM by splitting the iterative operations into local and global computation tasks. The global tasks require data exchange to be performed among the nodes. For this task, we apply an average consensus algorithm to efficiently perform the global computations. As a special case, we consider a structured graph that is a tree with clusters of nodes at its leaves. For an accelerated distributed implementation, we propose to use computation over multiple access channel (CoMAC) as a building block of the algorithm. Numerical simulations are provided to illustrate the performance of the two algorithms.
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.
Two novel classes of solvable many-body problems of goldfish type with constraints
NASA Astrophysics Data System (ADS)
Calogero, F.; Gómez-Ullate, D.
2007-05-01
Two novel classes of many-body models with nonlinear interactions 'of goldfish type' are introduced. They are solvable provided the initial data satisfy a single constraint (in one case; in the other, two constraints), i.e., for such initial data the solution of their initial-value problem can be achieved via algebraic operations, such as finding the eigenvalues of given matrices or equivalently the zeros of known polynomials. Entirely isochronous versions of some of these models are also exhibited, i.e., versions of these models whose nonsingular solutions are all completely periodic with the same period.
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…
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…
Approximation methods in relativistic eigenvalue perturbation theory
NASA Astrophysics Data System (ADS)
Noble, Jonathan Howard
In this dissertation, three questions, concerning approximation methods for the eigenvalues of quantum mechanical systems, are investigated: (i) What is a pseudo--Hermitian Hamiltonian, and how can its eigenvalues be approximated via numerical calculations? This is a fairly broad topic, and the scope of the investigation is narrowed by focusing on a subgroup of pseudo--Hermitian operators, namely, PT--symmetric operators. Within a numerical approach, one projects a PT--symmetric Hamiltonian onto an appropriate basis, and uses a straightforward two--step algorithm to diagonalize the resulting matrix, leading to numerically approximated eigenvalues. (ii) Within an analytic ansatz, how can a relativistic Dirac Hamiltonian be decoupled into particle and antiparticle degrees of freedom, in appropriate kinematic limits? One possible answer is the Foldy--Wouthuysen transform; however, there are alter- native methods which seem to have some advantages over the time--tested approach. One such method is investigated by applying both the traditional Foldy--Wouthuysen transform and the "chiral" Foldy--Wouthuysen transform to a number of Dirac Hamiltonians, including the central-field Hamiltonian for a gravitationally bound system; namely, the Dirac-(Einstein-)Schwarzschild Hamiltonian, which requires the formal- ism of general relativity. (iii) Are there are pseudo--Hermitian variants of Dirac Hamiltonians that can be approximated using a decoupling transformation? The tachyonic Dirac Hamiltonian, which describes faster-than-light spin-1/2 particles, is gamma5--Hermitian, i.e., pseudo-Hermitian. Superluminal particles remain faster than light upon a Lorentz transformation, and hence, the Foldy--Wouthuysen program is unsuited for this case. Thus, inspired by the Foldy--Wouthuysen program, a decoupling transform in the ultrarelativistic limit is proposed, which is applicable to both sub- and superluminal particles.
The first eigenvalue of the Laplace operator
NASA Astrophysics Data System (ADS)
Kanguzhin, Baltabek E.; Dauitbek, Dostilek
2016-08-01
We consider a self-adjoint differential operator in the Hilbert space. The domain of the operator is changed by the perturbation of the boundary conditions so that a given neighborhood "there are no eigenvalues on neighborhood of zero" from the points of the spectrum of the perturbed operator. For the Sturm-Liouville operator on the segment and the Laplace operator on the square such a possibility is achieved through integral perturbations of boundary conditions. These statements are given with full proofs, and with a possible extension.
NASA Astrophysics Data System (ADS)
Huang, Tsung-Ming; Lin, Wen-Wei; Wang, Weichung
2016-10-01
We study how to efficiently solve the eigenvalue problems in computing band structure of three-dimensional dispersive metallic photonic crystals with face-centered cubic lattices based on the lossless Drude model. The discretized Maxwell equations result in large-scale standard eigenvalue problems whose spectrum contains many zero and cluster eigenvalues, both prevent existed eigenvalue solver from being efficient. To tackle this computational difficulties, we propose a hybrid Jacobi-Davidson method (hHybrid) that integrates harmonic Rayleigh-Ritz extraction, a new and hybrid way to compute the correction vectors, and a FFT-based preconditioner. Intensive numerical experiments show that the hHybrid outperforms existed eigenvalue solvers in terms of timing and convergence behaviors.
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.
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.
A spectral collocation solution to the compressible stability eigenvalue problem
NASA Technical Reports Server (NTRS)
Macaraeg, Michele G.; Streett, Craig L.; Hussaini, M. Yousuff
1988-01-01
A newly developed spectral compressible linear stability code (SPECLS) (staggered pressure mesh) is presented for analysis of shear flow stability, and applied to high speed boundary layers and free shear flows. The formulation utilizes the first application of a staggered mesh for a compressible flow analysis by a spectral technique. An order of magnitude less number of points is needed for equivalent accuracy of growth rates compared to those calculated by a finite difference formulation. Supersonic disturbances which are found to have oscillatory structures were resolved by a spectral multi-domain discretization, which requires a factor of three fewer points than the single domain spectral stability code. It is indicated, as expected, that stability of mixing layers is enhanced by viscosity and increasing Mach number. The mean flow involves a jet being injected into a quiescent gas. Higher temperatures of the injected gas is also found to enhance stability characteristics of the free shear layer.
Embedded Random Matrix Ensembles with Lie Symmetries: Results from U(Ω) Wigner-Racah algebra
NASA Astrophysics Data System (ADS)
Kota, V. K. B.; Vyas, Manan
2014-10-01
Random matrix ensembles for a system of m number of fermions or bosons in Ω number of single particle levels each r-fold degenerate and interacting with two-body forces are considered. The spectrum generating algebra for these systems is U(rΩ) and a subalgebra of interest is U(rΩ) ⊃ U(Ω) SU(r) algebra. Now, for random two-body interactions preserving SU(r) symmetry, one can introduce embedded Gaussian unitary ensemble of random matrices with U(Ω)SU(r) embedding and this class of ensembles are denoted by EGUE(2)-SU(r). Ensembles with r = 1,2 and 4 for fermions correspond to spinless fermions, fermions with spin and fermions with Wigner's spin-isospin SU(4) symmetry respectively. Similarly, for bosons r = 1, 2 and 3 correspond to spinless bosons, two species boson systems and bosons with spin one respectively. The distinction between fermions and bosons is in the U(Ω) irreducible representations. General formulation based on Wigner-Racah algebra for lower order moments of the one- and two-point functions in eigenvalues generated by EGUE(2)- SU(r) is briefly reviewed. The final formulas for the moments involve only SU(Ω) Racah coefficients. For the fourth moment of the one-point function for r > 1 and for the higher order (> 4) bivariate moments of the two-point function for r >= 1, formulas are not available for the SU(Ω) Racah coefficients that are needed. It is necessary to derive analytical formulas for these or develop methods that give asymptotic results (an example for this is given in the paper) or develop methods that allow for their numerical evaluation. This important open problem is discussed in some detail.
Shifted power method for computing tensor eigenvalues.
Mayo, Jackson R.; Kolda, Tamara Gibson
2010-07-01
Recent work on eigenvalues and eigenvectors for tensors of order m >= 3 has been motivated by applications in blind source separation, magnetic resonance imaging, molecular conformation, and more. In this paper, we consider methods for computing real symmetric-tensor eigenpairs of the form Ax{sup m-1} = lambda x subject to ||x||=1, which is closely related to optimal rank-1 approximation of a symmetric tensor. Our contribution is a shifted symmetric higher-order power method (SS-HOPM), which we show is guaranteed to converge to a tensor eigenpair. SS-HOPM can be viewed as a generalization of the power iteration method for matrices or of the symmetric higher-order power method. Additionally, using fixed point analysis, we can characterize exactly which eigenpairs can and cannot be found by the method. Numerical examples are presented, including examples from an extension of the method to finding complex eigenpairs.
Eigenvalue Detonation of Combined Effects Aluminized Explosives
NASA Astrophysics Data System (ADS)
Capellos, Christos; Baker, Ernest; Balas, Wendy; Nicolich, Steven; Stiel, Leonard
2007-06-01
This paper reports on the development of theory and performance for recently developed combined effects aluminized explosives. Traditional high energy explosives used for metal pushing incorporate high loading percentages of HMX or RDX, whereas blast explosives incorporate some percentage of aluminum. However, the high blast explosives produce increased blast energies, with reduced metal pushing capability due to late time aluminum reaction. Metal pushing capability refers to the early volume expansion work produced during the first few volume expansions associated with cylinder wall velocities and Gurney energies. Our Recently developed combined effects aluminized explosives (PAX-29C, PAX-30, PAX-42) are capable of achieving excellent metal pushing and high blast energies. Traditional Chapman-Jouguet detonation theory does not explain the observed detonation states achieved by these combined effects explosives. This work demonstrates, with the use of cylinder expansion data and thermochemical code calculations (JAGUAR and CHEETAH), that eigenvalue detonation theory explains the observed behavior.
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…
What Is the Place of Algebra in the K-12 Mathematics Program?
ERIC Educational Resources Information Center
Fendel, Dan; And Others
1997-01-01
As times change, so has the role of algebra in the educational program. The Interactive Mathematics Program (IMP) offers secondary students an opportunity to learn algebra in a college preparatory sequence that combines basic skills, problem solving, and conceptual understanding while integrating algebra into a problem-based program. Designed for…
Saldin, E.L.; Schneidmiller, E.A.; Ulyanov, Yu.N.
1995-12-31
The paper presents analysis of the eigenvalue problem of the FEL amplifier with axisymmetric electron beam and diaphragm focusing line. An FEL model is discussed wherein diffraction effects, space charge fields and energy spread of electrons in the beam are taken into account. To take into account diffraction effects at the diaphragms we apply the rigorous impedance boundary conditions proposed by Veinstein. The rigorous solutions of the eigenvalue problem leave been found for the stepped and bounded parabolic electron beam profiles. Analytical expressions for eigenfunctions of active open waveguide and formulae of their expansion in eigenfunctions of passive open waveguide, are derived, too. Asymptotic behaviour of the obtained solutions is studied in details. The multilayer approximation method has been used to solve the eigenvalue problem for the beams with an arbitrary gradient profile of current density. This novel type of an FEL amplifier has perspective to be used for applications where high average and peak radiation power is required.
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)
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…
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…
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.
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…
Applications of the ArbiTER edge plasma eigenvalue code
NASA Astrophysics Data System (ADS)
Baver, D. A.; Myra, J. R.; Umansky, M. V.
2013-10-01
ArbiTER is a flexible eigenvalue code designed for plasma physics applications. This code uses an equation and topology parser to determine how a particular set of linearized model equations is spatially discretized. The resulting matrix form is then solved using the SLEPc eigensolver package. The equation and topology parsers permit a wide variety of capabilities, including variable numbers of dimensions, both finite difference and finite element methods, and irregular boundary conditions. Recent upgrades also permit parallel operation and the solution of source-driven problems. Two applications of this code will be presented, both as demonstrations of capability and as benchmark cases. One of these is the calculation of resistive ballooning modes with fully kinetic electrons. This will demonstrate the capacity for solving kinetic problems. The other is the use of extended spatial domains for ballooning stability analysis. This will demonstrate the utility of extra dimensions in calculations with fluid models. Work supported by the U.S. DOE grant DE-SC0006562.
A Lanczos eigenvalue method on a parallel computer
NASA Technical Reports Server (NTRS)
Bostic, Susan W.; Fulton, Robert E.
1987-01-01
Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency for the Lanczos method was good for a moderate number of processors for the test problem, the greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.
Lefrancois, Daniel; Wormit, Michael; Dreuw, Andreas
2015-09-28
For the investigation of molecular systems with electronic ground states exhibiting multi-reference character, a spin-flip (SF) version of the algebraic diagrammatic construction (ADC) scheme for the polarization propagator up to third order perturbation theory (SF-ADC(3)) is derived via the intermediate state representation and implemented into our existing ADC computer program adcman. The accuracy of these new SF-ADC(n) approaches is tested on typical situations, in which the ground state acquires multi-reference character, like bond breaking of H{sub 2} and HF, the torsional motion of ethylene, and the excited states of rectangular and square-planar cyclobutadiene. Overall, the results of SF-ADC(n) reveal an accurate description of these systems in comparison with standard multi-reference methods. Thus, the spin-flip versions of ADC are easy-to-use methods for the calculation of “few-reference” systems, which possess a stable single-reference triplet ground state.
Eigenvalue assignment strategies in rotor systems
NASA Technical Reports Server (NTRS)
Youngblood, J. N.; Welzyn, K. J.
1986-01-01
The work done to establish the control and direction of effective eigenvalue excursions of lightly damped, speed dependent rotor systems using passive control is discussed. Both second order and sixth order bi-axis, quasi-linear, speed dependent generic models were investigated. In every case a single, bi-directional control bearing was used in a passive feedback stabilization loop to resist modal destabilization above the rotor critical speed. Assuming incomplete state measurement, sub-optimal control strategies were used to define the preferred location of the control bearing, the most effective measurement locations, and the best set of control gains to extend the speed range of stable operation. Speed dependent control gains were found by Powell's method to maximize the minimum modal damping ratio for the speed dependent linear model. An increase of 300 percent in stable speed operation was obtained for the sixth order linear system using passive control. Simulations were run to examine the effectiveness of the linear control law on nonlinear rotor models with bearing deadband. The maximum level of control effort (force) required by the control bearing to stabilize the rotor at speeds above the critical was determined for the models with bearing deadband.
NASA Astrophysics Data System (ADS)
Senovilla, José M. M.
2010-11-01
The algebraic classification of the Weyl tensor in the arbitrary dimension n is recovered by means of the principal directions of its 'superenergy' tensor. This point of view can be helpful in order to compute the Weyl aligned null directions explicitly, and permits one to obtain the algebraic type of the Weyl tensor by computing the principal eigenvalue of rank-2 symmetric future tensors. The algebraic types compatible with states of intrinsic gravitational radiation can then be explored. The underlying ideas are general, so that a classification of arbitrary tensors in the general dimension can be achieved.
Promoting Quantitative Literacy in an Online College Algebra Course
ERIC Educational Resources Information Center
Tunstall, Luke; Bossé, Michael J.
2016-01-01
College algebra (a university freshman level algebra course) fulfills the quantitative literacy requirement of many college's general education programs and is a terminal course for most who take it. An online problem-based learning environment provides a unique means of engaging students in quantitative discussions and research. This article…
Algebraic Concepts: What's Really New in New Curricula?
ERIC Educational Resources Information Center
Star, Jon R.; Herbel-Eisenmann, Beth A.; Smith, John P., III
2000-01-01
Examines 8th grade units from the Connected Mathematics Project (CMP). Identifies differences in older and newer conceptions, fundamental objects of study, typical problems, and typical solution methods in algebra. Also discusses where the issue of what is new in algebra is relevant to many other innovative middle school curricula. (KHR)
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.
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.
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.
Correlation between eigenvalue spectra and dynamics of neural networks.
Zhou, Qingguo; Jin, Tao; Zhao, Hong
2009-10-01
This letter presents a study of the correlation between the eigenvalue spectra of synaptic matrices and the dynamical properties of asymmetric neural networks with associative memories. For this type of neural network, it was found that there are essentially two different dynamical phases: the chaos phase, with almost all trajectories converging to a single chaotic attractor, and the memory phase, with almost all trajectories being attracted toward fixed-point attractors acting as memories. We found that if a neural network is designed in the chaos phase, the eigenvalue spectrum of its synaptic matrix behaves like that of a random matrix (i.e., all eigenvalues lie uniformly distributed within a circle in the complex plan), and if it is designed in the memory phase, the eigenvalue spectrum will split into two parts: one part corresponds to a random background, the other part equal in number to the memory attractors. The mechanism for these phenomena is discussed in this letter.
Eigenvalues for unstable resonators with slightly misaligned strip mirrors.
Santana, C; Felsen, L B
1980-09-15
Very small misalignments in unstable strip resonators may cause detachment of the low-loss eigenmode at a lower equivalent Fresnel number N(eq) and introduce different periodicities into the eigenvalue curves as a function of N(eq). Using the resonance equation developed previously from waveguide mode theory, this behavior is explained in physical terms by coupling between mode fields with even and odd symmetry, which are uncoupled in the perfectly aligned configuration. A simplified explicit equation derived for the eigenvalues of the detached mode is found to predict correctly the periodicities of the eigenvalue oscillations. The waveguide method therefore continues to provide an explicit and reliable procedure for rapidly locating the maxima and minima of the detached-mode eigenvalues over broad ranges of N(eq). PMID:20234585
Network extreme eigenvalue: From mutimodal to scale-free networks
NASA Astrophysics Data System (ADS)
Chung, N. N.; Chew, L. Y.; Lai, C. H.
2012-03-01
The extreme eigenvalues of adjacency matrices are important indicators on the influence of topological structures to the collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme eigenvalue have further authenticated its applicability to the study of network dynamics. However, the ensemble average of extreme eigenvalue has only been solved analytically up to the second order correction. Here, we determine the ensemble average of the extreme eigenvalue and characterize its deviation across the ensemble through the discrete form of random scale-free network. Remarkably, the analytical approximation derived from the discrete form shows significant improvement over previous results, which implies a more accurate prediction of the epidemic threshold. In addition, we show that bimodal networks, which are more robust against both random and targeted removal of nodes, are more vulnerable to the spreading of diseases.
The Taylor spectrum and transversality for a Heisenberg algebra of operators
NASA Astrophysics Data System (ADS)
Dosi, Anar A.
2010-05-01
A problem on noncommutative holomorphic functional calculus is considered for a Banach module over a finite-dimensional nilpotent Lie algebra. As the main result, the transversality property of algebras of noncommutative holomorphic functions with respect to the Taylor spectrum is established for a family of bounded linear operators generating a Heisenberg algebra. Bibliography: 25 titles.
The Taylor spectrum and transversality for a Heisenberg algebra of operators
Dosi, Anar A
2010-05-11
A problem on noncommutative holomorphic functional calculus is considered for a Banach module over a finite-dimensional nilpotent Lie algebra. As the main result, the transversality property of algebras of noncommutative holomorphic functions with respect to the Taylor spectrum is established for a family of bounded linear operators generating a Heisenberg algebra. Bibliography: 25 titles.
Algebraic structure of general electromagnetic fields and energy flow
Hacyan, Shahen
2011-08-15
Highlights: > Algebraic structure of general electromagnetic fields in stationary spacetime. > Eigenvalues and eigenvectors of the electomagnetic field tensor. > Energy-momentum in terms of eigenvectors and Killing vector. > Explicit form of reference frame with vanishing Poynting vector. > Application of formalism to Bessel beams. - Abstract: The algebraic structures of a general electromagnetic field and its energy-momentum tensor in a stationary space-time are analyzed. The explicit form of the reference frame in which the energy of the field appears at rest is obtained in terms of the eigenvectors of the electromagnetic tensor and the existing Killing vector. The case of a stationary electromagnetic field is also studied and a comparison is made with the standard short-wave approximation. The results can be applied to the general case of a structured light beams, in flat or curved spaces. Bessel beams are worked out as example.
Exactly solvable potentials with finitely many discrete eigenvalues of arbitrary choice
NASA Astrophysics Data System (ADS)
Sasaki, Ryu
2014-06-01
We address the problem of possible deformations of exactly solvable potentials having finitely many discrete eigenvalues of arbitrary choice. As Kay and Moses showed in 1956, reflectionless potentials in one dimensional quantum mechanics are exactly solvable. With an additional time dependence these potentials are identified as the soliton solutions of the Korteweg de Vries (KdV) hierarchy. An N-soliton potential has the time t and 2N positive parameters, k1 < ⋯ < kN and {cj}, j = 1, …, N, corresponding to N discrete eigenvalues lbrace -k_j^2rbrace. The eigenfunctions are elementary functions expressed by the ratio of determinants. The Darboux-Crum-Krein-Adler transformations or the Abraham-Moses transformations based on eigenfunction deletions produce lower soliton number potentials with modified parameters lbrace c^' }_jrbrace. We explore various identities satisfied by the eigenfunctions of the soliton potentials, which reflect the uniqueness theorem of Gel'fand-Levitan-Marchenko equations for separable (degenerate) kernels.
Parameterized center manifold for unfolding bifurcations with an eigenvalue +1 in n-dimensional maps
NASA Astrophysics Data System (ADS)
Wen, Guilin; Yin, Shan; Xu, Huidong; Zhang, Sijin; Lv, Zengyao
2016-10-01
For the fold bifurcation with an eigenvalue +1, there are three types of potential solutions from saddle-node bifurcation, transcritical bifurcation and pitchfork bifurcation. In the existing analysis methods for high maps, there is a problem that for the fold bifurcation, saddle-node bifurcation and transcritical bifurcation cannot be distinguished by the center manifold without bifurcation parameter. In this paper, a parameterized center manifold has been derived to unfold the solutions of the fold bifurcation with an eigenvalue +1, which is used to reduce a general n-dimensional map to one-dimensional map. On the basis of the reduced map, the conditions of the fold bifurcations including saddle-node bifurcation, transcritical bifurcation and pitchfork bifurcation are established for general maps, respectively. We show the applications of the proposed bifurcation conditions by three four-dimensional map examples to distinguish saddle-node bifurcation, transcritical bifurcation and pitchfork bifurcation.
The Rayleigh-Ritz Technique for Estimating Eigenvalues
NASA Astrophysics Data System (ADS)
Schnack, Dalton D.
The energy principle provides a powerful technique for determining the stability or instability of a magneto-fluid system without resorting to the solution of a differential equation. Instead, one makes an educated guess at the minimizing displacement and then examines the sign of the resulting eigenvalue. This approach is made even more powerful, and put on a solid theoretical footing, by application of the Rayleigh-Ritz technique for estimating the eigenvalues of a self-adjoint operator.
Overview of the ArbiTER edge plasma eigenvalue code
NASA Astrophysics Data System (ADS)
Baver, Derek; Myra, James; Umansky, Maxim
2011-10-01
The Arbitrary Topology Equation Reader, or ArbiTER, is a flexible eigenvalue solver that is currently under development for plasma physics applications. The ArbiTER code builds on the equation parser framework of the existing 2DX code, extending it to include a topology parser. This will give the code the capability to model problems with complicated geometries (such as multiple X-points and scrape-off layers) or model equations with arbitrary numbers of dimensions (e.g. for kinetic analysis). In the equation parser framework, model equations are not included in the program's source code. Instead, an input file contains instructions for building a matrix from profile functions and elementary differential operators. The program then executes these instructions in a sequential manner. These instructions may also be translated into analytic form, thus giving the code transparency as well as flexibility. We will present an overview of how the ArbiTER code is to work, as well as preliminary results from early versions of this code. Work supported by the U.S. DOE.
Quantum eigenvalue estimation for irreducible non-negative matrices
NASA Astrophysics Data System (ADS)
Daskin, Anmer
2016-04-01
Quantum phase estimation algorithm (PEA) has been successfully adapted as a sub frame of many other algorithms applied to a wide variety of applications in different fields. However, the requirement of a good approximate eigenvector given as an input to the algorithm hinders the application of the algorithm to the problems where we do not have any prior knowledge about the eigenvector. In this paper, we show that the principal eigenvalue of an irreducible non-negative operator can be determined by using an equal superposition initial state in the PEA. This removes the necessity of the existence of an initial good approximate eigenvector. Moreover, we show that the success probability of the algorithm is related to the closeness of the operator to a stochastic matrix. Therefore, we draw an estimate for the success probability by using the variance of the column sums of the operator. This provides a priori information which can be used to know the success probability of the algorithm beforehand for the non-negative matrices and apply the algorithm only in cases when the estimated probability is reasonably high. Finally, we discuss the possible applications and show the results for random symmetric matrices and 3-local Hamiltonians with non-negative off-diagonal elements.
SCALE Continuous-Energy Eigenvalue Sensitivity Coefficient Calculations
Perfetti, Christopher M.; Rearden, Bradley T.; Martin, William R.
2016-02-25
Sensitivity coefficients describe the fractional change in a system response that is induced by changes to system parameters and nuclear data. The Tools for Sensitivity and UNcertainty Analysis Methodology Implementation (TSUNAMI) code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, including quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different critical systems, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved fidelity and the desire to extend TSUNAMI analysis to advanced applications has motivated the developmentmore » of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in the CE-KENO framework of the SCALE code system to enable TSUNAMI-3D to perform eigenvalue sensitivity calculations using continuous-energy Monte Carlo methods. This work provides a detailed description of the theory behind the CLUTCH method and describes in detail its implementation. This work explores the improvements in eigenvalue sensitivity coefficient accuracy that can be gained through the use of continuous-energy sensitivity methods and also compares several sensitivity methods in terms of computational efficiency and memory requirements.« less
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)
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.
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…
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.
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.
ERIC Educational Resources Information Center
Arnau, David; Arevalillo-Herraez, Miguel; Puig, Luis; Gonzalez-Calero, Jose Antonio
2013-01-01
Designers of interactive learning environments with a focus on word problem solving usually have to compromise between the amount of resolution paths that a user is allowed to follow and the quality of the feedback provided. We have built an intelligent tutoring system (ITS) that is able to both track the user's actions and provide adequate…
Estimates of the eigenvalues of operator arising in swelling pressure model
NASA Astrophysics Data System (ADS)
Kanguzhin, Baltabek; Zhapsarbayeva, Lyailya
2016-08-01
Swelling pressures from materials confined by structures can cause structural deformations and instability. Due to the complexity of interactions between expansive solid and solid-liquid equilibrium, the forces exerting on retaining structures from swelling are highly nonlinear. This work is our initial attempt to study a simplistic spectral problem based on the Euler-elastic beam theory and some simplistic swelling pressure model. In this work estimates of the eigenvalues of some initial/boundary value problem for nonlinear Euler-elastic beam equation are obtained.
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.
Effective mass Schrödinger equation and nonlinear algebras
NASA Astrophysics Data System (ADS)
Roy, B.; Roy, P.
2005-06-01
Using supersymmetry we obtain solutions of Schrödinger equation with a position dependent effective mass exhibiting a harmonic oscillator like spectrum. We also discuss the underlying nonlinear algebraic symmetry of the problem.
Applied Algebra: The Modeling Technique of Least Squares
ERIC Educational Resources Information Center
Zelkowski, Jeremy; Mayes, Robert
2008-01-01
The article focuses on engaging students in algebra through modeling real-world problems. The technique of least squares is explored, encouraging students to develop a deeper understanding of the method. (Contains 2 figures and a bibliography.)
NASA Astrophysics Data System (ADS)
Claeys, Pieter W.; De Baerdemacker, Stijn; Van Raemdonck, Mario; Van Neck, Dimitri
2015-04-01
We propose an extension of the numerical approach for integrable Richardson-Gaudin models based on a new set of eigenvalue-based variables [A. Faribault et al., Phys. Rev. B 83, 235124 (2011), 10.1103/PhysRevB.83.235124; O. El Araby et al., Phys. Rev. B 85, 115130 (2012), 10.1103/PhysRevB.85.115130]. Starting solely from the Gaudin algebra, the approach is generalized towards the full class of XXZ Richardson-Gaudin models. This allows for a fast and robust numerical determination of the spectral properties of these models, avoiding the singularities usually arising at the so-called singular points. We also provide different determinant expressions for the normalization of the Bethe ansatz states and form factors of local spin operators, opening up possibilities for the study of larger systems, both integrable and nonintegrable. These expressions can be written in terms of the new set of variables and generalize the results previously obtained for rational Richardson-Gaudin models [A. Faribault and D. Schuricht, J. Phys. A 45, 485202 (2012), 10.1088/1751-8113/45/48/485202] and Dicke-Jaynes-Cummings-Gaudin models [H. Tschirhart and A. Faribault, J. Phys. A 47, 405204 (2014), 10.1088/1751-8113/47/40/405204]. Remarkably, these results are independent of the explicit parametrization of the Gaudin algebra, exposing a universality in the properties of Richardson-Gaudin integrable systems deeply linked to the underlying algebraic structure.
Unstable transient response of gyroscopic systems with stable eigenvalues
NASA Astrophysics Data System (ADS)
Giannini, O.
2016-06-01
Gyroscopic conservative dynamical systems may exhibit flutter instability that leads to a pair of complex conjugate eigenvalues, one of which has a positive real part and thus leads to a divergent free response of the system. When dealing with non-conservative systems, the pitch fork bifurcation shifts toward the negative real part of the root locus, presenting a pair of eigenvalues with equal imaginary parts, while the real parts may or may not be negative. Several works study the stability of these systems for relevant engineering applications such as the flutter in airplane wings or suspended bridges, brake squeal, etc. and a common approach to detect the stability is the complex eigenvalue analysis that considers systems with all negative real part eigenvalues as stable systems. This paper studies analytically and numerically the cases where the free response of these systems exhibits a transient divergent time history even if all the eigenvalues have negative real part thus usually considered as stable, and relates such a behaviour to the non orthogonality of the eigenvectors. Finally, a numerical method to evaluate the presence of such instability is proposed.
Ternary diffusion path in terms of eigenvalues and eigenvectors
NASA Astrophysics Data System (ADS)
Ram-Mohan, L. R.; Dayananda, Mysore A.
2016-04-01
Based on the transfer matrix methodology, a new analysis is presented for the description of slopes of the ternary diffusion path for a solid-solid diffusion couple. Concentration profiles and diffusion paths for isothermal, ternary diffusion couples are examined in the context of eigenvalues and eigenvectors obtained from the diagonalisation of the ? ternary interdiffusion coefficients employed for their representation. New relations are derived relating the decoupled interdiffusion fluxes to combinations of concentration gradients through the major and minor eigenvalues, and the diffusion path becomes parallel to the major eigenvector at each path end. General expressions for the slope of the ternary diffusion path at any section of the couple are also derived in terms of eigenvalue and eigenvector parameters. Expressions for the path slope at the Matano plane involve only concentrations, major and minor eigenvalues and eigenvector parameters. New constraints relating the eigenvalues and the concentration gradients of the individual components are also presented at selected sections, where the diffusion path is parallel to the straight line joining the terminal composition points on an isotherm. Applications of the various relations are illustrated with the aid of a hypothetical couple and an experimental Cu-Ni-Zn diffusion couple.
NASA Astrophysics Data System (ADS)
Mishakin, S. V.; Samsonov, S. V.
2011-08-01
We present a method for calculating the dispersion characteristics of eigenmodes of metal waveguides with helical corrugations on the inner surface, which is based on the transition to a new nonorthogonal system of coordinates. In the new coordinate system, the problem of finding helical-waveguide modes is rigorously equivalent to the problem of finding the modes of a circular unitradius waveguide which has an anisotropic filling and is homogenous in the longitudinal direction. To solve the equivalent problem, we expand the field of the desired eigenmode in the modes of an empty circular unit-radius waveguide. As a result, the problem is reduced to solving a generalized algebraic eigenvalue problem. The comparison with the results of earlier three-dimensional calculations shows that the developed method allows one to determine characteristics of helical-waveguides with sufficient accuracy for many important applications and requires much lower calculation costs.
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…
q-graded Heisenberg algebras and deformed supersymmetries
Ben Geloun, Joseph; Hounkonnou, Mahouton Norbert
2010-02-15
The notion of q-grading on the enveloping algebra generated by products of q-deformed Heisenberg algebras is introduced for q complex number in the unit disk. Within this formulation, we consider the extension of the notion of supersymmetry in the enveloping algebra. We recover the ordinary Z{sub 2} grading or Grassmann parity for associative superalgebra and a modified version of the usual supersymmetry. As a specific problem, we focus on the interesting limit q{yields}-1 for which the Arik and Coon deformation [J. Math. Phys. 17, 524 (1976)] of the Heisenberg algebra allows one to map fermionic modes to bosonic ones in a modified sense. Different algebraic consequences are discussed.
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)
Clusters of eigenvalues for the magnetic Laplacian with Robin condition
NASA Astrophysics Data System (ADS)
Goffeng, Magnus; Kachmar, Ayman; Persson Sundqvist, Mikael
2016-06-01
We study the Schrödinger operator with a constant magnetic field in the exterior of a compact domain in Euclidean space. Functions in the domain of the operator are subject to a boundary condition of the third type (a magnetic Robin condition). In addition to the Landau levels, we obtain that the spectrum of this operator consists of clusters of eigenvalues around the Landau levels and that they do accumulate to the Landau levels from below. We give a precise asymptotic formula for the rate of accumulation of eigenvalues in these clusters, which is independent of the boundary condition.
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…
Situating the Debate on "Geometrical Algebra" within the Framework of Premodern Algebra.
Sialaros, Michalis; Christianidis, Jean
2016-06-01
Argument The aim of this paper is to employ the newly contextualized historiographical category of "premodern algebra" in order to revisit the arguably most controversial topic of the last decades in the field of Greek mathematics, namely the debate on "geometrical algebra." Within this framework, we shift focus from the discrepancy among the views expressed in the debate to some of the historiographical assumptions and methodological approaches that the opposing sides shared. Moreover, by using a series of propositions related to Elem. II.5 as a case study, we discuss Euclid's geometrical proofs, the so-called "semi-algebraic" alternative demonstrations attributed to Heron of Alexandria, as well as the solutions given by Diophantus, al-Sulamī, and al-Khwārizmī to the corresponding numerical problem. This comparative analysis offers a new reading of Heron's practice, highlights the significance of contextualizing "premodern algebra," and indicates that the origins of algebraic reasoning should be sought in the problem-solving practice, rather than in the theorem-proving tradition. PMID:27171890
Situating the Debate on "Geometrical Algebra" within the Framework of Premodern Algebra.
Sialaros, Michalis; Christianidis, Jean
2016-06-01
Argument The aim of this paper is to employ the newly contextualized historiographical category of "premodern algebra" in order to revisit the arguably most controversial topic of the last decades in the field of Greek mathematics, namely the debate on "geometrical algebra." Within this framework, we shift focus from the discrepancy among the views expressed in the debate to some of the historiographical assumptions and methodological approaches that the opposing sides shared. Moreover, by using a series of propositions related to Elem. II.5 as a case study, we discuss Euclid's geometrical proofs, the so-called "semi-algebraic" alternative demonstrations attributed to Heron of Alexandria, as well as the solutions given by Diophantus, al-Sulamī, and al-Khwārizmī to the corresponding numerical problem. This comparative analysis offers a new reading of Heron's practice, highlights the significance of contextualizing "premodern algebra," and indicates that the origins of algebraic reasoning should be sought in the problem-solving practice, rather than in the theorem-proving tradition.
Factors influencing the algebra ``reversal error''
NASA Astrophysics Data System (ADS)
Cohen, Elaine; Kanim, Stephen E.
2005-11-01
Given a written problem statement about a proportional relationship between two quantities, many students will place the constant of proportionality on the wrong side of the equals sign. Introductory physics is one of the first courses in which students encounter multiple-step problems that require algebraic (rather than numeric) solutions, and this "reversal error" is relatively common in student solutions to these types of problems. We describe an investigation into three possible influences on students who make this reversal error: variable symbol choice, sentence structure, and context familiarity. Our results, from a calculus-based physics course and an intermediate algebra course, show that sentence structure is the most significant of these three possibilities. However, sentence structure alone does not provide a complete explanation for the reversal error.
Laouar, A; Guerziz, A; Boussaha, A
2016-01-01
This paper focuses on the mathematical study of the existence of solitary gravity waves (solitons) and their characteristics (amplitude, velocity, [Formula: see text]) generated by a piston wave maker lying upstream of a horizontal channel. The mathematical model requires both incompressibility condition, irrotational flow of no viscous fluid and Lagrange coordinates. By using both the inverse scattering method and a given initial potential [Formula: see text] we can transform the KdV equation into Sturm-Liouville spectral problem. The latter problem amounts to find negative discrete eigenvalues [Formula: see text] and associated eigenfunctions [Formula: see text], where each calculated eigenvalue [Formula: see text] gives a soliton and the profile of the free surface. For solving this problem, we can use the Runge-Kutta method. For illustration, two examples of the wave maker movement are proposed. The numerical simulations show that the perturbation of wave maker with hyperbolic tangent displacement under physical conditions affect the number of solitons emitted. PMID:27606157
Development of a SCALE Tool for Continuous-Energy Eigenvalue Sensitivity Coefficient Calculations
NASA Astrophysics Data System (ADS)
Perfetti, Christopher M.; Rearden, Bradley T.
2014-06-01
Two methods for calculating eigenvalue sensitivity coefficients in continuous-energy Monte Carlo applications were implemented in the KENO code within the SCALE code package. The methods were used to calculate sensitivity coefficients for several criticality safety problems and produced sensitivity coefficients that agreed well with both reference sensitivities and multigroup TSUNAMI-3D sensitivity coefficients. The newly developed CLUTCH method was observed to produce sensitivity coefficients with high figures of merit and low memory requirements, and both continuous-energy sensitivity methods met or exceeded the accuracy of the multigroup TSUNAMI-3D calculations.
Development of a SCALE Tool for Continuous-Energy Eigenvalue Sensitivity Coefficient Calculations
Perfetti, Christopher M; Rearden, Bradley T
2013-01-01
Two methods for calculating eigenvalue sensitivity coefficients in continuous-energy Monte Carlo applications were implemented in the KENO code within the SCALE code package. The methods were used to calculate sensitivity coefficients for several criticality safety problems and produced sensitivity coefficients that agreed well with both reference sensitivities and multigroup TSUNAMI-3D sensitivity coefficients. The newly developed CLUTCH method was observed to produce sensitivity coefficients with high figures of merit and low memory requirements, and both continuous-energy sensitivity methods met or exceeded the accuracy of the multigroup TSUNAMI-3D calculations.
Continuous-energy eigenvalue sensitivity coefficient calculations in TSUNAMI-3D
Perfetti, C. M.; Rearden, B. T.
2013-07-01
Two methods for calculating eigenvalue sensitivity coefficients in continuous-energy Monte Carlo applications were implemented in the KENO code within the SCALE code package. The methods were used to calculate sensitivity coefficients for several test problems and produced sensitivity coefficients that agreed well with both reference sensitivities and multigroup TSUNAMI-3D sensitivity coefficients. The newly developed CLUTCH method was observed to produce sensitivity coefficients with high figures of merit and a low memory footprint, and both continuous-energy sensitivity methods met or exceeded the accuracy of the multigroup TSUNAMI-3D calculations. (authors)
Asymptotic behaviour of an eigenvalue in the continuous spectrum of a narrowed waveguide
Cardone, Giuseppe; Nazarov, Sergei A; Ruotsalainen, K
2012-02-28
The existence of an eigenvalue embedded in the continuous spectrum is proved for the Neumann problem for Helmholtz's equation in a two-dimensional waveguide with two outlets to infinity which are half-strips of width 1 and 1-{epsilon}, where {epsilon}>0 is a small parameter. The width function of the part of the waveguide connecting these outlets is of order {radical}({epsilon}); it is defined as a linear combination of three fairly arbitrary functions, whose coefficients are obtained from a certain nonlinear equation. The result is derived from an asymptotic analysis of an auxiliary object, the augmented scattering matrix. Bibliography: 29 titles.
Fibonacci's Triangle: A Vehicle for Problem Solving.
ERIC Educational Resources Information Center
Ouellette, Hugh
1979-01-01
A method for solving certain types of problems is illustrated by problems related to Fibonacci's triangle. The method involves pattern recognition, generalizing, algebraic manipulation, and mathematical induction. (MP)
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,…
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…
Mitter conjecture and structure theorem for six-dimensional estimation algebras
NASA Astrophysics Data System (ADS)
Jiao, Yang; Yau, Stephen; Chiou, Wen-Lin
2013-01-01
The problem of classification of finite-dimensional estimation algebras was formally proposed by Brockett in his lecture at International Congress of Mathematicians in 1983. Due to the difficulty of the problem, in the early 1990s Brockett suggested that one should understand the low-dimensional estimation algebras first. In this article, we extend Yau and his coauthors' work of the Mitter conjecture for low-dimensional estimation algebras in nonlinear filtering problem. And, we apply the results to give classification of estimation algebras of dimension six.
Confluences of the Painlevé equations, Cherednik algebras and q-Askey scheme
NASA Astrophysics Data System (ADS)
Mazzocco, Marta
2016-09-01
In this paper we produce seven new algebras as confluences of the Cherednik algebra of type \\check {{{{C}1}}} {{C}1} and we characterise their spherical-sub-algebras. The limit of the spherical sub-algebra of the Cherednik algebra of type \\check {{{{C}1}}} {{C}1} is the monodromy manifold of the Painlevé VI equation (Oblomkov 2004 Int. Math. Res. Not. 2004 877–912). Here we prove that by considering the limits of the spherical sub-algebras of our new confluent algebras, one obtains the monodromy manifolds of all other Painlevé differential equations. Moreover, we introduce confluent versions of the Zhedanov algebra and prove that each of them (quotiented by their Casimir) is isomorphic to the corresponding spherical sub-algebra of our new confluent Cherednik algebras. We show that in the basic representation our confluent Zhedanov algebras act as symmetries of certain elements of the q-Askey scheme, thus setting a stepping stone towards the solution of the open problem of finding the corresponding quantum algebra for each element of the q-Askey scheme. These results establish a new link between the theory of the Painlevé equations and the theory of the q-Askey scheme making a step towards the construction of a representation theoretic approach for the Painlevé theory.
Confluences of the Painlevé equations, Cherednik algebras and q-Askey scheme
NASA Astrophysics Data System (ADS)
Mazzocco, Marta
2016-09-01
In this paper we produce seven new algebras as confluences of the Cherednik algebra of type \\check {{{{C}1}}} {{C}1} and we characterise their spherical-sub-algebras. The limit of the spherical sub-algebra of the Cherednik algebra of type \\check {{{{C}1}}} {{C}1} is the monodromy manifold of the Painlevé VI equation (Oblomkov 2004 Int. Math. Res. Not. 2004 877-912). Here we prove that by considering the limits of the spherical sub-algebras of our new confluent algebras, one obtains the monodromy manifolds of all other Painlevé differential equations. Moreover, we introduce confluent versions of the Zhedanov algebra and prove that each of them (quotiented by their Casimir) is isomorphic to the corresponding spherical sub-algebra of our new confluent Cherednik algebras. We show that in the basic representation our confluent Zhedanov algebras act as symmetries of certain elements of the q-Askey scheme, thus setting a stepping stone towards the solution of the open problem of finding the corresponding quantum algebra for each element of the q-Askey scheme. These results establish a new link between the theory of the Painlevé equations and the theory of the q-Askey scheme making a step towards the construction of a representation theoretic approach for the Painlevé theory.
Reachability analysis of rational eigenvalue linear systems
NASA Astrophysics Data System (ADS)
Xu, Ming; Chen, Liangyu; Zeng, Zhenbing; Li, Zhi-bin
2010-12-01
One of the key problems in the safety analysis of control systems is the exact computation of reachable state spaces for continuous-time systems. Issues related to the controllability and observability of these systems are well-studied in systems theory. However, there are not many results on reachability, even for general linear systems. In this study, we present a large class of linear systems with decidable reachable state spaces. This is approached by reducing the reachability analysis to real root isolation of exponential polynomials. Furthermore, we have implemented this method in a Maple package based on symbolic computation and applied to several examples successfully.
Error estimations and their biases in Monte Carlo eigenvalue calculations
Ueki, Taro; Mori, Takamasa; Nakagawa, Masayuki
1997-01-01
In the Monte Carlo eigenvalue calculation of neutron transport, the eigenvalue is calculated as the average of multiplication factors from cycles, which are called the cycle k{sub eff}`s. Biases in the estimators of the variance and intercycle covariances in Monte Carlo eigenvalue calculations are analyzed. The relations among the real and apparent values of variances and intercycle covariances are derived, where real refers to a true value that is calculated from independently repeated Monte Carlo runs and apparent refers to the expected value of estimates from a single Monte Carlo run. Next, iterative methods based on the foregoing relations are proposed to estimate the standard deviation of the eigenvalue. The methods work well for the cases in which the ratios of the real to apparent values of variances are between 1.4 and 3.1. Even in the case where the foregoing ratio is >5, >70% of the standard deviation estimates fall within 40% from the true value.
Eigenvalue spectrum of lattice N=4 super Yang-Mills
NASA Astrophysics Data System (ADS)
Weir, D.; Catterall, S.; Mehta, D. B.
We present preliminary results for the eigenvalue spectrum of four-dimensional ${\\cal N}=4$ super Yang-Mills theory on the lattice. In particular, by studying the the spectral density a measurement of the anomalous dimension is made and found to be consistent with zero.
A Schwinger Term in q-Deformed su(2) Algebra
NASA Astrophysics Data System (ADS)
Fujikawa, Kazuo; Kubo, Harunobu; Oh, C. H.
An extra term generally appears in the q-deformed su(2) algebra for the deformation parameter q=exp2π iθ, if one combines the Biedenharn-Macfarlane construction of q-deformed su(2), which is a generalization of Schwinger's construction of conventional su(2), with the representation of the q-deformed oscillator algebra which is manifestly free of negative norm. This extra term introduced by the requirement of positive norm is analogous to the Schwinger term in current algebra. Implications of this extra term on the Bloch electron problem analyzed by Wiegmann and Zabrodin are briefly discussed.
Deformable target tracking method based on Lie algebra
NASA Astrophysics Data System (ADS)
Liu, Yunpeng; Shi, Zelin; Li, Guangwei
2007-11-01
Conventional approaches to object tracking use area correlation, but they are difficult to solve the problem of deformation of object region during tracking. A novel target tracking method based on Lie algebra is presented. We use Gabor feature as target token, model deformation using affine Lie group, and optimize parameters directly on manifold, which can be solved by exponential mapping between Lie Group and its Lie algebra. We analyze the essence of our method and test the algorithm using real image sequences. The experimental results demonstrate that Lie algebra method outperforms other traditional algorithms in efficiency, stabilization and accuracy.
Numerical solution to systems of delay integrodifferential algebraic equations
NASA Astrophysics Data System (ADS)
Dmitriev, S. S.; Kuznetsov, E. B.
2008-03-01
The numerical solution of the initial value problem for a system of delay integrodifferential algebraic equations is examined in the framework of the parametric continuation method. Necessary and sufficient conditions are obtained for transforming this problem to the best argument, which is the arc length along the integral curve of the problem. The efficiency of the transformation is demonstrated using test examples.
Maximizing algebraic connectivity in air transportation networks
NASA Astrophysics Data System (ADS)
Wei, Peng
In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the
Massless conformal fields, AdS(d + 1)/CFTd higher spin algebras and their deformations
NASA Astrophysics Data System (ADS)
Fernando, Sudarshan; Günaydin, Murat
2016-03-01
We extend our earlier work on the minimal unitary representation of SO (d , 2) and its deformations for d = 4 , 5 and 6 to arbitrary dimensions d. We show that there is a one-to-one correspondence between the minrep of SO (d , 2) and its deformations and massless conformal fields in Minkowskian spacetimes in d dimensions. The minrep describes a massless conformal scalar field, and its deformations describe massless conformal fields of higher spin. The generators of Joseph ideal vanish identically as operators for the quasiconformal realization of the minrep, and its enveloping algebra yields directly the standard bosonic AdS (d + 1) /CFTd higher spin algebra. For deformed minreps the generators of certain deformations of Joseph ideal vanish as operators and their enveloping algebras lead to deformations of the standard bosonic higher spin algebra. In odd dimensions there is a unique deformation of the higher spin algebra corresponding to the spinor singleton. In even dimensions one finds infinitely many deformations of the higher spin algebra labelled by the eigenvalues of Casimir operator of the little group SO (d - 2) for massless representations.
Algebraic criteria for positive realness relative to the unit circle.
NASA Technical Reports Server (NTRS)
Siljak, D. D.
1973-01-01
A definition is presented of the circle positive realness of real rational functions relative to the unit circle in the complex variable plane. The problem of testing this kind of positive reality is reduced to the algebraic problem of determining the distribution of zeros of a real polynomial with respect to and on the unit circle. Such reformulation of the problem avoids the search for explicit information about imaginary poles of rational functions. The stated algebraic problem is solved by applying the polynomial criteria of Marden (1966) and Jury (1964), and a completely recursive algorithm for circle positive realness is obtained.
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.
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
Linear Algebraic Method for Non-Linear Map Analysis
Yu,L.; Nash, B.
2009-05-04
We present a newly developed method to analyze some non-linear dynamics problems such as the Henon map using a matrix analysis method from linear algebra. Choosing the Henon map as an example, we analyze the spectral structure, the tune-amplitude dependence, the variation of tune and amplitude during the particle motion, etc., using the method of Jordan decomposition which is widely used in conventional linear algebra.
Selecting reusable components using algebraic specifications
NASA Technical Reports Server (NTRS)
Eichmann, David A.
1992-01-01
A significant hurdle confronts the software reuser attempting to select candidate components from a software repository - discriminating between those components without resorting to inspection of the implementation(s). We outline a mixed classification/axiomatic approach to this problem based upon our lattice-based faceted classification technique and Guttag and Horning's algebraic specification techniques. This approach selects candidates by natural language-derived classification, by their interfaces, using signatures, and by their behavior, using axioms. We briefly outline our problem domain and related work. Lattice-based faceted classifications are described; the reader is referred to surveys of the extensive literature for algebraic specification techniques. Behavioral support for reuse queries is presented, followed by the conclusions.
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®,…
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.
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.
Graphs and Matroids Weighted in a Bounded Incline Algebra
Lu, Ling-Xia; Zhang, Bei
2014-01-01
Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied. PMID:25126607
Graphs and matroids weighted in a bounded incline algebra.
Lu, Ling-Xia; Zhang, Bei
2014-01-01
Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied. PMID:25126607
Graphs and matroids weighted in a bounded incline algebra.
Lu, Ling-Xia; Zhang, Bei
2014-01-01
Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.
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.
Eigenvalues of the Neumann Laplacian in symmetric regions
NASA Astrophysics Data System (ADS)
Marrocos, Marcus A. M.; Pereira, Antônio L.
2015-11-01
In this work, we are concerned with the multiplicity of the eigenvalues of the Neumann Laplacian in regions of ℝn which are invariant under the natural action of a compact subgroup G of O(n). We give a partial positive answer (in the Neumann case) to a conjecture of Arnol'd [Funct. Anal. Appl. 6, 94-101 (1972)] on the transversality of the transformation given by the Dirichlet integral to the stratification in the space of quadratic forms according to the multiplicities of the eigenvalues. We show, for some classes of subgroups of O(n) that, generically in the set of G - invariant, C 2 -regions, the action is irreducible in each eigenspace Ker(Δ + λ). These classes include finite subgroups with irreducible representations of dimension not greater than 2 and, in the case n = 2, any compact subgroup of O(2). We also obtain some partial results for general compact subgroups of O(n).
Network and eigenvalue analysis of financial transaction networks
NASA Astrophysics Data System (ADS)
Kyriakopoulos, F.; Thurner, S.; Puhr, C.; Schmitz, S. W.
2009-10-01
We study a dataset containing all financial transactions between the accounts of practically all major financial players within Austria over one year. We empirically analyze transaction networks of money (in and out) flows and report the characteristic network parameters. We observe a significant dependence of network topology on the time scales of observation, and remarkably low correlation between node degrees and transaction volume. We further use transaction timeseries of the financial agents to compute covariance matrices and their eigenvalue spectra. Eigenvectors corresponding to eigenvalues deviating from the Marcenko-Pastur law are analyzed in detail. The potential for practical use as an automated detection mechanism for abnormal behavior of financial players is discussed. The opinion expressed in this paper is that of the authors and does not necessarily reflect the opinion of the OeNB or the ESCB. in here
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…
On Fluctuations of Eigenvalues of Random Band Matrices
NASA Astrophysics Data System (ADS)
Shcherbina, M.
2015-10-01
We consider the fluctuations of linear eigenvalue statistics of random band matrices whose entries have the form with i.i.d. possessing the th moment, where the function u has a finite support , so that M has only nonzero diagonals. The parameter b (called the bandwidth) is assumed to grow with n in a way such that . Without any additional assumptions on the growth of b we prove CLT for linear eigenvalue statistics for a rather wide class of test functions. Thus we improve and generalize the results of the previous papers (Jana et al., arXiv:1412.2445; Li et al. Random Matrices 2:04, 2013), where CLT was proven under the assumption . Moreover, we develop a method which allows to prove automatically the CLT for linear eigenvalue statistics of the smooth test functions for almost all classical models of random matrix theory: deformed Wigner and sample covariance matrices, sparse matrices, diluted random matrices, matrices with heavy tales etc.
Diagnosing Undersampling in Monte Carlo Eigenvalue and Flux Tally Estimates
Perfetti, Christopher M; Rearden, Bradley T
2015-01-01
This study explored the impact of undersampling on the accuracy of tally estimates in Monte Carlo (MC) calculations. Steady-state MC simulations were performed for models of several critical systems with varying degrees of spatial and isotopic complexity, and the impact of undersampling on eigenvalue and fuel pin flux/fission estimates was examined. This study observed biases in MC eigenvalue estimates as large as several percent and biases in fuel pin flux/fission tally estimates that exceeded tens, and in some cases hundreds, of percent. This study also investigated five statistical metrics for predicting the occurrence of undersampling biases in MC simulations. Three of the metrics (the Heidelberger-Welch RHW, the Geweke Z-Score, and the Gelman-Rubin diagnostics) are commonly used for diagnosing the convergence of Markov chains, and two of the methods (the Contributing Particles per Generation and Tally Entropy) are new convergence metrics developed in the course of this study. These metrics were implemented in the KENO MC code within the SCALE code system and were evaluated for their reliability at predicting the onset and magnitude of undersampling biases in MC eigenvalue and flux tally estimates in two of the critical models. Of the five methods investigated, the Heidelberger-Welch RHW, the Gelman-Rubin diagnostics, and Tally Entropy produced test metrics that correlated strongly to the size of the observed undersampling biases, indicating their potential to effectively predict the size and prevalence of undersampling biases in MC simulations.
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.
Algebraic Modeling of Information Retrieval in XML Documents
NASA Astrophysics Data System (ADS)
Georgiev, Bozhidar; Georgieva, Adriana
2009-11-01
This paper presents an information retrieval approach in XML documents using tools, based on the linear algebra. The well-known transformation languages as XSLT (XPath) are grounded on the features of higher-order logic for manipulating hierarchical trees. The presented conception is compared to existing higher-order logic formalisms, where the queries are realized by both languages XSLT and XPath. The possibilities of the proposed linear algebraic model combined with hierarchy data models permit more efficient solutions for searching, extracting and manipulating semi-structured data with hierarchical structures avoiding the global navigation over the XML tree components. The main purpose of this algebraic model representation, applied to the hierarchical relationships in the XML data structures, is to make the implementation of linear algebra tools possible for XML data manipulations and to eliminate existing problems, related to regular grammars theory and also to avoid the difficulties, connected with higher -order logic (first-order logic, monadic second- order logic etc.).
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
Perturbation method for the floquet eigenvalues and stability boundary of periodic linear systems
NASA Astrophysics Data System (ADS)
Wu, W.-T.; Griffin, J. H.; Wickert, J. A.
1995-04-01
A multiple parameter perturbation method is developed to determine the Floquet eigenvalues and stability boundary of a linear discrete system that is described by a system of ordinary differential equations with periodic coefficients. In the method, the state of the system is determined by solving a number of decoupled problems and, as a result, implementation of the method is computationally efficient even when the dimension of the system is large. The method is first applied to Mathieu's equation in order to illustrate its application to a relatively straightforward, standard problem. It is then applied to the torsional analysis of a boat's drive train to show application to a large scale system of some practical importance.
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…
Hidden algebra method (quasi-exact-solvability in quantum mechanics)
Turbiner, Alexander
1996-02-20
A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland N-body problems ass ociated with an existence of the hidden algebra slN is discussed extensively.
Clearing the Fog from the Undergraduate Course in Linear Algebra
ERIC Educational Resources Information Center
Scott, Damon
2007-01-01
For over a decade it has been a common observation that a "fog" passes over the course in linear algebra once abstract vector spaces are presented. See [2, 3]. We show how this fog may be cleared by having the students translate "abstract" vector-space problems to isomorphic "concrete" settings, solve the "concrete" problem either by hand or with…
Acoustooptic linear algebra processors - Architectures, algorithms, and applications
NASA Technical Reports Server (NTRS)
Casasent, D.
1984-01-01
Architectures, algorithms, and applications for systolic processors are described with attention to the realization of parallel algorithms on various optical systolic array processors. Systolic processors for matrices with special structure and matrices of general structure, and the realization of matrix-vector, matrix-matrix, and triple-matrix products and such architectures are described. Parallel algorithms for direct and indirect solutions to systems of linear algebraic equations and their implementation on optical systolic processors are detailed with attention to the pipelining and flow of data and operations. Parallel algorithms and their optical realization for LU and QR matrix decomposition are specifically detailed. These represent the fundamental operations necessary in the implementation of least squares, eigenvalue, and SVD solutions. Specific applications (e.g., the solution of partial differential equations, adaptive noise cancellation, and optimal control) are described to typify the use of matrix processors in modern advanced signal processing.
A numerical study of the temporal eigenvalue spectrum of the Blasius boundary layer
NASA Technical Reports Server (NTRS)
Mack, L. M.
1976-01-01
A numerical study is made of the temporal eigenvalue spectrum of the Orr-Sommerfeld equation for the Blasius boundary layer. Unlike channel flows, there is no mathematical proof that this flow has an infinite spectrum of discrete eigenvalues. The Orr-Sommerfeld equation is integrated numerically, and the eigenvalues located by tracing out the contour lines in the complex wave velocity plane on which the real and imaginary parts of the secular determinant are zero. The spectrum of plane Poiseuille flow is used as a guide to study the spectrum of an artificial two-wall flow which consists of two Blasius boundary layers. As the upper boundary of this flow moves to infinity, it is found that the portion of the spectrum with an infinite number of eigenvalues moves towards phase velocity equal to unity and the spacing between eigenvalues goes to zero. The original few eigenvalues found are the only discrete eigenvalues that exist for Blasius flow.
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
NASA Astrophysics Data System (ADS)
Ramakrishnan, Raghunathan; Nest, Mathias; Pollak, Eli
2012-05-01
Three different methods that are based on the coherent control of a time evolved wavefunction are used to determine the eigenvalues of Hermitian matrices. These methods are of special interest for determining eigenvalues of very large matrices and they replace the standard matrix diagonalization by a minimization problem of a few optimal time or phase variables. Upon inversion, the optimal time or phase variables directly provide the energies of higher eigenstates spanned by the initial wavefunction, without having to compute the wavefunctions themselves. The methods are applied to determine the electronic energies of the He and C atoms as well as a model harmonic oscillator system. All three methods scale as N 2 for a matrix whose dimension is N and they use as input only the overlap of the time evolved initial wavefunction with itself.
2004-04-21
Version 04 NESTLE solves the few-group neutron diffusion equation utilizing the NEM. The NESTLE code can solve the eigenvalue (criticality), eigenvalue adjoint, external fixed-source steady-state, and external fixed-source or eigenvalue initiated transient problems. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two- ormore » four-energy groups can be utilized, with all energy groups being thermal groups (i.e., upscatter exits) if desired. Core geometries modeled include Cartesian and hexagonal. Three-, two-, and one-dimensional models can be utilized with various symmetries. The thermal conditions predicted by the thermal-hydraulic model of the core are used to correct cross sections for temperature and density effects. Cross sections are parameterized by color, control rod state (i.e., in or out), and burnup, allowing fuel depletion to be modeled. Either a macroscopic or microscopic model may be employed.« 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.)
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.
The coquaternion algebra and complex partial differential equations
NASA Astrophysics Data System (ADS)
Dimiev, Stancho; Konstantinov, Mihail; Todorov, Vladimir
2009-11-01
In this paper we consider the problem of differentiation of coquaternionic functions. Let us recall that coquaternions are elements of an associative non-commutative real algebra with zero divisor, introduced by James Cockle (1849) under the name of split-quaternions or coquaternions. Developing two type complex representations for Cockle algebra (complex and paracomplex ones) we present the problem in a non-commutative form of the δ¯-type holomorphy. We prove that corresponding differentiable coquaternionic functions, smooth and analytic, satisfy PDE of complex, and respectively of real variables. Applications for coquaternionic polynomials are sketched.
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
Computer algebra methods in the study of nonlinear differential systems
NASA Astrophysics Data System (ADS)
Irtegov, V. D.; Titorenko, T. N.
2013-06-01
Some issues concerning computer algebra methods as applied to the qualitative analysis of differential equations with first integrals are discussed. The problems of finding stationary sets and analyzing their stability and bifurcations are considered. Special attention is given to algorithms for finding and analyzing peculiar stationary sets. It is shown that computer algebra tools, combined with qualitative analysis methods for differential equations, make it possible not only to enhance the computational efficiency of classical algorithms, but also to implement new approaches to the solution of well-known problems and, in this way, to obtain new results.
The noncommutative Poisson bracket and the deformation of the family algebras
Wei, Zhaoting
2015-07-15
The family algebras are introduced by Kirillov in 2000. In this paper, we study the noncommutative Poisson bracket P on the classical family algebra C{sub τ}(g). We show that P controls the first-order 1-parameter formal deformation from C{sub τ}(g) to Q{sub τ}(g) where the latter is the quantum family algebra. Moreover, we will prove that the noncommutative Poisson bracket is in fact a Hochschild 2-coboundary, and therefore, the deformation is infinitesimally trivial. In the last part of this paper, we discuss the relation between Mackey’s analogue and the quantization problem of the family algebras.
Sixth SIAM conference on applied linear algebra: Final program and abstracts. Final technical report
1997-12-31
Linear algebra plays a central role in mathematics and applications. The analysis and solution of problems from an amazingly wide variety of disciplines depend on the theory and computational techniques of linear algebra. In turn, the diversity of disciplines depending on linear algebra also serves to focus and shape its development. Some problems have special properties (numerical, structural) that can be exploited. Some are simply so large that conventional approaches are impractical. New computer architectures motivate new algorithms, and fresh ways to look at old ones. The pervasive nature of linear algebra in analyzing and solving problems means that people from a wide spectrum--universities, industrial and government laboratories, financial institutions, and many others--share an interest in current developments in linear algebra. This conference aims to bring them together for their mutual benefit. Abstracts of papers presented are included.
SD-CAS: Spin Dynamics by Computer Algebra System.
Filip, Xenia; Filip, Claudiu
2010-11-01
A computer algebra tool for describing the Liouville-space quantum evolution of nuclear 1/2-spins is introduced and implemented within a computational framework named Spin Dynamics by Computer Algebra System (SD-CAS). A distinctive feature compared with numerical and previous computer algebra approaches to solving spin dynamics problems results from the fact that no matrix representation for spin operators is used in SD-CAS, which determines a full symbolic character to the performed computations. Spin correlations are stored in SD-CAS as four-entry nested lists of which size increases linearly with the number of spins into the system and are easily mapped into analytical expressions in terms of spin operator products. For the so defined SD-CAS spin correlations a set of specialized functions and procedures is introduced that are essential for implementing basic spin algebra operations, such as the spin operator products, commutators, and scalar products. They provide results in an abstract algebraic form: specific procedures to quantitatively evaluate such symbolic expressions with respect to the involved spin interaction parameters and experimental conditions are also discussed. Although the main focus in the present work is on laying the foundation for spin dynamics symbolic computation in NMR based on a non-matrix formalism, practical aspects are also considered throughout the theoretical development process. In particular, specific SD-CAS routines have been implemented using the YACAS computer algebra package (http://yacas.sourceforge.net), and their functionality was demonstrated on a few illustrative examples.
SD-CAS: Spin Dynamics by Computer Algebra System
NASA Astrophysics Data System (ADS)
Filip, Xenia; Filip, Claudiu
2010-11-01
A computer algebra tool for describing the Liouville-space quantum evolution of nuclear 1/2-spins is introduced and implemented within a computational framework named Spin Dynamics by Computer Algebra System (SD-CAS). A distinctive feature compared with numerical and previous computer algebra approaches to solving spin dynamics problems results from the fact that no matrix representation for spin operators is used in SD-CAS, which determines a full symbolic character to the performed computations. Spin correlations are stored in SD-CAS as four-entry nested lists of which size increases linearly with the number of spins into the system and are easily mapped into analytical expressions in terms of spin operator products. For the so defined SD-CAS spin correlations a set of specialized functions and procedures is introduced that are essential for implementing basic spin algebra operations, such as the spin operator products, commutators, and scalar products. They provide results in an abstract algebraic form: specific procedures to quantitatively evaluate such symbolic expressions with respect to the involved spin interaction parameters and experimental conditions are also discussed. Although the main focus in the present work is on laying the foundation for spin dynamics symbolic computation in NMR based on a non-matrix formalism, practical aspects are also considered throughout the theoretical development process. In particular, specific SD-CAS routines have been implemented using the YACAS computer algebra package (http://yacas.sourceforge.net), and their functionality was demonstrated on a few illustrative examples.
How many eigenvalues of a Gaussian random matrix are positive?
Majumdar, Satya N.; Nadal, Celine; Scardicchio, Antonello; Vivo, Pierpaolo
2011-04-15
We study the probability distribution of the index N{sub +}, i.e., the number of positive eigenvalues of an NxN Gaussian random matrix. We show analytically that, for large N and large N{sub +} with the fraction 0{<=}c=N{sub +}/N{<=}1 of positive eigenvalues fixed, the index distribution P(N{sub +}=cN,N){approx}exp[-{beta}N{sup 2}{Phi}(c)] where {beta} is the Dyson index characterizing the Gaussian ensemble. The associated large deviation rate function {Phi}(c) is computed explicitly for all 0{<=}c{<=}1. It is independent of {beta} and displays a quadratic form modulated by a logarithmic singularity around c=1/2. As a consequence, the distribution of the index has a Gaussian form near the peak, but with a variance {Delta}(N) of index fluctuations growing as {Delta}(N){approx}lnN/{beta}{pi}{sup 2} for large N. For {beta}=2, this result is independently confirmed against an exact finite-N formula, yielding {Delta}(N)=lnN/2{pi}{sup 2}+C+O(N{sup -1}) for large N, where the constant C for even N has the nontrivial value C=({gamma}+1+3ln2)/2{pi}{sup 2}{approx_equal}0.185 248... and {gamma}=0.5772... is the Euler constant. We also determine for large N the probability that the interval [{zeta}{sub 1},{zeta}{sub 2}] is free of eigenvalues. Some of these results have been announced in a recent letter [Phys. Rev. Lett. 103, 220603 (2009)].
Sensitivity analysis of eigenvalues for an electro-hydraulic servomechanism
NASA Astrophysics Data System (ADS)
Stoia-Djeska, M.; Safta, C. A.; Halanay, A.; Petrescu, C.
2012-11-01
Electro-hydraulic servomechanisms (EHSM) are important components of flight control systems and their role is to control the movement of the flying control surfaces in response to the movement of the cockpit controls. As flight-control systems, the EHSMs have a fast dynamic response, a high power to inertia ratio and high control accuracy. The paper is devoted to the study of the sensitivity for an electro-hydraulic servomechanism used for an aircraft aileron action. The mathematical model of the EHSM used in this paper includes a large number of parameters whose actual values may vary within some ranges of uncertainty. It consists in a nonlinear ordinary differential equation system composed by the mass and energy conservation equations, the actuator movement equations and the controller equation. In this work the focus is on the sensitivities of the eigenvalues of the linearized homogeneous system, which are the partial derivatives of the eigenvalues of the state-space system with respect the parameters. These are obtained using a modal approach based on the eigenvectors of the state-space direct and adjoint systems. To calculate the eigenvalues and their sensitivity the system's Jacobian and its partial derivatives with respect the parameters are determined. The calculation of the derivative of the Jacobian matrix with respect to the parameters is not a simple task and for many situations it must be done numerically. The system stability is studied in relation with three parameters: m, the equivalent inertial load of primary control surface reduced to the actuator rod; B, the bulk modulus of oil and p a pressure supply proportionality coefficient. All the sensitivities calculated in this work are in good agreement with those obtained through recalculations.
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.
Eigenvalue Expansion Approach to Study Bio-Heat Equation
NASA Astrophysics Data System (ADS)
Khanday, M. A.; Nazir, Khalid
2016-07-01
A mathematical model based on Pennes bio-heat equation was formulated to estimate temperature profiles at peripheral regions of human body. The heat processes due to diffusion, perfusion and metabolic pathways were considered to establish the second-order partial differential equation together with initial and boundary conditions. The model was solved using eigenvalue method and the numerical values of the physiological parameters were used to understand the thermal disturbance on the biological tissues. The results were illustrated at atmospheric temperatures TA = 10∘C and 20∘C.
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)
Student Learning in Linear Algebra: The Gateways To Advance Mathematical Thinking Project.
ERIC Educational Resources Information Center
Manes, Michelle
This document provides a preliminary report of the study Gateways To Advance Mathematical Thinking (GAMT) run by Educational Development Center, Inc. (EDC). The study was designed to see what types of reasoning students who have recently completed a linear algebra course apply to problems in algebraic thinking. Student interviews were used as the…
Activities for Students: Biology as a Source for Algebra Equations--The Heart
ERIC Educational Resources Information Center
Horak, Virginia M.
2005-01-01
The high school course that integrated first year algebra with an introductory environmental biology/anatomy and physiology course, in order to solve algebra problems is discussed. Lessons and activities for the course were taken by identifying the areas where mathematics and biology content intervenes may help students understand biology concepts…
A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry
ERIC Educational Resources Information Center
Kalainoff, Melinda; Lachance, Russ; Riegner, Dawn; Biaglow, Andrew
2012-01-01
In this article, we report on a semester-long study of the incorporation into our general chemistry course, of advanced algebraic and computer algebra techniques for solving chemical equilibrium problems. The method presented here is an alternative to the commonly used concentration table method for describing chemical equilibria in general…
An Example of Competence-Based Learning: Use of Maxima in Linear Algebra for Engineers
ERIC Educational Resources Information Center
Diaz, Ana; Garcia, Alfonsa; de la Villa, Agustin
2011-01-01
This paper analyses the role of Computer Algebra Systems (CAS) in a model of learning based on competences. The proposal is an e-learning model Linear Algebra course for Engineering, which includes the use of a CAS (Maxima) and focuses on problem solving. A reference model has been taken from the Spanish Open University. The proper use of CAS is…
Heisenberg XXX Model with General Boundaries: Eigenvectors from Algebraic Bethe Ansatz
NASA Astrophysics Data System (ADS)
Belliard, Samuel; Crampé, Nicolas
2013-11-01
We propose a generalization of the algebraic Bethe ansatz to obtain the eigenvectors of the Heisenberg spin chain with general boundaries associated to the eigenvalues and the Bethe equations found recently by Cao et al. The ansatz takes the usual form of a product of operators acting on a particular vector except that the number of operators is equal to the length of the chain. We prove this result for the chains with small length. We obtain also an off-shell equation (i.e. satisfied without the Bethe equations) formally similar to the ones obtained in the periodic case or with diagonal boundaries.
Upper solution bounds of the continuous coupled algebraic Riccati matrix equation
NASA Astrophysics Data System (ADS)
Liu, Jianzhou; Zhang, Juan
2011-04-01
In this article, by using some matrix identities, we construct the equivalent form of the continuous coupled algebraic Riccati equation (CCARE). Further, with the aid of the eigenvalue inequalities of matrix's product, by solving the linear inequalities utilising the properties of M-matrix and its inverse matrix, new upper matrix bounds for the solutions of the CCARE are established, which improve and extend some of the recent results. Finally, a corresponding numerical example is proposed to illustrate the effectiveness of the derived results.
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.
Dhesi, G S; Ausloos, M
2016-06-01
Nowadays, strict finite size effects must be taken into account in condensed matter problems when treated through models based on lattices or graphs. On the other hand, the cases of directed bonds or links are known to be highly relevant in topics ranging from ferroelectrics to quotation networks. Combining these two points leads us to examine finite size random matrices. To obtain basic materials properties, the Green's function associated with the matrix has to be calculated. To obtain the first finite size correction, a perturbative scheme is hereby developed within the framework of the replica method. The averaged eigenvalue spectrum and the corresponding Green's function of Wigner random sign real symmetric N×N matrices to order 1/N are finally obtained analytically. Related simulation results are also presented. The agreement is excellent between the analytical formulas and finite size matrix numerical diagonalization results, confirming the correctness of the first-order finite size expression. PMID:27415216
Finite size effects in the averaged eigenvalue density of Wigner random-sign real symmetric matrices
NASA Astrophysics Data System (ADS)
Dhesi, G. S.; Ausloos, M.
2016-06-01
Nowadays, strict finite size effects must be taken into account in condensed matter problems when treated through models based on lattices or graphs. On the other hand, the cases of directed bonds or links are known to be highly relevant in topics ranging from ferroelectrics to quotation networks. Combining these two points leads us to examine finite size random matrices. To obtain basic materials properties, the Green's function associated with the matrix has to be calculated. To obtain the first finite size correction, a perturbative scheme is hereby developed within the framework of the replica method. The averaged eigenvalue spectrum and the corresponding Green's function of Wigner random sign real symmetric N ×N matrices to order 1 /N are finally obtained analytically. Related simulation results are also presented. The agreement is excellent between the analytical formulas and finite size matrix numerical diagonalization results, confirming the correctness of the first-order finite size expression.
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.
Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients
Kalchev, D
2012-04-02
This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-{rho}AMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the
Intergenerational Correlation in Monte Carlo k-Eigenvalue Calculation
Ueki, Taro
2002-06-15
This paper investigates intergenerational correlation in the Monte Carlo k-eigenvalue calculation of a neutron effective multiplicative factor. To this end, the exponential transform for path stretching has been applied to large fissionable media with localized highly multiplying regions because in such media an exponentially decaying shape is a rough representation of the importance of source particles. The numerical results show that the difference between real and apparent variances virtually vanishes for an appropriate value of the exponential transform parameter. This indicates that the intergenerational correlation of k-eigenvalue samples could be eliminated by the adjoint biasing of particle transport. The relation between the biasing of particle transport and the intergenerational correlation is therefore investigated in the framework of collision estimators, and the following conclusion has been obtained: Within the leading order approximation with respect to the number of histories per generation, the intergenerational correlation vanishes when immediate importance is constant, and the immediate importance under simulation can be made constant by the biasing of particle transport with a function adjoint to the source neutron's distribution, i.e., the importance over all future generations.
Improved staggered eigenvalues and epsilon regime universality in SU(2)
NASA Astrophysics Data System (ADS)
Hart, Alistair
2006-12-01
We study the low-lying modes of staggered Dirac operators for quenched SU(2) and show that improvement changes the distribution from lattice-like to continuum-like at lattice spacings rep- resentative of current dynamical SU(3) simulations. Epsilon regime universality predicts different distributions for the low-lying eigenvalues of the continuum and lattice staggered Dirac operators. At lattice spacings around 0.07 fm we show that improved staggered eigenvalues have the continuum distribution (as predicted by the chiral Orthogonal Ensemble of random matrices), whilst unimproved fall on the discrete distribution (as per the chiral Symplectic Ensemble). The crossover is much more rapid than for SU(3). In addition, improved staggered fermions give a good approximation to the Atiyah-Singer index theorem, appear to satisfy the Banks-Casher relation and show clear taste-degeneracy for the non- zero modes. All this indicates that taste-changing interactions are well under control at lattice spacings 0.07 - 0.13 fm, matching our findings for SU(3).
ERIC Educational Resources Information Center
Sullivan, Patrick
2013-01-01
The purpose of this study is to examine the nature of what students notice about symbols and use as they solve unfamiliar algebra problems based on familiar algebra concepts and involving symbolic inscriptions. The researcher conducted a study of students at three levels of algebra exposure: (a) students enrolled in a high school pre-calculus…
ERIC Educational Resources Information Center
Khajarian, Seta
2011-01-01
Algebra is a branch in mathematics and taking Algebra in middle school is often a gateway to advanced courses in high school. The problem is that the United States and Lebanon had low scores in Algebra in the 2007 Trends in Mathematics and Sciences Study (TIMSS), an international assessment administered to 4th and 8th graders every 4 years. On the…
ERIC Educational Resources Information Center
Egodawatte, Gunawardena; Stoilescu, Dorian
2015-01-01
The purpose of this mixed-method study was to investigate grade 11 university/college stream mathematics students' difficulties in applying conceptual knowledge, procedural skills, strategic competence, and algebraic thinking in solving routine (instructional) algebraic problems. A standardized algebra test was administered to thirty randomly…
The Guderley problem revisited
Ramsey, Scott D; Kamm, James R; Bolstad, John H
2009-01-01
The self-similar converging-diverging shock wave problem introduced by Guderley in 1942 has been the source of numerous investigations since its publication. In this paper, we review the simplifications and group invariance properties that lead to a self-similar formulation of this problem from the compressible flow equations for a polytropic gas. The complete solution to the self-similar problem reduces to two coupled nonlinear eigenvalue problems: the eigenvalue of the first is the so-called similarity exponent for the converging flow, and that of the second is a trajectory multiplier for the diverging regime. We provide a clear exposition concerning the reflected shock configuration. Additionally, we introduce a new approximation for the similarity exponent, which we compare with other estimates and numerically computed values. Lastly, we use the Guderley problem as the basis of a quantitative verification analysis of a cell-centered, finite volume, Eulerian compressible flow algorithm.
NASA Astrophysics Data System (ADS)
Graefe, Eva-Maria; Korsch, Hans Jürgen; Rush, Alexander
2016-04-01
Bosonic quantum conversion systems can be modeled by many-particle single-mode Hamiltonians describing a conversion of m molecules of type A into n molecules of type B and vice versa. These Hamiltonians are analyzed in terms of generators of a polynomially deformed su(2) algebra. In the mean-field limit of large particle numbers, these systems become classical and their Hamiltonian dynamics can again be described by polynomial deformations of a Lie algebra, where quantum commutators are replaced by Poisson brackets. The Casimir operator restricts the motion to Kummer shapes, deformed Bloch spheres with cusp singularities depending on m and n . It is demonstrated that the many-particle eigenvalues can be recovered from the mean-field dynamics using a WKB-type quantization condition. The many-particle state densities can be semiclassically approximated by the time periods of periodic orbits, which show characteristic steps and singularities related to the fixed points, whose bifurcation properties are analyzed.
NASA Astrophysics Data System (ADS)
Salom, Igor; Dmitrašinović, V.
2016-05-01
We construct the three-body permutation symmetric O (6) hyperspherical harmonics and use them to solve the non-relativistic three-body Schrödinger equation in three spatial dimensions. We label the states with eigenvalues of the U (1) ⊗ SO(3)rot ⊂ U (3) ⊂ O (6) chain of algebras, and we present the K ≤ 4 harmonics and tables of their matrix elements. That leads to closed algebraic form of low-K energy spectra in the adiabatic approximation for factorizable potentials with square-integrable hyper-angular parts. This includes homogeneous pairwise potentials of degree α ≥ - 1. More generally, a simplification is achieved in numerical calculations of non-adiabatic approximations to non-factorizable potentials by using our harmonics.
Compatible Relaxation and Coarsening in Algebraic Multigrid
Brannick, J J; Falgout, R D
2009-09-22
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Lastly, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.