The algebraic multigrid projection for eigenvalue problems; backrotations and multigrid fixed points
NASA Technical Reports Server (NTRS)
Costiner, Sorin; Taasan, Shlomo
1994-01-01
The periods of the theorem for the algebraic multigrid projection (MGP) for eigenvalue problems, and of the multigrid fixed point theorem for multigrid cycles combining MGP with backrotations, are presented. The MGP and the backrotations are central eigenvector separation techniques for multigrid eigenvalue algorithms. They allow computation on coarse levels of eigenvalues of a given eigenvalue problem, and are efficient tools in the computation of eigenvectors.
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.
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.
A pivotal eigenvalue problem in river ecology
NASA Astrophysics Data System (ADS)
Hsu, Sze-Bi; López-Gómez, Julián; Mei, Linfeng; Wang, Feng-Bin
2015-09-01
This paper studies an eigenvalue problem associated with a linear parabolic equation and a coupled ordinary differential equation. The existence and the uniqueness of the principal eigenvalue for this eigenvalue problem is first established. Then, the qualitative dependence of the principal eigenvalue with respect to the several parameters involved in the system is analyzed. Finally, these results are applied to a system in flowing habitats with a hydraulic storage zone and light limitation.
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.
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.
Solving Maxwell eigenvalue problems for accelerating cavities
NASA Astrophysics Data System (ADS)
Arbenz, Peter; Geus, Roman; Adam, Stefan
2001-02-01
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell equations for the strength of the electric field are solved by a mixed method with quadratic finite edge (Nédélec) elements for the field values and corresponding node-based finite elements for the Lagrange multiplier. This approach avoids so-called spurious modes which are introduced if the divergence-free condition for the electric field is not treated properly. To compute a few of the smallest positive eigenvalues and corresponding eigenmodes of the resulting large sparse matrix eigenvalue problems, two algorithms have been used: the implicitly restarted Lanczos algorithm and the Jacobi-Davidson algorithm, both with shift-and-invert spectral transformation. Two-level hierarchical basis preconditioners have been employed for the iterative solution of the resulting systems of equations.
Polynomial Eigenvalue Solutions to Minimal Problems in Computer Vision.
Kukelova, Zuzana; Bujnak, Martin; Pajdla, Tomas
2012-07-01
We present a method for solving systems of polynomial equations appearing in computer vision. This method is based on polynomial eigenvalue solvers and is more straightforward and easier to implement than the state-of-the-art Gröbner basis method since eigenvalue problems are well studied, easy to understand, and efficient and robust algorithms for solving these problems are available. We provide a characterization of problems that can be efficiently solved as polynomial eigenvalue problems (PEPs) and present a resultant-based method for transforming a system of polynomial equations to a polynomial eigenvalue problem. We propose techniques that can be used to reduce the size of the computed polynomial eigenvalue problems. To show the applicability of the proposed polynomial eigenvalue method, we present the polynomial eigenvalue solutions to several important minimal relative pose problems.
On a recursive inverse eigenvalue problem
NASA Astrophysics Data System (ADS)
Ikramov, Kh. D.
2009-05-01
Let s 1, ..., s n be arbitrary complex scalars. It is required to construct an n × n normal matrix A such that s i is an eigenvalue of the leading principal submatrix A i , i = 1, 2, ..., n. It is shown that, along with the obvious diagonal solution diag( s 1, ..., s n ), this problem always admits a much more interesting nondiagonal solution A. As a rule, this solution is a dense matrix; with the diagonal solution, it shares the property that each submatrix A i is itself a normal matrix, which implies interesting connections between the spectra of the neighboring submatrices A i and A i + 1.
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.
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.
Extension of the tridiagonal reduction (FEER) method for complex eigenvalue problems in NASTRAN
NASA Technical Reports Server (NTRS)
Newman, M.; Mann, F. I.
1978-01-01
As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum were extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order was much lower than that of the full size problem. The reduction process was effected automatically, and thus avoided the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admitted mass, damping, and stiffness matrices which were unrestricted in character, i.e., they might be real, symmetric or nonsymmetric, singular or nonsingular.
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.
Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem
2005-03-03
study of a nonlin- ear continuous problem was done in [20] for ordinary differential equations with polynomial speedups over the classical settings. The...multivariate approximation, and ordinary differential equations . Tight bit query complexity bounds are known for a number of such problems, see [14, 15, 16...Linear Algebra, SIAM, Philadelphia. [12] Gary, H. (1965), Computing Eigenvalues of Ordinary Differential Equations with Finite Differences, Mathematics
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
Eigenvalues and stability problems of rotors
NASA Technical Reports Server (NTRS)
Walczyk, Z.
1985-01-01
The essential theoretical results of the application of a developed transfer matrix method to the free transverse vibration of a rotor are shown. Gyroscopic and shear effects, rotary inertia, and external and internal damping as well as the influence of sleeve bearings and rotor supports are taken into consideration. The eigenvalues of the motion equations of the rotor are searched by using a modified determinant method.
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.
Matrix iteration method for nonlinear eigenvalue problems with applications
NASA Astrophysics Data System (ADS)
Ram, Y. M.
2016-12-01
A simple and intuitive matrix iteration method for solving nonlinear eigenvalue problems is described and demonstrated in detail by two problems: (i) the boundary value problem associated with large deflection of a flexible rod, and (ii) the initial value problem associated with normal mode motion of a double pendulum. The two problems are solved by two approaches, the finite difference approach and a continuous realization approach which is similar in spirit to the Rayleigh-Ritz method.
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.
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…
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.
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.
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 parallel Lanczos method for symmetric generalized eigenvalue problems
Wu, K.; Simon, H.D.
1997-12-01
Lanczos algorithm is a very effective method for finding extreme eigenvalues of symmetric matrices. It requires less arithmetic operations than similar algorithms, such as, the Arnoldi method. In this paper, the authors present their parallel version of the Lanczos method for symmetric generalized eigenvalue problem, PLANSO. PLANSO is based on a sequential package called LANSO which implements the Lanczos algorithm with partial re-orthogonalization. It is portable to all parallel machines that support MPI and easy to interface with most parallel computing packages. Through numerical experiments, they demonstrate that it achieves similar parallel efficiency as PARPACK, but uses considerably less time.
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
2015-12-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.
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
Solving a Class of Nonlinear Eigenvalue Problems by Newton's Method
Gao, Weiguo; Yang, Chao; Meza, Juan C.
2009-07-02
We examine the possibility of using the standard Newton's method for solving a class of nonlinear eigenvalue problems arising from electronic structure calculation. We show that the Jacobian matrix associated with this nonlinear system has a special structure that can be exploited to reduce the computational complexity of the Newton's method. Preliminary numerical experiments indicate that the Newton's method can be more efficient for small problems in which a few smallest eigenpairs are needed.
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.
Nonlinear eigenvalue problems in Density Functional Theory calculations
Fattebert, J
2009-08-28
Developed in the 1960's by W. Kohn and coauthors, Density Functional Theory (DFT) is a very popular quantum model for First-Principles simulations in chemistry and material sciences. It allows calculations of systems made of hundreds of atoms. Indeed DFT reduces the 3N-dimensional Schroedinger electronic structure problem to the search for a ground state electronic density in 3D. In practice it leads to the search for N electronic wave functions solutions of an energy minimization problem in 3D, or equivalently the solution of an eigenvalue problem with a non-linear operator.
Levenberg-Marquardt method for the eigenvalue complementarity problem.
Chen, Yuan-yuan; Gao, Yan
2014-01-01
The eigenvalue complementarity problem (EiCP) is a kind of very useful model, which is widely used in the study of many problems in mechanics, engineering, and economics. The EiCP was shown to be equivalent to a special nonlinear complementarity problem or a mathematical programming problem with complementarity constraints. The existing methods for solving the EiCP are all nonsmooth methods, including nonsmooth or semismooth Newton type methods. In this paper, we reformulate the EiCP as a system of continuously differentiable equations and give the Levenberg-Marquardt method to solve them. Under mild assumptions, the method is proved globally convergent. Finally, some numerical results and the extensions of the method are also given. The numerical experiments highlight the efficiency of the method.
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 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.
NASA Astrophysics Data System (ADS)
Grigoriev, V. G.
2008-02-01
The conventional approach to determining the eigenvalues of a one-dimensional boundary value problem consists in writing out the solution of the differential equation in general form containing indeterminate coefficients and constructing a system of homogeneous linear algebraic equations for these coefficients on the basis of the expressions for the boundary conditions. The eigenvalue is determined from the condition that the determinant of the system thus constructed is zero. In the classical problems (of string, rod, etc. vibrations), this method, as a rule, does not cause any difficulties, although several examples in which the zero value of the frequency satisfying the characteristic equation thus constructed is not an eigenfrequency were constructed and investigated, for example, in [1, p. 220]. We show that in some cases more complicated than the classical ones a similar situation can lead to paradoxical conclusions and erroneous results.
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.
A numerical procedure to solve the multichannel Schrödinger eigenvalue problem
NASA Astrophysics Data System (ADS)
Ledoux, V.; Van Daele, M.; Berghe, G. Vanden
2007-02-01
We discuss the numerical solution of eigenvalue problems for systems of (regular) coupled Schrödinger equations. Using a high order CPM (abbreviation for piecewise Constant (reference potential) Perturbation Method) in a shooting procedure, eigenvalues can be computed accurately. A generalization of the Prüfer method for scalar Sturm-Liouville problems makes the whole procedure more robust and allows us to specify the required eigenvalue by its index.
Depletion GPT-free sensitivity analysis for reactor eigenvalue problems
Kennedy, C.; Abdel-Khalik, H.
2013-07-01
This manuscript introduces a novel approach to solving depletion perturbation theory problems without the need to set up or solve the generalized perturbation theory (GPT) equations. The approach, hereinafter denoted generalized perturbation theory free (GPT-Free), constructs a reduced order model (ROM) using methods based in perturbation theory and computes response sensitivity profiles in a manner that is independent of the number or type of responses, allowing for an efficient computation of sensitivities when many responses are required. Moreover, the reduction error from using the ROM is quantified in the GPT-Free approach by means of a Wilks' order statistics error metric denoted the K-metric. Traditional GPT has been recognized as the most computationally efficient approach for performing sensitivity analyses of models with many input parameters, e.g. when forward sensitivity analyses are computationally intractable. However, most neutronics codes that can solve the fundamental (homogenous) adjoint eigenvalue problem do not have GPT capabilities unless envisioned during code development. The GPT-Free approach addresses this limitation by requiring only the ability to compute the fundamental adjoint. This manuscript demonstrates the GPT-Free approach for depletion reactor calculations performed in SCALE6 using the 7x7 UAM assembly model. A ROM is developed for the assembly over a time horizon of 990 days. The approach both calculates the reduction error over the lifetime of the simulation using the K-metric and benchmarks the obtained sensitivities using sample calculations. (authors)
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.
Determination of Electromagnetic Source Direction as an Eigenvalue Problem
NASA Astrophysics Data System (ADS)
Martínez-Oliveros, Juan C.; Lindsey, Charles; Bale, Stuart D.; Krucker, Säm
2012-07-01
Low-frequency solar and interplanetary radio bursts are generated at frequencies below the ionospheric plasma cutoff and must therefore be measured in space, with deployable antenna systems. The problem of measuring both the general direction and polarization of an electromagnetic source is commonly solved by iterative fitting methods such as linear regression that deal simultaneously with both directional and polarization parameters. We have developed a scheme that separates the problem of deriving the source direction from that of determining the polarization, avoiding iteration in a multi-dimensional manifold. The crux of the method is to first determine the source direction independently of concerns as to its polarization. Once the source direction is known, its direct characterization in terms of Stokes vectors, in a single iteration if desired, is relatively simple. This study applies the source-direction determination to radio signatures of flares received by STEREO. We studied two previously analyzed radio type III bursts and found that the results of the eigenvalue decomposition technique are consistent with those obtained previously by Reiner et al. ( Solar Phys. 259, 255, 2009). For the type III burst observed on 7 December 2007, the difference in travel times from the derived source location to STEREO A and B is the same as the difference in the onset times of the burst profiles measured by the two spacecraft. This is consistent with emission originating from a single, relatively compact source. For the second event of 29 January 2008, the relative timing does not agree, suggesting emission from two sources separated by 0.1 AU, or perhaps from an elongated region encompassing the apparent source locations.
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.
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.
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.
Solution Techniques for Large Eigenvalue Problems in Structural Dynamics.
1979-06-01
e (k) = error In R(k) or -(k) X M multiple eigenvalue A, A = diagonal matrix of eigenvalues, jth...B.33), we can * show that 1k R(k) (k) (k) F (0 (I + E ) R (B.41) a.j j where R 1 L 9. PC (B.42) 72 an h ( )th E (k) (k and the (t, m ) element of the...symmetric matrix E , e , is n ,(0) C (k).,(k) a( k ) ( m = " s mm i=’ i O’ j( ) (k) n cit(k) i (k ,I e m (k) - 1 c.(k) i=s+l i - j( (t, m = 1,
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.
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.
Numerical solution of singular ODE eigenvalue problems in electronic structure computations
NASA Astrophysics Data System (ADS)
Hammerling, Robert; Koch, Othmar; Simon, Christa; Weinmüller, Ewa B.
2010-09-01
We put forward a new method for the solution of eigenvalue problems for (systems of) ordinary differential equations, where our main focus is on eigenvalue problems for singular Schrödinger equations arising for example in electronic structure computations. In most established standard methods, the generation of the starting values for the computation of eigenvalues of higher index is a critical issue. Our approach comprises two stages: First we generate rough approximations by a matrix method, which yields several eigenvalues and associated eigenfunctions simultaneously, albeit with moderate accuracy. In a second stage, these approximations are used as starting values for a collocation method which yields approximations of high accuracy efficiently due to an adaptive mesh selection strategy, and additionally provides reliable error estimates. We successfully apply our method to the solution of the quantum mechanical Kepler, Yukawa and the coupled ODE Stark problems.
Quadratic partial eigenvalue assignment problem with time delay for active vibration control
NASA Astrophysics Data System (ADS)
Pratt, J. M.; Singh, K. V.; Datta, B. N.
2009-08-01
Partial pole assignment in active vibration control refers to reassigning a small set of unwanted eigenvalues of the quadratic eigenvalue problem (QEP) associated with the second order system of a vibrating structure, by using feedback control force, to suitably chosen location without altering the remaining large number of eigenvalues and eigenvectors. There are several challenges of solving this quadratic partial eigenvalue assignment problem (QPEVAP) in a computational setting which the traditional pole-placement problems for first-order control systems do not have to deal with. In order to these challenges, there has been some work in recent years to solve QPEVAP in a computationally viable way. However, these works do not take into account of the practical phenomenon of the time-delay effect in the system. In this paper, a new "direct and partial modal" approach of the quadratic partial eigenvalue assignment problem with time-delay is proposed. The approach works directly in the quadratic system without requiring transformation to a standard state-space system and requires the knowledge of only a small number of eigenvalues and eigenvectors that can be computed or measured in practice. Two illustrative examples are presented in the context of active vibration control with constant time-delay to illustrate the success of our proposed approach. Future work includes generalization of this approach to a more practical complex time-delay system and extension of this work to the multi-input problem.
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.
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.
NASA Astrophysics Data System (ADS)
Brahma, Sanjoy; Datta, Biswa
2009-07-01
The partial quadratic eigenvalue assignment problem (PQEVAP) concerns the reassignment of a small number of undesirable eigenvalues of a quadratic matrix pencil, while leaving the remaining large number of eigenvalues and the corresponding eigenvectors unchanged. The problem arises in controlling undesirable resonance in vibrating structures and in stabilizing control systems. The solution of this problem requires computations of a pair of feedback matrices. For practical effectiveness, these feedback matrices must be computed in such a way that their norms and the condition number of the closed-loop eigenvector matrix are as small as possible. These considerations give rise to the minimum norm partial quadratic eigenvalue assignment problem (MNPQEVAP) and the robust partial quadratic eigenvalue assignment problem (RPQEVAP), respectively. In this paper we propose new optimization based algorithms for solving these problems. The problems are solved directly in a second-order setting without resorting to a standard first-order formulation so as to avoid the inversion of a possibly ill-conditioned matrix and the loss of exploitable structures of the original model. The algorithms require the knowledge of only the open-loop eigenvalues to be replaced and their corresponding eigenvectors. The remaining open-loop eigenvalues and their corresponding eigenvectors are kept unchanged. The invariance of the large number of eigenvalues and eigenvectors under feedback is guaranteed by a proven mathematical result. Furthermore, the gradient formulas needed to solve the problems by using the quasi-Newton optimization technique employed are computed in terms of the known quantities only. Above all, the proposed methods do not require the reduction of the model order or the order of the controller, even when the underlying finite element model has a very large degree of freedom. These attractive features, coupled with minimal computational requirements, such as solutions of small
Asymptotic behaviour of the eigenvalues of the Dirichlet problem in a domain with a narrow slit
Gadyl'shin, R R; Il'in, A M
1998-04-30
The Dirichlet problem in a two-dimensional domain with a narrow slit is studied. The width of the slit is a small parameter. The complete asymptotic expansion for the eigenvalue of the perturbed problem converging to a simple eigenvalue of the limiting problem is constructed by means of the method of matched asymptotic expansions. It is shown that the regular perturbation theory can formally be applied in a natural way up to terms of order {epsilon}{sup 2}. However, the result obtained in that way is false. The correct result can be obtained only by means of an inner asymptotic expansion.
Rees algebras, Monomial Subrings and Linear Optimization Problems
NASA Astrophysics Data System (ADS)
Dupont, Luis A.
2010-06-01
In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between commutative algebra, combinatorics and optimization. We study the normality and the Gorenstein property-as well as the canonical module and the a-invariant-of Rees algebras and subrings arising from linear optimization problems. In particular, we study algebraic properties of edge ideals and algebras associated to uniform clutters with the max-flow min-cut property or the packing property. We also study algebraic properties of symbolic Rees algebras of edge ideals of graphs, edge ideals of clique clutters of comparability graphs, and Stanley-Reisner rings.
NASA Astrophysics Data System (ADS)
Xiao, Jinyou; Zhou, Hang; Zhang, Chuanzeng; Xu, Chao
2016-11-01
This paper focuses on the development and engineering applications of a new resolvent sampling based Rayleigh-Ritz method (RSRR) for solving large-scale nonlinear eigenvalue problems (NEPs) in finite element analysis. There are three contributions. First, to generate reliable eigenspaces the resolvent sampling scheme is derived from Keldysh's theorem for holomorphic matrix functions following a more concise and insightful algebraic framework. Second, based on the new derivation a two-stage solution strategy is proposed for solving large-scale NEPs, which can greatly enhance the computational cost and accuracy of the RSRR. The effects of the user-defined parameters are studied, which provides a useful guide for real applications. Finally, the RSRR and the two-stage scheme is applied to solve two NEPs in the FE analysis of viscoelastic damping structures with up to 1 million degrees of freedom. The method is versatile, robust and suitable for parallelization, and can be easily implemented into other packages.
NASA Astrophysics Data System (ADS)
Xiao, Jinyou; Zhou, Hang; Zhang, Chuanzeng; Xu, Chao
2017-02-01
This paper focuses on the development and engineering applications of a new resolvent sampling based Rayleigh-Ritz method (RSRR) for solving large-scale nonlinear eigenvalue problems (NEPs) in finite element analysis. There are three contributions. First, to generate reliable eigenspaces the resolvent sampling scheme is derived from Keldysh's theorem for holomorphic matrix functions following a more concise and insightful algebraic framework. Second, based on the new derivation a two-stage solution strategy is proposed for solving large-scale NEPs, which can greatly enhance the computational cost and accuracy of the RSRR. The effects of the user-defined parameters are studied, which provides a useful guide for real applications. Finally, the RSRR and the two-stage scheme is applied to solve two NEPs in the FE analysis of viscoelastic damping structures with up to 1 million degrees of freedom. The method is versatile, robust and suitable for parallelization, and can be easily implemented into other packages.
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.
Perturbation of a Multiple Eigenvalue in the Benard Problem for Two Fluid Layers.
1984-12-01
EIGENVAWUE IN THlE BENARtD PROBLEM FOR TWO FLUID LAYERS Ca O~ Yuriko Renardy and Michael Renardy MUathematics Research Center University of Wisconsin...OF WISCONSIN - MADISON MATHEMATICS RESEARCH CENTER PERTUBBATION OF A MULTIPLE EIGENVALUE IN THE BENARD PROBLEM FOR TWO FLUID LAYERS Yuriko Renardy and...PROBLEM FOR TWO FLUID LAYERS Yuriko Renardy and Michael Renardy 1. INTRODUCTION In the B6nard problem for one fluid, "exchange of stabilities" holds
Estimates on the eigenvalues of the clamped plate problem on domains in Euclidean spaces
NASA Astrophysics Data System (ADS)
Yolcu, Selma Yıldırım; Yolcu, Türkay
2013-04-01
The purpose of this article is two-fold. First, we obtain some certain bounds for the sums of (positive and negative) powers of the eigenvalues of the clamped plate problem of the Dirichlet bi-Laplacian operator Δ 2|_{{D}}, restricted to a bounded domain {D}subset {{R}}^d with d ⩾ 2. Second, we establish lower bounds for the sums of eigenvalues of Δ ^2|_{{D}} sharper than the bounds recently obtained by Cheng and Wei ["A lower bound for eigenvalues of a clamped plate problem," Calculus Var. Partial Differ. Equ. 42(3-4), 579-590 (2011)], 10.1007/s00526-011-0399-6. All these estimates are sharp in the sense of Weyl asymptotics.
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 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.
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
Algebraic Thinking: A Problem Solving Approach
ERIC Educational Resources Information Center
Windsor, Will
2010-01-01
Algebraic thinking is a crucial and fundamental element of mathematical thinking and reasoning. It initially involves recognising patterns and general mathematical relationships among numbers, objects and geometric shapes. This paper will highlight how the ability to think algebraically might support a deeper and more useful knowledge, not only of…
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.
Finite element analysis of a coupling eigenvalue problem on overlapping domains
NASA Astrophysics Data System (ADS)
Schepper, Hennie De
2001-07-01
In this paper, we consider a nonstandard elliptic eigenvalue problem on a rectangular domain, consisting of two overlapping rectangles, where the interaction between the subdomains is expressed through an integral coupling condition on their intersection. For this problem we set up finite element (FE) approximations, without and with numerical quadrature. The involved error analysis is affected by the nonlocal coupling condition, which requires the introduction and error estimation of a suitably modified vector Lagrange interpolant on the overall FE mesh. As a consequence, the resulting error estimates are sub-optimal, as compared to the ones established, e.g., in Vanmaele and van Keer (RAIRO - Math. Mod. Num. Anal 29(3) (1995) 339-365) for classical eigenvalue problems with local boundary or transition conditions.
Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem
Jeong, Yongjin; Park, Jinsu; Lee, Hyun Chul; Lee, Deokjung
2015-12-01
In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also noted that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.
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.
1987-06-01
20742 DTIC BN-1066 r~* .NOV2 0 198 Il Approved for public relecm.: Distribution2 Unlinited Jue18Hune 1987 " INSTITUTE COVR P-:YSICAL SCI:NC,- AND TL C...AND ADORESS 10. PROGRAM ELEMENT. PROJECT. TASK Institute for Physical Science and Technology AREA&WORKUNITNUMBERS University of Maryland College Park...Holland, Amsterdam. NTIS GRA&I DTIc TAB C Unannounced [] "%. justification By. Distrblutilon/ . Av,,il bility Codes -° .Av~ia,,6/or Institute for
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).
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.
White, D; Koning, J
1999-10-21
The authors are interested in determining the electromagnetic fields within closed perfectly conducting cavities that may contain dielectric or magnetic materials. The vector Helmholtz equation is the appropriate partial differential equation for this problem. It is well known that the electromagnetic fields in a cavity can be decomposed into distinct modes that oscillate in time at specific resonant frequencies. These modes are referred to as eigenmodes, and the frequencies of these modes are referred to as eigenfrequencies. The authors' present application is the analysis of linear accelerator components. These components may have a complex geometry; hence numerical methods are require to compute the eigenmodes and the eigenfrequencies of these components. The Implicitly Restarted Arnoldi Method (IRAM) is a robust and efficient method for the numerical solution of the generalized eigenproblem Ax = {lambda}Bx, where A and B are sparse matrices, x is an eigenvector, and {lambda} is an eigenvalue. The IRAM is an iterative method for computing extremal eigenvalues; it is an extension of the classic Lanczos method. The mathematical details of the IRAM are too sophisticated to describe here; instead they refer the reader to [1]. A FORTRAN subroutine library that implements various versions of the IRAM is freely available, both in a serial version named ARPACK and parallel version named PARPACK. In this paper they discretize the vector Helmholtz equation using 1st order H(curl) conforming edge elements (also known as Nedelec elements). This discretization results in a generalized eigenvalue problem which can be solved using the IRAM. The question of so-called spurious modes is discussed, and it is shown that applying a spectral transformation completely eliminates these modes, without any need for an additional constraint equation. Typically they use the IRAM to compute a small set (n < 30) of eigenvalues and eigenmodes for a very large systems (N > 100,000).
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
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.
Developing and Validating Sets of Algebra Word Problems.
ERIC Educational Resources Information Center
Nasser, Ramzi; Carifio, James
The validation of key contextual features of algebra word problems was studied in two phases. In the first phase, five experts were asked to assess the appropriateness of the concepts in the problems and the adequacy of the assignment of the contextual features to the problems. In the second phase, construct validity was established by having 6…
Hoover, Jerome D; Healy, Alice F
2017-02-14
The classic bat-and-ball problem is used widely to measure biased and correct reasoning in decision-making. University students overwhelmingly tend to provide the biased answer to this problem. To what extent might reasoners be led to modify their judgement, and, more specifically, is it possible to facilitate problem solution by prompting participants to consider the problem from an algebraic perspective? One hundred ninety-seven participants were recruited to investigate the effect of algebraic cueing as a debiasing strategy on variants of the bat-and-ball problem. Participants who were cued to consider the problem algebraically were significantly more likely to answer correctly relative to control participants. Most of this cueing effect was confined to a condition that required participants to solve isomorphic algebra equations corresponding to the structure of bat-and-ball question types. On a subsequent critical question with differing item and dollar amounts presented without a cue, participants were able to generalize the learned information to significantly reduce overall bias. Math anxiety was also found to be significantly related to bat-and-ball problem accuracy. These results suggest that, under specific conditions, algebraic reasoning is an effective debiasing strategy on bat-and-ball problem variants, and provide the first documented evidence for the influence of math anxiety on Cognitive Reflection Test performance.
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.
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)
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…
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, Shun-fat
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)
Yang, Bian-Xia; Sun, Hong-Rui; Feng, Zhaosheng
In this paper, we are concerned with the unilateral global bifurcation structure of fractional differential equation (‑Δ)αu(x) = λa(x)u(x) + F(x,u,λ),x ∈ Ω,u = 0,inℝN\\Ω with nondifferentiable nonlinearity F. It shows that there are two distinct unbounded subcontinua 𝒞+ and 𝒞‑ consisting of the continuum 𝒞 emanating from [λ1 ‑ d,λ1 + d] ×{0}, and two unbounded subcontinua 𝒟+ and 𝒟‑ consisting of the continuum 𝒟 emanating from [λ1 ‑d¯,λ1 + d¯] ×{∞}. As an application of this unilateral global bifurcation results, we present the existence of the principal half-eigenvalues of the half-linear fractional eigenvalue problem. Finally, we deal with the existence of constant sign solutions for a class of fractional nonlinear problems. Main results of this paper generalize the known results on classical Laplace operators to fractional Laplace operators.
Strategic differences in algebraic problem solving: neuroanatomical correlates.
Lee, Kerry; Lim, Zee Ying; Yeong, Stephanie H M; Ng, Swee Fong; Venkatraman, Vinod; Chee, Michael W L
2007-06-25
In this study, we built on previous neuroimaging studies of mathematical cognition and examined whether the same cognitive processes are engaged by two strategies used in algebraic problem solving. We focused on symbolic algebra, which uses alphanumeric equations to represent problems, and the model method, which uses pictorial representation. Eighteen adults, matched on academic proficiency and competency in the two methods, transformed algebraic word problems into equations or models, and validated presented solutions. Both strategies were associated with activation of areas linked to working memory and quantitative processing. These included the left frontal gyri, and bilateral activation of the intraparietal sulci. Contrasting the two strategies, the symbolic method activated the posterior superior parietal lobules and the precuneus. These findings suggest that the two strategies are effected using similar processes but impose different attentional demands.
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.
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.
SEMI-DEFINITE PROGRAMMING TECHNIQUES FOR STRUCTURED QUADRATIC INVERSE EIGENVALUE PROBLEMS
LIN, MATTHEW M.; DONG, BO; CHU, MOODY T.
2014-01-01
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovative application of SDP techniques to quadratic inverse eigenvalue problems (QIEPs). The notion of QIEPs is of fundamental importance because its ultimate goal of constructing or updating a vibration system from some observed or desirable dynamical behaviors while respecting some inherent feasibility constraints well suits many engineering applications. Thus far, however, QIEPs have remained challenging both theoretically and computationally due to the great variations of structural constraints that must be addressed. Of notable interest and significance are the uniformity and the simplicity in the SDP formulation that solves effectively many otherwise very difficult QIEPs. PMID:25392603
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.
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…
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,…
Exact formulation and solution of the nuclear eigenvalue problem in a microscopic multiphonon space
Andreozzi, F.; Iudice, N. Lo; Porrino, A.; Knapp, F.; Kvasil, J.
2007-04-15
We propose a method for solving exactly the nuclear eigenvalue problem within a multiphonon space constructed out of Tamm-Dancoff phonons. The method consists in deriving, within a given n-phonon subspace, a set of equations, of simple structure for any n, which are solved iteratively, starting from the particle-hole vacuum, to yield a set of states covering a multiphonon space up to an arbitrary number of phonons. The intrinsic redundancy of the set so generated is removed completely and exactly by a simple and efficient prescription. Such a multiphonon basis reduces the Hamiltonian into diagonal blocks plus residual off-diagonal terms of simple form. Its diagonalization becomes straightforward and yields exact eigensolutions. {sup 16}O is adopted as numerical test ground.
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.
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)
High-order nodal discontinuous Galerkin methods for the Maxwell eigenvalue problem.
Hesthaven, J S; Warburton, T
2004-03-15
The Maxwell eigenvalue problem is known to pose difficulties for standard numerical methods, predominantly due to its large null space. As an alternative to the widespread use of Galerkin finite-element methods based on curl-conforming elements, we propose to use high-order nodal elements in a discontinuous element scheme. We consider both two- and three-dimensional problems and show the former to be without problems in a wide range of cases. Numerical experiments suggest the validity of this for general problems. For the three-dimensional eigenproblem, we encounter difficulties with a naive formulation of the scheme and propose minor modifications, intimately related to the discontinuous nature of the formulation, to overcome these concerns. We conclude by connecting the findings to time domain solution of Maxwell's equations. The discussion, analysis, and numerous computational experiments suggest that using discontinuous element schemes for solving Maxwell's equation in the frequency- or time-domain present a high-order accurate, efficient and robust alternative to classical Galerkin finite-element methods.
Algebraic Methods Applied to Network Reliability Problems. Revision.
1986-09-01
RD-RIBs 38? ALGEBRAIC METHODS APPLIED TO NETHORK RELIABILITY 1/1 PROBLEMS REVISIOU(U) CLEMSON UNIV SC DEPT OF MATEMATICAL SCIENCES D R SHIER ET AL...class of directed networks, Oper. Res., 32 (1984), pp. 493-515. -2 " 16 [3] A. AGRAWAL AND A. SATYANARAYANA, Network reliability analysis using 2...Networks, 13 (1983), pp. 107-120. [20] A. SATYANARAYANA AND A. PRABHAKAR, A new topological formula and rapid algorithm for reliability analysis of complex
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)
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…
Cognitive load and modelling of an algebra problem
NASA Astrophysics Data System (ADS)
Chinnappan, Mohan
2010-09-01
In the present study, I examine a modelling strategy as employed by a teacher in the context of an algebra lesson. The actions of this teacher suggest that a modelling approach will have a greater impact on enriching student learning if we do not lose sight of the need to manage associated cognitive loads that could either aid or hinder the integration of core concepts with processes that are at play. Results here also show that modelling a problem that is set within an authentic context helps learners develop a better appreciation of variables and relations that constitute the model. The teacher's scaffolding actions revealed the use of strategies that foster the development of connected, meaningful and more useable algebraic knowledge.
1980-09-29
FOUNDATIONS OF EIGENVALUE DISTRIBUTION THEORY FOR GENERAL A NON--ETC(U) SEP 80 M MARCUS, M GOLDBERG, M NEWMAN AFOSR-79-0127 UNCLASSIFIED AFOSR-TR-80...September 1980 Title of Research: Foundations of Eigenvalue Distribution Theory for General & Nonnegative Matrices, Stability Criteria for Hyperbolic
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).
NASA Astrophysics Data System (ADS)
Renac, Florent
2011-06-01
An algorithm for stabilizing linear iterative schemes is developed in this study. The recursive projection method is applied in order to stabilize divergent numerical algorithms. A criterion for selecting the divergent subspace of the iteration matrix with an approximate eigenvalue problem is introduced. The performance of the present algorithm is investigated in terms of storage requirements and CPU costs and is compared to the original Krylov criterion. Theoretical results on the divergent subspace selection accuracy are established. The method is then applied to the resolution of the linear advection-diffusion equation and to a sensitivity analysis for a turbulent transonic flow in the context of aerodynamic shape optimization. Numerical experiments demonstrate better robustness and faster convergence properties of the stabilization algorithm with the new criterion based on the approximate eigenvalue problem. This criterion requires only slight additional operations and memory which vanish in the limit of large linear systems.
Algebraic and Computational Aspects of Network Reliability and Problems.
1986-07-15
7 -A175 075 ALGEBRAIC AND COMPUTATIONAL ASPECTS OF KETUORK / IRELIABILITY AND PROBLEMS(U) CLEMSON UNIV SC D SHIER 15 JUL 86 AFOSR-TR-86-2115 AFOSR...MONITORING ORGANIZATION I, afpplhcable) Clemson University AFOSR/NM 6C. ADDRESS (City. State and ZIP Codej 7b. ADDRESS (City. State and ZIP Code) Mlartin...Hall Bldg 410 Clemson , SC 29634-1907 Bolling AFB OC 20332-6448 S& NAME OF FUNOING/SPONSORING Bb. OFFICE SYMBOL 9. PROCUREMENT INSTRUMENT IDENTIFICATION
A Variational Approach to the Isoperimetric Inequality for the Robin Eigenvalue Problem
NASA Astrophysics Data System (ADS)
Bucur, Dorin; Giacomini, Alessandro
2010-12-01
The isoperimetric inequality for the first eigenvalue of the Laplace operator with Robin boundary conditions was recently proved by Daners in the context of Lipschitz sets. This paper introduces a new approach to the isoperimetric inequality, based on the theory of special functions of bounded variation (SBV). We extend the notion of the first eigenvalue λ1 for general domains with finite volume (possibly unbounded and with irregular boundary), and we prove that the balls are the unique minimizers of λ1 among domains with prescribed volume.
NASA Astrophysics Data System (ADS)
Sobral, R. R.; Guimarães, A. P.; da Silva, X. A.
1994-10-01
The eigenvalues of the Crystalline Electric Field (CEF) Hamiltonian with cubic symmetry are analytically obtained for trivalent rare-earth ions of ground state J= {5}/{2}, {7}/{2}, 4, {9}/{2}, 6, {15}/{2} and 8, via a Computer Algebra approach. In the presence of both CEF and an effective exchange field, Computer Algebra still allows a partial factorization of the characteristic polynomial equation associated to the total Hamiltonian, a result of interest to the study of the magnetic behavior of rare-earth intermetallics. An application to the PrX2 intermetallic compounds ( X = Mg, Al, Ru, Rh, Pt) is reported.
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.
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…
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.
Baradari, F.
1982-01-01
In this work the applicability of a ''Boundary Element method'' for the numerical solution of the Liouville and Helmholtz eigenvalue problem for different two dimensional geometries including a typical reactor configuration was investigated. The method is based on the discretization of the unknown along the boundary and Green's function representation of the governing equation. To compare the capability of this method with the finite element method, a finite element code which uses quadratic quadrilateral isoparametric elements was developed. A boundary element code was also written. These codes were used to determine the fundamental eigenvalue for several two dimensional geometries--square, ''L'' shaped, circular, and a quarter of a typical reactor core. The results of both codes were compared with each other and with analytical solutions where available. To optimize the computer time for the code based on the boundary element method, a powerful search technique called Fibonacci search was used to determine the fundamental eigenvalues. During the course of this study, it was found that eliminating the imaginary part of the fundamental solution of the Helmholtz equation produced an instability in the result. The results show that, due to the use of the iteration procedure in the boundary element method to evaluate the determinant of the deduced matrix, more computer time is required for the boundary element solution than the finite element solution. However, the results obtained on the basis of the boundary element technique are more accurate than those from the finite element method.
NASA Astrophysics Data System (ADS)
Pavlenko, V. N.; Potapov, D. K.
2017-01-01
The question on the existence of solutions to eigenvalue problems is treated for nonlinear equations with discontinuous operators in a real Hilbert space. Using a variational method, theorems on the existence of two nontrivial solutions for sufficiently large values of the spectral parameter are proved. As an application, eigenvalue problems for elliptic-type equations with nonlinear terms which are discontinuous in the phase variable are investigated. Bibliography: 22 titles.
Paving a Way to Algebraic Word Problems Using a Nonalgebraic Route
ERIC Educational Resources Information Center
Amit, Miriam; Klass-Tsirulnikov, Bella
2005-01-01
A three-stage model for algebraic word problem solving is developed in which students' understanding of the intrinsic logical structure of word problems is strengthened by connecting real-life problems and formal mathematics. (Contains 3 figure.)
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.
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.
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.
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.
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.
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.
Nunes, C. E. A.; Alves Filho, H.; Barros, R. C.
2012-07-01
We discuss in this paper the computational efficiency of approximate discrete ordinates (SN) albedo boundary conditions for two-energy group eigenvalue problems in X,Y-geometry. The non-standard SN albedo substitutes approximately the reflector system around the active domain, as we neglect the transverse leakage terms within the non-multiplying reflector region. Should the problem have no transverse leakage terms, i.e., one-dimensional slab geometry, then the offered albedo boundary conditions are exact. By computational efficiency we mean analyzing the accuracy of the numerical results versus the CPU execution time of each run for a given model problem. Numerical results to a typical test problem are shown to illustrate this efficiency analysis. (authors)
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…
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…
NASA Astrophysics Data System (ADS)
Cano-Casanova, Santiago; López-Gómez, Julián
2002-01-01
In this paper we characterize the existence of principal eigenvalues for a general class of linear weighted second order elliptic boundary value problems subject to a very general class of mixed boundary conditions. Our theory is a substantial extension of the classical theory by P. Hess and T. Kato (1980, Comm. Partial Differential Equations5, 999-1030). In obtaining our main results we must give a number of new results on the continuous dependence of the principal eigenvalue of a second order linear elliptic boundary value problem with respect to the underlying domain and the boundary condition itself. These auxiliary results complement and in some sense complete the theory of D. Daners and E. N. Dancer (1997, J. Differential Equations138, 86-132). The main technical tool used throughout this paper is a very recent characterization of the strong maximum principle in terms of the existence of a positive strict supersolution due to H. Amann and J. López-Gómez (1998, J. Differential Equations146, 336-374).
Practical algorithms for algebraic and logical correction in precedent-based recognition problems
NASA Astrophysics Data System (ADS)
Ablameyko, S. V.; Biryukov, A. S.; Dokukin, A. A.; D'yakonov, A. G.; Zhuravlev, Yu. I.; Krasnoproshin, V. V.; Obraztsov, V. A.; Romanov, M. Yu.; Ryazanov, V. V.
2014-12-01
Practical precedent-based recognition algorithms relying on logical or algebraic correction of various heuristic recognition algorithms are described. The recognition problem is solved in two stages. First, an arbitrary object is recognized independently by algorithms from a group. Then a final collective solution is produced by a suitable corrector. The general concepts of the algebraic approach are presented, practical algorithms for logical and algebraic correction are described, and results of their comparison are given.
Persistent and Pernicious Errors in Algebraic Problem Solving
ERIC Educational Resources Information Center
Booth, Julie L.; Barbieri, Christina; Eyer, Francie; Paré-Blagoev, E. Juliana
2014-01-01
Students hold many misconceptions as they transition from arithmetic to algebraic thinking, and these misconceptions can hinder their performance and learning in the subject. To identify the errors in Algebra I which are most persistent and pernicious in terms of predicting student difficulty on standardized test items, the present study assessed…
Contextual Analysis of Problems in Algebra I Textbooks.
ERIC Educational Resources Information Center
Rivers, Janelle
This qualitative study is a two-part analysis of first year algebra textbooks adopted for use in South Carolina. Part 1 examines the five books selected in the 1984 adoption. This comparison of first year algebra textbooks examined: (1) whether the textbook authors had adjusted the traditional context of math texts at this level to reflect…
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…
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…
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-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 2nd- 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
SYMBOLIC ALGEBRAIC MANIPULATION BY DIGITAL COMPUTER IN PROBLEMS OF CONTROL THEORY.
shown, using a FORMAC program. The advantages over the conventional root locus method are discussed. Areas of possible future use of FORMAC in algebraic problems of control theory are discussed. (Author)
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.
Recursive integral method for transmission eigenvalues
NASA Astrophysics Data System (ADS)
Huang, Ruihao; Struthers, Allan A.; Sun, Jiguang; Zhang, Ruming
2016-12-01
Transmission eigenvalue problems arise from inverse scattering theory for inhomogeneous media. These non-selfadjoint problems are numerically challenging because of a complicated spectrum. In this paper, we propose a novel recursive contour integral method for matrix eigenvalue problems from finite element discretizations of transmission eigenvalue problems. The technique tests (using an approximate spectral projection) if a region contains eigenvalues. Regions that contain eigenvalues are subdivided and tested recursively until eigenvalues are isolated with a specified precision. The method is fully parallel and requires no a priori spectral information. Numerical examples show the method is effective and robust.
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.
NASA Astrophysics Data System (ADS)
Benner, Peter; Dolgov, Sergey; Khoromskaia, Venera; Khoromskij, Boris N.
2017-04-01
In this paper, we propose and study two approaches to approximate the solution of the Bethe-Salpeter equation (BSE) by using structured iterative eigenvalue solvers. Both approaches are based on the reduced basis method and low-rank factorizations of the generating matrices. We also propose to represent the static screen interaction part in the BSE matrix by a small active sub-block, with a size balancing the storage for rank-structured representations of other matrix blocks. We demonstrate by various numerical tests that the combination of the diagonal plus low-rank plus reduced-block approximation exhibits higher precision with low numerical cost, providing as well a distinct two-sided error estimate for the smallest eigenvalues of the Bethe-Salpeter operator. The complexity is reduced to O (Nb2) in the size of the atomic orbitals basis set, Nb, instead of the practically intractable O (Nb6) scaling for the direct diagonalization. In the second approach, we apply the quantized-TT (QTT) tensor representation to both, the long eigenvectors and the column vectors in the rank-structured BSE matrix blocks, and combine this with the ALS-type iteration in block QTT format. The QTT-rank of the matrix entities possesses almost the same magnitude as the number of occupied orbitals in the molecular systems, No
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.
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'…
Arc-Length Continuation and Multi-Grid Techniques for Nonlinear Elliptic Eigenvalue Problems,
1981-03-19
8217 MG Algorithm 13 3.3 Indefinite Problems 17 3.4 Continuation Methods 17 4. Application to the Bratu Problem 20 4.1 Bratu’s Problem 20 4.2 Arc-length...hierarchy of grids (G0 ,G1 . .... . G"), with GM being the finest one, defined on a domain 0 with corresponding meab sizes (h0 > hi > ..... > h,). and all...1 vM-1 FM-1 a M-RM oGM -1 Li Ml 1 Ml IM K onG • M (3.4) vM ’’I = 0 on aGM - 1 After this problem is solved we can interpolate the solution vM- I
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.
A Lower Bound for the Sturm-Liouville Eigenvalue Problem on a Quantum Computer
2005-12-14
dinger equation with a given potential for the ground state energy. The Sturm-Liouville problem depends on a function q, which, in the case of the... Schr ? dinger equation , can be identified with the potential function V . Recently Papageorgiou and Wozniakowski proved that quantum computers achieve an...ergy. The Sturm-Liouville problem depends on a function q, which, in the case of the Schrödinger equation , can be identified with the po- tential
NASA Astrophysics Data System (ADS)
Wenner, Michael T.
Obtaining the solution to the linear Boltzmann equation is often is often a daunting task. The time-independent form is an equation of six independent variables which cannot be solved analytically in all but some special problems. Instead, numerical approaches have been devised. This work focuses on improving Monte Carlo methods for its solution in eigenvalue form. First, a statistical method of stationarity detection called the KPSS test adapted as a Monte Carlo eigenvalue source convergence test. The KPSS test analyzes the source center of mass series which was chosen since it should be indicative of overall source behavior, and is physically easy to understand. A source center of mass plot alone serves as a good visual source convergence diagnostic. The KPSS test and three different information theoretic diagnostics were implemented into the well known KENOV.a code inside of the SCALE (version 5) code package from Oak Ridge National Laboratory and compared through analysis of a simple problem and several difficult source convergence benchmarks. Results showed that the KPSS test can add to the overall confidence by identifying more problematic simulations than without its usage. Not only this, the source center of mass information on hand visually aids in the understanding of the problem physics. The second major focus of this dissertation concerned variance reduction methodologies for Monte Carlo eigenvalue problems. The CADIS methodology, based on importance sampling, was adapted to the eigenvalue problems. It was shown that the straight adaption of importance sampling can provide a significant variance reduction in determination of keff (in cases studied up to 30%?). A modified version of this methodology was developed which utilizes independent deterministic importance simulations. In this new methodology, each particle is simulated multiple times, once to every other discretized source region utilizing the importance for that region only. Since each particle
NASA Astrophysics Data System (ADS)
Khapaev, M. M.; Khapaeva, T. M.
2016-10-01
A functional-based variational method is proposed for finding the eigenfunctions and eigenvalues in the Sturm-Liouville problem with Dirichlet boundary conditions at the left endpoint and Neumann conditions at the right endpoint. Computations are performed for three potentials: sin(( x-π)2/π), cos(4 x), and a high nonisosceles triangle.
Using Algebra Word Problems to Assess Quantitative Ability: Attributes, Strategies, and Errors.
ERIC Educational Resources Information Center
Sebrechts, Marc M.; And Others
1996-01-01
Examined relations between algebraic word-problem attributes and students' strategies, errors, and problem difficulty. Found that constructed responses capture strategy formulation and high-level planning--as do traditional measures of quantitative reasoning--but are more sensitive to individual problem characteristics and procedural errors that…
Key Contextual Features of Algebra Word Problems: A Theoretical Model and Review of the Literature.
ERIC Educational Resources Information Center
Nasser, Ramzi; Carifio, James
One of the four algebra word problem structures found in K-12 textbooks is the propositional relation structure (Mayer, 1982). This type of problem asks students to establish equivalences between the variables or noun referents in the problem. The literature available indicates that students have inordinate difficulties, when trying to solve a…
Projected implicit Runge-Kutta methods for differential-algebraic boundary value problems
Ascher, U. ); Petzoid, L. )
1990-09-01
Differential-algebraic boundary value problems arise in the modelling of singular optimal control problems and in parameter estimation for singular systems. A new class of numerical methods for these problems is introduced, and shown to overcome difficulties with previously defined numerical methods. 4 refs., 1 tab.
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…
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
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.
Hydrogen Atom as AN Eigenvalue Problem in 3-D Spaces of Constant Curvature and Minimal Length
NASA Astrophysics Data System (ADS)
Nieto, L. M.; Santander, M.; Rosu, H. C.
An old result of Stevenson [Phys. Rev. 59, 842 (1941)] concerning the Kepler-Coulomb quantum problem on the three-dimensional (3-D) hypersphere is considered from the perspective of the radial Schrödinger equations on 3-D spaces of any (either positive, zero or negative) constant curvature. Further to Stevenson, we show in detail how to get the hypergeometric wave function for the hydrogen atom case. Finally, we make a comparison between the "space curvature" effects and minimal length effects for the hydrogen spectrum.
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.
Yamazaki, Ichitaro; Wu, Kesheng; Simon, Horst
2008-10-27
The original software package TRLan, [TRLan User Guide], page 24, implements the thick restart Lanczos method, [Wu and Simon 2001], page 24, for computing eigenvalues {lambda} and their corresponding eigenvectors v of a symmetric matrix A: Av = {lambda}v. Its effectiveness in computing the exterior eigenvalues of a large matrix has been demonstrated, [LBNL-42982], page 24. However, its performance strongly depends on the user-specified dimension of a projection subspace. If the dimension is too small, TRLan suffers from slow convergence. If it is too large, the computational and memory costs become expensive. Therefore, to balance the solution convergence and costs, users must select an appropriate subspace dimension for each eigenvalue problem at hand. To free users from this difficult task, nu-TRLan, [LNBL-1059E], page 23, adjusts the subspace dimension at every restart such that optimal performance in solving the eigenvalue problem is automatically obtained. This document provides a user guide to the nu-TRLan software package. The original TRLan software package was implemented in Fortran 90 to solve symmetric eigenvalue problems using static projection subspace dimensions. nu-TRLan was developed in C and extended to solve Hermitian eigenvalue problems. It can be invoked using either a static or an adaptive subspace dimension. In order to simplify its use for TRLan users, nu-TRLan has interfaces and features similar to those of TRLan: (1) Solver parameters are stored in a single data structure called trl-info, Chapter 4 [trl-info structure], page 7. (2) Most of the numerical computations are performed by BLAS, [BLAS], page 23, and LAPACK, [LAPACK], page 23, subroutines, which allow nu-TRLan to achieve optimized performance across a wide range of platforms. (3) To solve eigenvalue problems on distributed memory systems, the message passing interface (MPI), [MPI forum], page 23, is used. The rest of this document is organized as follows. In Chapter 2 [Installation
Superaccurate finite element eigenvalues via a Rayleigh quotient correction
NASA Astrophysics Data System (ADS)
Fried, Isaac; Leong, Kaiwen
2005-11-01
The consistent finite element formulation of the vibration problem generates upper bounds on the corresponding exact eigenvalues but requires the solution of the highly expensive general algebraic eigenproblem Kx=λMx with a global matrix M that is of the same sparsity pattern as the global stiffness K. The lumped, diagonal, mass matrix finite element formulation is no longer variationally correct but results in a simplified algebraic eigenproblem of comparable accuracy. We may write the mass matrix as a linear matrix function, M(γ)=M1+γM2, of parameter γ such that M(γ=1) is the (diagonal) lumped mass matrix and M(γ=0) is the consistent mass matrix. It has been shown that an optimal γ exists between these two states which results in superaccurate eigenvalues. What detracts from the appeal of this approach is that the superior accuracy thus achieved comes at the hefty price of having to solve the still general algebraic eigenproblem with a nondiagonal mass matrix. In this note we show that the same superior accuracy can be had by first computing an eigenvector u from Ku=λDu, in which D=M1+M2 is the lumped, diagonal, mass matrix, and then obtaining the corresponding, superaccurate, eigenvalue from the Rayleigh quotient R[u]=uTKu/uTM(γ)u, M(γ)=M1+γM2 for an optimal γ.
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),…
Relative Perturbation Theory: (I) Eigenvalue Variations
1994-07-25
observaciones sobre el algebra lineal . Universidad Nacional de Tucuman Revista, Serie A, 5:147{151, 1946. [6] P. Deift, J. Demmel, L.-C. Li, and C. Tomei...Gragg. On computing accurate singular values and eigenvalues of matrices with acyclic graphs. Linear Algebra and its Application, 185:203{217, 1993. [8...21] R.-C. Li. Norms of certain matrices with applications to variations of the spectra of matrices and matrix pencils. Linear Algebra and its
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
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…
Does Calculation or Word-Problem Instruction Provide A Stronger Route to Pre-Algebraic Knowledge?
Fuchs, Lynn S; Powell, Sarah R; Cirino, Paul T; Schumacher, Robin F; Marrin, Sarah; Hamlett, Carol L; Fuchs, Douglas; Compton, Donald L; Changas, Paul C
2014-11-01
The focus of this study was connections among 3 aspects of mathematical cognition at 2(nd) grade: calculations, word problems, and pre-algebraic knowledge. We extended the literature, which is dominated by correlational work, by examining whether intervention conducted on calculations or word problems contributes to improved performance in the other domain and whether intervention in either or both domains contributes to pre-algebraic knowledge. Participants were 1102 children in 127 2(nd)-grade classrooms in 25 schools. Teachers were randomly assigned to 3 conditions: calculation intervention, word-problem intervention, and business-as-usual control. Intervention, which lasted 17 weeks, was designed to provide research-based linkages between arithmetic calculations or arithmetic word problems (depending on condition) to pre-algebraic knowledge. Multilevel modeling suggested calculation intervention improved calculation but not word-problem outcomes; word-problem intervention enhanced word-problem but not calculation outcomes; and word-problem intervention provided a stronger route than calculation intervention to pre-algebraic knowledge.
Geist, G.A.; Howell, G.W.; Watkins, D.S.
1997-11-01
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.
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…
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)
Ismagilov, R. S.
1988-02-01
Two problems in measure theory are considered: that of the tail C*-algebra of a random walk on a group, and that of ergodicity of a skew-product action. These problems are solved in a uniform way by using Banach algebras and harmonic analysis on a group. Bibliography: 22 titles.
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
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…
Visual, Algebraic and Mixed Strategies in Visually Presented Linear Programming Problems.
ERIC Educational Resources Information Center
Shama, Gilli; Dreyfus, Tommy
1994-01-01
Identified and classified solution strategies of (n=49) 10th-grade students who were presented with linear programming problems in a predominantly visual setting in the form of a computerized game. Visual strategies were developed more frequently than either algebraic or mixed strategies. Appendix includes questionnaires. (Contains 11 references.)…
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…
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.
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…
ERIC Educational Resources Information Center
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 third graders' development of mathematics problem solving. In the fall, 122 third-grade students were…
ERIC Educational Resources Information Center
Schumann, Heinz; Green, David
2000-01-01
Discusses software for geometric construction, measurement, and calculation, and software for numerical calculation and symbolic analysis that allows for new approaches to the solution of geometric problems. Illustrates these computer-aided graphical, numerical, and algebraic methods of solution and discusses examples using the appropriate choice…
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.
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…
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.
Discontinuous initial value problems for functional differential-algebraic equations of mixed type
NASA Astrophysics Data System (ADS)
d'Albis, H.; Augeraud-Véron, E.; Hupkes, H. J.
We study the well-posedness of initial value problems for nonlinear functional differential-algebraic equations of mixed type. We are interested in solutions to such problems that admit a single jump discontinuity at time zero. We focus specially on the question whether unstable equilibria can be stabilized by appropriately choosing the size of the jump discontinuity. We illustrate our techniques by analytically studying an economic model for the interplay between inflation and interest rates. In particular, we investigate under which circumstances the central bank can prevent runaway inflation by appropriately hiking the interest rate.
Fuchs, Lynn S; Zumeta, Rebecca O; Schumacher, Robin Finelli; Powell, Sarah R; Seethaler, Pamela M; Hamlett, Carol L; Fuchs, Douglas
2010-06-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 taught students to represent the structural, defining features of word problems with overarching equations. Intervention lasted 16 weeks. We pretested and posttested 270 students on measures of word-problem skill; analyses that accounted for the nested structure of the data indicated superior word-problem learning for SBI students. Descriptive analyses of students' word-problem work indicated that SBI helped students represent the structure of word problems with algebraic equations, suggesting that SBI promoted this aspect of students' emerging algebraic reasoning.
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 taught students to represent the structural, defining features of word problems with overarching equations. Intervention lasted 16 weeks. We pretested and posttested 270 students on measures of word-problem skill; analyses that accounted for the nested structure of the data indicated superior word-problem learning for SBI students. Descriptive analyses of students’ word-problem work indicated that SBI helped students represent the structure of word problems with algebraic equations, suggesting that SBI promoted this aspect of students’ emerging algebraic reasoning. PMID:20539822
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…
ERIC Educational Resources Information Center
Huntley, Mary Ann; Davis, Jon D.
2008-01-01
A cross-curricular structured-probe task-based clinical interview study with 44 pairs of third year high-school mathematics students, most of whom were high achieving, was conducted to investigate their approaches to a variety of algebra problems. This paper presents results from three problems that were posed in symbolic form. Two problems are…
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
NASA Technical Reports Server (NTRS)
Sidi, Avram
1992-01-01
Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.
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.
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.
Fuchs, Lynn S; Compton, Donald L; Fuchs, Douglas; Hollenbeck, Kurstin N; Craddock, Caitlin F; Hamlett, Carol L
2008-11-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 3(rd) graders' development of mathematics problem solving. In the fall, 122 3(rd)-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.
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
A Robust Multilevel Simultaneous Eigenvalue Solver
1993-06-01
same efficiency is obtained for problems in 3-D as for problem in 2-D. In all examples the periodic boundary conditions Schr ~ dinger eigenvalue problem (A...coarse level work on levels 1, 2, took ap- proximately 1/6 of the computer time and on levels 1, 2, 3, approximately 1/4 of the computer time . This is a...eigenvalues. The results of the numerical tests for Schr ~ dinger eigenvalue problems, show that the algorithm achieved the same accuracy, using the same
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.
ERIC Educational Resources Information Center
Xin, Yan Ping; Si, Luo; Hord, Casey; Zhang, Dake; Cetinas, Suleyman; Park, Joo Young
2012-01-01
The study explored the effects of a computer-assisted COnceptual Model-based Problem-Solving (COMPS) program on multiplicative word-problem-solving performance of students with learning disabilities or difficulties. The COMPS program emphasizes mathematical modeling with algebraic expressions of relations. Participants were eight fourth and fifth…
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…
Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems
NASA Technical Reports Server (NTRS)
Vanek, Petr; Mandel, Jan; Brezina, Marian
1996-01-01
Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.
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.
NASA Astrophysics Data System (ADS)
Leukhin, Anatolii N.
2005-08-01
The algebraic solution of a 'complex' problem of synthesis of phase-coded (PC) sequences with the zero level of side lobes of the cyclic autocorrelation function (ACF) is proposed. It is shown that the solution of the synthesis problem is connected with the existence of difference sets for a given code dimension. The problem of estimating the number of possible code combinations for a given code dimension is solved. It is pointed out that the problem of synthesis of PC sequences is related to the fundamental problems of discrete mathematics and, first of all, to a number of combinatorial problems, which can be solved, as the number factorisation problem, by algebraic methods by using the theory of Galois fields and groups.
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.
1988-04-01
Moreover, if e2 > 61 and we further assume (f.1) f(x,y) is locally Lipschitz continuous in y then inequalities (1.37) and (1.38) are strict. 17 Proof MI...Univ. Math. J. 20 (1971), 983-996.[I 124 18. J. A. Hempel, Superlinear variational boundary value problems and nonuniqueness , Thesis, University of
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.
Numerical methods for boundary value problems in differential-algebraic equations
Ascher, U.M. . Dept. of Computer Science); Petzold, L.R. )
1990-09-24
Differential-algebraic equation (DAE) boundary value problems arise in a variety of applications, including optimal control and parameter estimation for constrained systems. In this paper we survey these applications and explore some of the difficulties associated with solving the resulting DAE systems. For finite difference methods, the need to maintain stability in the differential part of the system often necessitates the use of methods based on symmetric discretizations. However, these methods can suffer from instability and loss of accuracy when applied to certain DAE systems. We describe a new class of methods, Projected Implicit Runge-Kutta Methods, which overcomes these difficulties. We give convergence and stability results, and present numerical experiments which illustrate the effectiveness of the new methods. 20 refs., 1 tab.
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 Technical Reports Server (NTRS)
Lyusternik, L. A.
1980-01-01
The mathematics involved in numerically solving for the plane boundary value of the Laplace equation by the grid method is developed. The approximate solution of a boundary value problem for the domain of the Laplace equation by the grid method consists of finding u at the grid corner which satisfies the equation at the internal corners (u=Du) and certain boundary value conditions at the boundary corners.
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.
ERIC Educational Resources Information Center
Shoecraft, Paul Joseph
Three instructional approaches on translating selected types of algebra word problems were investigated: direct translations, high imagery with materials, and high imagery with drawings. Participating were 366 seventh grade and 336 ninth grade students. Treatment effects by grade used multivariate analysis of covariance for student scores and…
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.
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…
Spurious Roots in the Algebraic Dirac Equation
NASA Astrophysics Data System (ADS)
Pestka, Grzegorz
The nature of spurious roots discovered by Drake and Goldman [G. W. F. Drake and S. P. Goldman, Phys. Rev. A 23, 2093 (1981)] among solutions of the algebraic Dirac Hamiltonian eigenvalue problem is discussed. It is shown that the spurious roots represent the positive spectrum states of the Dirac Hamiltonian and that each of them has its variational non-relativistic counterpart. Sufficient conditions to avoid the appearance of the spuriouses in the forbidden gap of Dirac energies are formulated. Numerical examples for κ = 1 ( P1/2) states of an electron in a spherical Coulomb potential (in Slater-type bases) are presented.
Unified algebraic method to non-Hermitian systems with Lie algebraic linear structure
NASA Astrophysics Data System (ADS)
Zhang, Hong-Biao; Jiang, Guang-Yuan; Wang, Gang-Cheng
2015-07-01
We suggest a generic algebraic method to solve non-Hermitian Hamiltonian systems with Lie algebraic linear structure. Such method can not only unify the non-Hermitian Hamiltonian and the Hermitian Hamiltonian with the same structure but also keep self-consistent between similarity transformation and unitary transformation. To clearly reveal the correctness and physical meaning of such algebraic method, we illustrate our method with two different types of non-Hermitian Hamiltonians: the non-Hermitian Hamiltonian with Heisenberg algebraic linear structure and the non-Hermitian Hamiltonian with su(1, 1) algebraic linear structure. We obtain energy eigenvalues and the corresponding eigenstates of non-Hermitian forced harmonic oscillator with Heisenberg algebra structure via a proper similarity transformation. We also calculate the eigen-problems of general non-Hermitian Hamiltonian with su(1, 1) structure in terms of the similarity transformation. As an application, we focus on studying the non-Hermitian single-mode squeezed and coherent harmonic oscillator system and find that such similarity transformation associated with this model is in fact gauge-like transformation for simple harmonic oscillator.
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
7 2.2 Condensed matter physics . . . . . . . . . . . . . . . . . . . . . . . 9 2.3 Spectral reordering...working precision in floating-point arithmetic due to the fact that rotational masses are omitted [1]. 2.2 Condensed matter physics In 1958, P.W...the plot more intuitive, we have chosen to refer to our updated vector as v = x+ d rather than v = x− d. 19 quantity is smallest, and the dark blue
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
graduate school. Debugging somebody else’s MPI code is an immensely frustrating experience, but he would regularly stay late at the oce to assist me...cessfully. In addition, I will describe the parallel kernels required by my code . 5 The next sections will describe my Fortran-based implementations of...Sandia’s publicly available Trace- Min code . Each of the methods has its own unique advantages and disadvantages, summarized in table 3.1. In short, I
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.
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.
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…
Algebraic connectivity and graph robustness.
Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T.
2009-07-01
Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.
NASA Astrophysics Data System (ADS)
Ellouz, Hanen; Feki, Ines; Jeribi, Aref
2013-11-01
In the present paper, we prove that the family of exponentials associated to the eigenvalues of the perturbed operator T(ɛ) ≔ T0 + ɛT1 + ɛ2T2 + … + ɛkTk + … forms a Riesz basis in L2(0, T), T > 0, where \\varepsilon in {C}, T0 is a closed densely defined linear operator on a separable Hilbert space H with domain D(T_0) having isolated eigenvalues with multiplicity one, while T1, T2, … are linear operators on H having the same domain Dsupset D(T_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.
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.
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…
Symmetry preserving eigenvalue embedding in finite-element model updating of vibrating structures
NASA Astrophysics Data System (ADS)
Carvalho, Joao B.; Datta, Biswa N.; Lin, Wen-Wei; Wang, Chern-Shuh
2006-03-01
The eigenvalue embedding problem addressed in this paper is the one of reassigning a few troublesome eigenvalues of a symmetric finite-element model to some suitable chosen ones, in such a way that the updated model remains symmetric and the remaining large number of eigenvalues and eigenvectors of the original model is to remain unchanged. The problem naturally arises in stabilizing a large-scale system or combating dangerous vibrations, which can be responsible for undesired phenomena such as resonance, in large vibrating structures. A new computationally efficient and symmetry preserving method and associated theories are presented in this paper. The model is updated using low-rank symmetric updates and other computational requirements of the method include only simple operations such as matrix multiplications and solutions of low-order algebraic linear systems. These features make the method practical for large-scale applications. The results of numerical experiments on the simulated data obtained from the Boeing company and on some benchmark examples are presented to show the accuracy of the method. Computable error bounds for the updated matrices are also given by means of rigorous mathematical analysis.
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…
On asymptotic properties of biharmonic Steklov eigenvalues
NASA Astrophysics Data System (ADS)
Liu, Genqian
2016-11-01
In this paper, by explicitly calculating the principal symbols of pseudodifferential operators, we establish two Weyl-type asymptotic formulas with sharp remainder estimates for the counting functions of the two classes of biharmonic Steklov eigenvalue problems of smooth bounded domains in a Riemannian manifold.
Numerical pole assignment by eigenvalue Jacobian inversion
NASA Technical Reports Server (NTRS)
Sevaston, George E.
1986-01-01
A numerical procedure for solving the linear pole placement problem is developed which operates by the inversion of an analytically determined eigenvalue Jacobian matrix. Attention is given to convergence characteristics and pathological situations. It is not concluded that the algorithm developed is suitable for computer-aided control system design with particular reference to the scan platform pointing control system for the Galileo spacecraft.
NASA Technical Reports Server (NTRS)
Murthy, D. V.
1989-01-01
This paper considers complex transcendental eigenvalue problems where one is interested in pairs of eigenvalues that are restricted to take real values only. Such eigenvalue problems arise in dynamic stability analysis of nonconservative physical systems, i.e., flutter analysis of aeroelastic systems. Some available solution methods are discussed and a new method is presented. Two computational approaches are described for analytical evaluation of the sensitivities of these eigenvalues when they are dependent on other parameters. The algorithms presented are illustrated through examples.
NASA Technical Reports Server (NTRS)
Newman, M.; Flanagan, P. F.
1976-01-01
The development of the tridiagonal reduction method and its implementation in NASTRAN are described for real eigenvalue analysis as typified by structural vibration and buckling problems. This method is an automatic matrix reduction scheme whereby the eigensolutions in the neighborhood of a specified point in the eigenspectrum can be accurately extracted from a tridiagonal eigenvalue problem whose order is much lower than that of the full problem. The process is effected without orbitrary lumping of masses or other physical quantities at selected node points and thus avoids one of the basic weaknesses of other techniques.
Quantum cluster algebras and quantum nilpotent algebras
Goodearl, Kenneth R.; Yakimov, Milen T.
2014-01-01
A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197
ERIC Educational Resources Information Center
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…
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…
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.
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…
EISPACK3. Matrix Eigenvalue/Vector Package
Garbow, B.S.
1984-04-01
EISPACK3 is a collection of 75 FORTRAN subroutines, both single and double-precision, that compute the eigenvalues and eigenvectors of nine classes of matrices. The package can determine the eigensystem of complex general, complex Hermitian, real general, real symmetric, real symmetric band, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real symmetric matrices. In addition, there are two routines which use the singular value decomposition to solve certain least squares problems.
NASA Astrophysics Data System (ADS)
Bai, Zheng-Jian; Chen, Mei-Xiang; Datta, Biswa Nath
2013-02-01
The partial quadratic eigenvalue assignment problem (PQEAP) is to compute a pair of feedback matrices such that a small number of unwanted eigenvalues in a structure are reassigned to suitable locations while keeping the remaining large number of eigenvalues and the associated eigenvectors unchanged. The problem arises in active vibration control of structures. For real-life applications, it is not enough just to compute the feedback matrices. They should be computed in such a way that both closed-loop eigenvalue sensitivity and feedback norms are as small as possible. Also, for practical effectiveness, the time-delay between the measurement of the state and implementation of the feedback controller should be considered while solving the PQEAP. These problems are usually solved using only system matrices and do not necessarily take advantage of the receptances which are available by measurements. In this paper, we propose hybrid methods, combining the system matrices and measured receptances, for solutions of the multi-input PQEAP and the minimum-norm PQEAP, both for systems with and without time-delay. These hybrid methods are more efficient than the standard methods which only use the system matrices and not the receptances. These hybrid methods also offer several other computational advantages over the standard methods. Our results generalize the recent work by Ram et al. [Partial pole placement with time delay in structures using the receptance and the system matrices, Linear Algebra and its Applications 434 (2011) 1689-1696]. The results of numerical experiments demonstrate the effectiveness of the proposed methods.
ERIC Educational Resources Information Center
Cavanagh, Sean
2008-01-01
A popular humorist and avowed mathphobe once declared that in real life, there's no such thing as algebra. Kathie Wilson knows better. Most of the students in her 8th grade class will be thrust into algebra, the definitive course that heralds the beginning of high school mathematics, next school year. The problem: Many of them are about three…
Complex eigenvalues for the stability of Couette flow
NASA Technical Reports Server (NTRS)
Diprima, R. C.; Hall, P.
1983-01-01
The eigenvalue problem for the linear stability of Couette flow between rotating concentric cylinders to axisymmetric disturbances is considered. It is shown by numerical calculations and by formal perturbation methods that when the outer cylinder is at rest there exist complex eigenvalues corresponding to oscillatory damped disturbances. The structure of the first few eigenvalues in the spectrum is discussed. The results do not contradict the principle of exchange of stabilities, namely, for a fixed axial wavenumber the first mode to become unstable as the speed of the inner cylinder is increased is nonoscillatory as the stability boundary is crossed.
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
ERIC Educational Resources Information Center
Suwito, Abi; Yuwono, Ipung; Parta, I. Nengah; Irawati, Santi; Oktavianingtyas, Ervin
2016-01-01
This study aims to determine the ability of algebra students who have 3 levels van Hiele levels. Follow its framework Dindyal framework (2007). Students are required to do 10 algebra shaped multiple choice, then students work 15 about the geometry of the van Hiele level in the form of multiple choice questions. The question has been tested levels…
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…
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
Fuchs, Lynn S.; Gilbert, Jennifer K.; Powell, Sarah R.; Cirino, Paul T.; Fuchs, Douglas; Hamlett, Carol L.; Seethaler, Pamela M.; Tolar, Tammy D.
2016-01-01
The purpose of this study was to examine child-level pathways in development of pre-algebraic knowledge versus word-problem solving, while evaluating the contribution of calculation accuracy and fluency as mediators of foundational skills/processes. Children (n = 962; mean 7.60 years) were assessed on general cognitive processes and early calculation, word-problem, and number knowledge at start of grade 2; calculation accuracy and calculation fluency at end of grade 2; and pre-algebraic knowledge and word-problem solving at end of grade 4. Important similarities in pathways were identified, but path analysis also indicated that language comprehension is more critical for later word-problem solving than pre-algebraic knowledge. We conclude that pathways in development of these forms of 4th-grade mathematics performance are more alike than different, but demonstrate the need to fine-tune instruction for strands of the mathematics curriculum in ways that address individual students’ foundational mathematics skills or cognitive processes. PMID:27786534
Determination of eigenvalues of dynamical systems by symbolic computation
NASA Technical Reports Server (NTRS)
Howard, J. C.
1982-01-01
A symbolic computation technique for determining the eigenvalues of dynamical systems is described wherein algebraic operations, symbolic differentiation, matrix formulation and inversion, etc., can be performed on a digital computer equipped with a formula-manipulation compiler. An example is included that demonstrates the facility with which the system dynamics matrix and the control distribution matrix from the state space formulation of the equations of motion can be processed to obtain eigenvalue loci as a function of a system parameter. The example chosen to demonstrate the technique is a fourth-order system representing the longitudinal response of a DC 8 aircraft to elevator inputs. This simplified system has two dominant modes, one of which is lightly damped and the other well damped. The loci may be used to determine the value of the controlling parameter that satisfied design requirements. The results were obtained using the MACSYMA symbolic manipulation system.
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
NASA Astrophysics Data System (ADS)
Mathai, Pramod P.
the uncertainty in the parameters of the differential equations. There is a clear need to design better experiments for IEF without the current overhead of expensive chemicals and labor. We show how with a simpler modeling of the underlying chemistry, we can still achieve the accuracy that has been achieved in existing literature for modeling small ranges of pH (hydrogen ion concentration) in IEF, but with far less computational time. We investigate a further reduction of time by modeling the IEF problem using the Proper Orthogonal Decomposition (POD) technique and show why POD may not be sufficient due to the underlying constraints. The final problem that we address in this thesis addresses a certain class of dynamics with high stiffness - in particular, differential algebraic equations. With the help of simple examples, we show how the traditional POD procedure will fail to model certain high stiffness problems due to a particular behavior of the vector field which we will denote as twist. We further show how a novel augmentation to the traditional POD algorithm can model-reduce problems with twist in a computationally cheap manner without any additional data requirements.
LAPACK++: A design overview of object-oriented extensions for high performance linear algebra
Dongarra, J.J. |; Pozo, R.; Walker, D.W.
1993-12-31
LAPACK++ is an object-oriented C++ extension of the LAPACK (Linear Algebra PACKage) library for solving the common problems of numerical linear algebra: linear systems, linear least squares, and eigenvalue problems on high-performance computer architectures. The advantages of an object-oriented approach include the ability to encapsule various matrix representations, hide their implementation details, reduce the number of subroutines, simplify their calling sequences, and provide an extendible software framework that can incorporate future extensions of LAPACK such as ScaLAPACK++ for distributed memory architectures. The authors present an overview of the object-oriented design of the matrix and decomposition classes in C++ and discuss its impact on elegance, generality, and performance.
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.
Software for computing eigenvalue bounds for iterative subspace matrix methods
NASA Astrophysics Data System (ADS)
Shepard, Ron; Minkoff, Michael; Zhou, Yunkai
2005-07-01
This paper describes software for computing eigenvalue bounds to the standard and generalized hermitian eigenvalue problem as described in [Y. Zhou, R. Shepard, M. Minkoff, Computing eigenvalue bounds for iterative subspace matrix methods, Comput. Phys. Comm. 167 (2005) 90-102]. The software discussed in this manuscript applies to any subspace method, including Lanczos, Davidson, SPAM, Generalized Davidson Inverse Iteration, Jacobi-Davidson, and the Generalized Jacobi-Davidson methods, and it is applicable to either outer or inner eigenvalues. This software can be applied during the subspace iterations in order to truncate the iterative process and to avoid unnecessary effort when converging specific eigenvalues to a required target accuracy, and it can be applied to the final set of Ritz values to assess the accuracy of the converged results. Program summaryTitle of program: SUBROUTINE BOUNDS_OPT Catalogue identifier: ADVE Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVE Computers: any computer that supports a Fortran 90 compiler Operating systems: any computer that supports a Fortran 90 compiler Programming language: Standard Fortran 90 High speed storage required:5m+5 working-precision and 2m+7 integer for m Ritz values No. of bits in a word: The floating point working precision is parameterized with the symbolic constant WP No. of lines in distributed program, including test data, etc.: 2452 No. of bytes in distributed program, including test data, etc.: 281 543 Distribution format: tar.gz Nature of physical problem: The computational solution of eigenvalue problems using iterative subspace methods has widespread applications in the physical sciences and engineering as well as other areas of mathematical modeling (economics, social sciences, etc.). The accuracy of the solution of such problems and the utility of those errors is a fundamental problem that is of
A new S-type eigenvalue inclusion set for tensors and its applications.
Huang, Zheng-Ge; Wang, Li-Gong; Xu, Zhong; Cui, Jing-Jing
2016-01-01
In this paper, a new S-type eigenvalue localization set for a tensor is derived by dividing [Formula: see text] into disjoint subsets S and its complement. It is proved that this new set is sharper than those presented by Qi (J. Symb. Comput. 40:1302-1324, 2005), Li et al. (Numer. Linear Algebra Appl. 21:39-50, 2014) and Li et al. (Linear Algebra Appl. 481:36-53, 2015). As applications of the results, new bounds for the spectral radius of nonnegative tensors and the minimum H-eigenvalue of strong M-tensors are established, and we prove that these bounds are tighter than those obtained by Li et al. (Numer. Linear Algebra Appl. 21:39-50, 2014) and He and Huang (J. Inequal. Appl. 2014:114, 2014).
Learning Algebra from Worked Examples
ERIC Educational Resources Information Center
Lange, Karin E.; Booth, Julie L.; Newton, Kristie J.
2014-01-01
For students to be successful in algebra, they must have a truly conceptual understanding of key algebraic features as well as the procedural skills to complete a problem. One strategy to correct students' misconceptions combines the use of worked example problems in the classroom with student self-explanation. "Self-explanation" is the…
Perturbation of eigenvalues for systems with concentrated mass
NASA Astrophysics Data System (ADS)
Sanchez-Hubert, Jacqueline
1989-07-01
Theoretical results are presented for the vibrations of a system which is formed by the domain of R exp N (for N of 2 and 3) and which converges to a uniform density and a point mass at the origin as the density-dependent parameter epsilon approaches 0. The present study extends previous two-dimensional results for the coupling between local vibrations near the origin and the global vibrations of the domain (Leal and Sanchez-Hubert, 1989) to the case of a simple eigenvalue which is common to both the N = 2 and N = 3 problems. For epsilon of greater than 0, the common eigenvalue for these problems is shown to be split into two branches of simple eigenvalues.
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.
Dispersion equation and eigenvalues for quantum wells using spectral parameter power series
Castillo-Perez, Raul; Oviedo-Galdeano, Hector; Rabinovich, Vladimir S.
2011-04-15
We derive a dispersion equation for determining eigenvalues of inhomogeneous quantum wells in terms of spectral parameter power series and apply it for the numerical treatment of eigenvalue problems. The method is algorithmically simple and can be easily implemented using available routines of such environments for scientific computing as MATLAB.
NASA Technical Reports Server (NTRS)
Sloss, J. M.; Kranzler, S. K.
1972-01-01
The equivalence of a considered integral equation form with an infinite system of linear equations is proved, and the localization of the eigenvalues of the infinite system is expressed. Error estimates are derived, and the problems of finding upper bounds and lower bounds for the eigenvalues are solved simultaneously.
Eigenvalue pinching on spinc manifolds
NASA Astrophysics Data System (ADS)
Roos, Saskia
2017-02-01
We derive various pinching results for small Dirac eigenvalues using the classification of spinc and spin manifolds admitting nontrivial Killing spinors. For this, we introduce a notion of convergence for spinc manifolds which involves a general study on convergence of Riemannian manifolds with a principal S1-bundle. We also analyze the relation between the regularity of the Riemannian metric and the regularity of the curvature of the associated principal S1-bundle on spinc manifolds with Killing spinors.
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.
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.
Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation
NASA Astrophysics Data System (ADS)
Jaksch, Peter; Papageorgiou, Anargyros
2003-12-01
We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schrödinger equation, on a discrete grid. We start with a classically obtained eigenvector for a problem discretized on a coarse grid, and we efficiently construct, quantum mechanically, an approximation of the same eigenvector on a fine grid. We use this approximation as the initial state for the eigenvalue estimation algorithm, and show the relationship between its success probability and the size of the coarse grid.
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.
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.…
1986-05-31
algebra required to derive the differential equations satisfied by the higher order gains. We are investigating the use of algebraic manipulators...establish that the weight matrices selected for the usual quadratic performance index have a strong impact upon eigenvalue placement and other...stability/performance robustness measures. We also establish an algorithm which we have found useful for "optimal tuning" of the weight matrices ; we have
Eigenvalue statistics for the sum of two complex Wishart matrices
NASA Astrophysics Data System (ADS)
Kumar, Santosh
2014-09-01
The sum of independent Wishart matrices, taken from distributions with unequal covariance matrices, plays a crucial role in multivariate statistics, and has applications in the fields of quantitative finance and telecommunication. However, analytical results concerning the corresponding eigenvalue statistics have remained unavailable, even for the sum of two Wishart matrices. This can be attributed to the complicated and rotationally noninvariant nature of the matrix distribution that makes extracting the information about eigenvalues a nontrivial task. Using a generalization of the Harish-Chandra-Itzykson-Zuber integral, we find exact solution to this problem for the complex Wishart case when one of the covariance matrices is proportional to the identity matrix, while the other is arbitrary. We derive exact and compact expressions for the joint probability density and marginal density of eigenvalues. The analytical results are compared with numerical simulations and we find perfect agreement.
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…
The Algebra of Complex Numbers.
ERIC Educational Resources Information Center
LePage, Wilbur R.
This programed text is an introduction to the algebra of complex numbers for engineering students, particularly because of its relevance to important problems of applications in electrical engineering. It is designed for a person who is well experienced with the algebra of real numbers and calculus, but who has no experience with complex number…
Classification of filiform Lie algebras of order 3
NASA Astrophysics Data System (ADS)
Navarro, Rosa María
2016-12-01
Lie algebras of order 3 constitute a generalization of Lie algebras and superalgebras. Throughout this paper the classification problem of filiform Lie algebras of order 3 is considered and therefore this work is a continuation papers seen in the literature. We approach this classification by extending Vergne's result for filiform Lie algebras and by considering algebras of order 3 of high nilindex. We find the expression of the law to which any elementary filiform Lie algebra of order 3 is isomorphic.
NASA Astrophysics Data System (ADS)
Li, Tiexiang; Huang, Tsung-Ming; Lin, Wen-Wei; Wang, Jenn-Nan
2017-03-01
We propose an efficient eigensolver for computing densely distributed spectra of the two-dimensional transmission eigenvalue problem (TEP), which is derived from Maxwell’s equations with Tellegen media and the transverse magnetic mode. The governing equations, when discretized by the standard piecewise linear finite element method, give rise to a large-scale quadratic eigenvalue problem (QEP). Our numerical simulation shows that half of the positive eigenvalues of the QEP are densely distributed in some interval near the origin. The quadratic Jacobi–Davidson method with a so-called non-equivalence deflation technique is proposed to compute the dense spectrum of the QEP. Extensive numerical simulations show that our proposed method processes the convergence efficiently, even when it needs to compute more than 5000 desired eigenpairs. Numerical results also illustrate that the computed eigenvalue curves can be approximated by nonlinear functions, which can be applied to estimate the denseness of the eigenvalues for the TEP.
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.
Embedding Algebraic Thinking throughout the Mathematics Curriculum
ERIC Educational Resources Information Center
Vennebush, G. Patrick; Marquez, Elizabeth; Larsen, Joseph
2005-01-01
This article explores the algebra that can be uncovered in many middle-grades mathematics tasks that, on first inspection, do not appear to be algebraic. It shows connections to the other four Standards that occur in traditional algebra problems, and it offers strategies for modifying activities so that they can be used to foster algebraic…
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.
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.
Tensor eigenvalues and entanglement of symmetric states
NASA Astrophysics Data System (ADS)
Bohnet-Waldraff, F.; Braun, D.; Giraud, O.
2016-10-01
Tensor eigenvalues and eigenvectors have been introduced in the recent mathematical literature as a generalization of the usual matrix eigenvalues and eigenvectors. We apply this formalism to a tensor that describes a multipartite symmetric state or a spin state, and we investigate to what extent the corresponding tensor eigenvalues contain information about the multipartite entanglement (or, equivalently, the quantumness) of the state. This extends previous results connecting entanglement to spectral properties related to the state. We show that if the smallest tensor eigenvalue is negative, the state is detected as entangled. While for spin-1 states the positivity of the smallest tensor eigenvalue is equivalent to separability, we show that for higher values of the angular momentum there is a correlation between entanglement and the value of the smallest tensor eigenvalue.
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.
ERIC Educational Resources Information Center
Ketterlin-Geller, Leanne R.; Jungjohann, Kathleen; Chard, David J.; Baker, Scott
2007-01-01
Much of the difficulty that students encounter in the transition from arithmetic to algebra stems from their early learning and understanding of arithmetic. Too often, students learn about the whole number system and the operations that govern that system as a set of procedures to solve addition, subtraction, multiplication, and division problems.…
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…
NASA Technical Reports Server (NTRS)
Ito, K.
1984-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
NASA Astrophysics Data System (ADS)
Bai, Zheng-Jian; Yang, Jin-Ku; Datta, Biswa Nath
2016-12-01
In this paper, we consider the robust partial quadratic eigenvalue assignment problem in vibration by active feedback control. Based on the receptance measurements and the system matrices, we propose an optimization method for the robust and minimum norm partial quadratic eigenvalue assignment problem. We provide a new cost function and the closed-loop eigenvalue sensitivity and the feedback norms can be minimized simultaneously. Our method is also extended to the case of time delay between measurements of state and actuation of control. Numerical tests demonstrate the effectiveness of our 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
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.
NASA Astrophysics Data System (ADS)
Mukhin, Evgeny; Tarasov, Vitaly; Varchenko, Alexander
2011-10-01
Consider a tensor product of finite-dimensional irreducible ??;N+1-modules and its decomposition into irreducible modules. The ??;N+1 Gaudin model assigns to each multiplicity space of that decomposition a commutative (Bethe) algebra of linear operators acting on the multiplicity space. The Bethe ansatz method is a method to find eigenvectors and eigenvalues of the Bethe algebra. One starts with a critical point of a suitable (master) function and constructs an eigenvector of the Bethe algebra. In this paper we consider the algebra of functions on the critical set of the associated master function and show that the action of this algebra on itself is isomorphic to the action of the Bethe algebra on a suitable subspace of the multiplicity space. As a byproduct we prove that the Bethe vectors corresponding to different critical points of the master function are linearly independent and, in particular, nonzero.
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.
NASA Technical Reports Server (NTRS)
Mulligan, Jeffrey B.
2017-01-01
A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. We would like it to match the well-defined algebra of spectral functions describing lights and surface reflectances, but an exact correspondence is impossible after the spectra have been projected to a three-dimensional color space, because of metamerism physically different spectra can produce the same color sensation. Metameric spectra are interchangeable for the purposes of addition, but not multiplication, so any color algebra is necessarily an approximation to physical reality. Nevertheless, because the majority of naturally-occurring spectra are well-behaved (e.g., continuous and slowly-varying), color algebras can be formulated that are largely accurate and agree well with human intuition. Here we explore the family of algebras that result from associating each color with a member of a three-dimensional manifold of spectra. This association can be used to construct a color product, defined as the color of the spectrum of the wavelength-wise product of the spectra associated with the two input colors. The choice of the spectral manifold determines the behavior of the resulting system, and certain special subspaces allow computational efficiencies. The resulting systems can be used to improve computer graphic rendering techniques, and to model various perceptual phenomena such as color constancy.
ERIC Educational Resources Information Center
Kinsella, John J.
1970-01-01
Discussed are the nature of a mathematical problem, problem solving in the traditional and modern mathematics programs, problem solving and psychology, research related to problem solving, and teaching problem solving in algebra and geometry. (CT)
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.
An eigenvalue inequality of the Newton potential
NASA Astrophysics Data System (ADS)
Suragan, Durvudkhan
2016-12-01
In this short conference paper we prove an isoperimetric inequality for the second eigenvalue of the Newton potential. In turn, the Newton potential can be related to the Laplacian with a non-local type boundary condition, so we obtain an isoperimetric result for its second eigenvalue as well.
Numerical determination of the fundamental eigenvalue for the Laplace operator on a spherical domain
NASA Technical Reports Server (NTRS)
Walden, H.
1977-01-01
Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (i.e., the membrane eignevalue problem for the vibration equation) on the unit spherical surface are developed. Two types of spherical surface domains are considered: the interior of a spherical triangle, and the exterior of a great circle arc extending for less than pi radians (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 employed. The fundamental eigenvalue is approximated by iteration utilizing the power method and point successive overrelaxation. Some numerical results are given and compared, in certain special cases, with analytical solutions to the eigenvalue problem. The significance of the numerical eigenvalue results is discussed in terms of the singularities in the solution of three-dimensional boundary-value problems near a polyhedral corner of the domain.
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.
NASA Astrophysics Data System (ADS)
Mikhalev, A. V.; Pinchuk, I. A.
2005-06-01
The structure of Steinberg conformal algebras is studied; these are analogues of Steinberg groups (algebras, superalgebras).A Steinberg conformal algebra is defined as an abstract algebra by a system of generators and relations between the generators. It is proved that a Steinberg conformal algebra is the universal central extension of the corresponding conformal Lie algebra; the kernel of this extension is calculated.
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-07-23
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.
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
On special classes of n-algebras
NASA Astrophysics Data System (ADS)
Vainerman, L.; Kerner, R.
1996-05-01
We define n-algebras as linear spaces on which the internal composition law involves n elements: m:V⊗n■V. It is known that such algebraic structures are interesting for their applications to problems of modern mathematical physics. Using the notion of a commutant of two subalgebras of an n-algebra, we distinguish certain classes of n-algebras with reasonable properties: semisimple, Abelian, nilpotent, solvable. We also consider a few examples of n-algebras of different types, and show their properties.
Baxter Operator and Archimedean Hecke Algebra
NASA Astrophysics Data System (ADS)
Gerasimov, A.; Lebedev, D.; Oblezin, S.
2008-12-01
In this paper we introduce Baxter integral {mathcal{Q}} -operators for finite-dimensional Lie algebras {mathfrak{gl}_{ell+1}} and {mathfrak{so}_{2ell+1}} . Whittaker functions corresponding to these algebras are eigenfunctions of the {mathcal{Q}}-operators with the eigenvalues expressed in terms of Gamma-functions. The appearance of the Gamma-functions is one of the manifestations of an interesting connection between Mellin-Barnes and Givental integral representations of Whittaker functions, which are in a sense dual to each other. We define a dual Baxter operator and derive a family of mixed Mellin-Barnes-Givental integral representations. Givental and Mellin-Barnes integral representations are used to provide a short proof of the Friedberg-Bump and Bump conjectures for G = GL( ℓ + 1) proved earlier by Stade. We also identify eigenvalues of the Baxter {mathcal{Q}}-operator acting on Whittaker functions with local Archimedean L-factors. The Baxter {mathcal{Q}}-operator introduced in this paper is then described as a particular realization of the explicitly defined universal Baxter operator in the spherical Hecke algebra {mathcal {H}(G(mathbb{R}), K)} , K being a maximal compact subgroup of G. Finally we stress an analogy between {mathcal{Q}}-operators and certain elements of the non-Archimedean Hecke algebra {mathcal {H}(G(mathbb{Q}_p),G(mathbb{Z}_p))}.
Bifurcations of Nontwisted Heteroclinic Loop with Resonant Eigenvalues
Jin, Yinlai; Zhu, Xiaowei; Xu, Han; Zhang, Liqun; Ding, Benyan
2014-01-01
By using the foundational solutions of the linear variational equation of the unperturbed system along the heteroclinic orbits to establish the local coordinate systems in the small tubular neighborhoods of the heteroclinic orbits, we study the bifurcation problems of nontwisted heteroclinic loop with resonant eigenvalues. The existence, numbers, and existence regions of 1-heteroclinic loop, 1-homoclinic loop, 1-periodic orbit, 2-fold 1-periodic orbit, and two 1-periodic orbits are obtained. Meanwhile, we give the corresponding bifurcation surfaces. PMID:24892076
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.
ERIC Educational Resources Information Center
Capani, Antonio; De Dominicis, Gabriel
This paper proposes a model for a general interface between people and Computer Algebra Systems (CAS). The main features in the CAS interface are data navigation and the possibility of accessing powerful remote machines. This model is based on the idea of session management, in which the main engine of the tool enables interactions with the…
Inequalities, Assessment and Computer Algebra
ERIC Educational Resources Information Center
Sangwin, Christopher J.
2015-01-01
The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary…
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.
Eigenvalue Spectra of Modular Networks
NASA Astrophysics Data System (ADS)
Peixoto, Tiago P.
2013-08-01
A large variety of dynamical processes that take place on networks can be expressed in terms of the spectral properties of some linear operator which reflects how the dynamical rules depend on the network topology. Often, such spectral features are theoretically obtained by considering only local node properties, such as degree distributions. Many networks, however, possess large-scale modular structures that can drastically influence their spectral characteristics and which are neglected in such simplified descriptions. Here, we obtain in a unified fashion the spectrum of a large family of operators, including the adjacency, Laplacian, and normalized Laplacian matrices, for networks with generic modular structure, in the limit of large degrees. We focus on the conditions necessary for the merging of the isolated eigenvalues with the continuous band of the spectrum, after which the planted modular structure can no longer be easily detected by spectral methods. This is a crucial transition point which determines when a modular structure is strong enough to affect a given dynamical process. We show that this transition happens in general at different points for the different matrices, and hence the detectability threshold can vary significantly, depending on the operator chosen. Equivalently, the sensitivity to the modular structure of the different dynamical processes associated with each matrix will be different, given the same large-scale structure present in the network. Furthermore, we show that, with the exception of the Laplacian matrix, the different transitions coalesce into the same point for the special case where the modules are homogeneous but separate otherwise.
Direct determination of the underlying Lie algebra in nonlinear optics
NASA Astrophysics Data System (ADS)
Arnold, J. M.
1991-01-01
It is shown that the equations of resonant nonlinear optics can be studied entirely within the framework of an underlying Lie algebra, in which the 2x2 su(2) Hamiltonian and density matrices of the quantum mechanical description of the atomic system transform directly to the 2x2 sl(2,R) matrices of the Ablowitz-Kaup-Newell-Segur (AKNS) scheme, and the AKNS eigenvalue is introduced naturally as a free parameter. The Lie algebra sl(2,R) is also the symmetry algebra of transformations between equivalence classes of AKNS systems under SL(2,R) gauge transformations. The Lie algebra formalism condenses much algebraic manipulation, and provides a natural basis for the perturbation theory of "nearly integrable" nonlinear wave systems.
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.
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.
Optimal eigenvalue computation on distributed-memory MIMD multiprocessors
Crivelli, S.; Jessup, E. R.
1992-10-01
Simon proves that bisection is not the optimal method for computing an eigenvalue on a single vector processor. In this paper, we show that his analysis does not extend in a straightforward way to the computation of an eigenvalue on a distributed-memory MIMD multiprocessor. In particular, we show how the optimal number of sections (and processors) to use for multisection depends on variables such as the matrix size and certain parameters inherent to the machine. We also show that parallel multisection outperforms the variant of parallel bisection proposed by Swarztrauber or this problem on a distributed-memory MIMD multiprocessor. We present the results of experiments on the 64-processor Intel iPSC/2 hypercube and the 512-processor Intel Touchstone Delta mesh multiprocessor.
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.
Optimal eigenvalue computation on a mesh multiprocessor
Crivelli, S.; Jessup, E. R.
1993-01-01
In this paper, we compare the costs of computing a single eigenvalue of a symmetric tridiagonal matrix by serial bisection and by parallel multisection on a mesh multiprocessor. We show how the optimal method for computing one eigenvalue depends on such variables as the matrix order and parameters of the multiprocessor used. We present the results of experiments on the 520-processor Intel Touchstone Delta to support our analysis.
Processes Used by College Students in Understanding Basic Algebra.
ERIC Educational Resources Information Center
Rachlin, Sidney Lee
The purpose of this study was to uncover information about and gain a greater insight into the extent to which students who are successful in a basic algebra course: l) demonstrate a reversibility of reasoning processes when solving algebraic problems; 2) demonstrate a flexibility of reasoning processes when solving algebraic problems; 3)…
Sound Off! A Dialogue between Calculator and Algebra
ERIC Educational Resources Information Center
Wade, William R.
2006-01-01
This article illustrates the fact that unless tempered by algebraic reasoning, a graphing calculator can lead one to erroneous conclusions. It also demonstrates that some problems can be solved by combining technology with algebra.
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)
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
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.
The algebraic theory of latent projectors in lambda matrices
NASA Technical Reports Server (NTRS)
Denman, E. D.; Leyva-Ramos, J.; Jeon, G. J.
1981-01-01
Multivariable systems such as a finite-element model of vibrating structures, control systems, and large-scale systems are often formulated in terms of differential equations which give rise to lambda matrices. The present investigation is concerned with the formulation of the algebraic theory of lambda matrices and the relationship of latent roots, latent vectors, and latent projectors to the eigenvalues, eigenvectors, and eigenprojectors of the companion form. The chain rule for latent projectors and eigenprojectors for the repeated latent root or eigenvalues is given.
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.
Derive Workshop Matrix Algebra and Linear Algebra.
ERIC Educational Resources Information Center
Townsley Kulich, Lisa; Victor, Barbara
This document presents the course content for a workshop that integrates the use of the computer algebra system Derive with topics in matrix and linear algebra. The first section is a guide to using Derive that provides information on how to write algebraic expressions, make graphs, save files, edit, define functions, differentiate expressions,…
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.
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…
NASA Astrophysics Data System (ADS)
Ache, Gerardo A.
1987-10-01
The decay rates are computed for stationary perturbations of Poiseuille flow in channels and pipes. The decay rates are found by solving eigenvalue problems of ordinary differential equations, where the eigenvalues give the rate of decay for the perturbation. A two-point boundary value method is used to compute the eigenvalues yielding efficient and accurate calculations. For the channel flow problem, the results are in agreement with previous calculations however, the problem of determining the rate of decay for a fluid motion in a pipe has not been considered before. For the Stokes problem in a pipe the eigenvalues, governing the rate of decay, are complex. Computations are carried out for small and moderate Reynolds numbers, also high Reynolds number computations were done to show the effectiveness of this method.
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.
Classical versus Computer Algebra Methods in Elementary Geometry
ERIC Educational Resources Information Center
Pech, Pavel
2005-01-01
Computer algebra methods based on results of commutative algebra like Groebner bases of ideals and elimination of variables make it possible to solve complex, elementary and non elementary problems of geometry, which are difficult to solve using a classical approach. Computer algebra methods permit the proof of geometric theorems, automatic…
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.
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.
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.
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.
Eigenvalue routines in NASTRAN: A comparison with the Block Lanczos method
NASA Technical Reports Server (NTRS)
Tischler, V. A.; Venkayya, Vipperla B.
1993-01-01
The NASA STRuctural ANalysis (NASTRAN) program is one of the most extensively used engineering applications software in the world. It contains a wealth of matrix operations and numerical solution techniques, and they were used to construct efficient eigenvalue routines. The purpose of this paper is to examine the current eigenvalue routines in NASTRAN and to make efficiency comparisons with a more recent implementation of the Block Lanczos algorithm by Boeing Computer Services (BCS). This eigenvalue routine is now available in the BCS mathematics library as well as in several commercial versions of NASTRAN. In addition, CRAY maintains a modified version of this routine on their network. Several example problems, with a varying number of degrees of freedom, were selected primarily for efficiency bench-marking. Accuracy is not an issue, because they all gave comparable results. The Block Lanczos algorithm was found to be extremely efficient, in particular, for very large size problems.
Spectral properties of sums of Hermitian matrices and algebraic geometry
NASA Astrophysics Data System (ADS)
Chau Huu-Tai, P.; Van Isacker, P.
2016-04-01
It is shown that all the eigenvectors of a sum of Hermitian matrices belong to the same algebraic variety. A polynomial system characterizing this variety is given and a set of nonlinear equations is derived which allows the construction of the variety. Moreover, in some specific cases, explicit expressions for the eigenvectors and eigenvalues can be obtained. Explicit solutions of selected models are also derived.
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.
A new direction in hydrodynamic stability: Beyond eigenvalues
NASA Technical Reports Server (NTRS)
Trefethen, Lloyd N.; Trefethen, Anne E.; Reddy, Satish C.; Driscoll, Tobin A.
1992-01-01
Fluid flows that are smooth at low speeds become unstable and then turbulent at higher speeds. This phenomenon has traditionally been investigated by linearizing the equations of flow and looking for unstable eigenvalues of the linearized problem, but the results agree poorly in many cases with experiments. Nevertheless, it has become clear in recent years that linear effects play a central role in hydrodynamic instability. A reconciliation of these findings with the traditional analysis can be obtained by considering the 'pseudospectra' of the linearized problem, which reveals that small perturbations to the smooth flow in the form of streamwise vortices may be amplified by factors on the order of 10(exp 5) by a linear mechanism, even though all the eigenmodes are stable. The same principles apply also to other problems in the mathematical sciences that involve non-orthogonal eigenfunctions.
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.
Using Schemas to Develop Algebraic Thinking
ERIC Educational Resources Information Center
Steele, Diana F.
2005-01-01
This article describes ways in which students develop schemas as they generalize and formalize patterns when solving related algebraic problems that involve size, shape, growth, and change. (Contains 7 figures and 3 tables.)
On computational complexity of Clifford algebra
NASA Astrophysics Data System (ADS)
Budinich, Marco
2009-05-01
After a brief discussion of the computational complexity of Clifford algebras, we present a new basis for even Clifford algebra Cl(2m) that simplifies greatly the actual calculations and, without resorting to the conventional matrix isomorphism formulation, obtains the same complexity. In the last part we apply these results to the Clifford algebra formulation of the NP-complete problem of the maximum clique of a graph introduced by Budinich and Budinich ["A spinorial formulation of the maximum clique problem of a graph," J. Math. Phys. 47, 043502 (2006)].
Edge covers and independence: Algebraic approach
NASA Astrophysics Data System (ADS)
Kalinina, E. A.; Khitrov, G. M.; Pogozhev, S. V.
2016-06-01
In this paper, linear algebra methods are applied to solve some problems of graph theory. For ordinary connected graphs, edge coverings and independent sets are considered. Some results concerning minimum edge covers and maximum matchings are proved with the help of linear algebraic approach. The problem of finding a maximum matching of a graph is fundamental both practically and theoretically, and has numerous applications, e.g., in computational chemistry and mathematical chemistry.
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…
I CAN Learn[R] Pre-Algebra and Algebra. What Works Clearinghouse Intervention Report
ERIC Educational Resources Information Center
What Works Clearinghouse, 2007
2007-01-01
The "I CAN Learn[R] Pre-Algebra" and "Algebra" computerized curricula are designed to cover mathematics and problem-solving skills for ethnically diverse, inner-city students in grades 6-12. The curricula are designed to equip students with the skills they need to meet district, state, and national math objectives through an…
The Application of a Computer Algebra System as a Tool in College Algebra.
ERIC Educational Resources Information Center
Mayes, Robert L.
1995-01-01
Students (n=61) in an experimental course stressing active student involvement and the use of a computer algebra system scored higher than students (n=76) in a traditional college algebra course on final measures of inductive reasoning, visualization, and problem solving while maintaining equivalent manipulation and computation skills. (Author/MLB)
NASA Astrophysics Data System (ADS)
Caldwell, Curtis Irvin
This is a theoretical thesis. The goal is to determine how many signal sources exist in the medium when constrained to using only a few samples. The need to make decisions based on only a few samples is motivated by the slow sound propagation speed and the time urgency to make decisions. This research treats the problem from the point of view of classical hypothesis testing assuming complex multivariate Gaussian random variables. This is the small sample complex principal components analysis problem. The critical issue is the derivation of probability density functions of appropriate test statistics. The goal has been partially achieved. The probability density functions for several important distributions have been derived. In particular, these include the distribution for the set of eigenvalues satisfying the generalized eigenvalue problem of two complex Wishart matrices, the matrix complex Gaussian distribution, a joint distribution needed to derive the density for the sphericity test statistic, the density function for the ratio of averages of disjoint sums of sequential eigenvalues of a complex Wishart matrix, and several tests based on the ratio of an arbitrary eigenvalue to the maximum, minimum, average, or sum of all the eigenvalues for a special case of the complex Wishart matrix. This thesis includes a derivation completely in the context of complex variables of the density function of the complex Wishart distribution and the distribution of its eigenvalues. It also includes a few minor results regarding zonal polynomials of complex matrix argument. A comprehensive development of the tools of statistics of complex variables for engineers and physicists is provided. This includes a study of complex matrix derivatives, changes of complex variables, and properties of the characteristic function of a complex multivariate random variable. A derivation of the complex Hotelling's T^2 test statistic and distribution useful for tests on means is given. A tutorial
Feasible eigenvalue sensitivity for large power systems
Smed, T. . Dept. of Electric Power Systems)
1993-05-01
Traditional eigenvalue sensitivity for power systems requires the formulation of the system matrix, which lacks sparsity. In this paper, a new sensitivity analysis, derived for a sparse formulation, is presented. Variables that are computed as intermediate results in established eigen value programs for power systems, but not used further, are given a new interpretation. The effect of virtually any control action can be assessed based on a single eigenvalue-eigenvector calculation. In particular, the effect of active and reactive power modulation can be found as a multiplication of two or three complex numbers. The method is illustrated in an example for a large power system when applied to the control design for an HVDC-link.
Real eigenvalue analysis in NASTRAN by the tridiagonal reduction (FEER) method
NASA Technical Reports Server (NTRS)
Newman, M.; Flanagen, P. F.; Rogers, J. L., Jr.
1976-01-01
Implementation of the tridiagonal reduction method for real eigenvalue extraction in structural vibration and buckling problems is described. The basic concepts underlying the method are summarized and special features, such as the computation of error bounds and default modes of operation are discussed. In addition, the new user information and error messages and optional diagnostic output relating to the tridiagonal reduction method are presented. Some numerical results and initial experiences relating to usage in the NASTRAN environment are provided, including comparisons with other existing NASTRAN eigenvalue methods.
Numerical Demonstration of Source Convergence Issues in Monte Carlo Eigenvalue Simulations
Petrovic, Bojan
2001-06-17
Monte Carlo is potentially the most accurate method for modeling particle transport since it allows detailed geometry representation and use of pointwise cross sections. Its statistical nature, however, introduces additional concerns related to the reliability of the results. This is a special concern in eigenvalue Monte Carlo simulations because the possibility of significantly underestimating the eigenvalue is real. A series of test problems is introduced and utilized to demonstrate and clarify some of the source convergence issues. Analysis of the results is intended to help formulate improved diagnostic methods for identifying or preventing false source convergence.
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.
Superintegrability in Two Dimensions and the Racah-Wilson Algebra
NASA Astrophysics Data System (ADS)
Genest, Vincent X.; Vinet, Luc; Zhedanov, Alexei
2014-08-01
The analysis of the most general second-order superintegrable system in two dimensions: the generic 3-parameter model on the 2-sphere is cast in the framework of the Racah problem for the algebra. The Hamiltonian of the 3-parameter system and the generators of its quadratic symmetry algebra are seen to correspond to the total and intermediate Casimir operators of the combination of three algebras, respectively. The construction makes explicit the isomorphism between the Racah-Wilson algebra, which is the fundamental algebraic structure behind the Racah problem for , and the invariance algebra of the generic 3-parameter system. It also provides an explanation for the occurrence of the Racah polynomials as overlap coefficients in this context. The irreducible representations of the Racah-Wilson algebra are reviewed as well as their connection with the Askey scheme of classical orthogonal polynomials.
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.
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…
ERIC Educational Resources Information Center
Miller, L. Diane; England, David A.
1989-01-01
Describes a study in a large metropolitan high school to ascertain what influence the use of regular writing in algebra classes would have on students' attitudes towards algebra and their skills in algebra. Reports the simpler and more direct the writing topics the better. (MVL)
Applied Algebra Curriculum Modules.
ERIC Educational Resources Information Center
Texas State Technical Coll., Marshall.
This collection of 11 applied algebra curriculum modules can be used independently as supplemental modules for an existing algebra curriculum. They represent diverse curriculum styles that should stimulate the teacher's creativity to adapt them to other algebra concepts. The selected topics have been determined to be those most needed by students…
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…
Ternary Virasoro - Witt algebra.
Zachos, C.; Curtright, T.; Fairlie, D.; High Energy Physics; Univ. of Miami; Univ. of Durham
2008-01-01
A 3-bracket variant of the Virasoro-Witt algebra is constructed through the use of su(1,1) enveloping algebra techniques. The Leibniz rules for 3-brackets acting on other 3-brackets in the algebra are discussed and verified in various situations.
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.
Algebraic complexities and algebraic curves over finite fields
Chudnovsky, D. V.; Chudnovsky, G. V.
1987-01-01
We consider the problem of minimal (multiplicative) complexity of polynomial multiplication and multiplication in finite extensions of fields. For infinite fields minimal complexities are known [Winograd, S. (1977) Math. Syst. Theory 10, 169-180]. We prove lower and upper bounds on minimal complexities over finite fields, both linear in the number of inputs, using the relationship with linear coding theory and algebraic curves over finite fields. PMID:16593816
Sparse Covariance Matrix Estimation With Eigenvalue Constraints.
Liu, Han; Wang, Lie; Zhao, Tuo
2014-04-01
We propose a new approach for estimating high-dimensional, positive-definite covariance matrices. Our method extends the generalized thresholding operator by adding an explicit eigenvalue constraint. The estimated covariance matrix simultaneously achieves sparsity and positive definiteness. The estimator is rate optimal in the minimax sense and we develop an efficient iterative soft-thresholding and projection algorithm based on the alternating direction method of multipliers. Empirically, we conduct thorough numerical experiments on simulated datasets as well as real data examples to illustrate the usefulness of our method. Supplementary materials for the article are available online.
Whence the eigenstate-eigenvalue link?
NASA Astrophysics Data System (ADS)
Gilton, Marian J. R.
2016-08-01
David Wallace has recently argued that the eigenstate-eigenvalue (E-E) link has no place in serious discussions of quantum mechanics on the grounds that, as he claims, the E-E link is an invention of philosophers rather than the community of practicing physicists. This raises an historical question regarding the origin of the link. This paper aims to answer this question by tracing the historical development of the link through six key textbooks of quantum mechanics. In light of the historical evidence from these textbooks, it is argued that Wallace provides insufficient grounds for dismissing the E-E link from discussions of quantum mechanics.
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.
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…
Block Krylov-Schur method for large symmetric eigenvalue problems
NASA Astrophysics Data System (ADS)
Zhou, Yunkai; Saad, Yousef
2008-04-01
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vectors, the second is the avoidance of the potential forward instability of the QR algorithm. In this paper we develop a block version of the Krylov-Schur algorithm for symmetric eigenproblems. Details of this block algorithm are discussed, including how to handle rank deficient cases and how to use varying block sizes. Numerical results on the efficiency of the block Krylov-Schur method are reported.
Generalized Householder transformations for the complex symmetric eigenvalue problem
NASA Astrophysics Data System (ADS)
Noble, J. H.; Lubasch, M.; Jentschura, U. D.
2013-08-01
We present an intuitive and scalable algorithm for the diagonalization of complex symmetric matrices, which arise from the projection of pseudo-Hermitian and complex scaled Hamiltonians onto a suitable basis set of "trial" states. The algorithm diagonalizes complex and symmetric (non-Hermitian) matrices and is easily implemented in modern computer languages. It is based on generalized Householder transformations and relies on iterative similarity transformations T → T' = Q T T Q, where Q is a complex and orthogonal, but not unitary, matrix, i.e. Q T = Q -1 but Q + ≠ Q -1. We present numerical reference data to support the scalability of the algorithm. We construct the generalized Householder transformations from the notion that the conserved scalar product of eigenstates Ψ n and Ψ m of a pseudo-Hermitian quantum mechanical Hamiltonian can be reformulated in terms of the generalized indefinite inner product ∫ d x Ψ n ( x, t) Ψ m ( x, t), where the integrand is locally defined, and complex conjugation is avoided. A few example calculations are described which illustrate the physical origin of the ideas used in the construction of the algorithm.
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 H2 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.
NASA Astrophysics Data System (ADS)
Lefrancois, Daniel; Wormit, Michael; Dreuw, Andreas
2015-09-01
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 H2 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.
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.
Prediction of Algebraic Instabilities
NASA Astrophysics Data System (ADS)
Zaretzky, Paula; King, Kristina; Hill, Nicole; Keithley, Kimberlee; Barlow, Nathaniel; Weinstein, Steven; Cromer, Michael
2016-11-01
A widely unexplored type of hydrodynamic instability is examined - large-time algebraic growth. Such growth occurs on the threshold of (exponentially) neutral stability. A new methodology is provided for predicting the algebraic growth rate of an initial disturbance, when applied to the governing differential equation (or dispersion relation) describing wave propagation in dispersive media. Several types of algebraic instabilities are explored in the context of both linear and nonlinear waves.
Connecting Algebra and Chemistry.
ERIC Educational Resources Information Center
O'Connor, Sean
2003-01-01
Correlates high school chemistry curriculum with high school algebra curriculum and makes the case for an integrated approach to mathematics and science instruction. Focuses on process integration. (DDR)
Uncertainty Analyses for Localized Tallies in Monte Carlo Eigenvalue Calculations
Mervin, Brenden T.; Maldonado, G Ivan; Mosher, Scott W; Wagner, John C
2011-01-01
It is well known that statistical estimates obtained from Monte Carlo criticality simulations can be adversely affected by cycle-to-cycle correlations in the fission source. In addition there are several other more fundamental issues that may lead to errors in Monte Carlo results. These factors can have a significant impact on the calculated eigenvalue, localized tally means and their associated standard deviations. In fact, modern Monte Carlo computational tools may generate standard deviation estimates that are a factor of five or more lower than the true standard deviation for a particular tally due to the inter-cycle correlations in the fission source. The magnitude of this under-prediction can climb as high as one hundred when combined with an ill-converged fission source or poor sampling techniques. Since Monte Carlo methods are widely used in reactor analysis (as a benchmarking tool) and criticality safety applications, an in-depth understanding of the effects of these issues must be developed in order to support the practical use of Monte Carlo software packages. A rigorous statistical analysis of localized tally results in eigenvalue calculations is presented using the SCALE/KENO-VI and MCNP Monte Carlo codes. The purpose of this analysis is to investigate the under-prediction in the uncertainty and its sensitivity to problem characteristics and calculational parameters, and to provide a comparative study between the two codes with respect to this under-prediction. It is shown herein that adequate source convergence along with proper specification of Monte Carlo parameters can reduce the magnitude of under-prediction in the uncertainty to reasonable levels; below a factor of 2 when inter-cycle correlations in the fission source are not a significant factor. In addition, through the use of a modified sampling procedure, the effects of inter-cycle correlations on both the mean value and standard deviation estimates can be isolated.
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…
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.
Critical eigenvalue in LMFBRs: a physics assessment
McKnight, R.D.; Collins, P.J.; Olsen, D.N.
1984-01-01
This paper summarizes recent work to put the analysis of past critical eigenvalue measurements from the US critical experiments program on a consistent basis. The integral data base includes 53 configurations built in 11 ZPPR assemblies which simulate mixed oxide LMFBRs. Both conventional and heterogeneous designs representing 350, 700, and 900 MWe sizes and with and without simulated control rods and/or control rod positions have been studied. The review of the integral data base includes quantitative assessment of experimental uncertainties in the measured excess reactivity. Analyses have been done with design level and higher-order methods using ENDF/B-IV data. Comparisons of these analyses with the experiments are used to generate recommended bias factors for criticality predictions. Recommended methods for analysis of LMFBR fast critical assemblies and LMFBR design calculations are presented. Unresolved issues and areas which require additional experimental or analytical study are identified.
Eigenvalues properties of terms correspondences matrix
NASA Astrophysics Data System (ADS)
Bondarchuk, Dmitry; Timofeeva, Galina
2016-12-01
Vector model representations of text documents are widely used in the intelligent search. In this approach a collection of documents is represented in the form of the term-document matrix, reflecting the frequency of terms. In the latent semantic analysis the dimension of the vector space is reduced by the singular value decomposition of the term-document matrix. Authors use a matrix of terms correspondences, reflecting the relationship between the terms, to allocate a semantic core and to obtain more simple presentation of the documents. With this approach, reducing the number of terms is based on the orthogonal decomposition of the matrix of terms correspondences. Properties of singular values of the term-document matrix and eigenvalues of the matrix of terms correspondences are studied in the case when documents differ substantially in length.
Eigenvalues of the sample covariance matrix for a towed array.
Gerstoft, Peter; Menon, Ravishankar; Hodgkiss, William S; Mecklenbräuker, Christoph F
2012-10-01
It is well known that observations of the spatial sample covariance matrix (SCM, also called the cross-spectral matrix) reveal that the ordered noise eigenvalues of the SCM decay steadily, but common models predict equal noise eigenvalues. Random matrix theory (RMT) is used to derive and discuss properties of the eigenvalue spectrum of the data SCM for linear arrays, with an application to ocean acoustic data. Noise on the array is considered either incoherent or propagating acoustic noise that is coherent across the array. Using conventional three-dimensional or two-dimensional isotropic noise models with full or snapshot-deficient observations, realizations of the SCM eigenvalues are explained using RMT. Deep-water towed-array data are analyzed and it is shown that the eigenvalues of the SCM compare well with theory. It is demonstrated how RMT can be applied to study eigenvalue spectrum estimation as dependent on array properties (element spacing to wavelength ratio) and data sampling (snapshots). Apart from explaining the observed noise eigenvalue spectrum, the improved model of the eigenvalue spectrum has important applications in array signal processing.
Bicovariant quantum algebras and quantum Lie algebras
NASA Astrophysics Data System (ADS)
Schupp, Peter; Watts, Paul; Zumino, Bruno
1993-10-01
A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from Fun(mathfrak{G}_q ) to U q g, given by elements of the pure braid group. These operators—the “reflection matrix” Y≡L + SL - being a special case—generate algebras that linearly close under adjoint actions, i.e. they form generalized Lie algebras. We establish the connection between the Hopf algebra formulation of the calculus and a formulation in compact matrix form which is quite powerful for actual computations and as applications we find the quantum determinant and an orthogonality relation for Y in SO q (N).
Parastatistics Algebras and Combinatorics
NASA Astrophysics Data System (ADS)
Popov, T.
2005-03-01
We consider the algebras spanned by the creation parafermionic and parabosonic operators which give rise to generalized parastatistics Fock spaces. The basis of such a generalized Fock space can be labelled by Young tableaux which are combinatorial objects. By means of quantum deformations a nice combinatorial structure of the algebra of the plactic monoid that lies behind the parastatistics is revealed.
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…
Learning Activity Package, Algebra.
ERIC Educational Resources Information Center
Evans, Diane
A set of ten teacher-prepared Learning Activity Packages (LAPs) in beginning algebra and nine in intermediate algebra, these units cover sets, properties of operations, number systems, open expressions, solution sets of equations and inequalities in one and two variables, exponents, factoring and polynomials, relations and functions, radicals,…
NASA Technical Reports Server (NTRS)
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
ERIC Educational Resources Information Center
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this dissertation,…
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…
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.
Explicit a posteriori error estimates for eigenvalue analysis of heterogeneous elastic structures.
Walsh, Timothy Francis; Reese, Garth M.; Hetmaniuk, Ulrich L.
2005-07-01
An a posteriori error estimator is developed for the eigenvalue analysis of three-dimensional heterogeneous elastic structures. It constitutes an extension of a well-known explicit estimator to heterogeneous structures. We prove that our estimates are independent of the variations in material properties and independent of the polynomial degree of finite elements. Finally, we study numerically the effectivity of this estimator on several model problems.
Minimization of the k-th eigenvalue of the Dirichlet Laplacian
NASA Astrophysics Data System (ADS)
Bucur, Dorin
2012-12-01
For every {k in {N}}, we prove the existence of a quasi-open set minimizing the k-th eigenvalue of the Dirichlet Laplacian among all sets of prescribed Lebesgue measure. Moreover, we prove that every minimizer is bounded and has a finite perimeter. The key point is the observation that such quasi-open sets are shape subsolutions for an energy minimizing free boundary problem.
Clifford Algebras, Random Graphs, and Quantum Random Variables
NASA Astrophysics Data System (ADS)
Schott, René; Staples, G. Stacey
2008-08-01
For fixed n > 0, the space of finite graphs on n vertices is canonically associated with an abelian, nilpotent-generated subalgebra of the Clifford algebra {C}l2n,2n which is canonically isomorphic to the 2n-particle fermion algebra. Using the generators of the subalgebra, an algebraic probability space of "Clifford adjacency matrices" associated with finite graphs is defined. Each Clifford adjacency matrix is a quantum random variable whose mth moment corresponds to the number of m-cycles in the graph G. Each matrix admits a canonical "quantum decomposition" into a sum of three algebraic random variables: a = aΔ + aΥ + aΛ, where aΔ is classical while aΥ and aΛ are quantum. Moreover, within the Clifford algebra context the NP problem of cycle enumeration is reduced to matrix multiplication, requiring no more than n4 Clifford (geo-metric) multiplications within the algebra.
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…
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.
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.
Algebraic Nonlinear Collective Motion
NASA Astrophysics Data System (ADS)
Troupe, J.; Rosensteel, G.
1998-11-01
Finite-dimensional Lie algebras of vector fields determine geometrical collective models in quantum and classical physics. Every set of vector fields on Euclidean space that generates the Lie algebra sl(3, R) and contains the angular momentum algebra so(3) is determined. The subset of divergence-free sl(3, R) vector fields is proven to be indexed by a real numberΛ. TheΛ=0 solution is the linear representation that corresponds to the Riemann ellipsoidal model. The nonlinear group action on Euclidean space transforms a certain family of deformed droplets among themselves. For positiveΛ, the droplets have a neck that becomes more pronounced asΛincreases; for negativeΛ, the droplets contain a spherical bubble of radius |Λ|1/3. The nonlinear vector field algebra is extended to the nonlinear general collective motion algebra gcm(3) which includes the inertia tensor. The quantum algebraic models of nonlinear nuclear collective motion are given by irreducible unitary representations of the nonlinear gcm(3) Lie algebra. These representations model fissioning isotopes (Λ>0) and bubble and two-fluid nuclei (Λ<0).
Detection of holes in an elastic body based on eigenvalues and traces of eigenmodes
NASA Astrophysics Data System (ADS)
Antunes, Pedro R. S.; Barbarosie, Cristian; Toader, Anca-Maria
2017-03-01
We consider the numerical solution of an inverse problem of finding the shape and location of holes in an elastic body. The problem is solved by minimizing a functional depending on the eigenvalues and traces of corresponding eigenmodes. We use the adjoint method to calculate the shape derivative of this functional. The optimization is performed by BFGS, using a genetic algorithm as a preprocessor and the Method of Fundamental Solutions as a solver for the direct problem. We address several numerical simulations that illustrate the good performance of the method.
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.
Algebraic invariants for homotopy types
NASA Astrophysics Data System (ADS)
Blanc, David
1999-11-01
We define a sequence of purely algebraic invariants - namely, classes in the Quillen cohomology of the [Pi]-algebra [pi][low asterisk]X - for distinguishing between different homotopy types of spaces. Another sequence of such cohomology classes allows one to decide whether a given abstract [Pi]-algebra can be realized as the homotopy [Pi]-algebra of a space.
A Richer Understanding of Algebra
ERIC Educational Resources Information Center
Foy, Michelle
2008-01-01
Algebra is one of those hard-to-teach topics where pupils seem to struggle to see it as more than a set of rules to learn, but this author recently used the software "Grid Algebra" from ATM, which engaged her Year 7 pupils in exploring algebraic concepts for themselves. "Grid Algebra" allows pupils to experience number,…
Holstein-Primakoff realization of Higgs algebra and its q-extension
NASA Astrophysics Data System (ADS)
Chung, Won Sang
2014-03-01
In this paper, Holstein-Primakoff realization of Higgs algebra is obtained by using the linear (or quadratic) deformation of Heisenberg algebra and q-deformed Higgs algebra is proposed. Some applications such as Kepler problem in a two-dimensional curved space and SUSY quantum mechanics are also discussed.
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.
The Algebra of Lexical Semantics
NASA Astrophysics Data System (ADS)
Kornai, András
The current generative theory of the lexicon relies primarily on tools from formal language theory and mathematical logic. Here we describe how a different formal apparatus, taken from algebra and automata theory, resolves many of the known problems with the generative lexicon. We develop a finite state theory of word meaning based on machines in the sense of Eilenberg [11], a formalism capable of describing discrepancies between syntactic type (lexical category) and semantic type (number of arguments). This mechanism is compared both to the standard linguistic approaches and to the formalisms developed in AI/KR.
Pseudo-Riemannian Novikov algebras
NASA Astrophysics Data System (ADS)
Chen, Zhiqi; Zhu, Fuhai
2008-08-01
Novikov algebras were introduced in connection with the Poisson brackets of hydrodynamic-type and Hamiltonian operators in formal variational calculus. Pseudo-Riemannian Novikov algebras denote Novikov algebras with non-degenerate invariant symmetric bilinear forms. In this paper, we find that there is a remarkable geometry on pseudo-Riemannian Novikov algebras, and give a special class of pseudo-Riemannian Novikov algebras.
NASA Astrophysics Data System (ADS)
Markarian, Nikita
2017-03-01
We introduce Weyl n-algebras and show how their factorization complex may be used to define invariants of manifolds. In the appendix, we heuristically explain why these invariants must be perturbative Chern-Simons invariants.
Developing Algebraic Thinking.
ERIC Educational Resources Information Center
Alejandre, Suzanne
2002-01-01
Presents a teaching experience that resulted in students getting to a point of full understanding of the kinesthetic activity and the algebra behind it. Includes a lesson plan for a traffic jam activity. (KHR)
Jordan Algebraic Quantum Categories
NASA Astrophysics Data System (ADS)
Graydon, Matthew; Barnum, Howard; Ududec, Cozmin; Wilce, Alexander
2015-03-01
State cones in orthodox quantum theory over finite dimensional complex Hilbert spaces enjoy two particularly essential features: homogeneity and self-duality. Orthodox quantum theory is not, however, unique in that regard. Indeed, all finite dimensional formally real Jordan algebras -- arenas for generalized quantum theories with close algebraic kinship to the orthodox theory -- admit homogeneous self-dual positive cones. We construct categories wherein these theories are unified. The structure of composite systems is cast from universal tensor products of the universal C*-algebras enveloping ambient spaces for the constituent state cones. We develop, in particular, a notion of composition that preserves the local distinction of constituent systems in quaternionic quantum theory. More generally, we explicitly derive the structure of hybrid quantum composites with subsystems of arbitrary Jordan algebraic type.
Accounting Equals Applied Algebra.
ERIC Educational Resources Information Center
Roberts, Sondra
1997-01-01
Argues that students should be given mathematics credits for completing accounting classes. Demonstrates that, although the terminology is different, the mathematical concepts are the same as those used in an introductory algebra class. (JOW)
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.
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.
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.
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.
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…
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…
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
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 development 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.
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.)
Algebraic quantum gravity (AQG): II. Semiclassical analysis
NASA Astrophysics Data System (ADS)
Giesel, K.; Thiemann, T.
2007-05-01
In the previous paper (Giesel and Thiemann 2006 Conceptual setup Preprint gr-qc/0607099) a new combinatorial and thus purely algebraical approach to quantum gravity, called algebraic quantum gravity (AQG), was introduced. In the framework of AQG, existing semiclassical tools can be applied to operators that encode the dynamics of AQG such as the master constraint operator. In this paper, we will analyse the semiclassical limit of the (extended) algebraic master constraint operator and show that it reproduces the correct infinitesimal generators of general relativity. Therefore, the question of whether general relativity is included in the semiclassical sector of the theory, which is still an open problem in LQG, can be significantly improved in the framework of AQG. For the calculations, we will substitute SU(2) with U(1)3. That this substitution is justified will be demonstrated in the third paper (Giesel and Thiemann 2006 Semiclassical perturbation theory Preprint gr-qc/0607101) of this series.
ADA interpretative system for image algebra
NASA Astrophysics Data System (ADS)
Murillo, Juan J.; Wilson, Joseph N.
1992-06-01
An important research problem in image processing is to find appropriate tools to support algorithm development. There have been efforts to build algorithm development support systems for image algebra in several languages, but these systems still have the disadvantage of the time consuming algorithm development style associated with compilation-oriented programming. This paper starts with a description of the Run-Time Support Library (RTSL), which serves as the base for executing programs on both the Image Algebra Ada Translator (IAAT) and Image Algebra Ada Interpreter (IAAI). A presentation on the current status of IAAT and its capabilities is followed by a brief introduction to the utilization of the Image Display Manager (IDM) for image manipulation and analysis. We then discuss in detail the current development stage of IAAI and its relation with RTSL and IDM. The last section describes the design of a syntax-directed graphical user interface for IAAI. We close with an analysis of the current performance of IAAI, and future trends are discussed. Appendix A gives a brief introduction to Image Algebra (IA), and in Appendix B the reader is presented to the Image Algebra Ada (IAA) grammar.
On alphabetic presentations of Clifford algebras and their possible applications
NASA Astrophysics Data System (ADS)
Toppan, Francesco; Verbeek, Piet W.
2009-12-01
In this paper, we address the problem of constructing a class of representations of Clifford algebras that can be named "alphabetic (re)presentations." The Clifford algebra generators are expressed as m-letter words written with a three-character or a four-character alphabet. We formulate the problem of the alphabetic presentations, deriving the main properties and some general results. At the end, we briefly discuss the motivations of this work and outline some possible applications.
ERIC Educational Resources Information Center
Hitt, Fernando; Saboya, Mireille; Zavala, Carlos Cortés
2017-01-01
Part of the research community that has followed the Early Algebra paradigm is currently delimiting the differences between arithmetic thinking and algebraic thinking. This trend could prevent new research approaches to the problem of learning algebra, hiding the importance of considering an arithmetico-algebraic thinking, a new approach which…
Study on eigenvalue space of hyperchaotic canonical four-dimensional Chua's circuit
NASA Astrophysics Data System (ADS)
Li, Guan-Lin; Chen, Xi-You
2010-03-01
The eigenvalue space of the canonical four-dimensional Chua's circuit which can realize every eigenvalue for four-dimensional system is studied in this paper. First, the analytical relations between the circuit parameters and the eigenvalues of the system are established, and therefore all the circuit parameters can be determined explicitly by any given set of eigenvalues. Then, the eigenvalue space of the circuit is investigated in two cases by the nonlinear elements used. According to the types of the eigenvalues, some novel hyperchaotic attractors are presented. Further, the dynamic behaviours of the circuit are studied by the bifurcation diagrams and the Lyapunov spectra of the eigenvalues.
Algebraic mesh quality metrics
KNUPP,PATRICK
2000-04-24
Quality metrics for structured and unstructured mesh generation are placed within an algebraic framework to form a mathematical theory of mesh quality metrics. The theory, based on the Jacobian and related matrices, provides a means of constructing, classifying, and evaluating mesh quality metrics. The Jacobian matrix is factored into geometrically meaningful parts. A nodally-invariant Jacobian matrix can be defined for simplicial elements using a weight matrix derived from the Jacobian matrix of an ideal reference element. Scale and orientation-invariant algebraic mesh quality metrics are defined. the singular value decomposition is used to study relationships between metrics. Equivalence of the element condition number and mean ratio metrics is proved. Condition number is shown to measure the distance of an element to the set of degenerate elements. Algebraic measures for skew, length ratio, shape, volume, and orientation are defined abstractly, with specific examples given. Combined metrics for shape and volume, shape-volume-orientation are algebraically defined and examples of such metrics are given. Algebraic mesh quality metrics are extended to non-simplical elements. A series of numerical tests verify the theoretical properties of the metrics defined.
Abstract Algebra for Algebra Teaching: Influencing School Mathematics Instruction
ERIC Educational Resources Information Center
Wasserman, Nicholas H.
2016-01-01
This article explores the potential for aspects of abstract algebra to be influential for the teaching of school algebra (and early algebra). Using national standards for analysis, four primary areas common in school mathematics--and their progression across elementary, middle, and secondary mathematics--where teaching may be transformed by…
Adaptive Algebraic Multigrid Methods
Brezina, M; Falgout, R; MacLachlan, S; Manteuffel, T; McCormick, S; Ruge, J
2004-04-09
Our ability to simulate physical processes numerically is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to assumptions made on the near-null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. The principles which guide the adaptivity are highlighted, as well as their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.
NASA Astrophysics Data System (ADS)
Durka, R.
2017-04-01
The S-expansion framework is analyzed in the context of a freedom in closing the multiplication tables for the abelian semigroups. Including the possibility of the zero element in the resonant decomposition, and associating the Lorentz generator with the semigroup identity element, leads to a wide class of the expanded Lie algebras introducing interesting modifications to the gauge gravity theories. Among the results, we find all the Maxwell algebras of type {{B}m} , {{C}m} , and the recently introduced {{D}m} . The additional new examples complete the resulting generalization of the bosonic enlargements for an arbitrary number of the Lorentz-like and translational-like generators. Some further prospects concerning enlarging the algebras are discussed, along with providing all the necessary constituents for constructing the gravity actions based on the obtained results.
NASA Astrophysics Data System (ADS)
Roytenberg, Dmitry
2007-11-01
A Lie 2-algebra is a linear category equipped with a functorial bilinear operation satisfying skew-symmetry and Jacobi identity up to natural transformations which themselves obey coherence laws of their own. Functors and natural transformations between Lie 2-algebras can also be defined, yielding a 2-category. Passing to the normalized chain complex gives an equivalence of 2-categories between Lie 2-algebras and certain "up to homotopy" structures on the complex; for strictly skew-symmetric Lie 2-algebras these are L∞-algebras, by a result of Baez and Crans. Lie 2-algebras appear naturally as infinitesimal symmetries of solutions of the Maurer-Cartan equation in some differential graded Lie algebras and L∞-algebras. In particular, (quasi-) Poisson manifolds, (quasi-) Lie bialgebroids and Courant algebroids provide large classes of examples.
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)
A Holistic Approach to Algebra.
ERIC Educational Resources Information Center
Barbeau, Edward J.
1991-01-01
Described are two examples involving recursive mathematical sequences designed to integrate a holistic approach to learning algebra. These examples promote pattern recognition with algebraic justification, full class participation, and mathematical values that can be transferred to other situations. (MDH)
Computer Program For Linear Algebra
NASA Technical Reports Server (NTRS)
Krogh, F. T.; Hanson, R. J.
1987-01-01
Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.
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.
An eigenvalue transformation technique for predicting drug-target interaction.
Kuang, Qifan; Xu, Xin; Li, Rong; Dong, Yongcheng; Li, Yan; Huang, Ziyan; Li, Yizhou; Li, Menglong
2015-09-09
The prediction of drug-target interactions is a key step in the drug discovery process, which serves to identify new drugs or novel targets for existing drugs. However, experimental methods for predicting drug-target interactions are expensive and time-consuming. Therefore, the in silico prediction of drug-target interactions has recently attracted increasing attention. In this study, we propose an eigenvalue transformation technique and apply this technique to two representative algorithms, the Regularized Least Squares classifier (RLS) and the semi-supervised link prediction classifier (SLP), that have been used to predict drug-target interaction. The results of computational experiments with these techniques show that algorithms including eigenvalue transformation achieved better performance on drug-target interaction prediction than did the original algorithms. These findings show that eigenvalue transformation is an efficient technique for improving the performance of methods for predicting drug-target interactions. We further show that, in theory, eigenvalue transformation can be viewed as a feature transformation on the kernel matrix. Accordingly, although we only apply this technique to two algorithms in the current study, eigenvalue transformation also has the potential to be applied to other algorithms based on kernels.
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.
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)
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.
An algebra of reversible computation.
Wang, Yong
2016-01-01
We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.
LINPACK. Simultaneous Linear Algebraic Equations
Miller, M.A.
1990-05-01
LINPACK is a collection of FORTRAN subroutines which analyze and solve various classes of systems of simultaneous linear algebraic equations. The collection deals with general, banded, symmetric indefinite, symmetric positive definite, triangular, and tridiagonal square matrices, as well as with least squares problems and the QR and singular value decompositions of rectangular matrices. A subroutine-naming convention is employed in which each subroutine name consists of five letters which represent a coded specification (TXXYY) of the computation done by that subroutine. The first letter, T, indicates the matrix data type. Standard FORTRAN allows the use of three such types: S REAL, D DOUBLE PRECISION, and C COMPLEX. In addition, some FORTRAN systems allow a double-precision complex type: Z COMPLEX*16. The second and third letters of the subroutine name, XX, indicate the form of the matrix or its decomposition: GE General, GB General band, PO Positive definite, PP Positive definite packed, PB Positive definite band, SI Symmetric indefinite, SP Symmetric indefinite packed, HI Hermitian indefinite, HP Hermitian indefinite packed, TR Triangular, GT General tridiagonal, PT Positive definite tridiagonal, CH Cholesky decomposition, QR Orthogonal-triangular decomposition, SV Singular value decomposition. The final two letters, YY, indicate the computation done by the particular subroutine: FA Factor, CO Factor and estimate condition, SL Solve, DI Determinant and/or inverse and/or inertia, DC Decompose, UD Update, DD Downdate, EX Exchange. The LINPACK package also includes a set of routines to perform basic vector operations called the Basic Linear Algebra Subprograms (BLAS).
LINPACK. Simultaneous Linear Algebraic Equations
Dongarra, J.J.
1982-05-02
LINPACK is a collection of FORTRAN subroutines which analyze and solve various classes of systems of simultaneous linear algebraic equations. The collection deals with general, banded, symmetric indefinite, symmetric positive definite, triangular, and tridiagonal square matrices, as well as with least squares problems and the QR and singular value decompositions of rectangular matrices. A subroutine-naming convention is employed in which each subroutine name consists of five letters which represent a coded specification (TXXYY) of the computation done by that subroutine. The first letter, T, indicates the matrix data type. Standard FORTRAN allows the use of three such types: S REAL, D DOUBLE PRECISION, and C COMPLEX. In addition, some FORTRAN systems allow a double-precision complex type: Z COMPLEX*16. The second and third letters of the subroutine name, XX, indicate the form of the matrix or its decomposition: GE General, GB General band, PO Positive definite, PP Positive definite packed, PB Positive definite band, SI Symmetric indefinite, SP Symmetric indefinite packed, HI Hermitian indefinite, HP Hermitian indefinite packed, TR Triangular, GT General tridiagonal, PT Positive definite tridiagonal, CH Cholesky decomposition, QR Orthogonal-triangular decomposition, SV Singular value decomposition. The final two letters, YY, indicate the computation done by the particular subroutine: FA Factor, CO Factor and estimate condition, SL Solve, DI Determinant and/or inverse and/or inertia, DC Decompose, UD Update, DD Downdate, EX Exchange. The LINPACK package also includes a set of routines to perform basic vector operations called the Basic Linear Algebra Subprograms (BLAS).
Eigenvalue spectrum of the spheroidal harmonics: A uniform asymptotic analysis
NASA Astrophysics Data System (ADS)
Hod, Shahar
2015-06-01
The spheroidal harmonics Slm (θ ; c) have attracted the attention of both physicists and mathematicians over the years. These special functions play a central role in the mathematical description of diverse physical phenomena, including black-hole perturbation theory and wave scattering by nonspherical objects. The asymptotic eigenvalues {Alm (c) } of these functions have been determined by many authors. However, it should be emphasized that all the previous asymptotic analyzes were restricted either to the regime m → ∞ with a fixed value of c, or to the complementary regime | c | → ∞ with a fixed value of m. A fuller understanding of the asymptotic behavior of the eigenvalue spectrum requires an analysis which is asymptotically uniform in both m and c. In this paper we analyze the asymptotic eigenvalue spectrum of these important functions in the double limit m → ∞ and | c | → ∞ with a fixed m / c ratio.
Embedded eigenvalues and the nonlinear Schrödinger equation
NASA Astrophysics Data System (ADS)
Asad, R.; Simpson, G.
2011-03-01
A common challenge in proving asymptotic stability of solitary waves is understanding the spectrum of the operator associated with the linearized flow. The existence of eigenvalues can inhibit the dispersive estimates key to proving stability. Following the work of Marzuola and Simpson [Nonlinearity 52, 389 (2011)], 10.1088/0951-7715/24/2/003, we prove the absence of embedded eigenvalues for a collection of nonlinear Schrödinger equations, including some one and three dimensional supercritical equations, and the three dimensional cubic-quintic equation. Our results also rule out nonzero eigenvalues within the spectral gap and end point resonances. The proof is computer assisted as it depends on the signs of certain inner products which do not readily admit analytic representations. Our source code is available for verification at http://hdl.handle.net/1807/26121.
Courant-sharp eigenvalues of Neumann 2-rep-tiles
NASA Astrophysics Data System (ADS)
Band, Ram; Bersudsky, Michael; Fajman, David
2016-11-01
We find the Courant-sharp Neumann eigenvalues of the Laplacian on some 2-rep-tile domains. In {R}2 , the domains we consider are the isosceles right triangle and the rectangle with edge ratio √{2} (also known as the A4 paper). In {R}n , the domains are boxes which generalize the mentioned planar rectangle. The symmetries of those domains reveal a special structure of their eigenfunctions, which we call folding/unfolding. This structure affects the nodal set of the eigenfunctions, which, in turn, allows to derive necessary conditions for Courant-sharpness. In addition, the eigenvalues of these domains are arranged as a lattice which allows for a comparison between the nodal count and the spectral position. The Courant-sharpness of most eigenvalues is ruled out using those methods. In addition, this analysis allows to estimate the nodal deficiency—the difference between the spectral position and the nodal count.
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.
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.
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…
Algebraic Thinking through Origami.
ERIC Educational Resources Information Center
Higginson, William; Colgan, Lynda
2001-01-01
Describes the use of paper folding to create a rich environment for discussing algebraic concepts. Explores the effect that changing the dimensions of two-dimensional objects has on the volume of related three-dimensional objects. (Contains 13 references.) (YDS)
Eigenvalues of singular differential operators by finite difference methods. II.
NASA Technical Reports Server (NTRS)
Baxley, J. V.
1972-01-01
Note is made of an earlier paper which defined finite difference operators for the Hilbert space L2(m), and gave the eigenvalues for these operators. The present work examines eigenvalues for higher order singular differential operators by using finite difference methods. The two self-adjoint operators investigated are defined by a particular value in the same Hilbert space, L2(m), and are strictly positive with compact inverses. A class of finite difference operators is considered, with the idea of application to the theory of Toeplitz matrices. The approximating operators consist of a good approximation plus a perturbing operator.
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.
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)
f-Deformed Boson Algebra Related to Gentile Statistics
NASA Astrophysics Data System (ADS)
Chung, Won Sang; Hassanabadi, Hassan
2017-02-01
In this paper the deformed boson algebra giving the Gentile distribution function is constructed by using the model of ideal gas of deformed bosons and some properties of a root of unity. As an example we discuss the quantum optical problem related to the Gentile (or f-deformed) boson algebra with large but finite M. For this algebra we construct the Gentile (or f-deformed) coherent state and discuss its nonclassical properties such as sub-Poissonian statistics and anti-bunching effect.
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
On Dunkl angular momenta algebra
NASA Astrophysics Data System (ADS)
Feigin, Misha; Hakobyan, Tigran
2015-11-01
We consider the quantum angular momentum generators, deformed by means of the Dunkl operators. Together with the reflection operators they generate a subalgebra in the rational Cherednik algebra associated with a finite real reflection group. We find all the defining relations of the algebra, which appear to be quadratic, and we show that the algebra is of Poincaré-Birkhoff-Witt (PBW) type. We show that this algebra contains the angular part of the Calogero-Moser Hamiltonian and that together with constants it generates the centre of the algebra. We also consider the gl( N ) version of the subalge-bra of the rational Cherednik algebra and show that it is a non-homogeneous quadratic algebra of PBW type as well. In this case the central generator can be identified with the usual Calogero-Moser Hamiltonian associated with the Coxeter group in the harmonic confinement.
Algebraic and geometric structures of analytic partial differential equations
NASA Astrophysics Data System (ADS)
Kaptsov, O. V.
2016-11-01
We study the problem of the compatibility of nonlinear partial differential equations. We introduce the algebra of convergent power series, the module of derivations of this algebra, and the module of Pfaffian forms. Systems of differential equations are given by power series in the space of infinite jets. We develop a technique for studying the compatibility of differential systems analogous to the Gröbner bases. Using certain assumptions, we prove that compatible systems generate infinite manifolds.
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.
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.
Non-Real Eigenvalues for PT-Symmetric Double Wells
NASA Astrophysics Data System (ADS)
Benbernou, Amina; Boussekkine, Naima; Mecherout, Nawal; Ramond, Thierry; Sjöstrand, Johannes
2016-12-01
We study small, PT-symmetric perturbations of self-adjoint double-well Schrödinger operators in dimension {n≥ 1}. We prove that the eigenvalues stay real for a very small perturbation, then bifurcate to the complex plane as the perturbation gets stronger.
The Fourier analysis technique and epsilon-pseudo-eigenvalues
Donato, J.M.
1993-07-01
The spectral radii of iteration matrices and the spectra and condition numbers of preconditioned systems are important in forecasting the convergence rates for iterative methods. Unfortunately, the spectra of iteration matrices or preconditioned systems is rarely easily available. The Fourier analysis technique has been shown to be a useful tool in studying the effectiveness of iterative methods by determining approximate expressions for the eigenvalues or condition numbers of matrix systems. For non-symmetric matrices the eigenvalues may be highly sensitive to perturbations. The spectral radii of nonsymmetric iteration matrices may not give a numerically realistic indication of the convergence of the iterative method. Trefethen and others have presented a theory on the use of {epsilon}-pseudo-eigenvalues in the study of matrix equations. For Toeplitz matrices, we show that the theory of c-pseudo-eigenvalues includes the Fourier analysis technique as a limiting case. For non-Toeplitz matrices, the relationship is not clear. We shall examine this relationship for non-Toeplitz matrices that arise when studying preconditioned systems for methods applied to a two-dimensional discretized elliptic differential equation.
Marquette, Ian
2013-07-15
We introduce the most general quartic Poisson algebra generated by a second and a fourth order integral of motion of a 2D superintegrable classical system. We obtain the corresponding quartic (associative) algebra for the quantum analog, extend Daskaloyannis construction obtained in context of quadratic algebras, and also obtain the realizations as deformed oscillator algebras for this quartic algebra. We obtain the Casimir operator and discuss how these realizations allow to obtain the finite-dimensional unitary irreducible representations of quartic algebras and obtain algebraically the degenerate energy spectrum of superintegrable systems. We apply the construction and the formula obtained for the structure function on a superintegrable system related to type I Laguerre exceptional orthogonal polynomials introduced recently.
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®,…
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.
AKNS eigenvalue spectrum for densely spaced envelope solitary waves
NASA Astrophysics Data System (ADS)
Slunyaev, Alexey; Starobor, Alexey
2010-05-01
The problem of the influence of one envelope soliton to the discrete eigenvalues of the associated scattering problem for the other envelope soliton, which is situated close to the first one, is discussed. Envelope solitons are exact solutions of the integrable nonlinear Schrödinger equation (NLS). Their generalizations (taking into account the background nonlinear waves [1-4] or strongly nonlinear effects [5, 6]) are possible candidates to rogue waves in the ocean. The envelope solitary waves could be in principle detected in the stochastic wave field by approaches based on the Inverse Scattering Technique in terms of ‘unstable modes' (see [1-3]), or envelope solitons [7-8]. However, densely spaced intense groups influence the spectrum of the associated scattering problem, so that the solitary trains cannot be considered alone. Here we solve the initial-value problem exactly for some simplified configurations of the wave field, representing two closely placed intense wave groups, within the frameworks of the NLS equation by virtue of the solution of the AKNS system [9]. We show that the analogues of the level splitting and the tunneling effects, known in quantum physics, exist in the context of the NLS equation, and thus may be observed in application to sea waves [10]. These effects make the detecting of single solitary wave groups surrounded by other nonlinear wave groups difficult. [1]. A.L. Islas, C.M. Schober (2005) Predicting rogue waves in random oceanic sea states. Phys. Fluids 17, 031701-1-4. [2]. A.R. Osborne, M. Onorato, M. Serio (2005) Nonlinear Fourier analysis of deep-water random surface waves: Theoretical formulation and and experimental observations of rogue waves. 14th Aha Huliko's Winter Workshop, Honolulu, Hawaii. [3]. C.M. Schober, A. Calini (2008) Rogue waves in higher order nonlinear Schrödinger models. In: Extreme Waves (Eds.: E. Pelinovsky & C. Kharif), Springer. [4]. N. Akhmediev, A. Ankiewicz, M. Taki (2009) Waves that appear from
NASA Astrophysics Data System (ADS)
Dresvyannikov, M. A.; Chernyaev, A. P.; Karuzskii, A. L.; Mityagin, Yu. A.; Perestoronin, A. V.; Volchkov, N. A.
2016-12-01
An operator of the permittivity can completely describe alone a microwave response of conductors with the spatial dispersion. A wave problem is formulated to search the eigenvalues of the permittivity operator, similar to the problem of the wave propagation in hollow waveguides and resonators, but non-self conjugated. Dispersion relations and general solutions are obtained. A significant role of the spatial-type force resonances is considered. Due to the self-consistency of a kinetics problem, the spatial-type force resonances are added to and usually dominate over the influence of boundary conditions. The obtained resonances include particular solutions corresponding to the surface impedances for the anomalous skin effect, for superconductors, as well as four novel solutions. The general frequency dependence of the surface impedance is derived for all solutions except that for a superconductor.
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.
Clifford Algebras and Their Decomposition into Conjugate Fermionic Heisenberg Algebras
NASA Astrophysics Data System (ADS)
Catto, Sultan; Gürcan, Yasemin; Khalfan, Amish; Kurt, Levent; Kato La, V.
2016-10-01
We discuss a construction scheme for Clifford numbers of arbitrary dimension. The scheme is based upon performing direct products of the Pauli spin and identity matrices. Conjugate fermionic algebras can then be formed by considering linear combinations of the Clifford numbers and the Hermitian conjugates of such combinations. Fermionic algebras are important in investigating systems that follow Fermi-Dirac statistics. We will further comment on the applications of Clifford algebras to Fueter analyticity, twistors, color algebras, M-theory and Leech lattice as well as unification of ancient and modern geometries through them.
Verburgt, Lukas M
2016-01-01
This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s.
Quantum computation using geometric algebra
NASA Astrophysics Data System (ADS)
Matzke, Douglas James
This dissertation reports that arbitrary Boolean logic equations and operators can be represented in geometric algebra as linear equations composed entirely of orthonormal vectors using only addition and multiplication Geometric algebra is a topologically based algebraic system that naturally incorporates the inner and anticommutative outer products into a real valued geometric product, yet does not rely on complex numbers or matrices. A series of custom tools was designed and built to simplify geometric algebra expressions into a standard sum of products form, and automate the anticommutative geometric product and operations. Using this infrastructure, quantum bits (qubits), quantum registers and EPR-bits (ebits) are expressed symmetrically as geometric algebra expressions. Many known quantum computing gates, measurement operators, and especially the Bell/magic operators are also expressed as geometric products. These results demonstrate that geometric algebra can naturally and faithfully represent the central concepts, objects, and operators necessary for quantum computing, and can facilitate the design and construction of quantum computing tools.
ERIC Educational Resources Information Center
Novotna, Jarmila; Hoch, Maureen
2008-01-01
Many students have difficulties with basic algebraic concepts at high school and at university. In this paper two levels of algebraic structure sense are defined: for high school algebra and for university algebra. We suggest that high school algebra structure sense components are sub-components of some university algebra structure sense…
Applications of algebraic grid generation
NASA Technical Reports Server (NTRS)
Eiseman, Peter R.; Smith, Robert E.
1990-01-01
Techniques and applications of algebraic grid generation are described. The techniques are univariate interpolations and transfinite assemblies of univariate interpolations. Because algebraic grid generation is computationally efficient, the use of interactive graphics in conjunction with the techniques is advocated. A flexible approach, which works extremely well in an interactive environment, called the control point form of algebraic grid generation is described. The applications discussed are three-dimensional grids constructed about airplane and submarine configurations.
Tests for Linear Trend in the Smallest Eigenvalues of the Correlation Matrix.
ERIC Educational Resources Information Center
Bentler, Peter M.; Yuan, Ke-Hai
1998-01-01
A test for linear trend among a set of eigenvalues of a correlation matrix is described. It is a generalization of G. Anderson's (1965) test for the equality of eigenvalues and extends the present authors' previous work on linear trends in eigenvalues of a covariance matrix. The linear trend hypothesis is discussed. (SLD)
NASA Astrophysics Data System (ADS)
Zheltukhin, V. S.; Solovyev, S. I.; Solovyev, P. S.; Chebakova, V. Yu
2016-11-01
A sufficient condition for the existence of a minimal eigenvalue corresponding to a positive eigenfunction of an eigenvalue problem with nonlinear dependence on the parameter for a second order ordinary differential equation is established. The initial problem is approximated by the finite element method. Error estimates for the approximate minimal eigenvalue and corresponding positive eigenfunction are derived. Problems of this form arise in modelling the plasma of a radio-frequency discharge at reduced pressure.
A new application of algebraic geometry to systems theory
NASA Technical Reports Server (NTRS)
Martin, C. F.; Hermann, R.
1976-01-01
Following an introduction to algebraic geometry, the dominant morphism theorem is stated, and the application of this theorem to systems-theoretic problems, such as the feedback problem, is discussed. The Gaussian elimination method used for solving linear equations is shown to be an example of a dominant morphism.
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…
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.
A Method for the Microanalysis of Pre-Algebra Transfer
ERIC Educational Resources Information Center
Pavlik, Philip I., Jr.; Yudelson, Michael; Koedinger, Kenneth R.
2011-01-01
The objective of this research was to better understand the transfer of learning between different variations of pre-algebra problems. While the authors could have addressed a specific variation that might address transfer, they were interested in developing a general model of transfer, so we gathered data from multiple problem types and their…
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
A novel iris segmentation algorithm based on small eigenvalue analysis
NASA Astrophysics Data System (ADS)
Harish, B. S.; Aruna Kumar, S. V.; Guru, D. S.; Ngo, Minh Ngoc
2015-12-01
In this paper, a simple and robust algorithm is proposed for iris segmentation. The proposed method consists of two steps. In first step, iris and pupil is segmented using Robust Spatial Kernel FCM (RSKFCM) algorithm. RSKFCM is based on traditional Fuzzy-c-Means (FCM) algorithm, which incorporates spatial information and uses kernel metric as distance measure. In second step, small eigenvalue transformation is applied to localize iris boundary. The transformation is based on statistical and geometrical properties of the small eigenvalue of the covariance matrix of a set of edge pixels. Extensive experimentations are carried out on standard benchmark iris dataset (viz. CASIA-IrisV4 and UBIRIS.v2). We compared our proposed method with existing iris segmentation methods. Our proposed method has the least time complexity of O(n(i+p)) . The result of the experiments emphasizes that the proposed algorithm outperforms the existing iris segmentation methods.
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…
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.
Field Theoretic Investigations in Current Algebra
NASA Astrophysics Data System (ADS)
Jackiw, Roman
The following sections are included: * Introduction * Canonical and Space-Time Constraints in Current Algebra * Canonical Theory of Currents * Space-Time Constraints on Commutators * Space-Time Constraints on Green's Functions * Space-Time Constraints on Ward Identities * Schwinger Terms * Discussion * The Bjorken-Johnson-Low Limit * The π 0 → 2γ Problem * Preliminaries * Sutherland-Veltman Theorem * Model Calculation * Anomalous Ward Identity * Anomalous Commutators * Anomalous Divergence of Axial Current * Discussion * Electroproduction Sum Rules * Preliminaries * Derivation of Sum Rules, Naive Method * Derivation of Sum Rules, Dispersive Method * Model Calculation * Anomalous Commutators * Discussion * Discussion of Anomalies in Current Algebra * Miscellaneous Anomalies * Non-Perturbative Arguments for Anomalies * Models without Anomalies * Discussion * Approximate Scale Symmetry * Introduction * Canonical Theory of Scale and Conformal Transformations * Ward Identities and Trace Identities * False Theorems * True Theorems * EXERCISES * SOLUTIONS
Detection of Wind Turbine Power Performance Abnormalities Using Eigenvalue Analysis
2014-12-23
Detection of Wind Turbine Power Performance Abnormalities Using Eigenvalue Analysis Georgios Alexandros Skrimpas1, Christian Walsted Sweeney2, Kun S...University of Denmark, Lyngby, 2800, Denmark nm@elektro.dtu.dk jh@elektro.dtu.dk ABSTRACT Condition monitoring of wind turbines is a field of continu...ous research and development as new turbine configurations enter into the market and new failure modes appear. Systems utilising well established
Control of large flexible systems via eigenvalue relocation
NASA Technical Reports Server (NTRS)
Denman, E. D.; Jeon, G. J.
1985-01-01
For the vibration control of large flexible systems, a control scheme by which the eigenvalues of the closed-loop systems are assigned to predetermined locations within the feasible region through velocity-only feedback is presented. Owing to the properties of second-order lambda-matrices and an efficient model decoupling technique, the control scheme makes it possible that selected modes are damped with the rest of the modes unchanged.
NASA Astrophysics Data System (ADS)
Barnett, Michael P.; Decker, Thomas; Krandick, Werner
2001-06-01
We use computer algebra to expand the Pekeris secular determinant for two-electron atoms symbolically, to produce an explicit polynomial in the energy parameter ɛ, with coefficients that are polynomials in the nuclear charge Z. Repeated differentiation of the polynomial, followed by a simple transformation, gives a series for ɛ in decreasing powers of Z. The leading term is linear, consistent with well-known behavior that corresponds to the approximate quadratic dependence of ionization potential on atomic number (Moseley's law). Evaluating the 12-term series for individual Z gives the roots to a precision of 10 or more digits for Z⩾2. This suggests the use of similar tactics to construct formulas for roots vs atomic, molecular, and variational parameters in other eigenvalue problems, in accordance with the general objectives of gradient theory. Matrix elements can be represented by symbols in the secular determinants, enabling the use of analytical expressions for the molecular integrals in the differentiation of the explicit polynomials. The mathematical and computational techniques include modular arithmetic to handle matrix and polynomial operations, and unrestricted precision arithmetic to overcome severe digital erosion. These are likely to find many further applications in computational chemistry.
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
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.
Courant-Sharp Eigenvalues for the Equilateral Torus, and for the Equilateral Triangle
NASA Astrophysics Data System (ADS)
Bérard, Pierre; Helffer, Bernard
2016-12-01
We address the question of determining the eigenvalues {λn} (listed in nondecreasing order, with multiplicities) for which Courant's nodal domain theorem is sharp i.e., for which there exists an associated eigenfunction with {n} nodal domains (Courant-sharp eigenvalues). Following ideas going back to Pleijel (1956), we prove that the only Courant-sharp eigenvalues of the flat equilateral torus are the first and second, and that the only Courant-sharp Dirichlet eigenvalues of the equilateral triangle are the first, second, and fourth eigenvalues. In the last section we sketch similar results for the right-angled isosceles triangle and for the hemiequilateral triangle.
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.
NASA Astrophysics Data System (ADS)
Bahn, Mark M.
1999-03-01
Diffusion in biological tissues can be measured by magnetic resonance diffusion tensor imaging The complex nature of anisotropic diffusion in the brain has been described by a diffusion tensor which contains information about the magnitude of diffusion in different directions. Each tensor contains a set of three eigenvalues which are related to the major, intermediate, and minor axes of a diffusion ellipsoid. This investigation demonstrates that the various sets of diffusion eigenvalues from different regions of the brain lie along a line in ordered eigenvalue space. Sets of ordered diffusion eigenvalues were considered points in ordered eigenvalue space. The line which best fit the data by minimizing the total squared deviations was determined. A new coordinate system was constructed through translation and rotation which spanned ordered eigenvalue space. Eigenvalues from both monkey brain and human brain were studied. It was found that the sets of eigenvalues from both species have significant linear trends. Moreover, the same line may describe the brain eigenvalues from both species. It is likely that this linear relationship of the eigenvalues observed in an ordered eigenvalue plot is related to a combination of (1) conservation of total isotropic diffusion and (2) the degree of orientational dispersion of the microfibers within each voxel.
Viterbi/algebraic hybrid decoder
NASA Technical Reports Server (NTRS)
Boyd, R. W.; Ingels, F. M.; Mo, C.
1980-01-01
Decoder computer program is hybrid between optimal Viterbi and optimal algebraic decoders. Tests have shown that hybrid decoder outperforms any strictly Viterbi or strictly algebraic decoder and effectively handles compound channels. Algorithm developed uses syndrome-detecting logic to direct two decoders to assume decoding load alternately, depending on real-time channel characteristics.
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
1997
Astro Algebra is one of six titles in the Mighty Math Series from Edmark, a comprehensive line of math software for students from kindergarten through ninth grade. Many of the activities in Astro Algebra contain a unique technology that uses the computer to help students make the connection between concrete and abstract mathematics. This software…
Elementary maps on nest algebras
NASA Astrophysics Data System (ADS)
Li, Pengtong
2006-08-01
Let , be algebras and let , be maps. An elementary map of is an ordered pair (M,M*) such that for all , . In this paper, the general form of surjective elementary maps on standard subalgebras of nest algebras is described. In particular, such maps are automatically additive.
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.
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.)
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…
NASA Astrophysics Data System (ADS)
Wang, Dongdong; Li, Xiwei; Pan, Feixu
2016-11-01
A simple and unified finite element formulation is presented for superconvergent eigenvalue computation of wave equations ranging from 1D to 3D. In this framework, a general method based upon the so called α mass matrix formulation is first proposed to effectively construct 1D higher order mass matrices for arbitrary order elements. The finite elements discussed herein refer to the Lagrangian type of Lobatto elements that take the Lobatto points as nodes. Subsequently a set of quadrature rules that exactly integrate the 1D higher order mass matrices are rationally derived, which are termed as the superconvergent quadrature rules. More importantly, in 2D and 3D cases, it is found that the employment of these quadrature rules via tensor product simultaneously for the mass and stiffness matrix integrations of Lobatto elements produces a unified superconvergent formulation for the eigenvalue or frequency computation without wave propagation direction dependence, which usually is a critical issue for the multidimensional higher order mass matrix formulation. Consequently the proposed approach is capable of computing arbitrary frequencies in a superconvergent fashion. Meanwhile, numerical implementation of the proposed method for multidimensional problems is trivial. The effectiveness of the proposed methodology is systematically demonstrated by a series of numerical examples. Numerical results revealed that a superconvergence with 2(p+1)th order of frequency accuracy is achieved by the present unified formulation for the pth order Lobatto element.
NASA Astrophysics Data System (ADS)
Huang, Zhenghua; Zhang, Tianxu; Deng, Lihua; Fang, Hao; Li, Qian
2015-12-01
Total variation(TV) based on regularization has been proven as a popular and effective model for image restoration, because of its ability of edge preserved. However, as the TV favors a piece-wise constant solution, the processing results in the flat regions of the image are easily produced "staircase effects", and the amplitude of the edges will be underestimated; the underlying cause of the problem is that the regularization parameter can not be changeable with spatial local information of image. In this paper, we propose a novel Scatter-matrix eigenvalues-based TV(SMETV) regularization with image blind restoration algorithm for deblurring medical images. The spatial information in different image regions is incorporated into regularization by using the edge indicator called difference eigenvalue to distinguish edges from flat areas. The proposed algorithm can effectively reduce the noise in flat regions as well as preserve the edge and detailed information. Moreover, it becomes more robust with the change of the regularization parameter. Extensive experiments demonstrate that the proposed approach produces results superior to most methods in both visual image quality and quantitative measures.
NASA Astrophysics Data System (ADS)
Wang, Dongdong; Li, Xiwei; Pan, Feixu
2017-01-01
A simple and unified finite element formulation is presented for superconvergent eigenvalue computation of wave equations ranging from 1D to 3D. In this framework, a general method based upon the so called α mass matrix formulation is first proposed to effectively construct 1D higher order mass matrices for arbitrary order elements. The finite elements discussed herein refer to the Lagrangian type of Lobatto elements that take the Lobatto points as nodes. Subsequently a set of quadrature rules that exactly integrate the 1D higher order mass matrices are rationally derived, which are termed as the superconvergent quadrature rules. More importantly, in 2D and 3D cases, it is found that the employment of these quadrature rules via tensor product simultaneously for the mass and stiffness matrix integrations of Lobatto elements produces a unified superconvergent formulation for the eigenvalue or frequency computation without wave propagation direction dependence, which usually is a critical issue for the multidimensional higher order mass matrix formulation. Consequently the proposed approach is capable of computing arbitrary frequencies in a superconvergent fashion. Meanwhile, numerical implementation of the proposed method for multidimensional problems is trivial. The effectiveness of the proposed methodology is systematically demonstrated by a series of numerical examples. Numerical results revealed that a superconvergence with 2(p+1)th order of frequency accuracy is achieved by the present unified formulation for the pth order Lobatto element.
Eigenvalue distribution of second-order dynamic equations on time scales considered as fractals
NASA Astrophysics Data System (ADS)
Amster, Pablo; de Nápoli, Pablo; Pinasco, Juan Pablo
2008-07-01
Let be a time scale with . In this paper we study the asymptotic distribution of eigenvalues of the following linear problem -u[Delta][Delta]=[lambda]u[sigma], with mixed boundary conditions [alpha]u(a)+[beta]u[Delta](a)=0=[gamma]u([rho](b))+[delta]u[Delta]([rho](b)). It is known that there exists a sequence of simple eigenvalues {[lambda]k}k; we consider the spectral counting function , and we seek for its asymptotic expansion as a power of [lambda]. Let d be the Minkowski (or box) dimension of , which gives the order of growth of the number of intervals of length [epsilon] needed to cover , namely . We prove an upper bound of N([lambda]) which involves the Minkowski dimension, , where C is a positive constant depending only on the Minkowski content of (roughly speaking, its d-volume, although the Minkowski content is not a measure). We also consider certain limiting cases (d=0, infinite Minkowski content), and we show a family of self similar fractal sets where admits two-side estimates.
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.
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.
Symplectic Clifford Algebraic Field Theory.
NASA Astrophysics Data System (ADS)
Dixon, Geoffrey Moore
We develop a mathematical framework on which is built a theory of fermion, scalar, and gauge vector fields. This field theory is shown to be equivalent to the original Weinberg-Salam model of weak and electromagnetic interactions, but since the new framework is more rigid than that on which the original Weinberg-Salam model was built, a concomitant reduction in the number of assumptions lying outside of the framework has resulted. In particular, parity violation is actually hiding within our framework, and with little difficulty we are able to manifest it. The mathematical framework upon which we build our field theory is arrived at along two separate paths. The first is by the marriage of a Clifford algebra and a Lie superalgebra, the result being called a super Clifford algebra. The second is by providing a new characterization for a Clifford algebra employing its generators and a symmetric array of metric coefficients. Subsequently we generalize this characterization to the case of an antisymmetric array of metric coefficients, and we call the algebra which results a symplectic Clifford algebra. It is upon one of these that we build our field theory, and it is shown that this symplectic Clifford algebra is a particular subalgebra of a super Clifford algebra. The final ingredient is the operation of bracketing which involves treating the elements of our algebra as endomorphisms of a particular inner product space, and employing this space and its inner product to provide us with maps from our algebra to the reals. It is this operation which enables us to manifest the parity violation hiding in our algebra.
Relation of the nonlinear Heisenberg algebras in two dimensions with linear ones
NASA Astrophysics Data System (ADS)
Chung, Won Sang
2015-07-01
In this paper, we discuss the relation of the nonlinear Heisenberg algebras in two dimensions with linear ones following the Nowicki and Tkachuk's approach for one-dimensional case. For one-dimensional harmonic oscillator, we obtain the solution explicitly. For the nonlinear Heisenberg algebras in two dimensions, we introduce two generators to transform this algebra into the linear one. For the linear version of the nonlinear Heisenberg algebras in two dimensions, we obtain the eigenfunction for the position and angular momentum operator and solve the harmonic oscillator problem in two dimensions.
Coherent states for a polynomial su(1, 1) algebra and a conditionally solvable system
NASA Astrophysics Data System (ADS)
Sadiq, Muhammad; Inomata, Akira; Junker, Georg
2009-09-01
In a previous paper (2007 J. Phys. A: Math. Theor. 40 11105), we constructed a class of coherent states for a polynomially deformed su(2) algebra. In this paper, we first prepare the discrete representations of the nonlinearly deformed su(1, 1) algebra. Then we extend the previous procedure to construct a discrete class of coherent states for a polynomial su(1, 1) algebra which contains the Barut-Girardello set and the Perelomov set of the SU(1, 1) coherent states as special cases. We also construct coherent states for the cubic algebra related to the conditionally solvable radial oscillator problem.
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.
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…
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…
ERIC Educational Resources Information Center
Bal, Ayten Pinar
2016-01-01
Problem Statement: Algebra, which is one of the basic principles of mathematical learning, still maintains its importance in mathematics programmes. However, especially starting from the primary school years, algebra represents a complex mathematical factor in the operational stage for many students. In this scope, a differentiated teaching…
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)
Algebraic and geometric spread in finite frames
NASA Astrophysics Data System (ADS)
King, Emily J.
2015-08-01
When searching for finite unit norm tight frames (FUNTFs) of M vectors in FN which yield robust representations, one is concerned with finding frames consisting of frame vectors which are in some sense as spread apart as possible. Algebraic spread and geometric spread are the two most commonly used measures of spread. A frame with optimal algebraic spread is called full spark and is such that any subcollection of N frame vectors is a basis for FN. A Grassmannian frame is a FUNTF which satisfies the Grassmannian packing problem; that is, the frame vectors are optimally geometrically spread given fixed M and N. A particular example of a Grassmannian frame is an equiangular frame, which is such that the absolute value of all inner products of distinct vectors is equal. The relationship between these two types of optimal spread is complicated. The folk knowledge for many years was that equiangular frames were full spark; however, this is now known not to hold for an infinite class of equiangular frames. The exact relationship between these types of spread will be further explored in this talk, as well as Plücker coordinates and coherence, which are measures of how much a frame misses being optimally algebraically or geometrically spread.
Algebraic properties of Rogers-Szegö functions: I. Applications in quantum optics
NASA Astrophysics Data System (ADS)
Marchiolli, M. A.; Ruzzi, M.; Galetti, D.
2009-09-01
By means of a well-established algebraic framework, Rogers-Szegö functions associated with a circular geometry in the complex plane are introduced in the context of q-special functions, and their properties are discussed in detail. The eigenfunctions related to the coherent and phase states emerge from this formalism as infinite expansions of Rogers-Szegö functions, the coefficients being determined through proper eigenvalue equations in each situation. Furthermore, a complementary study on the Robertson-Schrödinger and symmetrical uncertainty relations for the cosine, sine and nondeformed number operators is also conducted, corroborating, in this way, certain features of q-deformed coherent states.
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.
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