Exact solution of some linear matrix equations using algebraic methods

NASA Technical Reports Server (NTRS)

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

1979-01-01

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

Algebraic methods for the solution of some linear matrix equations

NASA Technical Reports Server (NTRS)

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

1979-01-01

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

Conical Lens for 5-Inch/54 Gun Launched Missile

DTIC Science & Technology

1981-06-01

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

Asymptotic aspect of derivations in Banach algebras.

PubMed

Roh, Jaiok; Chang, Ick-Soon

2017-01-01

We prove that every approximate linear left derivation on a semisimple Banach algebra is continuous. Also, we consider linear derivations on Banach algebras and we first study the conditions for a linear derivation on a Banach algebra. Then we examine the functional inequalities related to a linear derivation and their stability. We finally take central linear derivations with radical ranges on semiprime Banach algebras and a continuous linear generalized left derivation on a semisimple Banach algebra.

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

PubMed

Zhao, Shouwei

2011-06-01

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

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

PubMed Central

Brini, A; Teolis, A G

1990-01-01

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

Numerical methods on some structured matrix algebra problems

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

Jessup, E.R.

1996-06-01

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

Identification of Large Space Structures on Orbit

DTIC Science & Technology

1986-09-01

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

Some Applications Of Semigroups And Computer Algebra In Discrete Structures

NASA Astrophysics Data System (ADS)

Bijev, G.

2009-11-01

An algebraic approach to the pseudoinverse generalization problem in Boolean vector spaces is used. A map (p) is defined, which is similar to an orthogonal projection in linear vector spaces. Some other important maps with properties similar to those of the generalized inverses (pseudoinverses) of linear transformations and matrices corresponding to them are also defined and investigated. Let Ax = b be an equation with matrix A and vectors x and b Boolean. Stochastic experiments for solving the equation, which involves the maps defined and use computer algebra methods, have been made. As a result, the Hamming distance between vectors Ax = p(b) and b is equal or close to the least possible. We also share our experience in using computer algebra systems for teaching discrete mathematics and linear algebra and research. Some examples for computations with binary relations using Maple are given.

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

ERIC Educational Resources Information Center

Pankavich, Stephen; Swanson, Rebecca

2015-01-01

Principal Component Analysis (PCA) is a highly useful topic within an introductory Linear Algebra course, especially since it can be used to incorporate a number of applied projects. This method represents an essential application and extension of the Spectral Theorem and is commonly used within a variety of fields, including statistics,…

A Characterization of a Unified Notion of Mathematical Function: The Case of High School Function and Linear Transformation

ERIC Educational Resources Information Center

Zandieh, Michelle; Ellis, Jessica; Rasmussen, Chris

2017-01-01

As part of a larger study of student understanding of concepts in linear algebra, we interviewed 10 university linear algebra students as to their conceptions of functions from high school algebra and linear transformation from their study of linear algebra. An overarching goal of this study was to examine how linear algebra students see linear…

The Growing Importance of Linear Algebra in Undergraduate Mathematics.

ERIC Educational Resources Information Center

Tucker, Alan

1993-01-01

Discusses the theoretical and practical importance of linear algebra. Presents a brief history of linear algebra and matrix theory and describes the place of linear algebra in the undergraduate curriculum. (MDH)

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

ERIC Educational Resources Information Center

Gasyna, Zbigniew L.

2008-01-01

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

Linear systems with structure group and their feedback invariants

NASA Technical Reports Server (NTRS)

Martin, C.; Hermann, R.

1977-01-01

A general method described by Hermann and Martin (1976) for the study of the feedback invariants of linear systems is considered. It is shown that this method, which makes use of ideas of topology and algebraic geometry, is very useful in the investigation of feedback problems for which the classical methods are not suitable. The transfer function as a curve in the Grassmanian is examined. The general concepts studied in the context of specific systems and applications are organized in terms of the theory of Lie groups and algebraic geometry. Attention is given to linear systems which have a structure group, linear mechanical systems, and feedback invariants. The investigation shows that Lie group techniques are powerful and useful tools for analysis of the feedback structure of linear systems.

Investigating Students' Modes of Thinking in Linear Algebra: The Case of Linear Independence

ERIC Educational Resources Information Center

Çelik, Derya

2015-01-01

Linear algebra is one of the most challenging topics to learn and teach in many countries. To facilitate the teaching and learning of linear algebra, priority should be given to epistemologically analyze the concepts that the undergraduate students have difficulty in conceptualizing and to define their ways of reasoning in linear algebra. After…

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

PubMed

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

2016-09-28

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

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

ERIC Educational Resources Information Center

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

2016-01-01

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

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

NASA Astrophysics Data System (ADS)

Campoamor-Stursberg, R.

2018-03-01

A procedure for the construction of nonlinear realizations of Lie algebras in the context of Vessiot-Guldberg-Lie algebras of first-order systems of ordinary differential equations (ODEs) is proposed. The method is based on the reduction of invariants and projection of lowest-dimensional (irreducible) representations of Lie algebras. Applications to the description of parameterized first-order systems of ODEs related by contraction of Lie algebras are given. In particular, the kinematical Lie algebras in (2 + 1)- and (3 + 1)-dimensions are realized simultaneously as Vessiot-Guldberg-Lie algebras of parameterized nonlinear systems in R3 and R4, respectively.

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

NASA Astrophysics Data System (ADS)

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

2016-06-01

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

Mathematical Techniques for Nonlinear System Theory.

DTIC Science & Technology

1981-09-01

This report deals with research results obtained in the following areas: (1) Finite-dimensional linear system theory by algebraic methods--linear...Infinite-dimensional linear systems--realization theory of infinite-dimensional linear systems; (3) Nonlinear system theory --basic properties of

Algebraic approach to electronic spectroscopy and dynamics.

PubMed

Toutounji, Mohamad

2008-04-28

Lie algebra, Zassenhaus, and parameter differentiation techniques are utilized to break up the exponential of a bilinear Hamiltonian operator into a product of noncommuting exponential operators by the virtue of the theory of Wei and Norman [J. Math. Phys. 4, 575 (1963); Proc. Am. Math. Soc., 15, 327 (1964)]. There are about three different ways to find the Zassenhaus exponents, namely, binomial expansion, Suzuki formula, and q-exponential transformation. A fourth, and most reliable method, is provided. Since linearly displaced and distorted (curvature change upon excitation/emission) Hamiltonian and spin-boson Hamiltonian may be classified as bilinear Hamiltonians, the presented algebraic algorithm (exponential operator disentanglement exploiting six-dimensional Lie algebra case) should be useful in spin-boson problems. The linearly displaced and distorted Hamiltonian exponential is only treated here. While the spin-boson model is used here only as a demonstration of the idea, the herein approach is more general and powerful than the specific example treated. The optical linear dipole moment correlation function is algebraically derived using the above mentioned methods and coherent states. Coherent states are eigenvectors of the bosonic lowering operator a and not of the raising operator a(+). While exp(a(+)) translates coherent states, exp(a(+)a(+)) operation on coherent states has always been a challenge, as a(+) has no eigenvectors. Three approaches, and the results, of that operation are provided. Linear absorption spectra are derived, calculated, and discussed. The linear dipole moment correlation function for the pure quadratic coupling case is expressed in terms of Legendre polynomials to better show the even vibronic transitions in the absorption spectrum. Comparison of the present line shapes to those calculated by other methods is provided. Franck-Condon factors for both linear and quadratic couplings are exactly accounted for by the herein calculated linear absorption spectra. This new methodology should easily pave the way to calculating the four-point correlation function, F(tau(1),tau(2),tau(3),tau(4)), of which the optical nonlinear response function may be procured, as evaluating F(tau(1),tau(2),tau(3),tau(4)) is only evaluating the optical linear dipole moment correlation function iteratively over different time intervals, which should allow calculating various optical nonlinear temporal/spectral signals.

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

NASA Astrophysics Data System (ADS)

Winicour, Jeffrey

2017-08-01

An algebraic-hyperbolic method for solving the Hamiltonian and momentum constraints has recently been shown to be well posed for general nonlinear perturbations of the initial data for a Schwarzschild black hole. This is a new approach to solving the constraints of Einstein’s equations which does not involve elliptic equations and has potential importance for the construction of binary black hole data. In order to shed light on the underpinnings of this approach, we consider its application to obtain solutions of the constraints for linearized perturbations of Minkowski space. In that case, we find the surprising result that there are no suitable Cauchy hypersurfaces in Minkowski space for which the linearized algebraic-hyperbolic constraint problem is well posed.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

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.

Those Do What? Connecting Eigenvectors and Eigenvalues to the Rest of Linear Algebra: Using Visual Enhancements to Help Students Connect Eigenvectors to the Rest of Linear Algebra

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…

Invariant algebraic surfaces for a virus dynamics

NASA Astrophysics Data System (ADS)

Valls, Claudia

2015-08-01

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

On differential operators generating iterative systems of linear ODEs of maximal symmetry algebra

NASA Astrophysics Data System (ADS)

Ndogmo, J. C.

2017-06-01

Although every iterative scalar linear ordinary differential equation is of maximal symmetry algebra, the situation is different and far more complex for systems of linear ordinary differential equations, and an iterative system of linear equations need not be of maximal symmetry algebra. We illustrate these facts by examples and derive families of vector differential operators whose iterations are all linear systems of equations of maximal symmetry algebra. Some consequences of these results are also discussed.

On representations of the filiform Lie superalgebra Lm,n

NASA Astrophysics Data System (ADS)

Wang, Qi; Chen, Hongjia; Liu, Wende

2015-11-01

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

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

NASA Astrophysics Data System (ADS)

Larese, D.; Iachello, F.

2011-06-01

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

Sixth SIAM conference on applied linear algebra: Final program and abstracts. Final technical report

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

NONE

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 peoplemore » 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.« less

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

Computing Gröbner Bases within Linear Algebra

NASA Astrophysics Data System (ADS)

Suzuki, Akira

In this paper, we present an alternative algorithm to compute Gröbner bases, which is based on computations on sparse linear algebra. Both of S-polynomial computations and monomial reductions are computed in linear algebra simultaneously in this algorithm. So it can be implemented to any computational system which can handle linear algebra. For a given ideal in a polynomial ring, it calculates a Gröbner basis along with the corresponding term order appropriately.

Using Example Generation to Explore Students' Understanding of the Concepts of Linear Dependence/Independence in Linear Algebra

ERIC Educational Resources Information Center

Aydin, Sinan

2014-01-01

Linear algebra is a basic mathematical subject taught in mathematics and science depar-tments of universities. The teaching and learning of this course has always been difficult. This study aims to contribute to the research in linear algebra education, focusing on linear dependence and independence concepts. This was done by introducing…

Algebraic approach to electronic spectroscopy and dynamics

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

Toutounji, Mohamad

Lie algebra, Zassenhaus, and parameter differentiation techniques are utilized to break up the exponential of a bilinear Hamiltonian operator into a product of noncommuting exponential operators by the virtue of the theory of Wei and Norman [J. Math. Phys. 4, 575 (1963); Proc. Am. Math. Soc., 15, 327 (1964)]. There are about three different ways to find the Zassenhaus exponents, namely, binomial expansion, Suzuki formula, and q-exponential transformation. A fourth, and most reliable method, is provided. Since linearly displaced and distorted (curvature change upon excitation/emission) Hamiltonian and spin-boson Hamiltonian may be classified as bilinear Hamiltonians, the presented algebraic algorithm (exponentialmore » operator disentanglement exploiting six-dimensional Lie algebra case) should be useful in spin-boson problems. The linearly displaced and distorted Hamiltonian exponential is only treated here. While the spin-boson model is used here only as a demonstration of the idea, the herein approach is more general and powerful than the specific example treated. The optical linear dipole moment correlation function is algebraically derived using the above mentioned methods and coherent states. Coherent states are eigenvectors of the bosonic lowering operator a and not of the raising operator a{sup +}. While exp(a{sup +}) translates coherent states, exp(a{sup +}a{sup +}) operation on coherent states has always been a challenge, as a{sup +} has no eigenvectors. Three approaches, and the results, of that operation are provided. Linear absorption spectra are derived, calculated, and discussed. The linear dipole moment correlation function for the pure quadratic coupling case is expressed in terms of Legendre polynomials to better show the even vibronic transitions in the absorption spectrum. Comparison of the present line shapes to those calculated by other methods is provided. Franck-Condon factors for both linear and quadratic couplings are exactly accounted for by the herein calculated linear absorption spectra. This new methodology should easily pave the way to calculating the four-point correlation function, F({tau}{sub 1},{tau}{sub 2},{tau}{sub 3},{tau}{sub 4}), of which the optical nonlinear response function may be procured, as evaluating F({tau}{sub 1},{tau}{sub 2},{tau}{sub 3},{tau}{sub 4}) is only evaluating the optical linear dipole moment correlation function iteratively over different time intervals, which should allow calculating various optical nonlinear temporal/spectral signals.« less

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.

Chemical Equation Balancing.

ERIC Educational Resources Information Center

Blakley, G. R.

1982-01-01

Reviews mathematical techniques for solving systems of homogeneous linear equations and demonstrates that the algebraic method of balancing chemical equations is a matter of solving a system of homogeneous linear equations. FORTRAN programs using this matrix method to chemical equation balancing are available from the author. (JN)

Computer programs for the solution of systems of linear algebraic equations

NASA Technical Reports Server (NTRS)

Sequi, W. T.

1973-01-01

FORTRAN subprograms for the solution of systems of linear algebraic equations are described, listed, and evaluated in this report. Procedures considered are direct solution, iteration, and matrix inversion. Both incore methods and those which utilize auxiliary data storage devices are considered. Some of the subroutines evaluated require the entire coefficient matrix to be in core, whereas others account for banding or sparceness of the system. General recommendations relative to equation solving are made, and on the basis of tests, specific subprograms are recommended.

[Relations between biomedical variables: mathematical analysis or linear algebra?].

PubMed

Hucher, M; Berlie, J; Brunet, M

1977-01-01

The authors, after a short reminder of one pattern's structure, stress on the possible double approach of relations uniting the variables of this pattern: use of fonctions, what is within the mathematical analysis sphere, use of linear algebra profiting by matricial calculation's development and automatiosation. They precise the respective interests on these methods, their bounds and the imperatives for utilization, according to the kind of variables, of data, and the objective for work, understanding phenomenons or helping towards decision.

Linear-Algebra Programs

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.

Linear Ordinary Differential Equations with Constant Coefficients. Revisiting the Impulsive Response Method Using Factorization

ERIC Educational Resources Information Center

Camporesi, Roberto

2011-01-01

We present an approach to the impulsive response method for solving linear constant-coefficient ordinary differential equations based on the factorization of the differential operator. The approach is elementary, we only assume a basic knowledge of calculus and linear algebra. In particular, we avoid the use of distribution theory, as well as of…

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

NASA Technical Reports Server (NTRS)

Lerner, Bao-Ting; Morelli, Michael V.

1990-01-01

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

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

NASA Astrophysics Data System (ADS)

Seo, Jae Hong

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

An Inquiry-Based Linear Algebra Class

ERIC Educational Resources Information Center

Wang, Haohao; Posey, Lisa

2011-01-01

Linear algebra is a standard undergraduate mathematics course. This paper presents an overview of the design and implementation of an inquiry-based teaching material for the linear algebra course which emphasizes discovery learning, analytical thinking and individual creativity. The inquiry-based teaching material is designed to fit the needs of a…

Numerical Linear Algebra.

DTIC Science & Technology

1980-09-08

February 1979 through 31 March 1980 Title of Research: NUMERICAL LINEAR ALGEBRA Principal Investigators: Gene H. Golub James H. Wilkinson Research...BEFORE COMPLETING FORM 2 OTAgSSION NO. 3. RECIPIENT’S CATALOG NUMBER ITE~ btitle) ~qEE NUMERICAL LINEAR ALGEBRA #I ~ f#7&/8 PER.ORMING ORG. REPORT NUM 27R 7

Linear {GLP}-algebras and their elementary theories

NASA Astrophysics Data System (ADS)

Pakhomov, F. N.

2016-12-01

The polymodal provability logic {GLP} was introduced by Japaridze in 1986. It is the provability logic of certain chains of provability predicates of increasing strength. Every polymodal logic corresponds to a variety of polymodal algebras. Beklemishev and Visser asked whether the elementary theory of the free {GLP}-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable [1]. For every positive integer n we solve the corresponding question for the logics {GLP}_n that are the fragments of {GLP} with n modalities. We prove that the elementary theory of the free {GLP}_n-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable for all n. We introduce the notion of a linear {GLP}_n-algebra and prove that all free {GLP}_n-algebras generated by the constants \\mathbf{0}, \\mathbf{1} are linear. We also consider the more general case of the logics {GLP}_α whose modalities are indexed by the elements of a linearly ordered set α: we define the notion of a linear algebra and prove the latter result in this case.

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

NASA Astrophysics Data System (ADS)

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

1995-07-01

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

Visualizing the inner product space ℝm×n in a MATLAB-assisted linear algebra classroom

NASA Astrophysics Data System (ADS)

Caglayan, Günhan

2018-05-01

This linear algebra note offers teaching and learning ideas in the treatment of the inner product space ? in a technology-supported learning environment. Classroom activities proposed in this note demonstrate creative ways of integrating MATLAB technology into various properties of Frobenius inner product as visualization tools that complement the algebraic approach. As implemented in linear algebra lessons in a university in the Unites States, the article also incorporates algebraic and visual work of students who experienced these activities with MATLAB software. The connection between the Frobenius norm and the Euclidean norm is also emphasized.

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

Resources for Teaching Linear Algebra. MAA Notes Volume 42.

ERIC Educational Resources Information Center

Carlson, David, Ed.; And Others

This book takes the position that the teaching of elementary linear algebra can be made more effective by emphasizing applications, exposition, and pedagogy. It includes the recommendations of the Linear Algebra Curriculum Study Group with their core syllabus for the first course, and the thoughts of mathematics faculty who have taught linear…

Emphasizing Language and Visualization in Teaching Linear Algebra

ERIC Educational Resources Information Center

Hannah, John; Stewart, Sepideh; Thomas, Mike

2013-01-01

Linear algebra with its rich theoretical nature is a first step towards advanced mathematical thinking for many undergraduate students. In this paper, we consider the teaching approach of an experienced mathematician as he attempts to engage his students with the key ideas embedded in a second-year course in linear algebra. We describe his…

A Fresh Look at Linear Ordinary Differential Equations with Constant Coefficients. Revisiting the Impulsive Response Method Using Factorization

ERIC Educational Resources Information Center

Camporesi, Roberto

2016-01-01

We present an approach to the impulsive response method for solving linear constant-coefficient ordinary differential equations of any order based on the factorization of the differential operator. The approach is elementary, we only assume a basic knowledge of calculus and linear algebra. In particular, we avoid the use of distribution theory, as…

Numerical Methods for Forward and Inverse Problems in Discontinuous Media

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

Chartier, Timothy P.

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

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

PubMed

Li, Jing; Hong, Wenxue

2014-12-01

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

Block iterative restoration of astronomical images with the massively parallel processor

NASA Technical Reports Server (NTRS)

Heap, Sara R.; Lindler, Don J.

1987-01-01

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

Advanced Mathematics Online: Assessing Particularities in the Online Delivery of a Second Linear Algebra Course

ERIC Educational Resources Information Center

Montiel, Mariana; Bhatti, Uzma

2010-01-01

This article presents an overview of some issues that were confronted when delivering an online second Linear Algebra course (assuming a previous Introductory Linear Algebra course) to graduate students enrolled in a Secondary Mathematics Education program. The focus is on performance in one particular aspect of the course: "change of basis" and…

Linear Algebra Revisited: An Attempt to Understand Students' Conceptual Difficulties

ERIC Educational Resources Information Center

Britton, Sandra; Henderson, Jenny

2009-01-01

This article looks at some of the conceptual difficulties that students have in a linear algebra course. An overview of previous research in this area is given, and the various theories that have been espoused regarding the reasons that students find linear algebra so difficult are discussed. Student responses to two questions testing the ability…

Natural differential operations on manifolds: an algebraic approach

NASA Astrophysics Data System (ADS)

Katsylo, P. I.; Timashev, D. A.

2008-10-01

Natural algebraic differential operations on geometric quantities on smooth manifolds are considered. A method for the investigation and classification of such operations is described, the method of IT-reduction. With it the investigation of natural operations reduces to the analysis of rational maps between k-jet spaces, which are equivariant with respect to certain algebraic groups. On the basis of the method of IT-reduction a finite generation theorem is proved: for tensor bundles \\mathscr{V},\\mathscr{W}\\to M all the natural differential operations D\\colon\\Gamma(\\mathscr{V})\\to\\Gamma(\\mathscr{W}) of degree at most d can be algebraically constructed from some finite set of such operations. Conceptual proofs of known results on the classification of natural linear operations on arbitrary and symplectic manifolds are presented. A non-existence theorem is proved for natural deformation quantizations on Poisson manifolds and symplectic manifolds.Bibliography: 21 titles.

AN EFFICIENT HIGHER-ORDER FAST MULTIPOLE BOUNDARY ELEMENT SOLUTION FOR POISSON-BOLTZMANN BASED MOLECULAR ELECTROSTATICS

PubMed Central

Bajaj, Chandrajit; Chen, Shun-Chuan; Rand, Alexander

2011-01-01

In order to compute polarization energy of biomolecules, we describe a boundary element approach to solving the linearized Poisson-Boltzmann equation. Our approach combines several important features including the derivative boundary formulation of the problem and a smooth approximation of the molecular surface based on the algebraic spline molecular surface. State of the art software for numerical linear algebra and the kernel independent fast multipole method is used for both simplicity and efficiency of our implementation. We perform a variety of computational experiments, testing our method on a number of actual proteins involved in molecular docking and demonstrating the effectiveness of our solver for computing molecular polarization energy. PMID:21660123

Generalized Clifford Algebras as Algebras in Suitable Symmetric Linear Gr-Categories

NASA Astrophysics Data System (ADS)

Cheng, Tao; Huang, Hua-Lin; Yang, Yuping

2016-01-01

By viewing Clifford algebras as algebras in some suitable symmetric Gr-categories, Albuquerque and Majid were able to give a new derivation of some well known results about Clifford algebras and to generalize them. Along the same line, Bulacu observed that Clifford algebras are weak Hopf algebras in the aforementioned categories and obtained other interesting properties. The aim of this paper is to study generalized Clifford algebras in a similar manner and extend the results of Albuquerque, Majid and Bulacu to the generalized setting. In particular, by taking full advantage of the gauge transformations in symmetric linear Gr-categories, we derive the decomposition theorem and provide categorical weak Hopf structures for generalized Clifford algebras in a conceptual and simpler manner.

Solving rational matrix equations in the state space with applications to computer-aided control-system design

NASA Technical Reports Server (NTRS)

Packard, A. K.; Sastry, S. S.

1986-01-01

A method of solving a class of linear matrix equations over various rings is proposed, using results from linear geometric control theory. An algorithm, successfully implemented, is presented, along with non-trivial numerical examples. Applications of the method to the algebraic control system design methodology are discussed.

True orbit simulation of piecewise linear and linear fractional maps of arbitrary dimension using algebraic numbers

NASA Astrophysics Data System (ADS)

Saito, Asaki; Yasutomi, Shin-ichi; Tamura, Jun-ichi; Ito, Shunji

2015-06-01

We introduce a true orbit generation method enabling exact simulations of dynamical systems defined by arbitrary-dimensional piecewise linear fractional maps, including piecewise linear maps, with rational coefficients. This method can generate sufficiently long true orbits which reproduce typical behaviors (inherent behaviors) of these systems, by properly selecting algebraic numbers in accordance with the dimension of the target system, and involving only integer arithmetic. By applying our method to three dynamical systems—that is, the baker's transformation, the map associated with a modified Jacobi-Perron algorithm, and an open flow system—we demonstrate that it can reproduce their typical behaviors that have been very difficult to reproduce with conventional simulation methods. In particular, for the first two maps, we show that we can generate true orbits displaying the same statistical properties as typical orbits, by estimating the marginal densities of their invariant measures. For the open flow system, we show that an obtained true orbit correctly converges to the stable period-1 orbit, which is inherently possessed by the system.

The Linear Algebra Curriculum Study Group Recommendations for the First Course in Linear Algebra.

ERIC Educational Resources Information Center

Carlson, David; And Others

1993-01-01

Presents five recommendations of the Linear Algebra Curriculum Study Group: (1) The syllabus must respond to the client disciplines; (2) The first course should be matrix oriented; (3) Faculty should consider the needs and interests of students; (4) Faculty should use technology; and (5) At least one follow-up course should be required. Provides a…

W-algebra for solving problems with fuzzy parameters

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

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

PubMed

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

2017-01-01

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

Individual and Collective Analyses of the Genesis of Student Reasoning Regarding the Invertible Matrix Theorem in Linear Algebra

ERIC Educational Resources Information Center

Wawro, Megan Jean

2011-01-01

In this study, I considered the development of mathematical meaning related to the Invertible Matrix Theorem (IMT) for both a classroom community and an individual student over time. In this particular linear algebra course, the IMT was a core theorem in that it connected many concepts fundamental to linear algebra through the notion of…

Bisimulation equivalence of differential-algebraic systems

NASA Astrophysics Data System (ADS)

Megawati, Noorma Yulia; Schaft, Arjan van der

2018-01-01

In this paper, the notion of bisimulation relation for linear input-state-output systems is extended to general linear differential-algebraic (DAE) systems. Geometric control theory is used to derive a linear-algebraic characterisation of bisimulation relations, and an algorithm for computing the maximal bisimulation relation between two linear DAE systems. The general definition is specialised to the case where the matrix pencil sE - A is regular. Furthermore, by developing a one-sided version of bisimulation, characterisations of simulation and abstraction are obtained.

GPU Linear Algebra Libraries and GPGPU Programming for Accelerating MOPAC Semiempirical Quantum Chemistry Calculations.

PubMed

Maia, Julio Daniel Carvalho; Urquiza Carvalho, Gabriel Aires; Mangueira, Carlos Peixoto; Santana, Sidney Ramos; Cabral, Lucidio Anjos Formiga; Rocha, Gerd B

2012-09-11

In this study, we present some modifications in the semiempirical quantum chemistry MOPAC2009 code that accelerate single-point energy calculations (1SCF) of medium-size (up to 2500 atoms) molecular systems using GPU coprocessors and multithreaded shared-memory CPUs. Our modifications consisted of using a combination of highly optimized linear algebra libraries for both CPU (LAPACK and BLAS from Intel MKL) and GPU (MAGMA and CUBLAS) to hasten time-consuming parts of MOPAC such as the pseudodiagonalization, full diagonalization, and density matrix assembling. We have shown that it is possible to obtain large speedups just by using CPU serial linear algebra libraries in the MOPAC code. As a special case, we show a speedup of up to 14 times for a methanol simulation box containing 2400 atoms and 4800 basis functions, with even greater gains in performance when using multithreaded CPUs (2.1 times in relation to the single-threaded CPU code using linear algebra libraries) and GPUs (3.8 times). This degree of acceleration opens new perspectives for modeling larger structures which appear in inorganic chemistry (such as zeolites and MOFs), biochemistry (such as polysaccharides, small proteins, and DNA fragments), and materials science (such as nanotubes and fullerenes). In addition, we believe that this parallel (GPU-GPU) MOPAC code will make it feasible to use semiempirical methods in lengthy molecular simulations using both hybrid QM/MM and QM/QM potentials.

Parallel Algorithms for Least Squares and Related Computations.

DTIC Science & Technology

1991-03-22

for dense computations in linear algebra . The work has recently been published in a general reference book on parallel algorithms by SIAM. AFO SR...written his Ph.D. dissertation with the principal investigator. (See publication 6.) • Parallel Algorithms for Dense Linear Algebra Computations. Our...and describe and to put into perspective a selection of the more important parallel algorithms for numerical linear algebra . We give a major new

Global identifiability of linear compartmental models--a computer algebra algorithm.

PubMed

Audoly, S; D'Angiò, L; Saccomani, M P; Cobelli, C

1998-01-01

A priori global identifiability deals with the uniqueness of the solution for the unknown parameters of a model and is, thus, a prerequisite for parameter estimation of biological dynamic models. Global identifiability is however difficult to test, since it requires solving a system of algebraic nonlinear equations which increases both in nonlinearity degree and number of terms and unknowns with increasing model order. In this paper, a computer algebra tool, GLOBI (GLOBal Identifiability) is presented, which combines the topological transfer function method with the Buchberger algorithm, to test global identifiability of linear compartmental models. GLOBI allows for the automatic testing of a priori global identifiability of general structure compartmental models from general multi input-multi output experiments. Examples of usage of GLOBI to analyze a priori global identifiability of some complex biological compartmental models are provided.

Ermakov's Superintegrable Toy and Nonlocal Symmetries

NASA Astrophysics Data System (ADS)

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

2005-11-01

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

University of Chicago School Mathematics Project (UCSMP) Algebra. WWC Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2009

2009-01-01

University of Chicago School Mathematics Project (UCSMP) Algebra is a one-year course covering three primary topics: (1) linear and quadratic expressions, sentences, and functions; (2) exponential expressions and functions; and (3) linear systems. Topics from geometry, probability, and statistics are integrated with the appropriate algebra.…

Linear algebraic theory of partial coherence: discrete fields and measures of partial coherence.

PubMed

Ozaktas, Haldun M; Yüksel, Serdar; Kutay, M Alper

2002-08-01

A linear algebraic theory of partial coherence is presented that allows precise mathematical definitions of concepts such as coherence and incoherence. This not only provides new perspectives and insights but also allows us to employ the conceptual and algebraic tools of linear algebra in applications. We define several scalar measures of the degree of partial coherence of an optical field that are zero for full incoherence and unity for full coherence. The mathematical definitions are related to our physical understanding of the corresponding concepts by considering them in the context of Young's experiment.

Numerical methods in Markov chain modeling

NASA Technical Reports Server (NTRS)

Philippe, Bernard; Saad, Youcef; Stewart, William J.

1989-01-01

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Linear ordinary differential equations with constant coefficients. Revisiting the impulsive response method using factorization

NASA Astrophysics Data System (ADS)

Camporesi, Roberto

2011-06-01

We present an approach to the impulsive response method for solving linear constant-coefficient ordinary differential equations based on the factorization of the differential operator. The approach is elementary, we only assume a basic knowledge of calculus and linear algebra. In particular, we avoid the use of distribution theory, as well as of the other more advanced approaches: Laplace transform, linear systems, the general theory of linear equations with variable coefficients and the variation of constants method. The approach presented here can be used in a first course on differential equations for science and engineering majors.

Three-dimensional forward modeling of DC resistivity using the aggregation-based algebraic multigrid method

NASA Astrophysics Data System (ADS)

Chen, Hui; Deng, Ju-Zhi; Yin, Min; Yin, Chang-Chun; Tang, Wen-Wu

2017-03-01

To speed up three-dimensional (3D) DC resistivity modeling, we present a new multigrid method, the aggregation-based algebraic multigrid method (AGMG). We first discretize the differential equation of the secondary potential field with mixed boundary conditions by using a seven-point finite-difference method to obtain a large sparse system of linear equations. Then, we introduce the theory behind the pairwise aggregation algorithms for AGMG and use the conjugate-gradient method with the V-cycle AGMG preconditioner (AGMG-CG) to solve the linear equations. We use typical geoelectrical models to test the proposed AGMG-CG method and compare the results with analytical solutions and the 3DDCXH algorithm for 3D DC modeling (3DDCXH). In addition, we apply the AGMG-CG method to different grid sizes and geoelectrical models and compare it to different iterative methods, such as ILU-BICGSTAB, ILU-GCR, and SSOR-CG. The AGMG-CG method yields nearly linearly decreasing errors, whereas the number of iterations increases slowly with increasing grid size. The AGMG-CG method is precise and converges fast, and thus can improve the computational efficiency in forward modeling of three-dimensional DC resistivity.

Sampled-Data Kalman Filtering and Multiple Model Adaptive Estimation for Infinite-Dimensional Continuous-Time Systems

DTIC Science & Technology

2007-03-01

mathematical frame- 1-6 work of linear algebra and functional analysis [122, 33], while Kalman-Bucy filtering [96, 32] is an especially important...Engineering, Air Force Institute of Technology (AU), Wright- Patterson AFB, Ohio, March 2002. 85. Hoffman, Kenneth and Ray Kunze. Linear Algebra (Second Edition...Engineering, Air Force Institute of Technology (AU), Wright- Patterson AFB, Ohio, December 1989. 189. Strang, Gilbert. Linear Algebra and Its Applications

Calculating Required Substructure Damping to Meet Prescribed System Damping Levels

DTIC Science & Technology

2007-06-01

Rorres, Elementary Linear Algebra . New Jersey: John Wiley & Sons, 2005. 2. Klaus-Jurgen Bathe, Finite Element Procedures. New Jersey: Prentice Hall...will be covered in the explanation of orthogonal complement. The definitions are extracted from the book “ Linear Algebra and its Applications” by...TA = left nullspace of A; dimension m-r Applying the first part of the fundamental theorem of Linear Algebra we can now talk about the orthogonal

Emphasizing language and visualization in teaching linear algebra

NASA Astrophysics Data System (ADS)

Hannah, John; Stewart, Sepideh; Thomas, Mike

2013-06-01

Linear algebra with its rich theoretical nature is a first step towards advanced mathematical thinking for many undergraduate students. In this paper, we consider the teaching approach of an experienced mathematician as he attempts to engage his students with the key ideas embedded in a second-year course in linear algebra. We describe his approach in both lectures and tutorials, and how he employed visualization and an emphasis on language to encourage conceptual thinking. We use Tall's framework of three worlds of mathematical thinking to reflect on the effect of these activities in students' learning. An analysis of students' attitudes to the course and their test and examination results help to answer questions about the value of such an approach, suggesting ways forward in teaching linear algebra.

Mathematical Modeling of Chemical Stoichiometry

ERIC Educational Resources Information Center

Croteau, Joshua; Fox, William P.; Varazo, Kristofoland

2007-01-01

In beginning chemistry classes, students are taught a variety of techniques for balancing chemical equations. The most common method is inspection. This paper addresses using a system of linear mathematical equations to solve for the stoichiometric coefficients. Many linear algebra books carry the standard balancing of chemical equations as an…

Commentary on A General Curriculum in Mathematics for Colleges.

ERIC Educational Resources Information Center

Committee on the Undergraduate Program in Mathematics, Berkeley, CA.

This document constitutes a complete revision of the report of the same name first published in 1965. A new list of basic courses is described, consisting of Calculus I, Calculus II, Elementary Linear Algebra, Multivariable Calculus I, Linear Algebra, and Introductory Modern Algebra. Commentaries outline the content and spirit of these courses in…

Teaching the "Diagonalization Concept" in Linear Algebra with Technology: A Case Study at Galatasaray University

ERIC Educational Resources Information Center

Yildiz Ulus, Aysegul

2013-01-01

This paper examines experimental and algorithmic contributions of advanced calculators (graphing and computer algebra system, CAS) in teaching the concept of "diagonalization," one of the key topics in Linear Algebra courses taught at the undergraduate level. Specifically, the proposed hypothesis of this study is to assess the effective…

Complementary Reliability-Based Decodings of Binary Linear Block Codes

NASA Technical Reports Server (NTRS)

Fossorier, Marc P. C.; Lin, Shu

1997-01-01

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

The Role of Proof in Comprehending and Teaching Elementary Linear Algebra.

ERIC Educational Resources Information Center

Uhlig, Frank

2002-01-01

Describes how elementary linear algebra can be taught successfully while introducing students to the concept and practice of mathematical proof. Suggests exploring the concept of solvability of linear systems first via the row echelon form (REF). (Author/KHR)

Constitutive relations in optics in terms of geometric algebra

NASA Astrophysics Data System (ADS)

Dargys, A.

2015-11-01

To analyze the electromagnetic wave propagation in a medium the Maxwell equations should be supplemented by constitutive relations. At present the classification of linear constitutive relations is well established in tensorial-matrix and exterior p-form calculus. Here the constitutive relations are found in the context of Clifford geometric algebra. For this purpose Cl1,3 algebra that conforms with relativistic 4D Minkowskian spacetime is used. It is shown that the classification of linear optical phenomena with the help of constitutive relations in this case comes from the structure of Cl1,3 algebra itself. Concrete expressions for constitutive relations which follow from this algebra are presented. They can be applied in calculating the propagation properties of electromagnetic waves in any anisotropic, linear and nondissipative medium.

A Comparison Study between a Traditional and Experimental Program.

ERIC Educational Resources Information Center

Dogan, Hamide

This paper is part of a dissertation defended in January 2001 as part of the author's Ph.D. requirement. The study investigated the effects of use of Mathematica, a computer algebra system, in learning basic linear algebra concepts, It was done by means of comparing two first year linear algebra classes, one traditional and one Mathematica…

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…

A wavelet-based ECG delineation algorithm for 32-bit integer online processing

PubMed Central

2011-01-01

Background Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. Methods This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. Results The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. Conclusions The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra. PMID:21457580

On correct evaluation techniques of brightness enhancement effect measurement data

NASA Astrophysics Data System (ADS)

Kukačka, Leoš; Dupuis, Pascal; Motomura, Hideki; Rozkovec, Jiří; Kolář, Milan; Zissis, Georges; Jinno, Masafumi

2017-11-01

This paper aims to establish confidence intervals of the quantification of brightness enhancement effects resulting from the use of pulsing bright light. It is found that the methods used so far may yield significant bias in the published results, overestimating or underestimating the enhancement effect. The authors propose to use a linear algebra method called the total least squares. Upon an example dataset, it is shown that this method does not yield biased results. The statistical significance of the results is also computed. It is concluded over an observation set that the currently used linear algebra methods present many patterns of noise sensitivity. Changing algorithm details leads to inconsistent results. It is thus recommended to use the method with the lowest noise sensitivity. Moreover, it is shown that this method also permits one to obtain an estimate of the confidence interval. This paper neither aims to publish results about a particular experiment nor to draw any particular conclusion about existence or nonexistence of the brightness enhancement effect.

Tissue characterization using electrical impedance spectroscopy data: a linear algebra approach.

PubMed

Laufer, Shlomi; Solomon, Stephen B; Rubinsky, Boris

2012-06-01

In this study, we use a new linear algebra manipulation on electrical impedance spectroscopy measurements to provide real-time information regarding the nature of the tissue surrounding the needle in minimal invasive procedures. Using a Comsol Multiphysics three-dimensional model, a phantom based on ex vivo animal tissue and in vivo animal data, we demonstrate how tissue inhomogeneity can be characterized without any previous knowledge of the electrical properties of the different tissues, except that they should not be linearly dependent on a certain frequency range. This method may have applications in needle biopsies, radiation seeds, or minimally invasive surgery and can reduce the number of computer tomography or magnetic resonance imaging images. We conclude by demonstrating how this mathematical approach can be useful in other applications.

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

NASA Technical Reports Server (NTRS)

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

2008-01-01

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

Implicit Plasma Kinetic Simulation Using The Jacobian-Free Newton-Krylov Method

NASA Astrophysics Data System (ADS)

Taitano, William; Knoll, Dana; Chacon, Luis

2009-11-01

The use of fully implicit time integration methods in kinetic simulation is still area of algorithmic research. A brute-force approach to simultaneously including the field equations and the particle distribution function would result in an intractable linear algebra problem. A number of algorithms have been put forward which rely on an extrapolation in time. They can be thought of as linearly implicit methods or one-step Newton methods. However, issues related to time accuracy of these methods still remain. We are pursuing a route to implicit plasma kinetic simulation which eliminates extrapolation, eliminates phase-space from the linear algebra problem, and converges the entire nonlinear system within a time step. We accomplish all this using the Jacobian-Free Newton-Krylov algorithm. The original research along these lines considered particle methods to advance the distribution function [1]. In the current research we are advancing the Vlasov equations on a grid. Results will be presented which highlight algorithmic details for single species electrostatic problems and coupled ion-electron electrostatic problems. [4pt] [1] H. J. Kim, L. Chac'on, G. Lapenta, ``Fully implicit particle in cell algorithm,'' 47th Annual Meeting of the Division of Plasma Physics, Oct. 24-28, 2005, Denver, CO

Stability Analysis of Finite Difference Schemes for Hyperbolic Systems, and Problems in Applied and Computational Linear Algebra.

DTIC Science & Technology

FINITE DIFFERENCE THEORY, * LINEAR ALGEBRA , APPLIED MATHEMATICS, APPROXIMATION(MATHEMATICS), BOUNDARY VALUE PROBLEMS, COMPUTATIONS, HYPERBOLAS, MATHEMATICAL MODELS, NUMERICAL ANALYSIS, PARTIAL DIFFERENTIAL EQUATIONS, STABILITY.

Libraries for Software Use on Peregrine | High-Performance Computing | NREL

Science.gov Websites

-specific libraries. Libraries List Name Description BLAS Basic Linear Algebra Subroutines, libraries only managing hierarchically structured data. LAPACK Standard Netlib offering for computational linear algebra

Implementing Linear Algebra Related Algorithms on the TI-92+ Calculator.

ERIC Educational Resources Information Center

Alexopoulos, John; Abraham, Paul

2001-01-01

Demonstrates a less utilized feature of the TI-92+: its natural and powerful programming language. Shows how to implement several linear algebra related algorithms including the Gram-Schmidt process, Least Squares Approximations, Wronskians, Cholesky Decompositions, and Generalized Linear Least Square Approximations with QR Decompositions.…

Ada Linear-Algebra Program

NASA Technical Reports Server (NTRS)

Klumpp, A. R.; Lawson, C. L.

1988-01-01

Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.

Mathematical modelling in engineering: an alternative way to teach Linear Algebra

NASA Astrophysics Data System (ADS)

Domínguez-García, S.; García-Planas, M. I.; Taberna, J.

2016-10-01

Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic classroom approach in which students modelled real-world problems and turn gain a deeper knowledge of the Linear Algebra subject. Considering that most students are digital natives, we use the e-portfolio as a tool of communication between students and teachers, besides being a good place making the work visible. In this article, we present an overview of the design and implementation of a project-based learning for a Linear Algebra course taught during the 2014-2015 at the 'ETSEIB'of Universitat Politècnica de Catalunya (UPC).

Chiropractic biophysics technique: a linear algebra approach to posture in chiropractic.

PubMed

Harrison, D D; Janik, T J; Harrison, G R; Troyanovich, S; Harrison, D E; Harrison, S O

1996-10-01

This paper discusses linear algebra as applied to human posture in chiropractic, specifically chiropractic biophysics technique (CBP). Rotations, reflections and translations are geometric functions studied in vector spaces in linear algebra. These mathematical functions are termed rigid body transformations and are applied to segmental spinal movement in the literature. Review of the literature indicates that these linear algebra concepts have been used to describe vertebral motion. However, these rigid body movers are presented here as applying to the global postural movements of the head, thoracic cage and pelvis. The unique inverse functions of rotations, reflections and translations provide a theoretical basis for making postural corrections in neutral static resting posture. Chiropractic biophysics technique (CBP) uses these concepts in examination procedures, manual spinal manipulation, instrument assisted spinal manipulation, postural exercises, extension traction and clinical outcome measures.

Frequency analysis via the method of moment functionals

NASA Technical Reports Server (NTRS)

Pearson, A. E.; Pan, J. Q.

1990-01-01

Several variants are presented of a linear-in-parameters least squares formulation for determining the transfer function of a stable linear system at specified frequencies given a finite set of Fourier series coefficients calculated from transient nonstationary input-output data. The basis of the technique is Shinbrot's classical method of moment functionals using complex Fourier based modulating functions to convert a differential equation model on a finite time interval into an algebraic equation which depends linearly on frequency-related parameters.

An algebraic method for constructing stable and consistent autoregressive filters

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

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

2015-02-15

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

The Multifaceted Variable Approach: Selection of Method in Solving Simple Linear Equations

ERIC Educational Resources Information Center

Tahir, Salma; Cavanagh, Michael

2010-01-01

This paper presents a comparison of the solution strategies used by two groups of Year 8 students as they solved linear equations. The experimental group studied algebra following a multifaceted variable approach, while the comparison group used a traditional approach. Students in the experimental group employed different solution strategies,…

An application of the Maslov complex germ method to the one-dimensional nonlocal Fisher-KPP equation

NASA Astrophysics Data System (ADS)

Shapovalov, A. V.; Trifonov, A. Yu.

A semiclassical approximation approach based on the Maslov complex germ method is considered in detail for the one-dimensional nonlocal Fisher-Kolmogorov-Petrovskii-Piskunov (Fisher-KPP) equation under the supposition of weak diffusion. In terms of the semiclassical formalism developed, the original nonlinear equation is reduced to an associated linear partial differential equation and some algebraic equations for the coefficients of the linear equation with a given accuracy of the asymptotic parameter. The solutions of the nonlinear equation are constructed from the solutions of both the linear equation and the algebraic equations. The solutions of the linear problem are found with the use of symmetry operators. A countable family of the leading terms of the semiclassical asymptotics is constructed in explicit form. The semiclassical asymptotics are valid by construction in a finite time interval. We construct asymptotics which are different from the semiclassical ones and can describe evolution of the solutions of the Fisher-KPP equation at large times. In the example considered, an initial unimodal distribution becomes multimodal, which can be treated as an example of a space structure.

Embodied, Symbolic and Formal Thinking in Linear Algebra

ERIC Educational Resources Information Center

Stewart, Sepideh; Thomas, Michael O. J.

2007-01-01

Students often find their first university linear algebra experience very challenging. While coping with procedural aspects of the subject, solving linear systems and manipulating matrices, they may struggle with crucial conceptual ideas underpinning them, making it very difficult to progress in more advanced courses. This research has sought to…

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…

Numerical Solution of Systems of Loaded Ordinary Differential Equations with Multipoint Conditions

NASA Astrophysics Data System (ADS)

Assanova, A. T.; Imanchiyev, A. E.; Kadirbayeva, Zh. M.

2018-04-01

A system of loaded ordinary differential equations with multipoint conditions is considered. The problem under study is reduced to an equivalent boundary value problem for a system of ordinary differential equations with parameters. A system of linear algebraic equations for the parameters is constructed using the matrices of the loaded terms and the multipoint condition. The conditions for the unique solvability and well-posedness of the original problem are established in terms of the matrix made up of the coefficients of the system of linear algebraic equations. The coefficients and the righthand side of the constructed system are determined by solving Cauchy problems for linear ordinary differential equations. The solutions of the system are found in terms of the values of the desired function at the initial points of subintervals. The parametrization method is numerically implemented using the fourth-order accurate Runge-Kutta method as applied to the Cauchy problems for ordinary differential equations. The performance of the constructed numerical algorithms is illustrated by examples.

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.

A wavelet-based ECG delineation algorithm for 32-bit integer online processing.

PubMed

Di Marco, Luigi Y; Chiari, Lorenzo

2011-04-03

Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra.

Construction of Orthonormal Wavelets Using Symbolic Algebraic Methods

NASA Astrophysics Data System (ADS)

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

2009-09-01

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

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

PubMed

Benhammouda, Brahim

2016-01-01

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

Population Projection. Applications of Linear Algebra to Population Studies. Modules and Monographs in Undergraduate Mathematics and Its Applications. UMAP Module 345.

ERIC Educational Resources Information Center

Keller, Edward L.

This unit, which looks at applications of linear algebra to population studies, is designed to help pupils: (1) understand an application of matrix algebra to the study of populations; (2) see how knowledge of eigen values and eigen vectors is useful in studying powers of matrices; and (3) be briefly exposed to some difficult but interesting…

Gauss Elimination: Workhorse of Linear Algebra.

DTIC Science & Technology

1995-08-05

linear algebra computation for solving systems, computing determinants and determining the rank of matrix. All of these are discussed in varying contexts. These include different arithmetic or algebraic setting such as integer arithmetic or polynomial rings as well as conventional real (floating-point) arithmetic. These have effects on both accuracy and complexity analyses of the algorithm. These, too, are covered here. The impact of modern parallel computer architecture on GE is also

An algebraic equation solution process formulated in anticipation of banded linear equations.

DOT National Transportation Integrated Search

1971-01-01

A general method for the solution of large, sparsely banded, positive-definite, coefficient matrices is presented. The goal in developing the method was to produce an efficient and reliable solution process and to provide the user-programmer with a p...

Algebraic multigrid methods applied to problems in computational structural mechanics

NASA Technical Reports Server (NTRS)

Mccormick, Steve; Ruge, John

1989-01-01

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

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

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

Hamhalter, Jan

2012-12-15

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

Insights into the School Mathematics Tradition from Solving Linear Equations

ERIC Educational Resources Information Center

Buchbinder, Orly; Chazan, Daniel; Fleming, Elizabeth

2015-01-01

In this article, we explore how the solving of linear equations is represented in English­-language algebra text books from the early nineteenth century when schooling was becoming institutionalized, and then survey contemporary teachers. In the text books, we identify the increasing presence of a prescribed order of steps (a canonical method) for…

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)

Symmetric linear systems - An application of algebraic systems theory

NASA Technical Reports Server (NTRS)

Hazewinkel, M.; Martin, C.

1983-01-01

Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.

A fresh look at linear ordinary differential equations with constant coefficients. Revisiting the impulsive response method using factorization

NASA Astrophysics Data System (ADS)

Camporesi, Roberto

2016-01-01

We present an approach to the impulsive response method for solving linear constant-coefficient ordinary differential equations of any order based on the factorization of the differential operator. The approach is elementary, we only assume a basic knowledge of calculus and linear algebra. In particular, we avoid the use of distribution theory, as well as of the other more advanced approaches: Laplace transform, linear systems, the general theory of linear equations with variable coefficients and variation of parameters. The approach presented here can be used in a first course on differential equations for science and engineering majors.

Student Learning of Basis, Span and Linear Independence in Linear Algebra

ERIC Educational Resources Information Center

Stewart, Sepideh; Thomas, Michael O. J.

2010-01-01

One of the earlier, more challenging concepts in linear algebra at university is that of basis. Students are often taught procedurally how to find a basis for a subspace using matrix manipulation, but may struggle with understanding the construct of basis, making further progress harder. We believe one reason for this is because students have…

Mathematical Methods for Optical Physics and Engineering

NASA Astrophysics Data System (ADS)

Gbur, Gregory J.

2011-01-01

1. Vector algebra; 2. Vector calculus; 3. Vector calculus in curvilinear coordinate systems; 4. Matrices and linear algebra; 5. Advanced matrix techniques and tensors; 6. Distributions; 7. Infinite series; 8. Fourier series; 9. Complex analysis; 10. Advanced complex analysis; 11. Fourier transforms; 12. Other integral transforms; 13. Discrete transforms; 14. Ordinary differential equations; 15. Partial differential equations; 16. Bessel functions; 17. Legendre functions and spherical harmonics; 18. Orthogonal functions; 19. Green's functions; 20. The calculus of variations; 21. Asymptotic techniques; Appendices; References; Index.

Application of laser speckle to randomized numerical linear algebra

NASA Astrophysics Data System (ADS)

Valley, George C.; Shaw, Thomas J.; Stapleton, Andrew D.; Scofield, Adam C.; Sefler, George A.; Johannson, Leif

2018-02-01

We propose and simulate integrated optical devices for accelerating numerical linear algebra (NLA) calculations. Data is modulated on chirped optical pulses and these propagate through a multimode waveguide where speckle provides the random projections needed for NLA dimensionality reduction.

Constructive Learning in Undergraduate Linear Algebra

ERIC Educational Resources Information Center

Chandler, Farrah Jackson; Taylor, Dewey T.

2008-01-01

In this article we describe a project that we used in our undergraduate linear algebra courses to help our students successfully master fundamental concepts and definitions and generate interest in the course. We describe our philosophy and discuss the projects overall success.

Balancing Chemical Reactions With Matrix Methods and Computer Assistance. Applications of Linear Algebra to Chemistry. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Unit 339.

ERIC Educational Resources Information Center

Grimaldi, Ralph P.

This material was developed to provide an application of matrix mathematics in chemistry, and to show the concepts of linear independence and dependence in vector spaces of dimensions greater than three in a concrete setting. The techniques presented are not intended to be considered as replacements for such chemical methods as oxidation-reduction…

UCSMP Algebra. What Works Clearinghouse Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2007

2007-01-01

"University of Chicago School Mathematics Project (UCSMP) Algebra," designed to increase students' skills in algebra, is appropriate for students in grades 7-10, depending on the students' incoming knowledge. This one-year course highlights applications, uses statistics and geometry to develop the algebra of linear equations and inequalities, and…

The Matrix Pencil and its Applications to Speech Processing

DTIC Science & Technology

2007-03-01

Elementary Linear Algebra ” 8th edition, pp. 278, 2000 John Wiley & Sons, Inc., New York [37] Wai C. Chu, “Speech Coding Algorithms”, New Jeresy: John...Ben; Daniel, James W.; “Applied Linear Algebra ”, pp. 342-345, 1988 Prentice Hall, Englewood Cliffs, NJ [35] Haykin, Simon “Applied Linear Adaptive...ABSTRACT Matrix Pencils facilitate the study of differential equations resulting from oscillating systems. Certain problems in linear ordinary

Linear homotopy solution of nonlinear systems of equations in geodesy

NASA Astrophysics Data System (ADS)

Paláncz, Béla; Awange, Joseph L.; Zaletnyik, Piroska; Lewis, Robert H.

2010-01-01

A fundamental task in geodesy is solving systems of equations. Many geodetic problems are represented as systems of multivariate polynomials. A common problem in solving such systems is improper initial starting values for iterative methods, leading to convergence to solutions with no physical meaning, or to convergence that requires global methods. Though symbolic methods such as Groebner bases or resultants have been shown to be very efficient, i.e., providing solutions for determined systems such as 3-point problem of 3D affine transformation, the symbolic algebra can be very time consuming, even with special Computer Algebra Systems (CAS). This study proposes the Linear Homotopy method that can be implemented easily in high-level computer languages like C++ and Fortran that are faster than CAS by at least two orders of magnitude. Using Mathematica, the power of Homotopy is demonstrated in solving three nonlinear geodetic problems: resection, GPS positioning, and affine transformation. The method enlarging the domain of convergence is found to be efficient, less sensitive to rounding of numbers, and has lower complexity compared to other local methods like Newton-Raphson.

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

PubMed

Popa, Călin-Adrian

2018-06-08

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

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

NASA Astrophysics Data System (ADS)

Rosita, N. T.

2018-03-01

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

Projective formulation of Maggi's method for nonholonomic systems analysis

NASA Astrophysics Data System (ADS)

Blajer, Wojciech

1992-04-01

A projective interpretation of Maggi'a approach to dynamic analysis of nonholonomic systems is presented. Both linear and nonlinear constraint cases are treatment in unified fashion, using the language of vector spaces and tensor algebra analysis.

Discrete Methods and their Applications

DTIC Science & Technology

1993-02-03

problem of finding all near-optimal solutions to a linear program. In paper [18], we give a brief and elementary proof of a result of Hoffman [1952) about...relies only on linear programming duality; second, we obtain geometric and algebraic representations of the bounds that are determined explicitly in...same. We have studied the problem of finding the minimum n such that a given unit interval graph is an n--graph. A linear time algorithm to compute

Quantum monodromy and quantum phase transitions in floppy molecules

NASA Astrophysics Data System (ADS)

Larese, Danielle

2012-10-01

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

Computer Algebra Systems in Undergraduate Instruction.

ERIC Educational Resources Information Center

Small, Don; And Others

1986-01-01

Computer algebra systems (such as MACSYMA and muMath) can carry out many of the operations of calculus, linear algebra, and differential equations. Use of them with sketching graphs of rational functions and with other topics is discussed. (MNS)

Applications of a Sequence of Points in Teaching Linear Algebra, Numerical Methods and Discrete Mathematics

ERIC Educational Resources Information Center

Shi, Yixun

2009-01-01

Based on a sequence of points and a particular linear transformation generalized from this sequence, two recent papers (E. Mauch and Y. Shi, "Using a sequence of number pairs as an example in teaching mathematics". Math. Comput. Educ., 39 (2005), pp. 198-205; Y. Shi, "Case study projects for college mathematics courses based on a particular…

An Integrity Framework for Image-Based Navigation Systems

DTIC Science & Technology

2010-06-01

Anton H. and Rorres C. Elementary Linear Algebra . New York, NY: John Wiley & Sons, Inc., 2000. 4. Arthur T. “The Disparity of Parity, Determining...107. Spilker , James J.J. Digital Communications by Satellite. Englewood Cliffs NJ: Prentice Hall, 1977. 108. Strang G. Linear Algebra and its...2.3 The Linearized and Extended Kalman Filters . . . . . . 22 2.3.1 State and Measurement Model Equations . . . 23 2.3.2 The Linearized Kalman Filter

Journal Writing: Enlivening Elementary Linear Algebra.

ERIC Educational Resources Information Center

Meel, David E.

1999-01-01

Examines the various issues surrounding the implementation of journal writing in an undergraduate linear algebra course. Identifies the benefits of incorporating journal writing into an undergraduate mathematics course, which are supported with students' comments from their journals and their reflections on the process. Contains 14 references.…

Deconvolutions based on singular value decomposition and the pseudoinverse: a guide for beginners.

PubMed

Hendler, R W; Shrager, R I

1994-01-01

Singular value decomposition (SVD) is deeply rooted in the theory of linear algebra, and because of this is not readily understood by a large group of researchers who could profit from its application. In this paper, we discuss the subject on a level that should be understandable to scientists who are not well versed in linear algebra. However, because it is necessary that certain key concepts in linear algebra be appreciated in order to comprehend what is accomplished by SVD, we present the section, 'Bare basics of linear algebra'. This is followed by a discussion of the theory of SVD. Next we present step-by-step examples to illustrate how SVD is applied to deconvolute a titration involving a mixture of three pH indicators. One noiseless case is presented as well as two cases where either a fixed or varying noise level is present. Finally, we discuss additional deconvolutions of mixed spectra based on the use of the pseudoinverse.

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

NASA Astrophysics Data System (ADS)

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

1989-12-01

We present an axiomatic formulation of a new class of infinitedimensional Lie algebras-the generalizations of Z-graded Lie algebras with, generally speaking, an infinite-dimensional Cartan subalgebra and a contiguous set of roots. We call such algebras “continuum Lie algebras.” The simple Lie algebras of constant growth are encapsulated in our formulation. We pay particular attention to the case when the local algebra is parametrized by a commutative algebra while the Cartan operator (the generalization of the Cartan matrix) is a linear operator. Special examples of these algebras are the Kac-Moody algebras, algebras of Poisson brackets, algebras of vector fields on a manifold, current algebras, and algebras with differential or integro-differential cartan operator. The nonlinear dynamical systems associated with the continuum contragredient Lie algebras are also considered.

Non-algebraic integrability of the Chew-Low reversible dynamical system of the Cremona type and the relation with the 7th Hilbert problem (non-resonant case)

NASA Astrophysics Data System (ADS)

Rerikh, K. V.

A smooth reversible dynamical system (SRDS) and a system of nonlinear functional equations, defined by a certain rational quadratic Cremona mapping and arising from the static model of the dispersion approach in the theory of strong interactions (the Chew-Low equations for p- wave πN- scattering) are considered. This SRDS is splitted into 1- and 2-dimensional ones. An explicit Cremona transformation that completely determines the exact solution of the two-dimensional system is found. This solution depends on an odd function satisfying a nonlinear autonomous 3-point functional equation. Non-algebraic integrability of SRDS under consideration is proved using the method of Poincaré normal forms and the Siegel theorem on biholomorphic linearization of a mapping at a non-resonant fixed point. The proof is based on the classical Feldman-Baker theorem on linear forms of logarithms of algebraic numbers, which, in turn, relies upon solving the 7th Hilbert problem by A.I. Gel'fond and T. Schneider and new powerful methods of A. Baker in the theory of transcendental numbers. The general theorem, following from the Feldman-Baker theorem, on applicability of the Siegel theorem to the set of the eigenvalues λ ɛ Cn of a mapping at a non-resonant fixed point which belong to the algebraic number field A is formulated and proved. The main results are presented in Theorems 1-3, 5, 7, 8 and Remarks 3, 7.

Finding Coefficients of the Full Array of Motion-Independent N-Body Potentials of Metric Gravity from Gravity's Exterior and Interior Effacement Algebra

NASA Astrophysics Data System (ADS)

Nordtvedt, Kenneth

2018-01-01

In the author's previous publications, a recursive linear algebraic method was introduced for obtaining (without gravitational radiation) the full potential expansions for the gravitational metric field components and the Lagrangian for a general N-body system. Two apparent properties of gravity— Exterior Effacement and Interior Effacement—were defined and fully enforced to obtain the recursive algebra, especially for the motion-independent potential expansions of the general N-body situation. The linear algebraic equations of this method determine the potential coefficients at any order n of the expansions in terms of the lower-order coefficients. Then, enforcing Exterior and Interior Effacement on a selecedt few potential series of the full motion-independent potential expansions, the complete exterior metric field for a single, spherically-symmetric mass source was obtained, producing the Schwarzschild metric field of general relativity. In this fourth paper of this series, the complete spatial metric's motion-independent potentials for N bodies are obtained using enforcement of Interior Effacement and knowledge of the Schwarzschild potentials. From the full spatial metric, the complete set of temporal metric potentials and Lagrangian potentials in the motion-independent case can then be found by transfer equations among the coefficients κ( n, α) → λ( n, ɛ) → ξ( n, α) with κ( n, α), λ( n, ɛ), ξ( n, α) being the numerical coefficients in the spatial metric, the Lagrangian, and the temporal metric potential expansions, respectively.

The method of perturbation-harmonic balance for analysing nonlinear free vibration of MDOF systems and structures

NASA Astrophysics Data System (ADS)

Tang, Qiangang; Sun, Shixian

1992-03-01

In this paper, the perturbation technique is introduced into the method of harmonic balance. A new method used for analyzing nonlinear free vibration of multidegree-of-freedom systems and structures is obtained. The form of solution is expanded into a series of small parameters and harmonics, so no term will be lost in the solution and the algebraic equations are linear. With the linear transformations, the matrices of the equations become diagonal. As soon as the modes related to linear vibration are found, the solution can be obtained. This method is superior to the method of linearized iteration. The examples show that the method has high accuracy for small-amplitude problems and the results for rather large amplitudes are satisfactory.

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

NASA Astrophysics Data System (ADS)

Parand, K.; Nikarya, M.

2017-11-01

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

Error-Detecting Identification Codes for Algebra Students.

ERIC Educational Resources Information Center

Sutherland, David C.

1990-01-01

Discusses common error-detecting identification codes using linear algebra terminology to provide an interesting application of algebra. Presents examples from the International Standard Book Number, the Universal Product Code, bank identification numbers, and the ZIP code bar code. (YP)

Colombeau algebra as a mathematical tool for investigating step load and step deformation of systems of nonlinear springs and dashpots

NASA Astrophysics Data System (ADS)

Průša, Vít; Řehoř, Martin; Tůma, Karel

2017-02-01

The response of mechanical systems composed of springs and dashpots to a step input is of eminent interest in the applications. If the system is formed by linear elements, then its response is governed by a system of linear ordinary differential equations. In the linear case, the mathematical method of choice for the analysis of the response is the classical theory of distributions. However, if the system contains nonlinear elements, then the classical theory of distributions is of no use, since it is strictly limited to the linear setting. Consequently, a question arises whether it is even possible or reasonable to study the response of nonlinear systems to step inputs. The answer is positive. A mathematical theory that can handle the challenge is the so-called Colombeau algebra. Building on the abstract result by Průša and Rajagopal (Int J Non-Linear Mech 81:207-221, 2016), we show how to use the theory in the analysis of response of nonlinear spring-dashpot and spring-dashpot-mass systems.

Linear-scaling implementation of molecular response theory in self-consistent field electronic-structure theory.

PubMed

Coriani, Sonia; Høst, Stinne; Jansík, Branislav; Thøgersen, Lea; Olsen, Jeppe; Jørgensen, Poul; Reine, Simen; Pawłowski, Filip; Helgaker, Trygve; Sałek, Paweł

2007-04-21

A linear-scaling implementation of Hartree-Fock and Kohn-Sham self-consistent field theories for the calculation of frequency-dependent molecular response properties and excitation energies is presented, based on a nonredundant exponential parametrization of the one-electron density matrix in the atomic-orbital basis, avoiding the use of canonical orbitals. The response equations are solved iteratively, by an atomic-orbital subspace method equivalent to that of molecular-orbital theory. Important features of the subspace method are the use of paired trial vectors (to preserve the algebraic structure of the response equations), a nondiagonal preconditioner (for rapid convergence), and the generation of good initial guesses (for robust solution). As a result, the performance of the iterative method is the same as in canonical molecular-orbital theory, with five to ten iterations needed for convergence. As in traditional direct Hartree-Fock and Kohn-Sham theories, the calculations are dominated by the construction of the effective Fock/Kohn-Sham matrix, once in each iteration. Linear complexity is achieved by using sparse-matrix algebra, as illustrated in calculations of excitation energies and frequency-dependent polarizabilities of polyalanine peptides containing up to 1400 atoms.

Applications of Maple To Algebraic Cryptography.

ERIC Educational Resources Information Center

Sigmon, Neil P.

1997-01-01

Demonstrates the use of technology to enhance the appreciation of applications involving abstract algebra. The symbolic manipulator Maple can perform computations required for a linear cryptosystem. One major benefit of this process is that students can encipher and decipher messages using a linear cryptosystem without becoming confused and…

Mathematical Modelling in Engineering: A Proposal to Introduce Linear Algebra Concepts

ERIC Educational Resources Information Center

Cárcamo Bahamonde, Andrea; Gómez Urgelles, Joan; Fortuny Aymemí, Josep

2016-01-01

The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasise the development of mathematical abilities primarily associated with modelling and interpreting, which are not exclusively calculus abilities. Considering this, an instructional design was created based on mathematical modelling and…

Noise limitations in optical linear algebra processors.

PubMed

Batsell, S G; Jong, T L; Walkup, J F; Krile, T F

1990-05-10

A general statistical noise model is presented for optical linear algebra processors. A statistical analysis which includes device noise, the multiplication process, and the addition operation is undertaken. We focus on those processes which are architecturally independent. Finally, experimental results which verify the analytical predictions are also presented.

Modules as Learning Tools in Linear Algebra

ERIC Educational Resources Information Center

Cooley, Laurel; Vidakovic, Draga; Martin, William O.; Dexter, Scott; Suzuki, Jeff; Loch, Sergio

2014-01-01

This paper reports on the experience of STEM and mathematics faculty at four different institutions working collaboratively to integrate learning theory with curriculum development in a core undergraduate linear algebra context. The faculty formed a Professional Learning Community (PLC) with a focus on learning theories in mathematics and…

Image-algebraic design of multispectral target recognition algorithms

NASA Astrophysics Data System (ADS)

Schmalz, Mark S.; Ritter, Gerhard X.

1994-06-01

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

The First Fundamental Theorem of Invariant Theory for the Orthosymplectic Supergroup

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

The algebra of supertraces for 2+1 super de Sitter gravity

NASA Technical Reports Server (NTRS)

Urrutia, L. F.; Waelbroeck, H.; Zertuche, F.

1993-01-01

The algebra of the observables for 2+1 super de Sitter gravity, for one genus of the spatial surface is calculated. The algebra turns out to be an infinite Lie algebra subject to non-linear constraints. The constraints are solved explicitly in terms of five independent complex supertraces. These variables are the true degrees of freedom of the system and their quantized algebra generates a new structure which is referred to as a 'central extension' of the quantum algebra SU(2)q.

Newton's method: A link between continuous and discrete solutions of nonlinear problems

NASA Technical Reports Server (NTRS)

Thurston, G. A.

1980-01-01

Newton's method for nonlinear mechanics problems replaces the governing nonlinear equations by an iterative sequence of linear equations. When the linear equations are linear differential equations, the equations are usually solved by numerical methods. The iterative sequence in Newton's method can exhibit poor convergence properties when the nonlinear problem has multiple solutions for a fixed set of parameters, unless the iterative sequences are aimed at solving for each solution separately. The theory of the linear differential operators is often a better guide for solution strategies in applying Newton's method than the theory of linear algebra associated with the numerical analogs of the differential operators. In fact, the theory for the differential operators can suggest the choice of numerical linear operators. In this paper the method of variation of parameters from the theory of linear ordinary differential equations is examined in detail in the context of Newton's method to demonstrate how it might be used as a guide for numerical solutions.

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…

Teaching Linear Algebra: Proceeding More Efficiently by Staying Comfortably within Z

ERIC Educational Resources Information Center

Beaver, Scott

2015-01-01

For efficiency in a linear algebra course the instructor may wish to avoid the undue arithmetical distractions of rational arithmetic. In this paper we explore how to write fraction-free problems of various types including elimination, matrix inverses, orthogonality, and the (non-normalizing) Gram-Schmidt process.

A Linear Algebra Measure of Cluster Quality.

ERIC Educational Resources Information Center

Mather, Laura A.

2000-01-01

Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)

The Transformation App Redux: The Notion of Linearity

ERIC Educational Resources Information Center

Domenick, Anthony

2015-01-01

The notion of linearity is perhaps the most fundamental idea in algebraic thinking. It sets the transition to functions and culminates with the instantaneous rate of change in calculus. Despite its simplicity, this concept poses complexities to a considerable number of first semester college algebra students. The purpose of this observational…

Optical linear algebra processors: noise and error-source modeling.

PubMed

Casasent, D; Ghosh, A

1985-06-01

The modeling of system and component noise and error sources in optical linear algebra processors (OLAP's) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.

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…

Using Technology to Facilitate Reasoning: Lifting the Fog from Linear Algebra

ERIC Educational Resources Information Center

Berry, John S.; Lapp, Douglas A.; Nyman, Melvin A.

2008-01-01

This article discusses student difficulties in grasping concepts from linear algebra. Using an example from an interview with a student, we propose changes that might positively impact student understanding of concepts within a problem-solving context. In particular, we illustrate barriers to student understanding and suggest technological…

Mathematical Modelling in Engineering: An Alternative Way to Teach Linear Algebra

ERIC Educational Resources Information Center

Domínguez-García, S.; García-Planas, M. I.; Taberna, J.

2016-01-01

Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic…

Space and frequency-multiplexed optical linear algebra processor - Fabrication and initial tests

NASA Technical Reports Server (NTRS)

Casasent, D.; Jackson, J.

1986-01-01

A new optical linear algebra processor architecture is described. Space and frequency-multiplexing are used to accommodate bipolar and complex-valued data. A fabricated laboratory version of this processor is described, the electronic support system used is discussed, and initial test data obtained on it are presented.

Optical linear algebra processors - Noise and error-source modeling

NASA Technical Reports Server (NTRS)

Casasent, D.; Ghosh, A.

1985-01-01

The modeling of system and component noise and error sources in optical linear algebra processors (OLAPs) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.

Symmetries of the Space of Linear Symplectic Connections

NASA Astrophysics Data System (ADS)

Fox, Daniel J. F.

2017-01-01

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

Efficient hybrid-symbolic methods for quantum mechanical calculations

NASA Astrophysics Data System (ADS)

Scott, T. C.; Zhang, Wenxing

2015-06-01

We present hybrid symbolic-numerical tools to generate optimized numerical code for rapid prototyping and fast numerical computation starting from a computer algebra system (CAS) and tailored to any given quantum mechanical problem. Although a major focus concerns the quantum chemistry methods of H. Nakatsuji which has yielded successful and very accurate eigensolutions for small atoms and molecules, the tools are general and may be applied to any basis set calculation with a variational principle applied to its linear and non-linear parameters.

Mathematics in the Real World.

ERIC Educational Resources Information Center

Borenstein, Matt

1997-01-01

The abstract nature of algebra causes difficulties for many students. Describes "Real-World Data," an algebra course designed for students with low grades in algebra and provides multidisciplinary experiments (linear functions and variations; quadratic, square-root, and inverse relations; and exponential and periodic variation)…

Linking Computer Algebra Systems and Paper-and-Pencil Techniques To Support the Teaching of Mathematics.

ERIC Educational Resources Information Center

van Herwaarden, Onno A.; Gielen, Joseph L. W.

2002-01-01

Focuses on students showing a lack of conceptual insight while using computer algebra systems (CAS) in the setting of an elementary calculus and linear algebra course for first year university students in social sciences. The use of a computer algebra environment has been incorporated into a more traditional course but with special attention on…

A Brief Historical Introduction to Matrices and Their Applications

ERIC Educational Resources Information Center

Debnath, L.

2014-01-01

This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…

Students' Use of Computational Thinking in Linear Algebra

ERIC Educational Resources Information Center

Bagley, Spencer; Rabin, Jeffrey M.

2016-01-01

In this work, we examine students' ways of thinking when presented with a novel linear algebra problem. Our intent was to explore how students employ and coordinate three modes of thinking, which we call computational, abstract, and geometric, following similar frameworks proposed by Hillel (2000) and Sierpinska (2000). However, the undergraduate…

Undergraduate Mathematics Students' Emotional Experiences in Linear Algebra Courses

ERIC Educational Resources Information Center

Martínez-Sierra, Gustavo; García-González, María del Socorro

2016-01-01

Little is known about students' emotions in the field of Mathematics Education that go beyond students' emotions in problem solving. To start filling this gap this qualitative research has the aim to identify emotional experiences of undergraduate mathematics students in Linear Algebra courses. In order to obtain data, retrospective focus group…

Avoiding Communication in Dense Linear Algebra

DTIC Science & Technology

2013-08-16

Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.1 Asymptotic Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . 6...and parallelizing Strassen’s matrix multiplication algorithm (Chapter 11). 6 Chapter 2 Preliminaries 2.1 Notation and Definitions In this section we...between computations and algo- rithms). The following definition is based on [56]: Definition 2.1. A classical algorithm in linear algebra is one that

Secondary Pre-Service Teachers' Algebraic Reasoning about Linear Equation Solving

ERIC Educational Resources Information Center

Alvey, Christina; Hudson, Rick A.; Newton, Jill; Males, Lorraine M.

2016-01-01

This study analyzes the responses of 12 secondary pre-service teachers on two tasks focused on reasoning when solving linear equations. By documenting the choices PSTs made while engaging in these tasks, we gain insight into how new teachers work mathematically, reason algebraically, communicate their thinking, and make pedagogical decisions. We…

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

ERIC Educational Resources Information Center

Lapp, Douglas A.; Nyman, Melvin A.; Berry, John S.

2010-01-01

This article examines the connections of linear algebra concepts in a first course at the undergraduate level. The theoretical underpinnings of this study are grounded in the constructivist perspective (including social constructivism), Vernaud's theory of conceptual fields and Pirie and Kieren's model for the growth of mathematical understanding.…

All Talk and More Action

ERIC Educational Resources Information Center

Williams-Candek, Maryellen

2016-01-01

How better to begin the study of linear equations in an algebra class than to determine what students already know about the subject? A seventh-grade algebra class in a suburban school undertook a project early in the school year that was completed before they began studying linear relations and functions. The project, which might have been…

Transforming an Introductory Linear Algebra Course with a TI-92 Hand-Held Computer.

ERIC Educational Resources Information Center

Quesada, Antonio R.

2003-01-01

Describes how the introduction of the TI-92 transformed a traditional first semester linear algebra course into a matrix-oriented course that emphasized conceptual understanding, relevant applications, and numerical issues. Indicates an increase in students' overall performance as they found the calculator very useful, believed it helped them…

Subspace in Linear Algebra: Investigating Students' Concept Images and Interactions with the Formal Definition

ERIC Educational Resources Information Center

Wawro, Megan; Sweeney, George F.; Rabin, Jeffrey M.

2011-01-01

This paper reports on a study investigating students' ways of conceptualizing key ideas in linear algebra, with the particular results presented here focusing on student interactions with the notion of subspace. In interviews conducted with eight undergraduates, we found students' initial descriptions of subspace often varied substantially from…

Advanced Linear Algebra: A Call for the Early Introduction of Complex Numbers

ERIC Educational Resources Information Center

Garcia, Stephan Ramon

2017-01-01

A second course in linear algebra that goes beyond the traditional lower-level curriculum is increasingly important for students of the mathematical sciences. Although many applications involve only real numbers, a solid understanding of complex arithmetic often sheds significant light. Many instructors are unaware of the opportunities afforded by…

An Authentic Task That Models Quadratics

ERIC Educational Resources Information Center

Baron, Lorraine M.

2015-01-01

As students develop algebraic reasoning in grades 5 to 9, they learn to recognize patterns and understand expressions, equations, and variables. Linear functions are a focus in eighth-grade mathematics, and by algebra 1, students must make sense of functions that are not linear. This article describes how students worked through a classroom task…

Lack of Set Theory Relevant Prerequisite Knowledge

ERIC Educational Resources Information Center

Dogan-Dunlap, Hamide

2006-01-01

Many students struggle with college mathematics topics due to a lack of mastery of prerequisite knowledge. Set theory language is one such prerequisite for linear algebra courses. Many students' mistakes on linear algebra questions reveal a lack of mastery of set theory knowledge. This paper reports the findings of a qualitative analysis of a…

Mat-Rix-Toe: Improving Writing through a Game-Based Project in Linear Algebra

ERIC Educational Resources Information Center

Graham-Squire, Adam; Farnell, Elin; Stockton, Julianna Connelly

2014-01-01

The Mat-Rix-Toe project utilizes a matrix-based game to deepen students' understanding of linear algebra concepts and strengthen students' ability to express themselves mathematically. The project was administered in three classes using slightly different approaches, each of which included some editing component to encourage the…

Using Cognitive Tutor Software in Learning Linear Algebra Word Concept

ERIC Educational Resources Information Center

Yang, Kai-Ju

2015-01-01

This paper reports on a study of twelve 10th grade students using Cognitive Tutor, a math software program, to learn linear algebra word concept. The study's purpose was to examine whether students' mathematics performance as it is related to using Cognitive Tutor provided evidence to support Koedlinger's (2002) four instructional principles used…

Student Reactions to Learning Theory Based Curriculum Materials in Linear Algebra--A Survey Analysis

ERIC Educational Resources Information Center

Cooley, Laurel; Vidakovic, Draga; Martin, William O.; Dexter, Scott; Suzuki, Jeff

2016-01-01

In this report we examine students' perceptions of the implementation of carefully designed curriculum materials (called modules) in linear algebra courses at three different universities. The curricular materials were produced collaboratively by STEM and mathematics education faculty as members of a professional learning community (PLC) over…

A Framework for Mathematical Thinking: The Case of Linear Algebra

ERIC Educational Resources Information Center

Stewart, Sepideh; Thomas, Michael O. J.

2009-01-01

Linear algebra is one of the unavoidable advanced courses that many mathematics students encounter at university level. The research reported here was part of the first author's recent PhD study, where she created and applied a theoretical framework combining the strengths of two major mathematics education theories in order to investigate the…

Partially Flipped Linear Algebra: A Team-Based Approach

ERIC Educational Resources Information Center

Carney, Debra; Ormes, Nicholas; Swanson, Rebecca

2015-01-01

In this article we describe a partially flipped Introductory Linear Algebra course developed by three faculty members at two different universities. We give motivation for our partially flipped design and describe our implementation in detail. Two main features of our course design are team-developed preview videos and related in-class activities.…

Definitions Are Important: The Case of Linear Algebra

ERIC Educational Resources Information Center

Berman, Abraham; Shvartsman, Ludmila

2016-01-01

In this paper we describe an experiment in a linear algebra course. The aim of the experiment was to promote the students' understanding of the studied concepts focusing on their definitions. It seems to be a given that students should understand concepts' definitions before working substantially with them. Unfortunately, in many cases they do…

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

Contractions and deformations of quasiclassical Lie algebras preserving a nondegenerate quadratic Casimir operator

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

Campoamor-Stursberg, R., E-mail: rutwig@mat.ucm.e

2008-05-15

By means of contractions of Lie algebras, we obtain new classes of indecomposable quasiclassical Lie algebras that satisfy the Yang-Baxter equations in its reformulation in terms of triple products. These algebras are shown to arise naturally from noncompact real simple algebras with nonsimple complexification, where we impose that a nondegenerate quadratic Casimir operator is preserved by the limiting process. We further consider the converse problem and obtain sufficient conditions on integrable cocycles of quasiclassical Lie algebras in order to preserve nondegenerate quadratic Casimir operators by the associated linear deformations.

Developing CORE model-based worksheet with recitation task to facilitate students’ mathematical communication skills in linear algebra course

NASA Astrophysics Data System (ADS)

Risnawati; Khairinnisa, S.; Darwis, A. H.

2018-01-01

The purpose of this study was to develop a CORE model-based worksheet with recitation task that were valid and practical and could facilitate students’ communication skills in Linear Algebra course. This study was conducted in mathematics education department of one public university in Riau, Indonesia. Participants of the study were media and subject matter experts as validators as well as students from mathematics education department. The objects of this study are students’ worksheet and students’ mathematical communication skills. The results of study showed that: (1) based on validation of the experts, the developed students’ worksheet was valid and could be applied for students in Linear Algebra courses; (2) based on the group trial, the practicality percentage was 92.14% in small group and 90.19% in large group, so the worksheet was very practical and could attract students to learn; and (3) based on the post test, the average percentage of ideals was 87.83%. In addition, the results showed that the students’ worksheet was able to facilitate students’ mathematical communication skills in linear algebra course.

The Effect of Using Concept Maps in Elementary Linear Algebra Course on Students’ Learning

NASA Astrophysics Data System (ADS)

Syarifuddin, H.

2018-04-01

This paper presents the results of a classroom action research that was done in Elementary Linear Algebra course at Universitas Negeri Padang. The focus of the research want to see the effect of using concept maps in the course on students’ learning. Data in this study were collected through classroom observation, students’ reflective journal and concept maps that were created by students. The result of the study was the using of concept maps in Elementary Linera Algebra course gave positive effect on students’ learning.

Many-core graph analytics using accelerated sparse linear algebra routines

NASA Astrophysics Data System (ADS)

Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

2016-05-01

Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

Algebraic special functions and SO(3,2)

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

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

2013-06-15

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

Realization of preconditioned Lanczos and conjugate gradient algorithms on optical linear algebra processors.

PubMed

Ghosh, A

1988-08-01

Lanczos and conjugate gradient algorithms are important in computational linear algebra. In this paper, a parallel pipelined realization of these algorithms on a ring of optical linear algebra processors is described. The flow of data is designed to minimize the idle times of the optical multiprocessor and the redundancy of computations. The effects of optical round-off errors on the solutions obtained by the optical Lanczos and conjugate gradient algorithms are analyzed, and it is shown that optical preconditioning can improve the accuracy of these algorithms substantially. Algorithms for optical preconditioning and results of numerical experiments on solving linear systems of equations arising from partial differential equations are discussed. Since the Lanczos algorithm is used mostly with sparse matrices, a folded storage scheme to represent sparse matrices on spatial light modulators is also described.

Student Logical Implications and Connections between Symbolic Representations of a Linear System within the Context of an Introductory Linear Algebra Course Employing Inquiry-Oriented Teaching and Traditional Lecture

ERIC Educational Resources Information Center

Payton, Spencer D.

2017-01-01

This study aimed to explore how inquiry-oriented teaching could be implemented in an introductory linear algebra course that, due to various constraints, may not lend itself to inquiry-oriented teaching. In particular, the course in question has a traditionally large class size, limited amount of class time, and is often coordinated with other…

Variational data assimilation system "INM RAS - Black Sea"

NASA Astrophysics Data System (ADS)

Parmuzin, Eugene; Agoshkov, Valery; Assovskiy, Maksim; Giniatulin, Sergey; Zakharova, Natalia; Kuimov, Grigory; Fomin, Vladimir

2013-04-01

Development of Informational-Computational Systems (ICS) for Data Assimilation Procedures is one of multidisciplinary problems. To study and solve these problems one needs to apply modern results from different disciplines and recent developments in: mathematical modeling; theory of adjoint equations and optimal control; inverse problems; numerical methods theory; numerical algebra and scientific computing. The problems discussed above are studied in the Institute of Numerical Mathematics of the Russian Academy of Science (INM RAS) in ICS for Personal Computers (PC). Special problems and questions arise while effective ICS versions for PC are being developed. These problems and questions can be solved with applying modern methods of numerical mathematics and by solving "parallelism problem" using OpenMP technology and special linear algebra packages. In this work the results on the ICS development for PC-ICS "INM RAS - Black Sea" are presented. In the work the following problems and questions are discussed: practical problems that can be studied by ICS; parallelism problems and their solutions with applying of OpenMP technology and the linear algebra packages used in ICS "INM - Black Sea"; Interface of ICS. The results of ICS "INM RAS - Black Sea" testing are presented. Efficiency of technologies and methods applied are discussed. The work was supported by RFBR, grants No. 13-01-00753, 13-05-00715 and by The Ministry of education and science of Russian Federation, project 8291, project 11.519.11.1005 References: [1] V.I. Agoshkov, M.V. Assovskii, S.A. Lebedev, Numerical simulation of Black Sea hydrothermodynamics taking into account tide-forming forces. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, 5-31 [2] E.I. Parmuzin, V.I. Agoshkov, Numerical solution of the variational assimilation problem for sea surface temperature in the model of the Black Sea dynamics. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, 69-94 [3] V.B. Zalesny, N.A. Diansky, V.V. Fomin, S.N. Moshonkin, S.G. Demyshev, Numerical model of the circulation of Black Sea and Sea of Azov. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, 95-111 [4] V.I. Agoshkov, S.V. Giniatulin, G.V. Kuimov. OpenMP technology and linear algebra packages in the variation data assimilation systems. - Abstracts of the 1-st China-Russia Conference on Numerical Algebra with Applications in Radiactive Hydrodynamics, Beijing, China, October 16-18, 2012. [5] Zakharova N.B., Agoshkov V.I., Parmuzin E.I., The new method of ARGO buoys system observation data interpolation. Russian Journal of Numerical Analysis and Mathematical Modelling. Vol. 28, Issue 1, 2013.

Moisture Transport in Composites during Repair Work,

DTIC Science & Technology

1983-09-01

4 * FINITE DIFFERENCE EQUATIONS. .. . . .. . .. .. .. .. .. 6 INI I A ANBOUNAAYYCONDITIONS................ 7 REASONABLE FIRST...DURING DRYING AND CURING . . . ........ 9 5 CONVERGENCE OF FINITE DIFFERENCE METHOD USING DIFFERENT At . . .. 12 6 CONVERGENCE OF FDA METHOD FOR SAME At...transport we will use a finite difference approach, changing the Fickian equation to a finite number of linear algebraic equations that can be solved by

Simulations of Coherent Synchrotron Radiation Effects in Electron Machines

NASA Astrophysics Data System (ADS)

Migliorati, M.; Schiavi, A.; Dattoli, G.

2007-09-01

Coherent synchrotron radiation (CSR) generated by high intensity electron beams can be a source of undesirable effects limiting the performance of storage rings. The complexity of the physical mechanisms underlying the interplay between the electron beam and the CSR demands for reliable simulation codes. In the past, codes based on Lie algebraic techniques have been very efficient to treat transport problems in accelerators. The extension of these methods to the non linear case is ideally suited to treat wakefields - beam interaction. In this paper we report on the development of a numerical code, based on the solution of the Vlasov equation, which includes the non linear contribution due to wakefields. The proposed solution method exploits an algebraic technique that uses the exponential operators. We show that, in the case of CSR wakefields, the integration procedure is capable of reproducing the onset of an instability which leads to microbunching of the beam thus increasing the CSR at short wavelengths. In addition, considerations on the threshold of the instability for Gaussian bunches is also reported.

Simulations of Coherent Synchrotron Radiation Effects in Electron Machines

NASA Astrophysics Data System (ADS)

Migliorati, M.; Schiavi, A.; Dattoli, G.

Coherent synchrotron radiation (CSR) generated by high intensity electron beams can be a source of undesirable effects limiting the performance of storage rings. The complexity of the physical mechanisms underlying the interplay between the electron beam and the CSR demands for reliable simulation codes. In the past, codes based on Lie algebraic techniques have been very efficient to treat transport problems in accelerators. The extension of these methods to the non linear case is ideally suited to treat wakefields - beam interaction. In this paper we report on the development of a numerical code, based on the solution of the Vlasov equation, which includes the non linear contribution due to wakefields. The proposed solution method exploits an algebraic technique that uses the exponential operators. We show that, in the case of CSR wakefields, the integration procedure is capable of reproducing the onset of an instability which leads to microbunching of the beam thus increasing the CSR at short wavelengths. In addition, considerations on the threshold of the instability for Gaussian bunches is also reported.

Some Applications of Algebraic System Solving

ERIC Educational Resources Information Center

Roanes-Lozano, Eugenio

2011-01-01

Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…

Pre-Service Teachers' Perceptions and Beliefs of Technological Pedagogical Content Knowledge on Algebra

ERIC Educational Resources Information Center

Lin, Cheng-Yao; Kuo, Yu-Chun; Ko, Yi-Yin

2015-01-01

The purpose of this study was to investigate elementary pre-service teachers' content knowledge in algebra (Linear Equation, Quadratic Equation, Functions, System Equations and Polynomials) as well as their technological pedagogical content knowledge (TPACK) in teaching algebra. Participants were 79 undergraduate pre-service teachers who were…

Ten-Year-Old Students Solving Linear Equations

ERIC Educational Resources Information Center

Brizuela, Barbara; Schliemann, Analucia

2004-01-01

In this article, the authors seek to re-conceptualize the perspective regarding students' difficulties with algebra. While acknowledging that students "do" have difficulties when learning algebra, they also argue that the generally espoused criteria for algebra as the ability to work with the syntactical rules for solving equations is…

Measuring the Readability of Elementary Algebra Using the Cloze Technique.

ERIC Educational Resources Information Center

Kulm, Gerald

The relationship to readability of ten variables characterizing structural properties of mathematical prose was investigated in elementary algebra textbooks. Readability was measured by algebra student's responses to two forms of cloze tests. Linear and currilinear correlations were calculated between each structural variable and the cloze test.…

Case Studies Listening to Students Using Kinesthetic Movement While Learning to Graph Linear Functions

ERIC Educational Resources Information Center

Novak, Melissa A.

2017-01-01

The purpose of this qualitative practitioner research study was to describe middle school algebra students' experiences of learning linear functions through kinesthetic movement. Participants were comprised of 8th grade algebra students. Practitioner research was used because I wanted to improve my teaching so students will have more success in…

Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients.

PubMed

Boyko, Vyacheslav M; Popovych, Roman O; Shapoval, Nataliya M

2013-01-01

Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal Lie invariance algebras possessed by such systems are obtained using an effective algebraic approach.

A Practical Approach to Inquiry-Based Learning in Linear Algebra

ERIC Educational Resources Information Center

Chang, J.-M.

2011-01-01

Linear algebra has become one of the most useful fields of mathematics since last decade, yet students still have trouble seeing the connection between some of the abstract concepts and real-world applications. In this article, we propose the use of thought-provoking questions in lesson designs to allow two-way communications between instructors…

Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients

PubMed Central

Boyko, Vyacheslav M.; Popovych, Roman O.; Shapoval, Nataliya M.

2013-01-01

Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal Lie invariance algebras possessed by such systems are obtained using an effective algebraic approach. PMID:23564972

Instructional Supports for Representational Fluency in Solving Linear Equations with Computer Algebra Systems and Paper-and-Pencil

ERIC Educational Resources Information Center

Fonger, Nicole L.; Davis, Jon D.; Rohwer, Mary Lou

2018-01-01

This research addresses the issue of how to support students' representational fluency--the ability to create, move within, translate across, and derive meaning from external representations of mathematical ideas. The context of solving linear equations in a combined computer algebra system (CAS) and paper-and-pencil classroom environment is…

Flipping an Algebra Classroom: Analyzing, Modeling, and Solving Systems of Linear Equations

ERIC Educational Resources Information Center

Kirvan, Rebecca; Rakes, Christopher R.; Zamora, Regie

2015-01-01

The present study investigated whether flipping an algebra classroom led to a stronger focus on conceptual understanding and improved learning of systems of linear equations for 54 seventh- and eighth-grade students using teacher journal data and district-mandated unit exam items. Multivariate analysis of covariance was used to compare scores on…

Some Comments on 'The Role of Proof in Comprehending and Teaching Elementary Linear Algebra' by F. Uhlig.

ERIC Educational Resources Information Center

Dorier, Jean-Luc; Robert, Aline; Rogalski, Marc

2002-01-01

Underlines the common points in F. Uhlig's approach published in an earlier issue of this journal about the question of proof in linear algebra. Describes some of his ideas in a new light and gives perspective for a further didactical development of Uhlig's first experiments. (Author/KHR)

Mathematical Modelling and the Learning Trajectory: Tools to Support the Teaching of Linear Algebra

ERIC Educational Resources Information Center

Cárcamo Bahamonde, Andrea Dorila; Fortuny Aymemí, Josep Maria; Gómez i Urgellés, Joan Vicenç

2017-01-01

In this article we present a didactic proposal for teaching linear algebra based on two compatible theoretical models: emergent models and mathematical modelling. This proposal begins with a problematic situation related to the creation and use of secure passwords, which leads students toward the construction of the concepts of spanning set and…

A Modified Approach to Team-Based Learning in Linear Algebra Courses

ERIC Educational Resources Information Center

Nanes, Kalman M.

2014-01-01

This paper documents the author's adaptation of team-based learning (TBL), an active learning pedagogy developed by Larry Michaelsen and others, in the linear algebra classroom. The paper discusses the standard components of TBL and the necessary changes to those components for the needs of the course in question. There is also an empirically…

Developing Conceptual Understanding and Definitional Clarity in Linear Algebra through the Three Worlds of Mathematical Thinking

ERIC Educational Resources Information Center

Hannah, John; Stewart, Sepideh; Thomas, Michael

2016-01-01

Linear algebra is one of the first abstract mathematics courses that students encounter at university. Research shows that many students find the dense presentation of definitions, theorems and proofs difficult to comprehend. Using a case study approach, we report on a teaching intervention based on Tall's three worlds (embodied, symbolic and…

Creating Discussions with Classroom Voting in Linear Algebra

ERIC Educational Resources Information Center

Cline, Kelly; Zullo, Holly; Duncan, Jonathan; Stewart, Ann; Snipes, Marie

2013-01-01

We present a study of classroom voting in linear algebra, in which the instructors posed multiple-choice questions to the class and then allowed a few minutes for consideration and small-group discussion. After each student in the class voted on the correct answer using a classroom response system, a set of clickers, the instructor then guided a…

An Example of Inquiry in Linear Algebra: The Roles of Symbolizing and Brokering

ERIC Educational Resources Information Center

Zandieh, Michelle; Wawro, Megan; Rasmussen, Chris

2017-01-01

In this paper we address practical questions such as: How do symbols appear and evolve in an inquiry-oriented classroom? How can an instructor connect students with traditional notation and vocabulary without undermining their sense of ownership of the material? We tender an example from linear algebra that highlights the roles of the instructor…

Linear Algebra and the Experiences of a "Flipper"

ERIC Educational Resources Information Center

Wright, Sarah E.

2015-01-01

This paper describes the linear algebra class I taught during Spring 2014 semester at Adelphi University. I discuss the details of how I flipped the class and incorporated elements of inquiry-based learning as well as the reasoning behind specific decisions I made. I give feedback from the students on the success of the course and provide my own…

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

Spotz, William F.

PyTrilinos is a set of Python interfaces to compiled Trilinos packages. This collection supports serial and parallel dense linear algebra, serial and parallel sparse linear algebra, direct and iterative linear solution techniques, algebraic and multilevel preconditioners, nonlinear solvers and continuation algorithms, eigensolvers and partitioning algorithms. Also included are a variety of related utility functions and classes, including distributed I/O, coloring algorithms and matrix generation. PyTrilinos vector objects are compatible with the popular NumPy Python package. As a Python front end to compiled libraries, PyTrilinos takes advantage of the flexibility and ease of use of Python, and the efficiency of themore » underlying C++, C and Fortran numerical kernels. This paper covers recent, previously unpublished advances in the PyTrilinos package.« less

Study of coherent synchrotron radiation effects by means of a new simulation code based on the non-linear extension of the operator splitting method

NASA Astrophysics Data System (ADS)

Dattoli, G.; Migliorati, M.; Schiavi, A.

2007-05-01

The coherent synchrotron radiation (CSR) is one of the main problems limiting the performance of high-intensity electron accelerators. The complexity of the physical mechanisms underlying the onset of instabilities due to CSR demands for accurate descriptions, capable of including the large number of features of an actual accelerating device. A code devoted to the analysis of these types of problems should be fast and reliable, conditions that are usually hardly achieved at the same time. In the past, codes based on Lie algebraic techniques have been very efficient to treat transport problems in accelerators. The extension of these methods to the non-linear case is ideally suited to treat CSR instability problems. We report on the development of a numerical code, based on the solution of the Vlasov equation, with the inclusion of non-linear contribution due to wake field effects. The proposed solution method exploits an algebraic technique that uses the exponential operators. We show that the integration procedure is capable of reproducing the onset of instability and the effects associated with bunching mechanisms leading to the growth of the instability itself. In addition, considerations on the threshold of the instability are also developed.

A computing method for sound propagation through a nonuniform jet stream

NASA Technical Reports Server (NTRS)

Padula, S. L.; Liu, C. H.

1974-01-01

The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Deformed coset models from gauged WZW actions

NASA Astrophysics Data System (ADS)

Park, Q.-Han

1994-06-01

A general Lagrangian formulation of integrably deformed G/H-coset models is given. We consider the G/H-coset model in terms of the gauged Wess-Zumino-Witten action and obtain an integrable deformation by adding a potential energy term Tr(gTg -1overlineT) , where algebra elements T, overlineT belong to the center of the algebra h associated with the subgroup H. We show that the classical equation of motion of the deformed coset model can be identified with the integrability condition of certain linear equations which makes the use of the inverse scattering method possible. Using the linear equation, we give a systematic way to construct infinitely many conserved currents as well as soliton solutions. In the case of the parafermionic SU(2)/U(1)-coset model, we derive n-solitons and conserved currents explicitly.

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions

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

Bui, Quan M.; Wang, Lu; Osei-Kuffuor, Daniel

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switchingmore » technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.« less

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions

DOE PAGES

Bui, Quan M.; Wang, Lu; Osei-Kuffuor, Daniel

2018-02-06

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switchingmore » technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.« less

Resolving Phase Ambiguities in the Calibration of Redundant Interferometric Arrays: Implications for Array Design

DTIC Science & Technology

2016-03-04

summary of the linear algebra involved. As we have seen, the RSC process begins with the interferometric phase measurement β, which due to wrapping will...mentary Divisors) in Section 2 and the following defi- nition of the matrix determinant. This definition is given in many linear algebra texts (see...principle solve for a particular solution of this system by arbitrarily setting two object phases (whose spatial frequencies are not co- linear ) and one

On conforming mixed finite element methods for incompressible viscous flow problems

NASA Technical Reports Server (NTRS)

Gunzburger, M. D; Nicolaides, R. A.; Peterson, J. S.

1982-01-01

The application of conforming mixed finite element methods to obtain approximate solutions of linearized Navier-Stokes equations is examined. Attention is given to the convergence rates of various finite element approximations of the pressure and the velocity field. The optimality of the convergence rates are addressed in terms of comparisons of the approximation convergence to a smooth solution in relation to the best approximation available for the finite element space used. Consideration is also devoted to techniques for efficient use of a Gaussian elimination algorithm to obtain a solution to a system of linear algebraic equations derived by finite element discretizations of linear partial differential equations.

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Linear reduction method for predictive and informative tag SNP selection.

PubMed

He, Jingwu; Westbrooks, Kelly; Zelikovsky, Alexander

2005-01-01

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

General algebraic method applied to control analysis of complex engine types

NASA Technical Reports Server (NTRS)

Boksenbom, Aaron S; Hood, Richard

1950-01-01

A general algebraic method of attack on the problem of controlling gas-turbine engines having any number of independent variables was utilized employing operational functions to describe the assumed linear characteristics for the engine, the control, and the other units in the system. Matrices were used to describe the various units of the system, to form a combined system showing all effects, and to form a single condensed matrix showing the principal effects. This method directly led to the conditions on the control system for noninteraction so that any setting disturbance would affect only its corresponding controlled variable. The response-action characteristics were expressed in terms of the control system and the engine characteristics. The ideal control-system characteristics were explicitly determined in terms of any desired response action.

The method of Ritz applied to the equation of Hamilton. [for pendulum systems

NASA Technical Reports Server (NTRS)

Bailey, C. D.

1976-01-01

Without any reference to the theory of differential equations, the initial value problem of the nonlinear, nonconservative double pendulum system is solved by the application of the method of Ritz to the equation of Hamilton. Also shown is an example of the reduction of the traditional eigenvalue problem of linear, homogeneous, differential equations of motion to the solution of a set of nonhomogeneous algebraic equations. No theory of differential equations is used. Solution of the time-space path of the linear oscillator is demonstrated and compared to the exact solution.

Elongation cutoff technique armed with quantum fast multipole method for linear scaling.

PubMed

Korchowiec, Jacek; Lewandowski, Jakub; Makowski, Marcin; Gu, Feng Long; Aoki, Yuriko

2009-11-30

A linear-scaling implementation of the elongation cutoff technique (ELG/C) that speeds up Hartree-Fock (HF) self-consistent field calculations is presented. The cutoff method avoids the known bottleneck of the conventional HF scheme, that is, diagonalization, because it operates within the low dimension subspace of the whole atomic orbital space. The efficiency of ELG/C is illustrated for two model systems. The obtained results indicate that the ELG/C is a very efficient sparse matrix algebra scheme. Copyright 2009 Wiley Periodicals, Inc.

Finite-analytic numerical solution of heat transfer in two-dimensional cavity flow

NASA Technical Reports Server (NTRS)

Chen, C.-J.; Naseri-Neshat, H.; Ho, K.-S.

1981-01-01

Heat transfer in cavity flow is numerically analyzed by a new numerical method called the finite-analytic method. The basic idea of the finite-analytic method is the incorporation of local analytic solutions in the numerical solutions of linear or nonlinear partial differential equations. In the present investigation, the local analytic solutions for temperature, stream function, and vorticity distributions are derived. When the local analytic solution is evaluated at a given nodal point, it gives an algebraic relationship between a nodal value in a subregion and its neighboring nodal points. A system of algebraic equations is solved to provide the numerical solution of the problem. The finite-analytic method is used to solve heat transfer in the cavity flow at high Reynolds number (1000) for Prandtl numbers of 0.1, 1, and 10.

Energy conserving, linear scaling Born-Oppenheimer molecular dynamics.

PubMed

Cawkwell, M J; Niklasson, Anders M N

2012-10-07

Born-Oppenheimer molecular dynamics simulations with long-term conservation of the total energy and a computational cost that scales linearly with system size have been obtained simultaneously. Linear scaling with a low pre-factor is achieved using density matrix purification with sparse matrix algebra and a numerical threshold on matrix elements. The extended Lagrangian Born-Oppenheimer molecular dynamics formalism [A. M. N. Niklasson, Phys. Rev. Lett. 100, 123004 (2008)] yields microcanonical trajectories with the approximate forces obtained from the linear scaling method that exhibit no systematic drift over hundreds of picoseconds and which are indistinguishable from trajectories computed using exact forces.

Deriving the Regression Line with Algebra

ERIC Educational Resources Information Center

Quintanilla, John A.

2017-01-01

Exploration with spreadsheets and reliance on previous skills can lead students to determine the line of best fit. To perform linear regression on a set of data, students in Algebra 2 (or, in principle, Algebra 1) do not have to settle for using the mysterious "black box" of their graphing calculators (or other classroom technologies).…

Exact Baker-Campbell-Hausdorff formula for the contact Heisenberg algebra

NASA Astrophysics Data System (ADS)

Bravetti, Alessandro; Garcia-Chung, Angel; Tapias, Diego

2017-03-01

In this work we introduce the contact Heisenberg algebra which is the restriction of the Jacobi algebra on contact manifolds to the linear and constant functions. We give the exact expression of its corresponding Baker-Campbell-Hausdorff formula. We argue that this result is relevant to the quantization of contact systems.

Algebraic Generalization Strategies Used by Kuwaiti Pre-Service Teachers

ERIC Educational Resources Information Center

Alajmi, Amal Hussain

2016-01-01

This study reports on the algebraic generalization strategies used by elementary and middle/high school pre-service mathematics teachers in Kuwait. They were presented with 9 tasks that involved linear, exponential, and quadratic situations. The results showed that these pre-service teachers had difficulty in generalizing algebraic rules in all 3…

Introduction to Matrix Algebra, Student's Text, Unit 23.

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

Unit 23 in the SMSG secondary school mathematics series is a student text covering the following topics in matrix algebra: matrix operations, the algebra of 2 X 2 matrices, matrices and linear systems, representation of column matrices as geometric vectors, and transformations of the plane. Listed in the appendix are four research exercises in…

Symmetries and integrability of a fourth-order Euler-Bernoulli beam equation

NASA Astrophysics Data System (ADS)

Bokhari, Ashfaque H.; Mahomed, F. M.; Zaman, F. D.

2010-05-01

The complete symmetry group classification of the fourth-order Euler-Bernoulli ordinary differential equation, where the elastic modulus and the area moment of inertia are constants and the applied load is a function of the normal displacement, is obtained. We perform the Lie and Noether symmetry analysis of this problem. In the Lie analysis, the principal Lie algebra which is one dimensional extends in four cases, viz. the linear, exponential, general power law, and a negative fractional power law. It is further shown that two cases arise in the Noether classification with respect to the standard Lagrangian. That is, the linear case for which the Noether algebra dimension is one less than the Lie algebra dimension as well as the negative fractional power law. In the latter case the Noether algebra is three dimensional and is isomorphic to the Lie algebra which is sl(2,R). This exceptional case, although admitting the nonsolvable algebra sl(2,R), remarkably allows for a two-parameter family of exact solutions via the Noether integrals. The Lie reduction gives a second-order ordinary differential equation which has nonlocal symmetry.

Improving Machining Accuracy of CNC Machines with Innovative Design Methods

NASA Astrophysics Data System (ADS)

Yemelyanov, N. V.; Yemelyanova, I. V.; Zubenko, V. L.

2018-03-01

The article considers achieving the machining accuracy of CNC machines by applying innovative methods in modelling and design of machining systems, drives and machine processes. The topological method of analysis involves visualizing the system as matrices of block graphs with a varying degree of detail between the upper and lower hierarchy levels. This approach combines the advantages of graph theory and the efficiency of decomposition methods, it also has visual clarity, which is inherent in both topological models and structural matrices, as well as the resiliency of linear algebra as part of the matrix-based research. The focus of the study is on the design of automated machine workstations, systems, machines and units, which can be broken into interrelated parts and presented as algebraic, topological and set-theoretical models. Every model can be transformed into a model of another type, and, as a result, can be interpreted as a system of linear and non-linear equations which solutions determine the system parameters. This paper analyses the dynamic parameters of the 1716PF4 machine at the stages of design and exploitation. Having researched the impact of the system dynamics on the component quality, the authors have developed a range of practical recommendations which have enabled one to reduce considerably the amplitude of relative motion, exclude some resonance zones within the spindle speed range of 0...6000 min-1 and improve machining accuracy.

Implementing dense linear algebra algorithms using multitasking on the CRAY X-MP-4 (or approaching the gigaflop)

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

Dongarra, J.J.; Hewitt, T.

1985-08-01

This note describes some experiments on simple, dense linear algebra algorithms. These experiments show that the CRAY X-MP is capable of small-grain multitasking arising from standard implementations of LU and Cholesky decomposition. The implementation described here provides the ''fastest'' execution rate for LU decomposition, 718 MFLOPS for a matrix of order 1000.

Visualizing the Inner Product Space R[superscript m x n] in a MATLAB-Assisted Linear Algebra Classroom

ERIC Educational Resources Information Center

Caglayan, Günhan

2018-01-01

This linear algebra note offers teaching and learning ideas in the treatment of the inner product space R[superscript m x n] in a technology-supported learning environment. Classroom activities proposed in this note demonstrate creative ways of integrating MATLAB technology into various properties of Frobenius inner product as visualization tools…

Symmetry groups of integro-differential equations for linear thermoviscoelastic materials with memory

NASA Astrophysics Data System (ADS)

Zhou, L.-Q.; Meleshko, S. V.

2017-07-01

The group analysis method is applied to a system of integro-differential equations corresponding to a linear thermoviscoelastic model. A recently developed approach for calculating the symmetry groups of such equations is used. The general solution of the determining equations for the system is obtained. Using subalgebras of the admitted Lie algebra, two classes of partially invariant solutions of the considered system of integro-differential equations are studied.

BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS

NASA Technical Reports Server (NTRS)

Krogh, F. T.

1994-01-01

The Basic Linear Algebra Subprogram (BLAS) library is a collection of FORTRAN callable routines for employing standard techniques in performing the basic operations of numerical linear algebra. The BLAS library was developed to provide a portable and efficient source of basic operations for designers of programs involving linear algebraic computations. The subprograms available in the library cover the operations of dot product, multiplication of a scalar and a vector, vector plus a scalar times a vector, Givens transformation, modified Givens transformation, copy, swap, Euclidean norm, sum of magnitudes, and location of the largest magnitude element. Since these subprograms are to be used in an ANSI FORTRAN context, the cases of single precision, double precision, and complex data are provided for. All of the subprograms have been thoroughly tested and produce consistent results even when transported from machine to machine. BLAS contains Assembler versions and FORTRAN test code for any of the following compilers: Lahey F77L, Microsoft FORTRAN, or IBM Professional FORTRAN. It requires the Microsoft Macro Assembler and a math co-processor. The PC implementation allows individual arrays of over 64K. The BLAS library was developed in 1979. The PC version was made available in 1986 and updated in 1988.

An empirical investigation of methods for nonsymmetric linear systems

NASA Technical Reports Server (NTRS)

Sherman, A. H.

1981-01-01

The present investigation is concerned with a comparison of methods for solving linear algebraic systems which arise from finite difference discretizations of the elliptic convection-diffusion equation in a planar region Omega with Dirichlet boundary conditions. Such linear systems are typically of the form Ax = b where A is an N x N sparse nonsymmetric matrix. In a discussion of discretizations, it is assumed that a regular rectilinear mesh of width h has been imposed on Omega. The discretizations considered include central differences, upstream differences, and modified upstream differences. Six methods for solving Ax = b are considered. Three variants of Gaussian elimination have been chosen as representatives of state-of-the-art software for direct methods under different assumptions about pivoting. Three iterative methods are also included.

A Comprehensive Analytical Model of Rotorcraft Aerodynamics and Dynamics. Part 1. Analysis Development

DTIC Science & Technology

1980-06-01

sufficient. Dropping the time lag terms, the equations for Xu, Xx’, and X reduce to linear algebraic equations.Y Hence in the quasistatic case the...quasistatic variables now are not described by differential equations but rather by linear algebraic equations. The solution for x0 then is simply -365...matrices for two-bladed rotor 414 7. LINEAR SYSTEM ANALYSIS 425 7,1 State Variable Form 425 7.2 Constant Coefficient System 426 7.2. 1 Eigen-analysis 426

Resolving phase ambiguities in the calibration of redundant interferometric arrays: implications for array design

DTIC Science & Technology

2015-11-30

matrix determinant. This definition is given in many linear algebra texts (see e.g. Bretscher (2001)). Definition 3.1 : Suppose we have an n-by-n...Processing, 2, 767 Blanchard P., Greenaway A., Anderton R., Appleby R., 1996, J. Opt. Soc. Am. A, 13, 1593 Bretscher O., 2001, Linear Algebra with...frequencies are not co- linear ) and one piston phase. This particular solution will then differ from the true solution by a phase ramp in the Fourier

A new S-type eigenvalue inclusion set for tensors and its applications.

PubMed

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

Matrix form of Legendre polynomials for solving linear integro-differential equations of high order

NASA Astrophysics Data System (ADS)

Kammuji, M.; Eshkuvatov, Z. K.; Yunus, Arif A. M.

2017-04-01

This paper presents an effective approximate solution of high order of Fredholm-Volterra integro-differential equations (FVIDEs) with boundary condition. Legendre truncated series is used as a basis functions to estimate the unknown function. Matrix operation of Legendre polynomials is used to transform FVIDEs with boundary conditions into matrix equation of Fredholm-Volterra type. Gauss Legendre quadrature formula and collocation method are applied to transfer the matrix equation into system of linear algebraic equations. The latter equation is solved by Gauss elimination method. The accuracy and validity of this method are discussed by solving two numerical examples and comparisons with wavelet and methods.

A least-squares finite element method for 3D incompressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Hou, Lin-Jun; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

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

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

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

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

Algebraic solutions of shape-invariant position-dependent effective mass systems

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

Amir, Naila, E-mail: naila.amir@live.com, E-mail: naila.amir@seecs.edu.pk; Iqbal, Shahid, E-mail: sic80@hotmail.com, E-mail: siqbal@sns.nust.edu.pk

2016-06-15

Keeping in view the ordering ambiguity that arises due to the presence of position-dependent effective mass in the kinetic energy term of the Hamiltonian, a general scheme for obtaining algebraic solutions of quantum mechanical systems with position-dependent effective mass is discussed. We quantize the Hamiltonian of the pertaining system by using symmetric ordering of the operators concerning momentum and the spatially varying mass, initially proposed by von Roos and Lévy-Leblond. The algebraic method, used to obtain the solutions, is based on the concepts of supersymmetric quantum mechanics and shape invariance. In order to exemplify the general formalism a class ofmore » non-linear oscillators has been considered. This class includes the particular example of a one-dimensional oscillator with different position-dependent effective mass profiles. Explicit expressions for the eigenenergies and eigenfunctions in terms of generalized Hermite polynomials are presented. Moreover, properties of these modified Hermite polynomials, like existence of generating function and recurrence relations among the polynomials have also been studied. Furthermore, it has been shown that in the harmonic limit, all the results for the linear harmonic oscillator are recovered.« less

Communication Avoiding and Overlapping for Numerical Linear Algebra

DTIC Science & Technology

2012-05-08

future exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms improve scalability by reducing...linear algebra problems to future exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms improve...will continue to grow relative to the cost of computation. With exascale computing as the long-term goal, the community needs to develop techniques

Some Issues about the Introduction of First Concepts in Linear Algebra during Tutorial Sessions at the Beginning of University

ERIC Educational Resources Information Center

Grenier-Boley, Nicolas

2014-01-01

Certain mathematical concepts were not introduced to solve a specific open problem but rather to solve different problems with the same tools in an economic formal way or to unify several approaches: such concepts, as some of those of linear algebra, are presumably difficult to introduce to students as they are potentially interwoven with many…

A preconditioner for the finite element computation of incompressible, nonlinear elastic deformations

NASA Astrophysics Data System (ADS)

Whiteley, J. P.

2017-10-01

Large, incompressible elastic deformations are governed by a system of nonlinear partial differential equations. The finite element discretisation of these partial differential equations yields a system of nonlinear algebraic equations that are usually solved using Newton's method. On each iteration of Newton's method, a linear system must be solved. We exploit the structure of the Jacobian matrix to propose a preconditioner, comprising two steps. The first step is the solution of a relatively small, symmetric, positive definite linear system using the preconditioned conjugate gradient method. This is followed by a small number of multigrid V-cycles for a larger linear system. Through the use of exemplar elastic deformations, the preconditioner is demonstrated to facilitate the iterative solution of the linear systems arising. The number of GMRES iterations required has only a very weak dependence on the number of degrees of freedom of the linear systems.

Families of vector-like deformations of relativistic quantum phase spaces, twists and symmetries

NASA Astrophysics Data System (ADS)

Meljanac, Daniel; Meljanac, Stjepan; Pikutić, Danijel

2017-12-01

Families of vector-like deformed relativistic quantum phase spaces and corresponding realizations are analyzed. A method for a general construction of the star product is presented. The corresponding twist, expressed in terms of phase space coordinates, in the Hopf algebroid sense is presented. General linear realizations are considered and corresponding twists, in terms of momenta and Poincaré-Weyl generators or gl(n) generators are constructed and R-matrix is discussed. A classification of linear realizations leading to vector-like deformed phase spaces is given. There are three types of spaces: (i) commutative spaces, (ii) κ -Minkowski spaces and (iii) κ -Snyder spaces. The corresponding star products are (i) associative and commutative (but non-local), (ii) associative and non-commutative and (iii) non-associative and non-commutative, respectively. Twisted symmetry algebras are considered. Transposed twists and left-right dual algebras are presented. Finally, some physical applications are discussed.

Simulation of the Flow Through Porous Layers Composed of Converging-Diverging Capillary Fissures or Tubes

NASA Astrophysics Data System (ADS)

Walicka, A.

2018-02-01

In this paper, a porous medium is modelled by a network of converging-diverging capillaries which may be considered as fissures or tubes. This model makes it necessary to consider flows through capillary fissures or tubes. Therefore an analytical method for deriving the relationships between pressure drops, volumetric flow rates and velocities for the following fluids: Newtonian, polar, power-law, pseudoplastic (DeHaven and Sisko types) and Shulmanian, was developed. Next, considerations on the models of pore network for Newtonian and non-Newtonian fluids were presented. The models, similar to the schemes of central finite differences may provide a good basis for transforming the governing equations of a flow through the porous medium into a set of linear or quasi-linear algebraic equations. It was shown that the some coefficients in these algebraic equations depend on the kind of the capillary convergence.

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

DOE PAGES

Li, Ruipeng; Saad, Yousef

2017-08-01

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisonsmore » with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.« less

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

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

Li, Ruipeng; Saad, Yousef

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisonsmore » with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.« less

The applications of a higher-dimensional Lie algebra and its decomposed subalgebras

PubMed Central

Yu, Zhang; Zhang, Yufeng

2009-01-01

With the help of invertible linear transformations and the known Lie algebras, a higher-dimensional 6 × 6 matrix Lie algebra sμ(6) is constructed. It follows a type of new loop algebra is presented. By using a (2 + 1)-dimensional partial-differential equation hierarchy we obtain the integrable coupling of the (2 + 1)-dimensional KN integrable hierarchy, then its corresponding Hamiltonian structure is worked out by employing the quadratic-form identity. Furthermore, a higher-dimensional Lie algebra denoted by E, is given by decomposing the Lie algebra sμ(6), then a discrete lattice integrable coupling system is produced. A remarkable feature of the Lie algebras sμ(6) and E is used to directly construct integrable couplings. PMID:20084092

The applications of a higher-dimensional Lie algebra and its decomposed subalgebras.

PubMed

Yu, Zhang; Zhang, Yufeng

2009-01-15

With the help of invertible linear transformations and the known Lie algebras, a higher-dimensional 6 x 6 matrix Lie algebra smu(6) is constructed. It follows a type of new loop algebra is presented. By using a (2 + 1)-dimensional partial-differential equation hierarchy we obtain the integrable coupling of the (2 + 1)-dimensional KN integrable hierarchy, then its corresponding Hamiltonian structure is worked out by employing the quadratic-form identity. Furthermore, a higher-dimensional Lie algebra denoted by E, is given by decomposing the Lie algebra smu(6), then a discrete lattice integrable coupling system is produced. A remarkable feature of the Lie algebras smu(6) and E is used to directly construct integrable couplings.

Contextualizing symbol, symbolizing context

NASA Astrophysics Data System (ADS)

Maudy, Septiani Yugni; Suryadi, Didi; Mulyana, Endang

2017-08-01

When students learn algebra for the first time, inevitably they are experiencing transition from arithmetic to algebraic thinking. Once students could apprehend this essential mathematical knowledge, they are cultivating their ability in solving daily life problems by applying algebra. However, as we dig into this transitional stage, we identified possible students' learning obstacles to be dealt with seriously in order to forestall subsequent hindrance in studying more advance algebra. We come to realize this recurring problem as we undertook the processes of re-personalization and re-contextualization in which we scrutinize the very basic questions: 1) what is variable, linear equation with one variable and their relationship with the arithmetic-algebraic thinking? 2) Why student should learn such concepts? 3) How to teach those concepts to students? By positioning ourselves as a seventh grade student, we address the possibility of children to think arithmetically when confronted with the problems of linear equation with one variable. To help them thinking algebraically, Bruner's modes of representation developed contextually from concrete to abstract were delivered to enhance their interpretation toward the idea of variables. Hence, from the outset we designed the context for student to think symbolically initiated by exploring various symbols that could be contextualized in order to bridge student traversing the arithmetic-algebraic fruitfully.

Graph C ∗-algebras and Z2-quotients of quantum spheres

NASA Astrophysics Data System (ADS)

Hajac, Piotr M.; Matthes, Rainer; Szymański, Wojciech

2003-06-01

We consider two Z2-actions on the Podleś generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesmewski q-disc and the quantum real projective space, respectively. The C ∗-algebas of all these quantum spaces are described as graph C ∗-algebras. The K-groups of the thus presented C ∗-algebras are then easily determined from the general theory of graph C ∗-algebas. For the quantum real projective space, we also recall the classification of the classes of irreducible ∗-representations of its algebra and give a linear basis for this algebra.

Lattice algebra approach to multispectral analysis of ancient documents.

PubMed

Valdiviezo-N, Juan C; Urcid, Gonzalo

2013-02-01

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

Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems.

PubMed

Wang, An; Cao, Yang; Shi, Quan

2018-01-01

In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respectively.

Towards classical spectrum generating algebras for f-deformations

NASA Astrophysics Data System (ADS)

Kullock, Ricardo; Latini, Danilo

2016-01-01

In this paper we revise the classical analog of f-oscillators, a generalization of q-oscillators given in Man'ko et al. (1997) [8], in the framework of classical spectrum generating algebras (SGA) introduced in Kuru and Negro (2008) [9]. We write down the deformed Poisson algebra characterizing the entire family of non-linear oscillators and construct its general solution algebraically. The latter, covering the full range of f-deformations, shows an energy dependence both in the amplitude and the frequency of the motion.

A Quantum Groups Primer

NASA Astrophysics Data System (ADS)

Majid, Shahn

2002-05-01

Here is a self-contained introduction to quantum groups as algebraic objects. Based on the author's lecture notes for the Part III pure mathematics course at Cambridge University, the book is suitable as a primary text for graduate courses in quantum groups or supplementary reading for modern courses in advanced algebra. The material assumes knowledge of basic and linear algebra. Some familiarity with semisimple Lie algebras would also be helpful. The volume is a primer for mathematicians but it will also be useful for mathematical physicists.

High-Order Automatic Differentiation of Unmodified Linear Algebra Routines via Nilpotent Matrices

NASA Astrophysics Data System (ADS)

Dunham, Benjamin Z.

This work presents a new automatic differentiation method, Nilpotent Matrix Differentiation (NMD), capable of propagating any order of mixed or univariate derivative through common linear algebra functions--most notably third-party sparse solvers and decomposition routines, in addition to basic matrix arithmetic operations and power series--without changing data-type or modifying code line by line; this allows differentiation across sequences of arbitrarily many such functions with minimal implementation effort. NMD works by enlarging the matrices and vectors passed to the routines, replacing each original scalar with a matrix block augmented by derivative data; these blocks are constructed with special sparsity structures, termed "stencils," each designed to be isomorphic to a particular multidimensional hypercomplex algebra. The algebras are in turn designed such that Taylor expansions of hypercomplex function evaluations are finite in length and thus exactly track derivatives without approximation error. Although this use of the method in the "forward mode" is unique in its own right, it is also possible to apply it to existing implementations of the (first-order) discrete adjoint method to find high-order derivatives with lowered cost complexity; for example, for a problem with N inputs and an adjoint solver whose cost is independent of N--i.e., O(1)--the N x N Hessian can be found in O(N) time, which is comparable to existing second-order adjoint methods that require far more problem-specific implementation effort. Higher derivatives are likewise less expensive--e.g., a N x N x N rank-three tensor can be found in O(N2). Alternatively, a Hessian-vector product can be found in O(1) time, which may open up many matrix-based simulations to a range of existing optimization or surrogate modeling approaches. As a final corollary in parallel to the NMD-adjoint hybrid method, the existing complex-step differentiation (CD) technique is also shown to be capable of finding the Hessian-vector product. All variants are implemented on a stochastic diffusion problem and compared in-depth with various cost and accuracy metrics.

Packing a Box with Bricks.

ERIC Educational Resources Information Center

Jepsen, Charles H.

1991-01-01

Presented are solutions to variations of a combinatorics problem from a recent International Mathematics Olympiad. In particular, the matrix algebra solution illustrates an interaction among the undergraduate areas of geometry, combinatorics, linear algebra, and group theory. (JJK)

Finite-dimensional integrable systems: A collection of research problems

NASA Astrophysics Data System (ADS)

Bolsinov, A. V.; Izosimov, A. M.; Tsonev, D. M.

2017-05-01

This article suggests a series of problems related to various algebraic and geometric aspects of integrability. They reflect some recent developments in the theory of finite-dimensional integrable systems such as bi-Poisson linear algebra, Jordan-Kronecker invariants of finite dimensional Lie algebras, the interplay between singularities of Lagrangian fibrations and compatible Poisson brackets, and new techniques in projective geometry.

On squares of representations of compact Lie algebras

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

Zeier, Robert, E-mail: robert.zeier@ch.tum.de; Zimborás, Zoltán, E-mail: zimboras@gmail.com

We study how tensor products of representations decompose when restricted from a compact Lie algebra to one of its subalgebras. In particular, we are interested in tensor squares which are tensor products of a representation with itself. We show in a classification-free manner that the sum of multiplicities and the sum of squares of multiplicities in the corresponding decomposition of a tensor square into irreducible representations has to strictly grow when restricted from a compact semisimple Lie algebra to a proper subalgebra. For this purpose, relevant details on tensor products of representations are compiled from the literature. Since the summore » of squares of multiplicities is equal to the dimension of the commutant of the tensor-square representation, it can be determined by linear-algebra computations in a scenario where an a priori unknown Lie algebra is given by a set of generators which might not be a linear basis. Hence, our results offer a test to decide if a subalgebra of a compact semisimple Lie algebra is a proper one without calculating the relevant Lie closures, which can be naturally applied in the field of controlled quantum systems.« less

New modified multi-level residue harmonic balance method for solving nonlinearly vibrating double-beam problem

NASA Astrophysics Data System (ADS)

Rahman, Md. Saifur; Lee, Yiu-Yin

2017-10-01

In this study, a new modified multi-level residue harmonic balance method is presented and adopted to investigate the forced nonlinear vibrations of axially loaded double beams. Although numerous nonlinear beam or linear double-beam problems have been tackled and solved, there have been few studies of this nonlinear double-beam problem. The geometric nonlinear formulations for a double-beam model are developed. The main advantage of the proposed method is that a set of decoupled nonlinear algebraic equations is generated at each solution level. This heavily reduces the computational effort compared with solving the coupled nonlinear algebraic equations generated in the classical harmonic balance method. The proposed method can generate the higher-level nonlinear solutions that are neglected by the previous modified harmonic balance method. The results from the proposed method agree reasonably well with those from the classical harmonic balance method. The effects of damping, axial force, and excitation magnitude on the nonlinear vibrational behaviour are examined.

A Computing Method for Sound Propagation Through a Nonuniform Jet Stream

NASA Technical Reports Server (NTRS)

Padula, S. L.; Liu, C. H.

1974-01-01

Understanding the principles of jet noise propagation is an essential ingredient of systematic noise reduction research. High speed computer methods offer a unique potential for dealing with complex real life physical systems whereas analytical solutions are restricted to sophisticated idealized models. The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions and a more suitable approach was needed. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

αAMG based on Weighted Matching for Systems of Elliptic PDEs Arising From Displacement and Mixed Methods

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

D'Ambra, P.; Vassilevski, P. S.

2014-05-30

Adaptive Algebraic Multigrid (or Multilevel) Methods (αAMG) are introduced to improve robustness and efficiency of classical algebraic multigrid methods in dealing with problems where no a-priori knowledge or assumptions on the near-null kernel of the underlined matrix are available. Recently we proposed an adaptive (bootstrap) AMG method, αAMG, aimed to obtain a composite solver with a desired convergence rate. Each new multigrid component relies on a current (general) smooth vector and exploits pairwise aggregation based on weighted matching in a matrix graph to define a new automatic, general-purpose coarsening process, which we refer to as “the compatible weighted matching”. Inmore » this work, we present results that broaden the applicability of our method to different finite element discretizations of elliptic PDEs. In particular, we consider systems arising from displacement methods in linear elasticity problems and saddle-point systems that appear in the application of the mixed method to Darcy problems.« less

Lie algebraic approach to valence bond theory of π-electron systems: a preliminary study of excited states

NASA Astrophysics Data System (ADS)

Paldus, J.; Li, X.

1992-10-01

Following a brief outline of various developments and exploitations of the unitary group approach (UGA), and its extension referred to as Clifford algebra UGA (CAUGA), in molecular electronic structure calculations, we present a summary of a recently introduced implementation of CAUGA for the valence bond (VB) method based on the Pariser-Parr-Pople (PPP)-type Hamiltonian. The existing applications of this PPP-VB approach have been limited to groundstates of various π-electron systems or, at any rate, to the lowest states of a given multiplicity. In this paper the method is applied to the low-lying excited states of several archetypal models, namely cyclobutadiene and benzene, representing antiaromatic and aromatic systems, hexatriene, representing linear polyenic systems and, finally, naphthalene, representing polyacenes.

Decomposition Theory in the Teaching of Elementary Linear Algebra.

ERIC Educational Resources Information Center

London, R. R.; Rogosinski, H. P.

1990-01-01

Described is a decomposition theory from which the Cayley-Hamilton theorem, the diagonalizability of complex square matrices, and functional calculus can be developed. The theory and its applications are based on elementary polynomial algebra. (KR)

Manifolds, Tensors, and Forms

NASA Astrophysics Data System (ADS)

Renteln, Paul

2013-11-01

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

Pole-placement Predictive Functional Control for under-damped systems with real numbers algebra.

PubMed

Zabet, K; Rossiter, J A; Haber, R; Abdullah, M

2017-11-01

This paper presents the new algorithm of PP-PFC (Pole-placement Predictive Functional Control) for stable, linear under-damped higher-order processes. It is shown that while conventional PFC aims to get first-order exponential behavior, this is not always straightforward with significant under-damped modes and hence a pole-placement PFC algorithm is proposed which can be tuned more precisely to achieve the desired dynamics, but exploits complex number algebra and linear combinations in order to deliver guarantees of stability and performance. Nevertheless, practical implementation is easier by avoiding complex number algebra and hence a modified formulation of the PP-PFC algorithm is also presented which utilises just real numbers while retaining the key attributes of simple algebra, coding and tuning. The potential advantages are demonstrated with numerical examples and real-time control of a laboratory plant. Copyright © 2017 ISA. All rights reserved.

Projection of angular momentum via linear algebra

DOE PAGES

Johnson, Calvin W.; O'Mara, Kevin D.

2017-12-01

Projection of many-body states with good angular momentum from an initial state is usually accomplished by a three-dimensional integral. Here, we show how projection can instead be done by solving a straightforward system of linear equations. We demonstrate the method and give sample applications tomore » $$^{48}$$Cr and $$^{60}$$Fe in the $pf$ shell. This new projection scheme, which is competitive against the standard numerical quadrature, should also be applicable to other quantum numbers such as isospin and particle number.« less

Projection of angular momentum via linear algebra

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

Johnson, Calvin W.; O'Mara, Kevin D.

Projection of many-body states with good angular momentum from an initial state is usually accomplished by a three-dimensional integral. Here, we show how projection can instead be done by solving a straightforward system of linear equations. We demonstrate the method and give sample applications tomore » $$^{48}$$Cr and $$^{60}$$Fe in the $pf$ shell. This new projection scheme, which is competitive against the standard numerical quadrature, should also be applicable to other quantum numbers such as isospin and particle number.« less

Time domain convergence properties of Lyapunov stable penalty methods

NASA Technical Reports Server (NTRS)

Kurdila, A. J.; Sunkel, John

1991-01-01

Linear hyperbolic partial differential equations are analyzed using standard techniques to show that a sequence of solutions generated by the Liapunov stable penalty equations approaches the solution of the differential-algebraic equations governing the dynamics of multibody problems arising in linear vibrations. The analysis does not require that the system be conservative and does not impose any specific integration scheme. Variational statements are derived which bound the error in approximation by the norm of the constraint violation obtained in the approximate solutions.

Projection of angular momentum via linear algebra

NASA Astrophysics Data System (ADS)

Johnson, Calvin W.; O'Mara, Kevin D.

2017-12-01

Projection of many-body states with good angular momentum from an initial state is usually accomplished by a three-dimensional integral. We show how projection can instead be done by solving a straightforward system of linear equations. We demonstrate the method and give sample applications to 48Cr and 60Fe in the p f shell. This new projection scheme, which is competitive against the standard numerical quadrature, should also be applicable to other quantum numbers such as isospin and particle number.

An Algebraic Approach to Inference in Complex Networked Structures

DTIC Science & Technology

2015-07-09

44], [45],[46] where the shift is the elementary non-trivial filter that generates, under an appropriate notion of shift invariance, all linear ... elementary filter, and its output is a graph signal with the value at vertex n of the graph given approximately by a weighted linear combination of...AFRL-AFOSR-VA-TR-2015-0265 An Algebraic Approach to Inference in Complex Networked Structures Jose Moura CARNEGIE MELLON UNIVERSITY Final Report 07

Labeled trees and the efficient computation of derivations

NASA Technical Reports Server (NTRS)

Grossman, Robert; Larson, Richard G.

1989-01-01

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

NASA Astrophysics Data System (ADS)

Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.

2015-08-01

The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.

Efficient computer algebra algorithms for polynomial matrices in control design

NASA Technical Reports Server (NTRS)

Baras, J. S.; Macenany, D. C.; Munach, R.

1989-01-01

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

A Mathematics Software Database Update.

ERIC Educational Resources Information Center

Cunningham, R. S.; Smith, David A.

1987-01-01

Contains an update of an earlier listing of software for mathematics instruction at the college level. Topics are: advanced mathematics, algebra, calculus, differential equations, discrete mathematics, equation solving, general mathematics, geometry, linear and matrix algebra, logic, statistics and probability, and trigonometry. (PK)

College Algebra I.

ERIC Educational Resources Information Center

Benjamin, Carl; And Others

Presented are student performance objectives, a student progress chart, and assignment sheets with objective and diagnostic measures for the stated performance objectives in College Algebra I. Topics covered include: sets; vocabulary; linear equations; inequalities; real numbers; operations; factoring; fractions; formulas; ratio, proportion, and…

On iterative processes in the Krylov-Sonneveld subspaces

NASA Astrophysics Data System (ADS)

Ilin, Valery P.

2016-10-01

The iterative Induced Dimension Reduction (IDR) methods are considered for solving large systems of linear algebraic equations (SLAEs) with nonsingular nonsymmetric matrices. These approaches are investigated by many authors and are charachterized sometimes as the alternative to the classical processes of Krylov type. The key moments of the IDR algorithms consist in the construction of the embedded Sonneveld subspaces, which have the decreasing dimensions and use the orthogonalization to some fixed subspace. Other independent approaches for research and optimization of the iterations are based on the augmented and modified Krylov subspaces by using the aggregation and deflation procedures with present various low rank approximations of the original matrices. The goal of this paper is to show, that IDR method in Sonneveld subspaces present an original interpretation of the modified algorithms in the Krylov subspaces. In particular, such description is given for the multi-preconditioned semi-conjugate direction methods which are actual for the parallel algebraic domain decomposition approaches.

Eigenmodes of Multilayer Slit Structures

NASA Astrophysics Data System (ADS)

Kovalenko, A. N.

2017-12-01

We generalize the high-efficiency numerical-analytical method of calculating the eigenmodes of a microstrip line, which was proposed in [1], to multilayer slit structures. The obtained relationships make it possible to allow for the multilayer nature of the medium on the basis of solving the electrodynamic problem for a two-layer structure. The algebraic models of a single line and coupled slit lines in a multilayer dielectric medium are constructed. The matrix elements of the system of linear algebraic equations, which is used to determine the expansion coefficients of the electric field inside the slits in a Chebyshev basis, are converted to rapidly convergent series. The constructed models allow one to use computer simulation to obtain numerical results with high speed and accuracy, regardless of the number of dielectric layers. The presented results of a numerical study of the method convergence confirm high efficiency of the method.

Linear reduction methods for tag SNP selection.

PubMed

He, Jingwu; Zelikovsky, Alex

2004-01-01

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

GHM method for obtaining rationalsolutions of nonlinear differential equations.

PubMed

Vazquez-Leal, Hector; Sarmiento-Reyes, Arturo

2015-01-01

In this paper, we propose the application of the general homotopy method (GHM) to obtain rational solutions of nonlinear differential equations. It delivers a high precision representation of the nonlinear differential equation using a few linear algebraic terms. In order to assess the benefits of this proposal, three nonlinear problems are solved and compared against other semi-analytic methods or numerical methods. The obtained results show that GHM is a powerful tool, capable to generate highly accurate rational solutions. AMS subject classification 34L30.

Analysis of junior high school students' attempt to solve a linear inequality problem

NASA Astrophysics Data System (ADS)

Taqiyuddin, Muhammad; Sumiaty, Encum; Jupri, Al

2017-08-01

Linear inequality is one of fundamental subjects within junior high school mathematics curricula. Several studies have been conducted to asses students' perform on linear inequality. However, it can hardly be found that linear inequality problems are in the form of "ax + b < dx + e" with "a, d ≠ 0", and "a ≠ d" as it can be seen on the textbook used by Indonesian students and several studies. This condition leads to the research questions concerning students' attempt on solving a simple linear inequality problem in this form. In order to do so, the written test was administered to 58 students from two schools in Bandung followed by interviews. The other sources of the data are from teachers' interview and mathematics books used by students. After that, the constant comparative method was used to analyse the data. The result shows that the majority approached the question by doing algebraic operations. Interestingly, most of them did it incorrectly. In contrast, algebraic operations were correctly used by some of them. Moreover, the others performed expected-numbers solution, rewriting the question, translating the inequality into words, and blank answer. Furthermore, we found that there is no one who was conscious of the existence of all-numbers solution. It was found that this condition is reasonably due to how little the learning components concern about why a procedure of solving a linear inequality works and possibilities of linear inequality solution.

Particle-like structure of coaxial Lie algebras

NASA Astrophysics Data System (ADS)

Vinogradov, A. M.

2018-01-01

This paper is a natural continuation of Vinogradov [J. Math. Phys. 58, 071703 (2017)] where we proved that any Lie algebra over an algebraically closed field or over R can be assembled in a number of steps from two elementary constituents, called dyons and triadons. Here we consider the problems of the construction and classification of those Lie algebras which can be assembled in one step from base dyons and triadons, called coaxial Lie algebras. The base dyons and triadons are Lie algebra structures that have only one non-trivial structure constant in a given basis, while coaxial Lie algebras are linear combinations of pairwise compatible base dyons and triadons. We describe the maximal families of pairwise compatible base dyons and triadons called clusters, and, as a consequence, we give a complete description of the coaxial Lie algebras. The remarkable fact is that dyons and triadons in clusters are self-organised in structural groups which are surrounded by casings and linked by connectives. We discuss generalisations and applications to the theory of deformations of Lie algebras.

NASA-Ames three-dimensional potential flow analysis system (POTFAN) equation solver code (SOLN) version 1

NASA Technical Reports Server (NTRS)

Davis, J. E.; Bonnett, W. S.; Medan, R. T.

1976-01-01

A computer program known as SOLN was developed as an independent segment of the NASA-Ames three-dimensional potential flow analysis systems of linear algebraic equations. Methods used include: LU decomposition, Householder's method, a partitioning scheme, and a block successive relaxation method. Due to the independent modular nature of the program, it may be used by itself and not necessarily in conjunction with other segments of the POTFAN system.

Communication: Analysing kinetic transition networks for rare events.

PubMed

Stevenson, Jacob D; Wales, David J

2014-07-28

The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods, focusing on large, sparse networks. We show that graph transformation provides a much more robust framework, succeeding when numerical precision issues cause the other methods to fail completely. These are precisely the situations that correspond to rare event dynamics for which the graph transformation was introduced.

A linear programming manual

NASA Technical Reports Server (NTRS)

Tuey, R. C.

1972-01-01

Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.

Semi-automatic sparse preconditioners for high-order finite element methods on non-uniform meshes

NASA Astrophysics Data System (ADS)

Austin, Travis M.; Brezina, Marian; Jamroz, Ben; Jhurani, Chetan; Manteuffel, Thomas A.; Ruge, John

2012-05-01

High-order finite elements often have a higher accuracy per degree of freedom than the classical low-order finite elements. However, in the context of implicit time-stepping methods, high-order finite elements present challenges to the construction of efficient simulations due to the high cost of inverting the denser finite element matrix. There are many cases where simulations are limited by the memory required to store the matrix and/or the algorithmic components of the linear solver. We are particularly interested in preconditioned Krylov methods for linear systems generated by discretization of elliptic partial differential equations with high-order finite elements. Using a preconditioner like Algebraic Multigrid can be costly in terms of memory due to the need to store matrix information at the various levels. We present a novel method for defining a preconditioner for systems generated by high-order finite elements that is based on a much sparser system than the original high-order finite element system. We investigate the performance for non-uniform meshes on a cube and a cubed sphere mesh, showing that the sparser preconditioner is more efficient and uses significantly less memory. Finally, we explore new methods to construct the sparse preconditioner and examine their effectiveness for non-uniform meshes. We compare results to a direct use of Algebraic Multigrid as a preconditioner and to a two-level additive Schwarz method.

Computing Principal Eigenvectors of Large Web Graphs: Algorithms and Accelerations Related to PageRank and HITS

ERIC Educational Resources Information Center

Nagasinghe, Iranga

2010-01-01

This thesis investigates and develops a few acceleration techniques for the search engine algorithms used in PageRank and HITS computations. PageRank and HITS methods are two highly successful applications of modern Linear Algebra in computer science and engineering. They constitute the essential technologies accounted for the immense growth and…

Special Year on Numerical Linear Algebra

DTIC Science & Technology

1988-09-01

ORNL) Worley, Pat (ORNL) A special acknowledgement should go to Mary Drake (UT) and Mitzy Denson (ORNL) who carried the burden of making the innumerable...a time step appropriate for the regular cells with no stability restriction. Entrance to Y-12 requires a pass. Contact Mitzy Denson (615) 574-3125 to...requires a pass. Contact Mitzy Denson (615) 574-3125 to obtain one. ’This seminar is part of the Special Year on Numerical Linear Algebra sponsored by the

Generation of Custom DSP Transform IP Cores: Case Study Walsh-Hadamard Transform

DTIC Science & Technology

2002-09-01

mathematics and hardware design What I know: Finite state machine Pipelining Systolic array … What I know: Linear algebra Digital signal processing...state machine Pipelining Systolic array … What I know: Linear algebra Digital signal processing Adaptive filter theory … A math guy A hardware engineer...Synthesis Technology Libary Bit-width (8) HF factor (1,2,3,6) VF factor (1,2,4, ... 32) Xilinx FPGA Place&Route Xilinx FPGA Place&Route Performance

USSR and Eastern Europe Scientific Abstracts, Electronics and Electrical Engineering, Number 33.

DTIC Science & Technology

1977-09-27

reduces to an infinite system of linear homogeneous algebraic equations and leads to Mathieu functions of the k-th order. The solution is convergent in...cylinder walls to be infinitesimally thin ideal conductors. The problem is reduced to a system of Fredholm linear algebraic equations of the second...EXPECTED DEVELOPMENTS OF TRANSISTORIZED LOW-NOISE MICROWAVE AMPLIFIERS Prague SDELOVACI TECHNIKA in Czech Vol 25, No 2, Feb 77 pp 47-49 TALLO, ANTON

A new exact method for line radiative transfer

NASA Astrophysics Data System (ADS)

Elitzur, Moshe; Asensio Ramos, Andrés

2006-01-01

We present a new method, the coupled escape probability (CEP), for exact calculation of line emission from multi-level systems, solving only algebraic equations for the level populations. The CEP formulation of the classical two-level problem is a set of linear equations, and we uncover an exact analytic expression for the emission from two-level optically thick sources that holds as long as they are in the `effectively thin' regime. In a comparative study of a number of standard problems, the CEP method outperformed the leading line transfer methods by substantial margins. The algebraic equations employed by our new method are already incorporated in numerous codes based on the escape probability approximation. All that is required for an exact solution with these existing codes is to augment the expression for the escape probability with simple zone-coupling terms. As an application, we find that standard escape probability calculations generally produce the correct cooling emission by the CII 158-μm line but not by the 3P lines of OI.

Semistrict higher gauge theory

NASA Astrophysics Data System (ADS)

Jurčo, Branislav; Sämann, Christian; Wolf, Martin

2015-04-01

We develop semistrict higher gauge theory from first principles. In particular, we describe the differential Deligne cohomology underlying semistrict principal 2-bundles with connective structures. Principal 2-bundles are obtained in terms of weak 2-functors from the Čech groupoid to weak Lie 2-groups. As is demonstrated, some of these Lie 2-groups can be differentiated to semistrict Lie 2-algebras by a method due to Ševera. We further derive the full description of connective structures on semistrict principal 2-bundles including the non-linear gauge transformations. As an application, we use a twistor construction to derive superconformal constraint equations in six dimensions for a non-Abelian tensor multiplet taking values in a semistrict Lie 2-algebra.

Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

NASA Astrophysics Data System (ADS)

Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.

2017-11-01

When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.

Amesos2 and Belos: Direct and Iterative Solvers for Large Sparse Linear Systems

DOE PAGES

Bavier, Eric; Hoemmen, Mark; Rajamanickam, Sivasankaran; ...

2012-01-01

Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix factorization codes, and can handle any implementation of sparse matrices and vectors, via an easy-to-extend C++ traits interface. It can also factor matrices whose entries have arbitrary “Scalar” type, enabling extended-precision and mixed-precision algorithms. Belos includes many different iterative methods for solving large sparse linear systems and least-squares problems. Unlike competing iterative solver libraries, Belos completely decouples themore » algorithms from the implementations of the underlying linear algebra objects. This lets Belos exploit the latest hardware without changes to the code. Belos favors algorithms that solve higher-level problems, such as multiple simultaneous linear systems and sequences of related linear systems, faster than standard algorithms. The package also supports extended-precision and mixed-precision algorithms. Together, Amesos2 and Belos form a complete suite of sparse linear solvers.« less

Numerical Problem Solving Using Mathcad in Undergraduate Reaction Engineering

ERIC Educational Resources Information Center

Parulekar, Satish J.

2006-01-01

Experience in using a user-friendly software, Mathcad, in the undergraduate chemical reaction engineering course is discussed. Example problems considered for illustration deal with simultaneous solution of linear algebraic equations (kinetic parameter estimation), nonlinear algebraic equations (equilibrium calculations for multiple reactions and…

A Nonlinear, Multiinput, Multioutput Process Control Laboratory Experiment

ERIC Educational Resources Information Center

Young, Brent R.; van der Lee, James H.; Svrcek, William Y.

2006-01-01

Experience in using a user-friendly software, Mathcad, in the undergraduate chemical reaction engineering course is discussed. Example problems considered for illustration deal with simultaneous solution of linear algebraic equations (kinetic parameter estimation), nonlinear algebraic equations (equilibrium calculations for multiple reactions and…

Elliptic biquaternion algebra

NASA Astrophysics Data System (ADS)

Özen, Kahraman Esen; Tosun, Murat

2018-01-01

In this study, we define the elliptic biquaternions and construct the algebra of elliptic biquaternions over the elliptic number field. Also we give basic properties of elliptic biquaternions. An elliptic biquaternion is in the form A0 + A1i + A2j + A3k which is a linear combination of {1, i, j, k} where the four components A0, A1, A2 and A3 are elliptic numbers. Here, 1, i, j, k are the quaternion basis of the elliptic biquaternion algebra and satisfy the same multiplication rules which are satisfied in both real quaternion algebra and complex quaternion algebra. In addition, we discuss the terms; conjugate, inner product, semi-norm, modulus and inverse for elliptic biquaternions.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Jain, A.; Kreutz-Delgado, K.

1991-01-01

A recently developed spatial operator algebra for manipulator modeling, control, and trajectory design is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and for control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics.

A numerical investigation of the boundary layer flow of an Eyring-Powell fluid over a stretching sheet via rational Chebyshev functions

NASA Astrophysics Data System (ADS)

Parand, Kourosh; Mahdi Moayeri, Mohammad; Latifi, Sobhan; Delkhosh, Mehdi

2017-07-01

In this paper, a spectral method based on the four kinds of rational Chebyshev functions is proposed to approximate the solution of the boundary layer flow of an Eyring-Powell fluid over a stretching sheet. First, by using the quasilinearization method (QLM), the model which is a nonlinear ordinary differential equation is converted to a sequence of linear ordinary differential equations (ODEs). By applying the proposed method on the ODEs in each iteration, the equations are converted to a system of linear algebraic equations. The results indicate the high accuracy and convergence of our method. Moreover, the effects of the Eyring-Powell fluid material parameters are discussed.

Interpolation problem for the solutions of linear elasticity equations based on monogenic functions

NASA Astrophysics Data System (ADS)

Grigor'ev, Yuri; Gürlebeck, Klaus; Legatiuk, Dmitrii

2017-11-01

Interpolation is an important tool for many practical applications, and very often it is beneficial to interpolate not only with a simple basis system, but rather with solutions of a certain differential equation, e.g. elasticity equation. A typical example for such type of interpolation are collocation methods widely used in practice. It is known, that interpolation theory is fully developed in the framework of the classical complex analysis. However, in quaternionic analysis, which shows a lot of analogies to complex analysis, the situation is more complicated due to the non-commutative multiplication. Thus, a fundamental theorem of algebra is not available, and standard tools from linear algebra cannot be applied in the usual way. To overcome these problems, a special system of monogenic polynomials the so-called Pseudo Complex Polynomials, sharing some properties of complex powers, is used. In this paper, we present an approach to deal with the interpolation problem, where solutions of elasticity equations in three dimensions are used as an interpolation basis.

BLAS (Basic Linear Algebra Subroutines), Linear Algebra Modules and Supercomputers.

DTIC Science & Technology

1984-12-31

the BLAS, Dodson and Lewis C.Remarks on "A. Proposal for a New Set of BLAS", Hanson D. Standard MSC/ NASTRAN Kernels, Komzsik E. Summary of Functions...Fortran names and that character string arguments for the BLAS could provide incr-ased naturalrness in the n3aL,’cs. D ’:andard MSC/ NASTRAN Kernels. Louis...Komnzsik, 8 pages. NASTRAN is a very large structural engineering system marketed by MacNeal- Schwvrdler Corp. (MSC). They are interested in

Optical linear algebra processors - Architectures and algorithms

NASA Technical Reports Server (NTRS)

Casasent, David

1986-01-01

Attention is given to the component design and optical configuration features of a generic optical linear algebra processor (OLAP) architecture, as well as the large number of OLAP architectures, number representations, algorithms and applications encountered in current literature. Number-representation issues associated with bipolar and complex-valued data representations, high-accuracy (including floating point) performance, and the base or radix to be employed, are discussed, together with case studies on a space-integrating frequency-multiplexed architecture and a hybrid space-integrating and time-integrating multichannel architecture.

Proceedings of the Tenth Annual National Conference on Ada Technology. Held in Arlington, VA, on February 24-28, 1992

DTIC Science & Technology

1992-02-01

Newsletter, Vol. 5, No. 1, January 1983 be translated from HAL’S. 4. Klumpp, Allan R., An Ada Linear Algebra Software development costs for using the...a linear algebra approach to As noted above, the concept of the problem and address the problem of unitdimensional analysis extends beyond problems...you will join us again next year. The 11th Annual Conference on Ada Technology (1993) will be held here at the Hyatt Regency - Crystal City

Secondary School Mathematics Curriculum Improvement Study Information Bulletin 7.

ERIC Educational Resources Information Center

Secondary School Mathematics Curriculum Improvement Study, New York, NY.

The background, objectives, and design of Secondary School Mathematics Curriculum Improvement Study (SSMCIS) are summarized. Details are given of the content of the text series, "Unified Modern Mathematics," in the areas of algebra, geometry, linear algebra, probability and statistics, analysis (calculus), logic, and computer…

Architecture for one-shot compressive imaging using computer-generated holograms.

PubMed

Macfaden, Alexander J; Kindness, Stephen J; Wilkinson, Timothy D

2016-09-10

We propose a synchronous implementation of compressive imaging. This method is mathematically equivalent to prevailing sequential methods, but uses a static holographic optical element to create a spatially distributed spot array from which the image can be reconstructed with an instantaneous measurement. We present the holographic design requirements and demonstrate experimentally that the linear algebra of compressed imaging can be implemented with this technique. We believe this technique can be integrated with optical metasurfaces, which will allow the development of new compressive sensing methods.

Some estimation formulae for continuous time-invariant linear systems

NASA Technical Reports Server (NTRS)

Bierman, G. J.; Sidhu, G. S.

1975-01-01

In this brief paper we examine a Riccati equation decomposition due to Reid and Lainiotis and apply the result to the continuous time-invariant linear filtering problem. Exploitation of the time-invariant structure leads to integration-free covariance recursions which are of use in covariance analyses and in filter implementations. A super-linearly convergent iterative solution to the algebraic Riccati equation (ARE) is developed. The resulting algorithm, arranged in a square-root form, is thought to be numerically stable and competitive with other ARE solution methods. Certain covariance relations that are relevant to the fixed-point and fixed-lag smoothing problems are also discussed.

Simultaneous quantification of protein phosphorylation sites using liquid chromatography-tandem mass spectrometry-based targeted proteomics: a linear algebra approach for isobaric phosphopeptides.

PubMed

Xu, Feifei; Yang, Ting; Sheng, Yuan; Zhong, Ting; Yang, Mi; Chen, Yun

2014-12-05

As one of the most studied post-translational modifications (PTM), protein phosphorylation plays an essential role in almost all cellular processes. Current methods are able to predict and determine thousands of phosphorylation sites, whereas stoichiometric quantification of these sites is still challenging. Liquid chromatography coupled with tandem mass spectrometry (LC-MS/MS)-based targeted proteomics is emerging as a promising technique for site-specific quantification of protein phosphorylation using proteolytic peptides as surrogates of proteins. However, several issues may limit its application, one of which relates to the phosphopeptides with different phosphorylation sites and the same mass (i.e., isobaric phosphopeptides). While employment of site-specific product ions allows for these isobaric phosphopeptides to be distinguished and quantified, site-specific product ions are often absent or weak in tandem mass spectra. In this study, linear algebra algorithms were employed as an add-on to targeted proteomics to retrieve information on individual phosphopeptides from their common spectra. To achieve this simultaneous quantification, a LC-MS/MS-based targeted proteomics assay was first developed and validated for each phosphopeptide. Given the slope and intercept of calibration curves of phosphopeptides in each transition, linear algebraic equations were developed. Using a series of mock mixtures prepared with varying concentrations of each phosphopeptide, the reliability of the approach to quantify isobaric phosphopeptides containing multiple phosphorylation sites (≥ 2) was discussed. Finally, we applied this approach to determine the phosphorylation stoichiometry of heat shock protein 27 (HSP27) at Ser78 and Ser82 in breast cancer cells and tissue samples.

A genotype probability index for multiple alleles and haplotypes.

PubMed

Percy, A; Kinghorn, B P

2005-12-01

We use linear algebra to calculate an index of information content in genotype probabilities which has previously been calculated using trigonometry. The new method can be generalized allowing the index to be calculated for loci with more than two alleles. Applications of this index include its use in genotyping strategies, strategies to manage genetic disorders and in estimation of genotype effects.

Construction of Ligand Group Orbitals for Polyatomics and Transition-Metal Complexes Using an Intuitive Symmetry-Based Approach

ERIC Educational Resources Information Center

Johnson, Adam R.

2013-01-01

A molecular orbital (MO) diagram, especially its frontier orbitals, explains the bonding and reactivity for a chemical compound. It is therefore important for students to learn how to construct one. The traditional methods used to derive these diagrams rely on linear algebra techniques to combine ligand orbitals into symmetry-adapted linear…

A density matrix-based method for the linear-scaling calculation of dynamic second- and third-order properties at the Hartree-Fock and Kohn-Sham density functional theory levels.

PubMed

Kussmann, Jörg; Ochsenfeld, Christian

2007-11-28

A density matrix-based time-dependent self-consistent field (D-TDSCF) method for the calculation of dynamic polarizabilities and first hyperpolarizabilities using the Hartree-Fock and Kohn-Sham density functional theory approaches is presented. The D-TDSCF method allows us to reduce the asymptotic scaling behavior of the computational effort from cubic to linear for systems with a nonvanishing band gap. The linear scaling is achieved by combining a density matrix-based reformulation of the TDSCF equations with linear-scaling schemes for the formation of Fock- or Kohn-Sham-type matrices. In our reformulation only potentially linear-scaling matrices enter the formulation and efficient sparse algebra routines can be employed. Furthermore, the corresponding formulas for the first hyperpolarizabilities are given in terms of zeroth- and first-order one-particle reduced density matrices according to Wigner's (2n+1) rule. The scaling behavior of our method is illustrated for first exemplary calculations with systems of up to 1011 atoms and 8899 basis functions.

Problems Relating Mathematics and Science in the High School.

ERIC Educational Resources Information Center

Morrow, Richard; Beard, Earl

This document contains various science problems which require a mathematical solution. The problems are arranged under two general areas. The first (algebra I) contains biology, chemistry, and physics problems which require solutions related to linear equations, exponentials, and nonlinear equations. The second (algebra II) contains physics…

Now & Then: Roger Whitmore, Police Officer.

ERIC Educational Resources Information Center

Barnes, Sue; Michalowicz, Karen Dee

1995-01-01

Discusses police officers' use of mathematics when reconstructing an accident scene; and the history of algebra, including al-Khwarizmi's works on the theory of equations, the Rhind Papyrus, a Chinese and an Indian manuscript on systems of linear and quadratic equations, and Diophantus'"syncopated algebra." (10 references) (EK)

Efficient and Robust Optimization for Building Energy Simulation

PubMed Central

Pourarian, Shokouh; Kearsley, Anthony; Wen, Jin; Pertzborn, Amanda

2016-01-01

Efficiently, robustly and accurately solving large sets of structured, non-linear algebraic and differential equations is one of the most computationally expensive steps in the dynamic simulation of building energy systems. Here, the efficiency, robustness and accuracy of two commonly employed solution methods are compared. The comparison is conducted using the HVACSIM+ software package, a component based building system simulation tool. The HVACSIM+ software presently employs Powell’s Hybrid method to solve systems of nonlinear algebraic equations that model the dynamics of energy states and interactions within buildings. It is shown here that the Powell’s method does not always converge to a solution. Since a myriad of other numerical methods are available, the question arises as to which method is most appropriate for building energy simulation. This paper finds considerable computational benefits result from replacing the Powell’s Hybrid method solver in HVACSIM+ with a solver more appropriate for the challenges particular to numerical simulations of buildings. Evidence is provided that a variant of the Levenberg-Marquardt solver has superior accuracy and robustness compared to the Powell’s Hybrid method presently used in HVACSIM+. PMID:27325907

Efficient and Robust Optimization for Building Energy Simulation.

PubMed

Pourarian, Shokouh; Kearsley, Anthony; Wen, Jin; Pertzborn, Amanda

2016-06-15

Efficiently, robustly and accurately solving large sets of structured, non-linear algebraic and differential equations is one of the most computationally expensive steps in the dynamic simulation of building energy systems. Here, the efficiency, robustness and accuracy of two commonly employed solution methods are compared. The comparison is conducted using the HVACSIM+ software package, a component based building system simulation tool. The HVACSIM+ software presently employs Powell's Hybrid method to solve systems of nonlinear algebraic equations that model the dynamics of energy states and interactions within buildings. It is shown here that the Powell's method does not always converge to a solution. Since a myriad of other numerical methods are available, the question arises as to which method is most appropriate for building energy simulation. This paper finds considerable computational benefits result from replacing the Powell's Hybrid method solver in HVACSIM+ with a solver more appropriate for the challenges particular to numerical simulations of buildings. Evidence is provided that a variant of the Levenberg-Marquardt solver has superior accuracy and robustness compared to the Powell's Hybrid method presently used in HVACSIM+.

Smooth function approximation using neural networks.

PubMed

Ferrari, Silvia; Stengel, Robert F

2005-01-01

An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

Structure of Lie point and variational symmetry algebras for a class of odes

NASA Astrophysics Data System (ADS)

Ndogmo, J. C.

2018-04-01

It is known for scalar ordinary differential equations, and for systems of ordinary differential equations of order not higher than the third, that their Lie point symmetry algebras is of maximal dimension if and only if they can be reduced by a point transformation to the trivial equation y(n)=0. For arbitrary systems of ordinary differential equations of order n ≥ 3 reducible by point transformations to the trivial equation, we determine the complete structure of their Lie point symmetry algebras as well as that for their variational, and their divergence symmetry algebras. As a corollary, we obtain the maximal dimension of the Lie point symmetry algebra for any system of linear or nonlinear ordinary differential equations.

Numerical methods for solving moment equations in kinetic theory of neuronal network dynamics

NASA Astrophysics Data System (ADS)

Rangan, Aaditya V.; Cai, David; Tao, Louis

2007-02-01

Recently developed kinetic theory and related closures for neuronal network dynamics have been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The moment equations arising from the kinetic theory are a system of (1 + 1)-dimensional nonlinear partial differential equations (PDE) on a bounded domain with nonlinear boundary conditions. The PDEs themselves are self-consistently specified by parameters which are functions of the boundary values of the solution. The moment equations can be stiff in space and time. Numerical methods are presented here for efficiently and accurately solving these moment equations. The essential ingredients in our numerical methods include: (i) the system is discretized in time with an implicit Euler method within a spectral deferred correction framework, therefore, the PDEs of the kinetic theory are reduced to a sequence, in time, of boundary value problems (BVPs) with nonlinear boundary conditions; (ii) a set of auxiliary parameters is introduced to recast the original BVP with nonlinear boundary conditions as BVPs with linear boundary conditions - with additional algebraic constraints on the auxiliary parameters; (iii) a careful combination of two Newton's iterates for the nonlinear BVP with linear boundary condition, interlaced with a Newton's iterate for solving the associated algebraic constraints is constructed to achieve quadratic convergence for obtaining the solutions with self-consistent parameters. It is shown that a simple fixed-point iteration can only achieve a linear convergence for the self-consistent parameters. The practicability and efficiency of our numerical methods for solving the moment equations of the kinetic theory are illustrated with numerical examples. It is further demonstrated that the moment equations derived from the kinetic theory of neuronal network dynamics can very well capture the coarse-grained dynamical properties of integrate-and-fire neuronal networks.

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1991-01-01

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Symbolic-numeric interface: A review

NASA Technical Reports Server (NTRS)

Ng, E. W.

1980-01-01

A survey of the use of a combination of symbolic and numerical calculations is presented. Symbolic calculations primarily refer to the computer processing of procedures from classical algebra, analysis, and calculus. Numerical calculations refer to both numerical mathematics research and scientific computation. This survey is intended to point out a large number of problem areas where a cooperation of symbolic and numerical methods is likely to bear many fruits. These areas include such classical operations as differentiation and integration, such diverse activities as function approximations and qualitative analysis, and such contemporary topics as finite element calculations and computation complexity. It is contended that other less obvious topics such as the fast Fourier transform, linear algebra, nonlinear analysis and error analysis would also benefit from a synergistic approach.

A Note on Multigrid Theory for Non-nested Grids and/or Quadrature

NASA Technical Reports Server (NTRS)

Douglas, C. C.; Douglas, J., Jr.; Fyfe, D. E.

1996-01-01

We provide a unified theory for multilevel and multigrid methods when the usual assumptions are not present. For example, we do not assume that the solution spaces or the grids are nested. Further, we do not assume that there is an algebraic relationship between the linear algebra problems on different levels. What we provide is a computationally useful theory for adaptively changing levels. Theory is provided for multilevel correction schemes, nested iteration schemes, and one way (i.e., coarse to fine grid with no correction iterations) schemes. We include examples showing the applicability of this theory: finite element examples using quadrature in the matrix assembly and finite volume examples with non-nested grids. Our theory applies directly to other discretizations as well.

Deformations of vector-scalar models

NASA Astrophysics Data System (ADS)

Barnich, Glenn; Boulanger, Nicolas; Henneaux, Marc; Julia, Bernard; Lekeu, Victor; Ranjbar, Arash

2018-02-01

Abelian vector fields non-minimally coupled to uncharged scalar fields arise in many contexts. We investigate here through algebraic methods their consistent deformations ("gaugings"), i.e., the deformations that preserve the number (but not necessarily the form or the algebra) of the gauge symmetries. Infinitesimal consistent deformations are given by the BRST cohomology classes at ghost number zero. We parametrize explicitly these classes in terms of various types of global symmetries and corresponding Noether currents through the characteristic cohomology related to antifields and equations of motion. The analysis applies to all ghost numbers and not just ghost number zero. We also provide a systematic discussion of the linear and quadratic constraints on these parameters that follow from higher-order consistency. Our work is relevant to the gaugings of extended supergravities.

Dirac delta representation by exact parametric equations.. Application to impulsive vibration systems

NASA Astrophysics Data System (ADS)

Chicurel-Uziel, Enrique

2007-08-01

A pair of closed parametric equations are proposed to represent the Heaviside unit step function. Differentiating the step equations results in two additional parametric equations, that are also hereby proposed, to represent the Dirac delta function. These equations are expressed in algebraic terms and are handled by means of elementary algebra and elementary calculus. The proposed delta representation complies exactly with the values of the definition. It complies also with the sifting property and the requisite unit area and its Laplace transform coincides with the most general form given in the tables. Furthermore, it leads to a very simple method of solution of impulsive vibrating systems either linear or belonging to a large class of nonlinear problems. Two example solutions are presented.

Processes and Reasoning in Representations of Linear Functions

ERIC Educational Resources Information Center

Adu-Gyamfi, Kwaku; Bossé, Michael J.

2014-01-01

This study examined student actions, interpretations, and language in respect to questions raised regarding tabular, graphical, and algebraic representations in the context of functions. The purpose was to investigate students' interpretations and specific ways of working within table, graph, and the algebraic on notions fundamental to a…

Teaching Algebraic Equations to Middle School Students with Intellectual Disabilities

ERIC Educational Resources Information Center

Baker, Joshua N.; Rivera, Christopher J.; Morgan, Joseph John; Reese, Noelle

2015-01-01

The purpose of this study was to replicate similar instructional techniques of Jimenez, Browder, and Courtade (2008) using a single-subject multiple-probe across participants design to investigate the effects of task analytic instruction coupled with semi-concrete representations to teach linear algebraic equations to middle school students with…

Generalized Heisenberg algebra and (non linear) pseudo-bosons

NASA Astrophysics Data System (ADS)

Bagarello, F.; Curado, E. M. F.; Gazeau, J. P.

2018-04-01

We propose a deformed version of the generalized Heisenberg algebra by using techniques borrowed from the theory of pseudo-bosons. In particular, this analysis is relevant when non self-adjoint Hamiltonians are needed to describe a given physical system. We also discuss relations with nonlinear pseudo-bosons. Several examples are discussed.

The Jukes-Cantor Model of Molecular Evolution

ERIC Educational Resources Information Center

Erickson, Keith

2010-01-01

The material in this module introduces students to some of the mathematical tools used to examine molecular evolution. This topic is standard fare in many mathematical biology or bioinformatics classes, but could also be suitable for classes in linear algebra or probability. While coursework in matrix algebra, Markov processes, Monte Carlo…

Racing against Time: Using Technology To Explore Distance, Rate, and Time.

ERIC Educational Resources Information Center

Essex, N. Kathryn; Lambdin, Diana V.; McGraw, Rebecca H.

2002-01-01

Investigates ways to analyze change in various contexts. Focuses on computer technology providing contexts for children's investigations of patterns of change and helping to develop foundational ideas of algebra and calculus. Discusses relationships between patterns of change, fundamental algebraic notions as linear and nonlinear functions, and…

Thinking Visually about Algebra

ERIC Educational Resources Information Center

Baroudi, Ziad

2015-01-01

Many introductions to algebra in high school begin with teaching students to generalise linear numerical patterns. This article argues that this approach needs to be changed so that students encounter variables in the context of modelling visual patterns so that the variables have a meaning. The article presents sample classroom activities,…

Prospective Mathematics Teachers' Sense Making of Polynomial Multiplication and Factorization Modeled with Algebra Tiles

ERIC Educational Resources Information Center

Caglayan, Günhan

2013-01-01

This study is about prospective secondary mathematics teachers' understanding and sense making of representational quantities generated by algebra tiles, the quantitative units (linear vs. areal) inherent in the nature of these quantities, and the quantitative addition and multiplication operations--referent preserving versus referent…

Parallel Dynamics Simulation Using a Krylov-Schwarz Linear Solution Scheme

DOE PAGES

Abhyankar, Shrirang; Constantinescu, Emil M.; Smith, Barry F.; ...

2016-11-07

Fast dynamics simulation of large-scale power systems is a computational challenge because of the need to solve a large set of stiff, nonlinear differential-algebraic equations at every time step. The main bottleneck in dynamic simulations is the solution of a linear system during each nonlinear iteration of Newton’s method. In this paper, we present a parallel Krylov- Schwarz linear solution scheme that uses the Krylov subspacebased iterative linear solver GMRES with an overlapping restricted additive Schwarz preconditioner. As a result, performance tests of the proposed Krylov-Schwarz scheme for several large test cases ranging from 2,000 to 20,000 buses, including amore » real utility network, show good scalability on different computing architectures.« less

Parallel Dynamics Simulation Using a Krylov-Schwarz Linear Solution Scheme

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

Abhyankar, Shrirang; Constantinescu, Emil M.; Smith, Barry F.

Fast dynamics simulation of large-scale power systems is a computational challenge because of the need to solve a large set of stiff, nonlinear differential-algebraic equations at every time step. The main bottleneck in dynamic simulations is the solution of a linear system during each nonlinear iteration of Newton’s method. In this paper, we present a parallel Krylov- Schwarz linear solution scheme that uses the Krylov subspacebased iterative linear solver GMRES with an overlapping restricted additive Schwarz preconditioner. As a result, performance tests of the proposed Krylov-Schwarz scheme for several large test cases ranging from 2,000 to 20,000 buses, including amore » real utility network, show good scalability on different computing architectures.« less

Quantized Algebra I Texts

NASA Astrophysics Data System (ADS)

DeBuvitz, William

2014-03-01

I am a volunteer reader at the Princeton unit of "Learning Ally" (formerly "Recording for the Blind & Dyslexic") and I recently discovered that high school students are introduced to the concept of quantization well before they take chemistry and physics. For the past few months I have been reading onto computer files a popular Algebra I textbook, and I was surprised and dismayed by how it treated simultaneous equations and quadratic equations. The coefficients are always simple integers in examples and exercises, even when they are related to physics. This is probably a good idea when these topics are first presented to the students. It makes it easy to solve simultaneous equations by the method of elimination of a variable. And it makes it easy to solve some quadratic equations by factoring. The textbook also discusses the method of substitution for linear equations and the use of the quadratic formula, but only with simple integers.

Generalized channeled polarimetry.

PubMed

Alenin, Andrey S; Tyo, J Scott

2014-05-01

Channeled polarimeters measure polarization by modulating the measured intensity in order to create polarization-dependent channels that can be demodulated to reveal the desired polarization information. A number of channeled systems have been described in the past, but their proposed designs often unintentionally sacrifice optimality for ease of algebraic reconstruction. To obtain more optimal systems, a generalized treatment of channeled polarimeters is required. This paper describes methods that enable handling of multi-domain modulations and reconstruction of polarization information using linear algebra. We make practical choices regarding use of either Fourier or direct channels to make these methods more immediately useful. Employing the introduced concepts to optimize existing systems often results in superficial system changes, like changing the order, orientation, thickness, or spacing of polarization elements. For the two examples we consider, we were able to reduce noise in the reconstruction to 34.1% and 57.9% of the original design values.

AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1994-01-01

This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.

Super-Laplacians and their symmetries

NASA Astrophysics Data System (ADS)

Howe, P. S.; Lindström, U.

2017-05-01

A super-Laplacian is a set of differential operators in superspace whose highestdimensional component is given by the spacetime Laplacian. Symmetries of super-Laplacians are given by linear differential operators of arbitrary finite degree and are determined by superconformal Killing tensors. We investigate these in flat superspaces. The differential operators determining the symmetries give rise to algebras which can be identified in many cases with the tensor algebras of the relevant superconformal Lie algebras modulo certain ideals. They have applications to Higher Spin theories.

Anti-commutative Gröbner-Shirshov basis of a free Lie algebra

NASA Astrophysics Data System (ADS)

Bokut, L. A.; Chen, Yuqun; Li, Yu

2009-03-01

One of the natural ways to prove that the Hall words (Philip Hall, 1933) consist of a basis of a free Lie algebra is a direct construction: to start with a linear space spanned by Hall words, to define the Lie product of Hall words, and then to check that the product yields the Lie identities (Marshall Hall, 1950). Here we suggest another way using the Composition-Diamond lemma for free anti-commutative (non-associative) algebras (A.I. Shirshov, 1962).

Cryptographic Properties of Monotone Boolean Functions

DTIC Science & Technology

2016-01-01

Algebraic attacks on stream ciphers with linear feedback, in: Advances in Cryptology (Eurocrypt 2003), Lecture Notes in Comput. Sci. 2656, Springer, Berlin...spectrum, algebraic immu- nity MSC 2010: 06E30, 94C10, 94A60, 11T71, 05E99 || Communicated by: Carlo Blundo 1 Introduction Let F 2 be the prime eld of...7]. For the reader’s convenience, we recall some basic notions below. Any f ∈ Bn can be expressed in algebraic normal form (ANF) as f(x 1 , x 2

LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators

NASA Astrophysics Data System (ADS)

Gonzalez, Juan; Núñez, Rafael C.

2009-07-01

We present LAPACKrc, a family of FPGA-based linear algebra solvers able to achieve more than 100x speedup per commodity processor on certain problems. LAPACKrc subsumes some of the LAPACK and ScaLAPACK functionalities, and it also incorporates sparse direct and iterative matrix solvers. Current LAPACKrc prototypes demonstrate between 40x-150x speedup compared against top-of-the-line hardware/software systems. A technology roadmap is in place to validate current performance of LAPACKrc in HPC applications, and to increase the computational throughput by factors of hundreds within the next few years.

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

Heroux, Michael Allen; Marker, Bryan

This report summarizes the progress made as part of a one year lab-directed research and development (LDRD) project to fund the research efforts of Bryan Marker at the University of Texas at Austin. The goal of the project was to develop new techniques for automatically tuning the performance of dense linear algebra kernels. These kernels often represent the majority of computational time in an application. The primary outcome from this work is a demonstration of the value of model driven engineering as an approach to accurately predict and study performance trade-offs for dense linear algebra computations.

Basic linear algebra subprograms for FORTRAN usage

NASA Technical Reports Server (NTRS)

Lawson, C. L.; Hanson, R. J.; Kincaid, D. R.; Krogh, F. T.

1977-01-01

A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented. The package is intended to be used with FORTRAN. The operations in the package are dot products, elementary vector operations, Givens transformations, vector copy and swap, vector norms, vector scaling, and the indices of components of largest magnitude. The subprograms and a test driver are available in portable FORTRAN. Versions of the subprograms are also provided in assembly language for the IBM 360/67, the CDC 6600 and CDC 7600, and the Univac 1108.

Preconditioned conjugate gradient methods for the compressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.

1990-01-01

The compressible Navier-Stokes equations are solved for a variety of two-dimensional inviscid and viscous problems by preconditioned conjugate gradient-like algorithms. Roe's flux difference splitting technique is used to discretize the inviscid fluxes. The viscous terms are discretized by using central differences. An algebraic turbulence model is also incorporated. The system of linear equations which arises out of the linearization of a fully implicit scheme is solved iteratively by the well known methods of GMRES (Generalized Minimum Residual technique) and Chebyschev iteration. Incomplete LU factorization and block diagonal factorization are used as preconditioners. The resulting algorithm is competitive with the best current schemes, but has wide applications in parallel computing and unstructured mesh computations.

Instability of the cored barotropic disc: the linear eigenvalue formulation

NASA Astrophysics Data System (ADS)

Polyachenko, E. V.

2018-05-01

Gaseous rotating razor-thin discs are a testing ground for theories of spiral structure that try to explain appearance and diversity of disc galaxy patterns. These patterns are believed to arise spontaneously under the action of gravitational instability, but calculations of its characteristics in the gas are mostly obscured. The paper suggests a new method for finding the spiral patterns based on an expansion of small amplitude perturbations over Lagrange polynomials in small radial elements. The final matrix equation is extracted from the original hydrodynamical equations without the use of an approximate theory and has a form of the linear algebraic eigenvalue problem. The method is applied to a galactic model with the cored exponential density profile.

Tracking control of concentration profiles in a fed-batch bioreactor using a linear algebra methodology.

PubMed

Rómoli, Santiago; Serrano, Mario Emanuel; Ortiz, Oscar Alberto; Vega, Jorge Rubén; Eduardo Scaglia, Gustavo Juan

2015-07-01

Based on a linear algebra approach, this paper aims at developing a novel control law able to track reference profiles that were previously-determined in the literature. A main advantage of the proposed strategy is that the control actions are obtained by solving a system of linear equations. The optimal controller parameters are selected through Monte Carlo Randomized Algorithm in order to minimize a proposed cost index. The controller performance is evaluated through several tests, and compared with other controller reported in the literature. Finally, a Monte Carlo Randomized Algorithm is conducted to assess the performance of the proposed controller. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Real-time adaptive finite element solution of time-dependent Kohn-Sham equation

NASA Astrophysics Data System (ADS)

Bao, Gang; Hu, Guanghui; Liu, Di

2015-01-01

In our previous paper (Bao et al., 2012 [1]), a general framework of using adaptive finite element methods to solve the Kohn-Sham equation has been presented. This work is concerned with solving the time-dependent Kohn-Sham equations. The numerical methods are studied in the time domain, which can be employed to explain both the linear and the nonlinear effects. A Crank-Nicolson scheme and linear finite element space are employed for the temporal and spatial discretizations, respectively. To resolve the trouble regions in the time-dependent simulations, a heuristic error indicator is introduced for the mesh adaptive methods. An algebraic multigrid solver is developed to efficiently solve the complex-valued system derived from the semi-implicit scheme. A mask function is employed to remove or reduce the boundary reflection of the wavefunction. The effectiveness of our method is verified by numerical simulations for both linear and nonlinear phenomena, in which the effectiveness of the mesh adaptive methods is clearly demonstrated.

Investigating Integer Restrictions in Linear Programming

ERIC Educational Resources Information Center

Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.

2015-01-01

Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…

Differential Geometry and Lie Groups for Physicists

NASA Astrophysics Data System (ADS)

Fecko, Marián.

2006-10-01

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

Differential Geometry and Lie Groups for Physicists

NASA Astrophysics Data System (ADS)

Fecko, Marián.

2011-03-01

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

Linear-scaling density-functional simulations of charged point defects in Al2O3 using hierarchical sparse matrix algebra.

PubMed

Hine, N D M; Haynes, P D; Mostofi, A A; Payne, M C

2010-09-21

We present calculations of formation energies of defects in an ionic solid (Al(2)O(3)) extrapolated to the dilute limit, corresponding to a simulation cell of infinite size. The large-scale calculations required for this extrapolation are enabled by developments in the approach to parallel sparse matrix algebra operations, which are central to linear-scaling density-functional theory calculations. The computational cost of manipulating sparse matrices, whose sizes are determined by the large number of basis functions present, is greatly improved with this new approach. We present details of the sparse algebra scheme implemented in the ONETEP code using hierarchical sparsity patterns, and demonstrate its use in calculations on a wide range of systems, involving thousands of atoms on hundreds to thousands of parallel processes.

Asymptotic identity in min-plus algebra: a report on CPNS.

PubMed

Li, Ming; Zhao, Wei

2012-01-01

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions.

Asymptotic Identity in Min-Plus Algebra: A Report on CPNS

PubMed Central

Li, Ming; Zhao, Wei

2012-01-01

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions. PMID:21822446

Linear network representation of multistate models of transport.

PubMed Central

Sandblom, J; Ring, A; Eisenman, G

1982-01-01

By introducing external driving forces in rate-theory models of transport we show how the Eyring rate equations can be transformed into Ohm's law with potentials that obey Kirchhoff's second law. From such a formalism the state diagram of a multioccupancy multicomponent system can be directly converted into linear network with resistors connecting nodal (branch) points and with capacitances connecting each nodal point with a reference point. The external forces appear as emf or current generators in the network. This theory allows the algebraic methods of linear network theory to be used in solving the flux equations for multistate models and is particularly useful for making proper simplifying approximation in models of complex membrane structure. Some general properties of linear network representation are also deduced. It is shown, for instance, that Maxwell's reciprocity relationships of linear networks lead directly to Onsager's relationships in the near equilibrium region. Finally, as an example of the procedure, the equivalent circuit method is used to solve the equations for a few transport models. PMID:7093425

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.

Line defect Schur indices, Verlinde algebras and U(1) r fixed points

NASA Astrophysics Data System (ADS)

Neitzke, Andrew; Yan, Fei

2017-11-01

Given an N=2 superconformal field theory, we reconsider the Schur index ℐ L ( q) in the presence of a half line defect L. Recently Cordova-Gaiotto-Shao found that ℐ L ( q) admits an expansion in terms of characters of the chiral algebra A introduced by Beem et al., with simple coefficients υ L, β ( q). We report a puzzling new feature of this expansion: the q → 1 limit of the coefficients υ L, β ( q) is linearly related to the vacuum expectation values 〈 L〉 in U(1) r -invariant vacua of the theory compactified on S 1. This relation can be expressed algebraically as a commutative diagram involving three algebras: the algebra generated by line defects, the algebra of functions on U(1) r -invariant vacua, and a Verlindelike algebra associated to A . Our evidence is experimental, by direct computation in the Argyres-Douglas theories of type ( A 1, A 2), ( A 1, A 4), ( A 1, A 6), ( A 1, D 3) and ( A 1, D 5). In the latter two theories, which have flavor symmetries, the Verlinde-like algebra which appears is a new deformation of algebras previously considered.

Bicycles, Birds, Bats and Balloons: New Applications for Algebra Classes.

ERIC Educational Resources Information Center

Yoshiwara, Bruce; Yoshiwara, Kathy

This collection of activities is intended to enhance the teaching of college algebra through the use of modeling. The problems use real data and involve the representation and interpretation of the data. The concepts addressed include rates of change, linear and quadratic regression, and functions. The collection consists of eight problems, four…

A Third Grader's Way of Thinking about Linear Function Tables

ERIC Educational Resources Information Center

Martinez, Mara; Brizuela, Barbara M.

2006-01-01

This paper is inscribed within the research effort to produce evidence regarding primary school students' learning of algebra. Given the results obtained so far in the research community, we are convinced that young elementary school students can successfully learn algebra. Moreover, children this young can make use of different representational…

Unification of the general non-linear sigma model and the Virasoro master equation

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

Boer, J. de; Halpern, M.B.

1997-06-01

The Virasoro master equation describes a large set of conformal field theories known as the affine-Virasoro constructions, in the operator algebra (affinie Lie algebra) of the WZW model, while the einstein equations of the general non-linear sigma model describe another large set of conformal field theories. This talk summarizes recent work which unifies these two sets of conformal field theories, together with a presumable large class of new conformal field theories. The basic idea is to consider spin-two operators of the form L{sub ij}{partial_derivative}x{sup i}{partial_derivative}x{sup j} in the background of a general sigma model. The requirement that these operators satisfymore » the Virasoro algebra leads to a set of equations called the unified Einstein-Virasoro master equation, in which the spin-two spacetime field L{sub ij} cuples to the usual spacetime fields of the sigma model. The one-loop form of this unified system is presented, and some of its algebraic and geometric properties are discussed.« less

Lightning Radio Source Retrieval Using Advanced Lightning Direction Finder (ALDF) Networks

NASA Technical Reports Server (NTRS)

Koshak, William J.; Blakeslee, Richard J.; Bailey, J. C.

1998-01-01

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing and arrival time of lightning radio emissions. Solutions for the plane (i.e., no Earth curvature) are provided that implement all of tile measurements mentioned above. Tests of the retrieval method are provided using computer-simulated data sets. We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. In the absence of measurement errors, quadratic root degeneracy (no source location ambiguity) is shown to exist exactly on the outer sensor baselines for arbitrary non-collinear network geometries. The accuracy of the quadratic planar method is tested with computer generated data sets. The results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 deg. We also note some of the advantages and disadvantages of these methods over the nonlinear method of chi(sup 2) minimization employed by the National Lightning Detection Network (NLDN) and discussed in Cummins et al.(1993, 1995, 1998).

Incomplete Gröbner basis as a preconditioner for polynomial systems

NASA Astrophysics Data System (ADS)

Sun, Yang; Tao, Yu-Hui; Bai, Feng-Shan

2009-04-01

Precondition plays a critical role in the numerical methods for large and sparse linear systems. It is also true for nonlinear algebraic systems. In this paper incomplete Gröbner basis (IGB) is proposed as a preconditioner of homotopy methods for polynomial systems of equations, which transforms a deficient system into a system with the same finite solutions, but smaller degree. The reduced system can thus be solved faster. Numerical results show the efficiency of the preconditioner.

Anytime query-tuned kernel machine classifiers via Cholesky factorization

NASA Technical Reports Server (NTRS)

DeCoste, D.

2002-01-01

We recently demonstrated 2 to 64-fold query-time speedups of Support Vector Machine and Kernel Fisher classifiers via a new computational geometry method for anytime output bounds (DeCoste,2002). This new paper refines our approach in two key ways. First, we introduce a simple linear algebra formulation based on Cholesky factorization, yielding simpler equations and lower computational overhead. Second, this new formulation suggests new methods for achieving additional speedups, including tuning on query samples. We demonstrate effectiveness on benchmark datasets.

The Use of Generalized Laguerre Polynomials in Spectral Methods for Solving Fractional Delay Differential Equations.

PubMed

Khader, M M

2013-10-01

In this paper, an efficient numerical method for solving the fractional delay differential equations (FDDEs) is considered. The fractional derivative is described in the Caputo sense. The proposed method is based on the derived approximate formula of the Laguerre polynomials. The properties of Laguerre polynomials are utilized to reduce FDDEs to a linear or nonlinear system of algebraic equations. Special attention is given to study the error and the convergence analysis of the proposed method. Several numerical examples are provided to confirm that the proposed method is in excellent agreement with the exact solution.

Proteus-MOC: A 3D deterministic solver incorporating 2D method of characteristics

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

Marin-Lafleche, A.; Smith, M. A.; Lee, C.

2013-07-01

A new transport solution methodology was developed by combining the two-dimensional method of characteristics with the discontinuous Galerkin method for the treatment of the axial variable. The method, which can be applied to arbitrary extruded geometries, was implemented in PROTEUS-MOC and includes parallelization in group, angle, plane, and space using a top level GMRES linear algebra solver. Verification tests were performed to show accuracy and stability of the method with the increased number of angular directions and mesh elements. Good scalability with parallelism in angle and axial planes is displayed. (authors)

Iterative algorithms for computing the feedback Nash equilibrium point for positive systems

NASA Astrophysics Data System (ADS)

Ivanov, I.; Imsland, Lars; Bogdanova, B.

2017-03-01

The paper studies N-player linear quadratic differential games on an infinite time horizon with deterministic feedback information structure. It introduces two iterative methods (the Newton method as well as its accelerated modification) in order to compute the stabilising solution of a set of generalised algebraic Riccati equations. The latter is related to the Nash equilibrium point of the considered game model. Moreover, we derive the sufficient conditions for convergence of the proposed methods. Finally, we discuss two numerical examples so as to illustrate the performance of both of the algorithms.

An efficient computer based wavelets approximation method to solve Fuzzy boundary value differential equations

NASA Astrophysics Data System (ADS)

Alam Khan, Najeeb; Razzaq, Oyoon Abdul

2016-03-01

In the present work a wavelets approximation method is employed to solve fuzzy boundary value differential equations (FBVDEs). Essentially, a truncated Legendre wavelets series together with the Legendre wavelets operational matrix of derivative are utilized to convert FB- VDE into a simple computational problem by reducing it into a system of fuzzy algebraic linear equations. The capability of scheme is investigated on second order FB- VDE considered under generalized H-differentiability. Solutions are represented graphically showing competency and accuracy of this method.

Prediction of free turbulent mixing using a turbulent kinetic energy method

NASA Technical Reports Server (NTRS)

Harsha, P. T.

1973-01-01

Free turbulent mixing of two-dimensional and axisymmetric one- and two-stream flows is analyzed by a relatively simple turbulent kinetic energy method. This method incorporates a linear relationship between the turbulent shear and the turbulent kinetic energy and an algebraic relationship for the length scale appearing in the turbulent kinetic energy equation. Good results are obtained for a wide variety of flows. The technique is shown to be especially applicable to flows with heat and mass transfer, for which nonunity Prandtl and Schmidt numbers may be assumed.

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.

Method of mechanical quadratures for solving singular integral equations of various types

NASA Astrophysics Data System (ADS)

Sahakyan, A. V.; Amirjanyan, H. A.

2018-04-01

The method of mechanical quadratures is proposed as a common approach intended for solving the integral equations defined on finite intervals and containing Cauchy-type singular integrals. This method can be used to solve singular integral equations of the first and second kind, equations with generalized kernel, weakly singular equations, and integro-differential equations. The quadrature rules for several different integrals represented through the same coefficients are presented. This allows one to reduce the integral equations containing integrals of different types to a system of linear algebraic equations.

Modular forms, Schwarzian conditions, and symmetries of differential equations in physics

NASA Astrophysics Data System (ADS)

Abdelaziz, Y.; Maillard, J.-M.

2017-05-01

We give examples of infinite order rational transformations that leave linear differential equations covariant. These examples are non-trivial yet simple enough illustrations of exact representations of the renormalization group. We first illustrate covariance properties on order-two linear differential operators associated with identities relating the same {}_2F1 hypergeometric function with different rational pullbacks. These rational transformations are solutions of a differentially algebraic equation that already emerged in a paper by Casale on the Galoisian envelopes. We provide two new and more general results of the previous covariance by rational functions: a new Heun function example and a higher genus {}_2F1 hypergeometric function example. We then focus on identities relating the same {}_2F1 hypergeometric function with two different algebraic pullback transformations: such remarkable identities correspond to modular forms, the algebraic transformations being solution of another differentially algebraic Schwarzian equation that also emerged in Casale’s paper. Further, we show that the first differentially algebraic equation can be seen as a subcase of the last Schwarzian differential condition, the restriction corresponding to a factorization condition of some associated order-two linear differential operator. Finally, we also explore generalizations of these results, for instance, to {}_3F2 , hypergeometric functions, and show that one just reduces to the previous {}_2F1 cases through a Clausen identity. The question of the reduction of these Schwarzian conditions to modular correspondences remains an open question. In a _2F1 hypergeometric framework the Schwarzian condition encapsulates all the modular forms and modular equations of the theory of elliptic curves, but these two conditions are actually richer than elliptic curves or {}_2F1 hypergeometric functions, as can be seen on the Heun and higher genus example. This work is a strong incentive to develop more differentially algebraic symmetry analysis in physics.

A double expansion method for the frequency response of finite-length beams with periodic parameters

NASA Astrophysics Data System (ADS)

Ying, Z. G.; Ni, Y. Q.

2017-03-01

A double expansion method for the frequency response of finite-length beams with periodic distribution parameters is proposed. The vibration response of the beam with spatial periodic parameters under harmonic excitations is studied. The frequency response of the periodic beam is the function of parametric period and then can be expressed by the series with the product of periodic and non-periodic functions. The procedure of the double expansion method includes the following two main steps: first, the frequency response function and periodic parameters are expanded by using identical periodic functions based on the extension of the Floquet-Bloch theorem, and the period-parametric differential equation for the frequency response is converted into a series of linear differential equations with constant coefficients; second, the solutions to the linear differential equations are expanded by using modal functions which satisfy the boundary conditions, and the linear differential equations are converted into algebraic equations according to the Galerkin method. The expansion coefficients are obtained by solving the algebraic equations and then the frequency response function is finally determined. The proposed double expansion method can uncouple the effects of the periodic expansion and modal expansion so that the expansion terms are determined respectively. The modal number considered in the second expansion can be reduced remarkably in comparison with the direct expansion method. The proposed double expansion method can be extended and applied to the other structures with periodic distribution parameters for dynamics analysis. Numerical results on the frequency response of the finite-length periodic beam with various parametric wave numbers and wave amplitude ratios are given to illustrate the effective application of the proposed method and the new frequency response characteristics, including the parameter-excited modal resonance, doubling-peak frequency response and remarkable reduction of the maximum frequency response for certain parametric wave number and wave amplitude. The results have the potential application to structural vibration control.

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…

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions

NASA Astrophysics Data System (ADS)

Bui, Quan M.; Wang, Lu; Osei-Kuffuor, Daniel

2018-04-01

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. We also show that the strategy is efficient and scales optimally with problem size.

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

Kitanidis, Peter

As large-scale, commercial storage projects become operational, the problem of utilizing information from diverse sources becomes more critically important. In this project, we developed, tested, and applied an advanced joint data inversion system for CO 2 storage modeling with large data sets for use in site characterization and real-time monitoring. Emphasis was on the development of advanced and efficient computational algorithms for joint inversion of hydro-geophysical data, coupled with state-of-the-art forward process simulations. The developed system consists of (1) inversion tools using characterization data, such as 3D seismic survey (amplitude images), borehole log and core data, as well as hydraulic,more » tracer and thermal tests before CO 2 injection, (2) joint inversion tools for updating the geologic model with the distribution of rock properties, thus reducing uncertainty, using hydro-geophysical monitoring data, and (3) highly efficient algorithms for directly solving the dense or sparse linear algebra systems derived from the joint inversion. The system combines methods from stochastic analysis, fast linear algebra, and high performance computing. The developed joint inversion tools have been tested through synthetic CO 2 storage examples.« less

New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

NASA Astrophysics Data System (ADS)

Liu, Jianzhou; Wang, Li; Zhang, Juan

2017-11-01

The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this paper, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we offer corresponding numerical examples to illustrate the effectiveness of the derived results.

Three-dimensional vibration analysis of a uniform beam with offset inertial masses at the ends

NASA Technical Reports Server (NTRS)

Robertson, D. K.

1985-01-01

Analysis of a flexible beam with displaced end-located inertial masses is presented. The resulting three-dimensional mode shape is shown to consist of two one-plane bending modes and one torsional mode. These three components of the mode shapes are shown to be linear combinations of trigonometric and hyperbolic sine and cosine functions. Boundary conditions are derived to obtain nonlinear algebraic equations through kinematic coupling of the general solutions of the three governing partial differential equations. A method of solution which takes these boundary conditions into account is also presented. A computer program has been written to obtain unique solutions to the resulting nonlinear algebraic equations. This program, which calculates natural frequencies and three-dimensional mode shapes for any number of modes, is presented and discussed.

ORACLS: A system for linear-quadratic-Gaussian control law design

NASA Technical Reports Server (NTRS)

Armstrong, E. S.

1978-01-01

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity

NASA Astrophysics Data System (ADS)

Mercier, Sylvain; Gratton, Serge; Tardieu, Nicolas; Vasseur, Xavier

2017-12-01

Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.

TDIGG - TWO-DIMENSIONAL, INTERACTIVE GRID GENERATION CODE

NASA Technical Reports Server (NTRS)

Vu, B. T.

1994-01-01

TDIGG is a fast and versatile program for generating two-dimensional computational grids for use with finite-difference flow-solvers. Both algebraic and elliptic grid generation systems are included. The method for grid generation by algebraic transformation is based on an interpolation algorithm and the elliptic grid generation is established by solving the partial differential equation (PDE). Non-uniform grid distributions are carried out using a hyperbolic tangent stretching function. For algebraic grid systems, interpolations in one direction (univariate) and two directions (bivariate) are considered. These interpolations are associated with linear or cubic Lagrangian/Hermite/Bezier polynomial functions. The algebraic grids can subsequently be smoothed using an elliptic solver. For elliptic grid systems, the PDE can be in the form of Laplace (zero forcing function) or Poisson. The forcing functions in the Poisson equation come from the boundary or the entire domain of the initial algebraic grids. A graphics interface procedure using the Silicon Graphics (GL) Library is included to allow users to visualize the grid variations at each iteration. This will allow users to interactively modify the grid to match their applications. TDIGG is written in FORTRAN 77 for Silicon Graphics IRIS series computers running IRIX. This package requires either MIT's X Window System, Version 11 Revision 4 or SGI (Motif) Window System. A sample executable is provided on the distribution medium. It requires 148K of RAM for execution. The standard distribution medium is a .25 inch streaming magnetic IRIX tape cartridge in UNIX tar format. This program was developed in 1992.

Curve Fitting via the Criterion of Least Squares. Applications of Algebra and Elementary Calculus to Curve Fitting. [and] Linear Programming in Two Dimensions: I. Applications of High School Algebra to Operations Research. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Units 321, 453.

ERIC Educational Resources Information Center

Alexander, John W., Jr.; Rosenberg, Nancy S.

This document consists of two modules. The first of these views applications of algebra and elementary calculus to curve fitting. The user is provided with information on how to: 1) construct scatter diagrams; 2) choose an appropriate function to fit specific data; 3) understand the underlying theory of least squares; 4) use a computer program to…

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

Carpenter, J.A.

This report is a sequel to ORNL/CSD-106 in the ongoing supplements to Professor A.S. Householder's KWIC Index for Numerical Algebra. Beginning with the previous supplement, the subject has been restricted to Numerical Linear Algebra, roughly characterized by the American Mathematical Society's classification sections 15 and 65F but with little coverage of infinite matrices, matrices over fields of characteristics other than zero, operator theory, optimization and those parts of matrix theory primarily combinatorial in nature. Some consideration is given to the uses of graph theory in Numerical Linear Algebra, particularly with respect to algorithms for sparse matrix computations. The period coveredmore » by this report is roughly the calendar year 1982 as measured by the appearance of the articles in the American Mathematical Society's Contents of Mathematical Publications lagging actual appearance dates by up to nearly half a year. The review citations are limited to the Mathematical Reviews (MR).« less

ADART: an adaptive algebraic reconstruction algorithm for discrete tomography.

PubMed

Maestre-Deusto, F Javier; Scavello, Giovanni; Pizarro, Joaquín; Galindo, Pedro L

2011-08-01

In this paper we suggest an algorithm based on the Discrete Algebraic Reconstruction Technique (DART) which is capable of computing high quality reconstructions from substantially fewer projections than required for conventional continuous tomography. Adaptive DART (ADART) goes a step further than DART on the reduction of the number of unknowns of the associated linear system achieving a significant reduction in the pixel error rate of reconstructed objects. The proposed methodology automatically adapts the border definition criterion at each iteration, resulting in a reduction of the number of pixels belonging to the border, and consequently of the number of unknowns in the general algebraic reconstruction linear system to be solved, being this reduction specially important at the final stage of the iterative process. Experimental results show that reconstruction errors are considerably reduced using ADART when compared to original DART, both in clean and noisy environments.

Descriptions of Free and Freeware Software in the Mathematics Teaching

NASA Astrophysics Data System (ADS)

Antunes de Macedo, Josue; Neves de Almeida, Samara; Voelzke, Marcos Rincon

2016-05-01

This paper presents the analysis and the cataloging of free and freeware mathematical software available on the internet, a brief explanation of them, and types of licenses for use in teaching and learning. The methodology is based on the qualitative research. Among the different types of software found, it stands out in algebra, the Winmat, that works with linear algebra, matrices and linear systems. In geometry, the GeoGebra, which can be used in the study of functions, plan and spatial geometry, algebra and calculus. For graphing, can quote the Graph and Graphequation. With Graphmatica software, it is possible to build various graphs of mathematical equations on the same screen, representing cartesian equations, inequalities, parametric among other functions. The Winplot allows the user to build graphics in two and three dimensions functions and mathematical equations. Thus, this work aims to present the teachers some free math software able to be used in the classroom.

Computerized implementation of higher-order electron-correlation methods and their linear-scaling divide-and-conquer extensions.

PubMed

Nakano, Masahiko; Yoshikawa, Takeshi; Hirata, So; Seino, Junji; Nakai, Hiromi

2017-11-05

We have implemented a linear-scaling divide-and-conquer (DC)-based higher-order coupled-cluster (CC) and Møller-Plesset perturbation theories (MPPT) as well as their combinations automatically by means of the tensor contraction engine, which is a computerized symbolic algebra system. The DC-based energy expressions of the standard CC and MPPT methods and the CC methods augmented with a perturbation correction were proposed for up to high excitation orders [e.g., CCSDTQ, MP4, and CCSD(2) TQ ]. The numerical assessment for hydrogen halide chains, polyene chains, and first coordination sphere (C1) model of photoactive yellow protein has revealed that the DC-based correlation methods provide reliable correlation energies with significantly less computational cost than that of the conventional implementations. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

An Ada Linear-Algebra Software Package Modeled After HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, Allan R.; Lawson, Charles L.

1990-01-01

New avionics software written more easily. Software package extends Ada programming language to include linear-algebra capabilities similar to those of HAL/S programming language. Designed for such avionics applications as Space Station flight software. In addition to built-in functions of HAL/S, package incorporates quaternion functions used in Space Shuttle and Galileo projects and routines from LINPAK solving systems of equations involving general square matrices. Contains two generic programs: one for floating-point computations and one for integer computations. Written on IBM/AT personal computer running under PC DOS, v.3.1.

Negative base encoding in optical linear algebra processors

NASA Technical Reports Server (NTRS)

Perlee, C.; Casasent, D.

1986-01-01

In the digital multiplication by analog convolution algorithm, the bits of two encoded numbers are convolved to form the product of the two numbers in mixed binary representation; this output can be easily converted to binary. Attention is presently given to negative base encoding, treating base -2 initially, and then showing that the negative base system can be readily extended to any radix. In general, negative base encoding in optical linear algebra processors represents a more efficient technique than either sign magnitude or 2's complement encoding, when the additions of digitally encoded products are performed in parallel.

Solution of Algebraic Equations in the Analysis, Design, and Optimization of Continuous Ultrafiltration

ERIC Educational Resources Information Center

Foley, Greg

2011-01-01

Continuous feed and bleed ultrafiltration, modeled with the gel polarization model for the limiting flux, is shown to provide a rich source of non-linear algebraic equations that can be readily solved using numerical and graphical techniques familiar to undergraduate students. We present a variety of numerical problems in the design, analysis, and…

Functional Thinking Ways in Relation to Linear Function Tables of Elementary School Students

ERIC Educational Resources Information Center

Tanisli, Dilek

2011-01-01

One of the basic components of algebraic thinking is functional thinking. Functional thinking involves focusing on the relationship between two (or more) varying quantities and such thinking facilitates the studies on both algebra and the notion of function. The development of functional thinking of students should start in the early grades and it…

Diagonalization and Jordan Normal Form--Motivation through "Maple"[R

ERIC Educational Resources Information Center

Glaister, P.

2009-01-01

Following an introduction to the diagonalization of matrices, one of the more difficult topics for students to grasp in linear algebra is the concept of Jordan normal form. In this note, we show how the important notions of diagonalization and Jordan normal form can be introduced and developed through the use of the computer algebra package…

An Introduction to the Profound Potential of Connected Algebra Activities: Issues of Representation, Engagement and Pedagogy

ERIC Educational Resources Information Center

Hegedus, Stephen J.; Kaput, James J.

2004-01-01

We present two vignettes of classroom episodes that exemplify new activity structures for introducing core algebra ideas such as linear functions, slope as rate and parametric variation within a new educational technology environment that combines two kinds of classroom technology affordances, one based in dynamic representation and the other…

Generalizations of Tikhonov's regularized method of least squares to non-Euclidean vector norms

NASA Astrophysics Data System (ADS)

Volkov, V. V.; Erokhin, V. I.; Kakaev, V. V.; Onufrei, A. Yu.

2017-09-01

Tikhonov's regularized method of least squares and its generalizations to non-Euclidean norms, including polyhedral, are considered. The regularized method of least squares is reduced to mathematical programming problems obtained by "instrumental" generalizations of the Tikhonov lemma on the minimal (in a certain norm) solution of a system of linear algebraic equations with respect to an unknown matrix. Further studies are needed for problems concerning the development of methods and algorithms for solving reduced mathematical programming problems in which the objective functions and admissible domains are constructed using polyhedral vector norms.

On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.; Nicolaides, R. A.

1986-01-01

Substructuring methods are in common use in mechanics problems where typically the associated linear systems of algebraic equations are positive definite. Here these methods are extended to problems which lead to nonpositive definite, nonsymmetric matrices. The extension is based on an algorithm which carries out the block Gauss elimination procedure without the need for interchanges even when a pivot matrix is singular. Examples are provided wherein the method is used in connection with finite element solutions of the stationary Stokes equations and the Helmholtz equation, and dual methods for second-order elliptic equations.

Performance of a parallel algebraic multilevel preconditioner for stabilized finite element semiconductor device modeling

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

Lin, Paul T.; Shadid, John N.; Sala, Marzio

In this study results are presented for the large-scale parallel performance of an algebraic multilevel preconditioner for solution of the drift-diffusion model for semiconductor devices. The preconditioner is the key numerical procedure determining the robustness, efficiency and scalability of the fully-coupled Newton-Krylov based, nonlinear solution method that is employed for this system of equations. The coupled system is comprised of a source term dominated Poisson equation for the electric potential, and two convection-diffusion-reaction type equations for the electron and hole concentration. The governing PDEs are discretized in space by a stabilized finite element method. Solution of the discrete system ismore » obtained through a fully-implicit time integrator, a fully-coupled Newton-based nonlinear solver, and a restarted GMRES Krylov linear system solver. The algebraic multilevel preconditioner is based on an aggressive coarsening graph partitioning of the nonzero block structure of the Jacobian matrix. Representative performance results are presented for various choices of multigrid V-cycles and W-cycles and parameter variations for smoothers based on incomplete factorizations. Parallel scalability results are presented for solution of up to 10{sup 8} unknowns on 4096 processors of a Cray XT3/4 and an IBM POWER eServer system.« less

Coalgebraic structure of genetic inheritance.

PubMed

Tian, Jianjun; Li, Bai-Lian

2004-09-01

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

SU-E-J-02: 4D Digital Tomosynthesis Based On Algebraic Image Reconstruction and Total-Variation Minimization for the Improvement of Image Quality

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

Kim, D; Kang, S; Kim, T

2014-06-01

Purpose: In this paper, we implemented the four-dimensional (4D) digital tomosynthesis (DTS) imaging based on algebraic image reconstruction technique and total-variation minimization method in order to compensate the undersampled projection data and improve the image quality. Methods: The projection data were acquired as supposed the cone-beam computed tomography system in linear accelerator by the Monte Carlo simulation and the in-house 4D digital phantom generation program. We performed 4D DTS based upon simultaneous algebraic reconstruction technique (SART) among the iterative image reconstruction technique and total-variation minimization method (TVMM). To verify the effectiveness of this reconstruction algorithm, we performed systematic simulation studiesmore » to investigate the imaging performance. Results: The 4D DTS algorithm based upon the SART and TVMM seems to give better results than that based upon the existing method, or filtered-backprojection. Conclusion: The advanced image reconstruction algorithm for the 4D DTS would be useful to validate each intra-fraction motion during radiation therapy. In addition, it will be possible to give advantage to real-time imaging for the adaptive radiation therapy. This research was supported by Leading Foreign Research Institute Recruitment Program (Grant No.2009-00420) and Basic Atomic Energy Research Institute (BAERI); (Grant No. 2009-0078390) through the National Research Foundation of Korea(NRF) funded by the Ministry of Science, ICT and Future Planning (MSIP)« less

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, Kenneth; Jain, Abhinandan

1989-01-01

A recently developed spatial operator algebra, useful for modeling, control, and trajectory design of manipulators is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics. Furthermore, implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection. Thus, the transition from an abstract problem formulation and solution to the detailed mechanizaton of specific algorithms is greatly simplified. The analytical formulation of the operator algebra, as well as its implementation in the Ada programming language are discussed.

Parallelization of the FLAPW method

NASA Astrophysics Data System (ADS)

Canning, A.; Mannstadt, W.; Freeman, A. J.

2000-08-01

The FLAPW (full-potential linearized-augmented plane-wave) method is one of the most accurate first-principles methods for determining structural, electronic and magnetic properties of crystals and surfaces. Until the present work, the FLAPW method has been limited to systems of less than about a hundred atoms due to the lack of an efficient parallel implementation to exploit the power and memory of parallel computers. In this work, we present an efficient parallelization of the method by division among the processors of the plane-wave components for each state. The code is also optimized for RISC (reduced instruction set computer) architectures, such as those found on most parallel computers, making full use of BLAS (basic linear algebra subprograms) wherever possible. Scaling results are presented for systems of up to 686 silicon atoms and 343 palladium atoms per unit cell, running on up to 512 processors on a CRAY T3E parallel supercomputer.

Study of high-performance canonical molecular orbitals calculation for proteins

NASA Astrophysics Data System (ADS)

Hirano, Toshiyuki; Sato, Fumitoshi

2017-11-01

The canonical molecular orbital (CMO) calculation can help to understand chemical properties and reactions in proteins. However, it is difficult to perform the CMO calculation of proteins because of its self-consistent field (SCF) convergence problem and expensive computational cost. To certainly obtain the CMO of proteins, we work in research and development of high-performance CMO applications and perform experimental studies. We have proposed the third-generation density-functional calculation method of calculating the SCF, which is more advanced than the FILE and direct method. Our method is based on Cholesky decomposition for two-electron integrals calculation and the modified grid-free method for the pure-XC term evaluation. By using the third-generation density-functional calculation method, the Coulomb, the Fock-exchange, and the pure-XC terms can be given by simple linear algebraic procedure in the SCF loop. Therefore, we can expect to get a good parallel performance in solving the SCF problem by using a well-optimized linear algebra library such as BLAS on the distributed memory parallel computers. The third-generation density-functional calculation method is implemented to our program, ProteinDF. To achieve computing electronic structure of the large molecule, not only overcoming expensive computation cost and also good initial guess for safe SCF convergence are required. In order to prepare a precise initial guess for the macromolecular system, we have developed the quasi-canonical localized orbital (QCLO) method. The QCLO has the characteristics of both localized and canonical orbital in a certain region of the molecule. We have succeeded in the CMO calculations of proteins by using the QCLO method. For simplified and semi-automated calculation of the QCLO method, we have also developed a Python-based program, QCLObot.

Generalized Lagrange Jacobi Gauss-Lobatto (GLJGL) Collocation Method for Solving Linear and Nonlinear Fokker-Planck Equations

NASA Astrophysics Data System (ADS)

Parand, K.; Latifi, S.; Moayeri, M. M.; Delkhosh, M.

2018-05-01

In this study, we have constructed a new numerical approach for solving the time-dependent linear and nonlinear Fokker-Planck equations. In fact, we have discretized the time variable with Crank-Nicolson method and for the space variable, a numerical method based on Generalized Lagrange Jacobi Gauss-Lobatto (GLJGL) collocation method is applied. It leads to in solving the equation in a series of time steps and at each time step, the problem is reduced to a problem consisting of a system of algebraic equations that greatly simplifies the problem. One can observe that the proposed method is simple and accurate. Indeed, one of its merits is that it is derivative-free and by proposing a formula for derivative matrices, the difficulty aroused in calculation is overcome, along with that it does not need to calculate the General Lagrange basis and matrices; they have Kronecker property. Linear and nonlinear Fokker-Planck equations are given as examples and the results amply demonstrate that the presented method is very valid, effective, reliable and does not require any restrictive assumptions for nonlinear terms.

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.

1992-01-01

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Statistics of the stochastically forced Lorenz attractor by the Fokker-Planck equation and cumulant expansions.

PubMed

Allawala, Altan; Marston, J B

2016-11-01

We investigate the Fokker-Planck description of the equal-time statistics of the three-dimensional Lorenz attractor with additive white noise. The invariant measure is found by computing the zero (or null) mode of the linear Fokker-Planck operator as a problem of sparse linear algebra. Two variants are studied: a self-adjoint construction of the linear operator and the replacement of diffusion with hyperdiffusion. We also access the low-order statistics of the system by a perturbative expansion in equal-time cumulants. A comparison is made to statistics obtained by the standard approach of accumulation via direct numerical simulation. Theoretical and computational aspects of the Fokker-Planck and cumulant expansion methods are discussed.

Adaptive Identification by Systolic Arrays.

DTIC Science & Technology

1987-12-01

BIBLIOGRIAPHY Anton , Howard, Elementary Linear Algebra , John Wiley & Sons, 19S4. Cristi, Roberto, A Parallel Structure Jor Adaptive Pole Placement...10 11. SYSTEM IDENTIFICATION M*YETHODS ....................... 12 A. LINEAR SYSTEM MODELING ......................... 12 B. SOLUTION OF SYSTEMS OF... LINEAR EQUATIONS ......... 13 C. QR DECOMPOSITION ................................ 14 D. RECURSIVE LEAST SQUARES ......................... 16 E. BLOCK

Linearized gravity in terms of differential forms

NASA Astrophysics Data System (ADS)

Baykal, Ahmet; Dereli, Tekin

2017-01-01

A technique to linearize gravitational field equations is developed in which the perturbation metric coefficients are treated as second rank, symmetric, 1-form fields belonging to the Minkowski background spacetime by using the exterior algebra of differential forms.

Performance improvements of wavelength-shifting-fiber neutron detectors using high-resolution positioning algorithms

DOE PAGES

Wang, C. L.

2016-05-17

On the basis of FluoroBancroft linear-algebraic method [S.B. Andersson, Opt. Exp. 16, 18714 (2008)] three highly-resolved positioning methods were proposed for wavelength-shifting fiber (WLSF) neutron detectors. Using a Gaussian or exponential-decay light-response function (LRF), the non-linear relation of photon-number profiles vs. x-pixels was linearized and neutron positions were determined. The proposed algorithms give an average 0.03-0.08 pixel position error, much smaller than that (0.29 pixel) from a traditional maximum photon algorithm (MPA). The new algorithms result in better detector uniformity, less position misassignment (ghosting), better spatial resolution, and an equivalent or better instrument resolution in powder diffraction than the MPA.more » Moreover, these characters will facilitate broader applications of WLSF detectors at time-of-flight neutron powder diffraction beamlines, including single-crystal diffraction and texture analysis.« less

Method of orbit sums in the theory of modular vector invariants

NASA Astrophysics Data System (ADS)

Stepanov, S. A.

2006-12-01

Let F be a field, V a finite-dimensional F-vector space, G\\leqslant \\operatorname{GL}_F(V) a finite group, and V^m=V\\oplus\\dots\\oplus V the m-fold direct sum with the diagonal action of G. The group G acts naturally on the symmetric graded algebra A_m=F \\lbrack V^m \\rbrack as a group of non-degenerate linear transformations of the variables. Let A_m^G be the subalgebra of invariants of the polynomial algebra A_m with respect to G. A classical result of Noether [1] says that if \\operatorname{char}F=0, then A_m^G is generated as an F-algebra by homogeneous polynomials of degree at most \\vert G\\vert, no matter how large m can be. On the other hand, it was proved by Richman [2], [3] that this result does not hold when the characteristic of F is positive and divides the order \\vert G\\vert of G. Let p, p>2, be a prime number, F=F_p a finite field of p elements, V a linear F_p-vector space of dimension n, and H\\leqslant \\operatorname{GL}_{F_p}(V) a cyclic group of order p generated by a matrix \\gamma of a certain special form. In this paper we describe explicitly (Theorem 1) one complete set of generators of A_m^H. After that, for an arbitrary complete set of generators of this algebra we find a lower bound for the highest degree of the generating elements of this algebra. This is a significant extension of the corresponding result of Campbell and Hughes [4] for the particular case of n=2. As a consequence we show (Theorem 3) that if m>n and G\\ge H is an arbitrary finite group, then each complete set of generators of A_m^G contains an element of degree at least 2(m-n+2r)(p-1)/r, where r=r(H) is a positive integer dependent on the structure of the generating matrix \\gamma of the group H. This result refines considerably the earlier lower bound obtained by Richman [3].

Lie-algebraic Approach to Dynamics of Closed Quantum Systems and Quantum-to-Classical Correspondence

NASA Astrophysics Data System (ADS)

Galitski, Victor

2012-02-01

I will briefly review our recent work on a Lie-algebraic approach to various non-equilibrium quantum-mechanical problems, which has been motivated by continuous experimental advances in the field of cold atoms. First, I will discuss non-equilibrium driven dynamics of a generic closed quantum system. It will be emphasized that mathematically a non-equilibrium Hamiltonian represents a trajectory in a Lie algebra, while the evolution operator is a trajectory in a Lie group generated by the underlying algebra via exponentiation. This turns out to be a constructive statement that establishes, in particular, the fact that classical and quantum unitary evolutions are two sides of the same coin determined uniquely by the same dynamic generators in the group. An equation for these generators - dubbed dual Schr"odinger-Bloch equation - will be derived and analyzed for a few of specific examples. This non-linear equation allows one to construct new exact non-linear solutions to quantum-dynamical systems. An experimentally-relevant example of a family of exact solutions to the many-body Landau-Zener problem will be presented. One practical application of the latter result includes dynamical means to optimize molecular production rate following a quench across the Feshbach resonance.

Dimensional analysis using toric ideals: primitive invariants.

PubMed

Atherton, Mark A; Bates, Ronald A; Wynn, Henry P

2014-01-01

Classical dimensional analysis in its original form starts by expressing the units for derived quantities, such as force, in terms of power products of basic units [Formula: see text] etc. This suggests the use of toric ideal theory from algebraic geometry. Within this the Graver basis provides a unique primitive basis in a well-defined sense, which typically has more terms than the standard Buckingham approach. Some textbook examples are revisited and the full set of primitive invariants found. First, a worked example based on convection is introduced to recall the Buckingham method, but using computer algebra to obtain an integer [Formula: see text] matrix from the initial integer [Formula: see text] matrix holding the exponents for the derived quantities. The [Formula: see text] matrix defines the dimensionless variables. But, rather than this integer linear algebra approach it is shown how, by staying with the power product representation, the full set of invariants (dimensionless groups) is obtained directly from the toric ideal defined by [Formula: see text]. One candidate for the set of invariants is a simple basis of the toric ideal. This, although larger than the rank of [Formula: see text], is typically not unique. However, the alternative Graver basis is unique and defines a maximal set of invariants, which are primitive in a simple sense. In addition to the running example four examples are taken from: a windmill, convection, electrodynamics and the hydrogen atom. The method reveals some named invariants. A selection of computer algebra packages is used to show the considerable ease with which both a simple basis and a Graver basis can be found.

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

NASA Technical Reports Server (NTRS)

Chou, Jack C. K.

1989-01-01

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Attitude control with realization of linear error dynamics

NASA Technical Reports Server (NTRS)

Paielli, Russell A.; Bach, Ralph E.

1993-01-01

An attitude control law is derived to realize linear unforced error dynamics with the attitude error defined in terms of rotation group algebra (rather than vector algebra). Euler parameters are used in the rotational dynamics model because they are globally nonsingular, but only the minimal three Euler parameters are used in the error dynamics model because they have no nonlinear mathematical constraints to prevent the realization of linear error dynamics. The control law is singular only when the attitude error angle is exactly pi rad about any eigenaxis, and a simple intuitive modification at the singularity allows the control law to be used globally. The forced error dynamics are nonlinear but stable. Numerical simulation tests show that the control law performs robustly for both initial attitude acquisition and attitude control.

Nonlinear, Incremental Structural Analysis of Olmsted Locks and Dams. Volume 1: Main Text

DTIC Science & Technology

1992-12-01

dependent functions, which are supplied as algebraic functions of time or as data arrays in ABAQUS user subroutines (Hibbitt, Karlsson, and Sorenson 1988...143.0 Thermal Prouerties 9. The heat transfer capability of ABAQUS uses the finite element method to numerically solve the governing differential...coefficient of linear thermal expansion which were conducted at WES for Olmsted mixtures 6 and 11 (Hammons et al. 1991). The different concrete mixture

Dynamical generation of noiseless quantum subsystems

PubMed

Viola; Knill; Lloyd

2000-10-16

We combine dynamical decoupling and universal control methods for open quantum systems with coding procedures. By exploiting a general algebraic approach, we show how appropriate encodings of quantum states result in obtaining universal control over dynamically generated noise-protected subsystems with limited control resources. In particular, we provide a constructive scheme based on two-body Hamiltonians for performing universal quantum computation over large noiseless spaces which can be engineered in the presence of arbitrary linear quantum noise.

Numerical evaluation of mobile robot navigation in static indoor environment via EGAOR Iteration

NASA Astrophysics Data System (ADS)

Dahalan, A. A.; Saudi, A.; Sulaiman, J.; Din, W. R. W.

2017-09-01

One of the key issues in mobile robot navigation is the ability for the robot to move from an arbitrary start location to a specified goal location without colliding with any obstacles while traveling, also known as mobile robot path planning problem. In this paper, however, we examined the performance of a robust searching algorithm that relies on the use of harmonic potentials of the environment to generate smooth and safe path for mobile robot navigation in a static known indoor environment. The harmonic potentials will be discretized by using Laplacian’s operator to form a system of algebraic approximation equations. This algebraic linear system will be computed via 4-Point Explicit Group Accelerated Over-Relaxation (4-EGAOR) iterative method for rapid computation. The performance of the proposed algorithm will then be compared and analyzed against the existing algorithms in terms of number of iterations and execution time. The result shows that the proposed algorithm performed better than the existing methods.

Maslov indices, Poisson brackets, and singular differential forms

NASA Astrophysics Data System (ADS)

Esterlis, I.; Haggard, H. M.; Hedeman, A.; Littlejohn, R. G.

2014-06-01

Maslov indices are integers that appear in semiclassical wave functions and quantization conditions. They are often notoriously difficult to compute. We present methods of computing the Maslov index that rely only on typically elementary Poisson brackets and simple linear algebra. We also present a singular differential form, whose integral along a curve gives the Maslov index of that curve. The form is closed but not exact, and transforms by an exact differential under canonical transformations. We illustrate the method with the 6j-symbol, which is important in angular-momentum theory and in quantum gravity.

Students’ difficulties in solving linear equation problems

NASA Astrophysics Data System (ADS)

Wati, S.; Fitriana, L.; Mardiyana

2018-03-01

A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.

Matrix preconditioning: a robust operation for optical linear algebra processors.

PubMed

Ghosh, A; Paparao, P

1987-07-15

Analog electrooptical processors are best suited for applications demanding high computational throughput with tolerance for inaccuracies. Matrix preconditioning is one such application. Matrix preconditioning is a preprocessing step for reducing the condition number of a matrix and is used extensively with gradient algorithms for increasing the rate of convergence and improving the accuracy of the solution. In this paper, we describe a simple parallel algorithm for matrix preconditioning, which can be implemented efficiently on a pipelined optical linear algebra processor. From the results of our numerical experiments we show that the efficacy of the preconditioning algorithm is affected very little by the errors of the optical system.

Operator pencil passing through a given operator

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

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

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

Steady and Oscillatory, Subsonic and Supersonic, Aerodynamic Pressure and Generalized Forces for Complex Aircraft Configurations and Applications to Flutter. M.S. Thesis

NASA Technical Reports Server (NTRS)

Chen, L. T.

1975-01-01

A general method for analyzing aerodynamic flows around complex configurations is presented. By applying the Green function method, a linear integral equation relating the unknown, small perturbation potential on the surface of the body, to the known downwash is obtained. The surfaces of the aircraft, wake and diaphragm (if necessary) are divided into small quadrilateral elements which are approximated with hyperboloidal surfaces. The potential and its normal derivative are assumed to be constant within each element. This yields a set of linear algebraic equations and the coefficients are evaluated analytically. By using Gaussian elimination method, equations are solved for the potentials at the centroids of elements. The pressure coefficient is evaluated by the finite different method; the lift and moment coefficients are evaluated by numerical integration. Numerical results are presented, and applications to flutter are also included.

An Inquiry-Oriented Approach to Span and Linear Independence: The Case of the Magic Carpet Ride Sequence

ERIC Educational Resources Information Center

Wawro, Megan; Rasmussen, Chris; Zandieh, Michelle; Sweeney, George Franklin; Larson, Christine

2012-01-01

In this paper we present an innovative instructional sequence for an introductory linear algebra course that supports students' reinvention of the concepts of span, linear dependence, and linear independence. Referred to as the Magic Carpet Ride sequence, the problems begin with an imaginary scenario that allows students to build rich imagery and…

Linear-scaling method for calculating nuclear magnetic resonance chemical shifts using gauge-including atomic orbitals within Hartree-Fock and density-functional theory.

PubMed

Kussmann, Jörg; Ochsenfeld, Christian

2007-08-07

Details of a new density matrix-based formulation for calculating nuclear magnetic resonance chemical shifts at both Hartree-Fock and density functional theory levels are presented. For systems with a nonvanishing highest occupied molecular orbital-lowest unoccupied molecular orbital gap, the method allows us to reduce the asymptotic scaling order of the computational effort from cubic to linear, so that molecular systems with 1000 and more atoms can be tackled with today's computers. The key feature is a reformulation of the coupled-perturbed self-consistent field (CPSCF) theory in terms of the one-particle density matrix (D-CPSCF), which avoids entirely the use of canonical MOs. By means of a direct solution for the required perturbed density matrices and the adaptation of linear-scaling integral contraction schemes, the overall scaling of the computational effort is reduced to linear. A particular focus of our formulation is to ensure numerical stability when sparse-algebra routines are used to obtain an overall linear-scaling behavior.

A Hypothetical Learning Trajectory for Conceptualizing Matrices as Linear Transformations

ERIC Educational Resources Information Center

Andrews-Larson, Christine; Wawro, Megan; Zandieh, Michelle

2017-01-01

In this paper, we present a hypothetical learning trajectory (HLT) aimed at supporting students in developing flexible ways of reasoning about matrices as linear transformations in the context of introductory linear algebra. In our HLT, we highlight the integral role of the instructor in this development. Our HLT is based on the "Italicizing…

Parallelization of the FLAPW method and comparison with the PPW method

NASA Astrophysics Data System (ADS)

Canning, Andrew; Mannstadt, Wolfgang; Freeman, Arthur

2000-03-01

The FLAPW (full-potential linearized-augmented plane-wave) method is one of the most accurate first-principles methods for determining electronic and magnetic properties of crystals and surfaces. In the past the FLAPW method has been limited to systems of about a hundred atoms due to the lack of an efficient parallel implementation to exploit the power and memory of parallel computers. In this work we present an efficient parallelization of the method by division among the processors of the plane-wave components for each state. The code is also optimized for RISC (reduced instruction set computer) architectures, such as those found on most parallel computers, making full use of BLAS (basic linear algebra subprograms) wherever possible. Scaling results are presented for systems of up to 686 silicon atoms and 343 palladium atoms per unit cell running on up to 512 processors on a Cray T3E parallel supercomputer. Some results will also be presented on a comparison of the plane-wave pseudopotential method and the FLAPW method on large systems.

Symmetry-preserving perturbations of the Bateman Lagrangian and dissipative systems

NASA Astrophysics Data System (ADS)

Campoamor-Stursberg, Rutwig

2017-03-01

Perturbations of the classical Bateman Lagrangian preserving a certain subalgebra of Noether symmetries are studied, and conservative perturbations are characterized by the Lie algebra sl(2, ℝ) ⊕ so(2). Non-conservative albeit integrable perturbations are determined by the simple Lie algebra sl(2,ℝ), showing further the relation of the corresponding non-linear systems with the notion of generalized Ermakov systems.

Gordan—Capelli series in superalgebras

PubMed Central

Brini, Andrea; Palareti, Aldopaolo; Teolis, Antonio G. B.

1988-01-01

We derive two Gordan—Capelli series for the supersymmetric algebra of the tensor product of two [unk]2-graded [unk]-vector spaces U and V, being [unk] a field of characteristic zero. These expansions yield complete decompositions of the supersymmetric algebra regarded as a pl(U)- and a pl(V)- module, where pl(U) and pl(V) are the general linear Lie superalgebras of U and V, respectively. PMID:16593911

Class and Homework Problems: The Break-Even Radius of Insulation Computed Using Excel Solver and WolframAlpha

ERIC Educational Resources Information Center

Foley, Greg

2014-01-01

A problem that illustrates two ways of computing the break-even radius of insulation is outlined. The problem is suitable for students who are taking an introductory module in heat transfer or transport phenomena and who have some previous knowledge of the numerical solution of non- linear algebraic equations. The potential for computer algebra,…

Symmetry-preserving perturbations of the Bateman Lagrangian and dissipative systems

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

Campoamor-Stursberg, Rutwig, E-mail: rutwig@ucm.es

Perturbations of the classical Bateman Lagrangian preserving a certain subalgebra of Noether symmetries are studied, and conservative perturbations are characterized by the Lie algebra sl(2, ℝ) ⊕ so(2). Non-conservative albeit integrable perturbations are determined by the simple Lie algebra sl(2,ℝ), showing further the relation of the corresponding non-linear systems with the notion of generalized Ermakov systems.

Computing the Moore-Penrose Inverse of a Matrix with a Computer Algebra System

ERIC Educational Resources Information Center

Schmidt, Karsten

2008-01-01

In this paper "Derive" functions are provided for the computation of the Moore-Penrose inverse of a matrix, as well as for solving systems of linear equations by means of the Moore-Penrose inverse. Making it possible to compute the Moore-Penrose inverse easily with one of the most commonly used Computer Algebra Systems--and to have the blueprint…

Signal Processing for Radar Target Tracking and Identification

DTIC Science & Technology

1996-12-01

Computes the likelihood for various potential jump moves. 12. matrix_mult.m: Parallel implementation of linear algebra ... Elementary Lineary Algebra with Applications, John Wiley k Sons, Inc., New York, 1987. [9] A. K. Bhattacharyya, and D. L. Sengupta, Radar Cross...Miller, ’Target Tracking and Recognition Using Jump-Diffusion Processes," ARO’s 11th Army Conf. on Applied Mathemat- ics and Computing, June 8-11

Data Retrieval Algorithms for Validating the Optical Transient Detector and the Lightning Imaging Sensor

NASA Technical Reports Server (NTRS)

Koshak, W. J.; Blakeslee, R. J.; Bailey, J. C.

2000-01-01

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions. Solutions for the plane (i.e., no earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated datasets, and the relative influence of bearing and arrival time data an the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA:s Optical Transient Detector and Lightning Imaging Sensor. A quadratic planar solution that is useful when only three arrival time measurements are available is also introduced. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in sc)iirce location, Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated datasets, and the results are generally better than those obtained from the three-station linear planar method when bearing errors are about 2 deg.

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

Slattery, Stuart R.

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothnessmore » and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.« less

Determination of many-electron basis functions for a quantum Hall ground state using Schur polynomials

NASA Astrophysics Data System (ADS)

Mandal, Sudhansu S.; Mukherjee, Sutirtha; Ray, Koushik

2018-03-01

A method for determining the ground state of a planar interacting many-electron system in a magnetic field perpendicular to the plane is described. The ground state wave-function is expressed as a linear combination of a set of basis functions. Given only the flux and the number of electrons describing an incompressible state, we use the combinatorics of partitioning the flux among the electrons to derive the basis wave-functions as linear combinations of Schur polynomials. The procedure ensures that the basis wave-functions form representations of the angular momentum algebra. We exemplify the method by deriving the basis functions for the 5/2 quantum Hall state with a few particles. We find that one of the basis functions is precisely the Moore-Read Pfaffian wave function.

Choosing order of operations to accelerate strip structure analysis in parameter range

NASA Astrophysics Data System (ADS)

Kuksenko, S. P.; Akhunov, R. R.; Gazizov, T. R.

2018-05-01

The paper considers the issue of using iteration methods in solving the sequence of linear algebraic systems obtained in quasistatic analysis of strip structures with the method of moments. Using the analysis of 4 strip structures, the authors have proved that additional acceleration (up to 2.21 times) of the iterative process can be obtained during the process of solving linear systems repeatedly by means of choosing a proper order of operations and a preconditioner. The obtained results can be used to accelerate the process of computer-aided design of various strip structures. The choice of the order of operations to accelerate the process is quite simple, universal and could be used not only for strip structure analysis but also for a wide range of computational problems.

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

ERIC Educational Resources Information Center

Egodawatte, Gunawardena; Stoilescu, Dorian

2015-01-01

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

Two-Level Hierarchical FEM Method for Modeling Passive Microwave Devices

NASA Astrophysics Data System (ADS)

Polstyanko, Sergey V.; Lee, Jin-Fa

1998-03-01

In recent years multigrid methods have been proven to be very efficient for solving large systems of linear equations resulting from the discretization of positive definite differential equations by either the finite difference method or theh-version of the finite element method. In this paper an iterative method of the multiple level type is proposed for solving systems of algebraic equations which arise from thep-version of the finite element analysis applied to indefinite problems. A two-levelV-cycle algorithm has been implemented and studied with a Gauss-Seidel iterative scheme used as a smoother. The convergence of the method has been investigated, and numerical results for a number of numerical examples are presented.

A Method to Solve Interior and Exterior Camera Calibration Parameters for Image Resection

NASA Technical Reports Server (NTRS)

Samtaney, Ravi

1999-01-01

An iterative method is presented to solve the internal and external camera calibration parameters, given model target points and their images from one or more camera locations. The direct linear transform formulation was used to obtain a guess for the iterative method, and herein lies one of the strengths of the present method. In all test cases, the method converged to the correct solution. In general, an overdetermined system of nonlinear equations is solved in the least-squares sense. The iterative method presented is based on Newton-Raphson for solving systems of nonlinear algebraic equations. The Jacobian is analytically derived and the pseudo-inverse of the Jacobian is obtained by singular value decomposition.

Quantifying non-linear dynamics of mass-springs in series oscillators via asymptotic approach

NASA Astrophysics Data System (ADS)

Starosta, Roman; Sypniewska-Kamińska, Grażyna; Awrejcewicz, Jan

2017-05-01

Dynamical regular response of an oscillator with two serially connected springs with nonlinear characteristics of cubic type and governed by a set of differential-algebraic equations (DAEs) is studied. The classical approach of the multiple scales method (MSM) in time domain has been employed and appropriately modified to solve the governing DAEs of two systems, i.e. with one- and two degrees-of-freedom. The approximate analytical solutions have been verified by numerical simulations.

Methods, Software and Tools for Three Numerical Applications. Final report

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

E. R. Jessup

2000-03-01

This is a report of the results of the authors work supported by DOE contract DE-FG03-97ER25325. They proposed to study three numerical problems. They are: (1) the extension of the PMESC parallel programming library; (2) the development of algorithms and software for certain generalized eigenvalue and singular value (SVD) problems, and (3) the application of techniques of linear algebra to an information retrieval technique known as latent semantic indexing (LSI).

Design Sensitivity Method for Sampling-Based RBDO with Fixed COV

DTIC Science & Technology

2015-04-29

contours of the input model at initial design d0 and RBDO optimum design dopt are shown. As the limit state functions are not linear and some input...Glasser, M. L., Moore, R. A., and Scott, T. C., 1990, "Evaluation of Classes of Definite Integrals Involving Elementary Functions via...Differentiation of Special Functions," Applicable Algebra in Engineering, Communication and Computing, 1(2), pp. 149-165. [25] Cho, H., Bae, S., Choi, K. K

Linear time-invariant controller design for two-channel decentralized control systems

NASA Technical Reports Server (NTRS)

Desoer, Charles A.; Gundes, A. Nazli

1987-01-01

This paper analyzes a linear time-invariant two-channel decentralized control system with a 2 x 2 strictly proper plant. It presents an algorithm for the algebraic design of a class of decentralized compensators which stabilize the given plant.

Inverse solutions for electrical impedance tomography based on conjugate gradients methods

NASA Astrophysics Data System (ADS)

Wang, M.

2002-01-01

A multistep inverse solution for two-dimensional electric field distribution is developed to deal with the nonlinear inverse problem of electric field distribution in relation to its boundary condition and the problem of divergence due to errors introduced by the ill-conditioned sensitivity matrix and the noise produced by electrode modelling and instruments. This solution is based on a normalized linear approximation method where the change in mutual impedance is derived from the sensitivity theorem and a method of error vector decomposition. This paper presents an algebraic solution of the linear equations at each inverse step, using a generalized conjugate gradients method. Limiting the number of iterations in the generalized conjugate gradients method controls the artificial errors introduced by the assumption of linearity and the ill-conditioned sensitivity matrix. The solution of the nonlinear problem is approached using a multistep inversion. This paper also reviews the mathematical and physical definitions of the sensitivity back-projection algorithm based on the sensitivity theorem. Simulations and discussion based on the multistep algorithm, the sensitivity coefficient back-projection method and the Newton-Raphson method are given. Examples of imaging gas-liquid mixing and a human hand in brine are presented.

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

PubMed

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

2014-07-05

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

Teaching Linear Functions in Context with Graphics Calculators: Students' Responses and the Impact of the Approach on Their Use of Algebraic Symbols

ERIC Educational Resources Information Center

Bardini, Caroline; Pierce, Robyn U.; Stacey, Kaye

2004-01-01

This study analyses some of the consequences of adopting a functional/modelling approach to the teaching of algebra. The teaching of one class of 17 students was observed over five weeks, with 15 students undertaking both pre- and post-tests and 6 students and the teacher being interviewed individually. Use of graphics calculators made the…

Algebraic Riccati equations in zero-sum differential games

NASA Technical Reports Server (NTRS)

Johnson, T. L.; Chao, A.

1974-01-01

The procedure for finding the closed-loop Nash equilibrium solution of two-player zero-sum linear time-invariant differential games with quadratic performance criteria and classical information pattern may be reduced in most cases to the solution of an algebraic Riccati equation. Based on the results obtained by Willems, necessary and sufficient conditions for existence of solutions to these equations are derived, and explicit conditions for a scalar example are given.

Algebraic Algorithm Design and Local Search

DTIC Science & Technology

1996-12-01

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

An automatic multigrid method for the solution of sparse linear systems

NASA Technical Reports Server (NTRS)

Shapira, Yair; Israeli, Moshe; Sidi, Avram

1993-01-01

An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.

The elastic theory of shells using geometric algebra

PubMed Central

Lasenby, J.; Agarwal, A.

2017-01-01

We present a novel derivation of the elastic theory of shells. We use the language of geometric algebra, which allows us to express the fundamental laws in component-free form, thus aiding physical interpretation. It also provides the tools to express equations in an arbitrary coordinate system, which enhances their usefulness. The role of moments and angular velocity, and the apparent use by previous authors of an unphysical angular velocity, has been clarified through the use of a bivector representation. In the linearized theory, clarification of previous coordinate conventions which have been the cause of confusion is provided, and the introduction of prior strain into the linearized theory of shells is made possible. PMID:28405404

New infinite-dimensional hidden symmetries for heterotic string theory

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

Gao Yajun

The symmetry structures of two-dimensional heterotic string theory are studied further. A (2d+n)x(2d+n) matrix complex H-potential is constructed and the field equations are extended into a complex matrix formulation. A pair of Hauser-Ernst-type linear systems are established. Based on these linear systems, explicit formulations of new hidden symmetry transformations for the considered theory are given and then these symmetry transformations are verified to constitute infinite-dimensional Lie algebras: the semidirect product of the Kac-Moody o(d,d+n-circumflex) and Virasoro algebras (without center charges). These results demonstrate that the heterotic string theory under consideration possesses more and richer symmetry structures than previously expected.

On recent advances and future research directions for computational fluid dynamics

NASA Technical Reports Server (NTRS)

Baker, A. J.; Soliman, M. O.; Manhardt, P. D.

1986-01-01

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

The elastic theory of shells using geometric algebra.

PubMed

Gregory, A L; Lasenby, J; Agarwal, A

2017-03-01

We present a novel derivation of the elastic theory of shells. We use the language of geometric algebra, which allows us to express the fundamental laws in component-free form, thus aiding physical interpretation. It also provides the tools to express equations in an arbitrary coordinate system, which enhances their usefulness. The role of moments and angular velocity, and the apparent use by previous authors of an unphysical angular velocity, has been clarified through the use of a bivector representation. In the linearized theory, clarification of previous coordinate conventions which have been the cause of confusion is provided, and the introduction of prior strain into the linearized theory of shells is made possible.

Accuracy requirements of optical linear algebra processors in adaptive optics imaging systems

NASA Technical Reports Server (NTRS)

Downie, John D.; Goodman, Joseph W.

1989-01-01

The accuracy requirements of optical processors in adaptive optics systems are determined by estimating the required accuracy in a general optical linear algebra processor (OLAP) that results in a smaller average residual aberration than that achieved with a conventional electronic digital processor with some specific computation speed. Special attention is given to an error analysis of a general OLAP with regard to the residual aberration that is created in an adaptive mirror system by the inaccuracies of the processor, and to the effect of computational speed of an electronic processor on the correction. Results are presented on the ability of an OLAP to compete with a digital processor in various situations.

Mathematical biology modules based on modern molecular biology and modern discrete mathematics.

PubMed

Robeva, Raina; Davies, Robin; Hodge, Terrell; Enyedi, Alexander

2010-01-01

We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network.

Mathematical Biology Modules Based on Modern Molecular Biology and Modern Discrete Mathematics

PubMed Central

Davies, Robin; Hodge, Terrell; Enyedi, Alexander

2010-01-01

We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network. PMID:20810955

Oscillator strengths, first-order properties, and nuclear gradients for local ADC(2).

PubMed

Schütz, Martin

2015-06-07

We describe theory and implementation of oscillator strengths, orbital-relaxed first-order properties, and nuclear gradients for the local algebraic diagrammatic construction scheme through second order. The formalism is derived via time-dependent linear response theory based on a second-order unitary coupled cluster model. The implementation presented here is a modification of our previously developed algorithms for Laplace transform based local time-dependent coupled cluster linear response (CC2LR); the local approximations thus are state specific and adaptive. The symmetry of the Jacobian leads to considerable simplifications relative to the local CC2LR method; as a result, a gradient evaluation is about four times less expensive. Test calculations show that in geometry optimizations, usually very similar geometries are obtained as with the local CC2LR method (provided that a second-order method is applicable). As an exemplary application, we performed geometry optimizations on the low-lying singlet states of chlorophyllide a.

Specter: linear deconvolution for targeted analysis of data-independent acquisition mass spectrometry proteomics.

PubMed

Peckner, Ryan; Myers, Samuel A; Jacome, Alvaro Sebastian Vaca; Egertson, Jarrett D; Abelin, Jennifer G; MacCoss, Michael J; Carr, Steven A; Jaffe, Jacob D

2018-05-01

Mass spectrometry with data-independent acquisition (DIA) is a promising method to improve the comprehensiveness and reproducibility of targeted and discovery proteomics, in theory by systematically measuring all peptide precursors in a biological sample. However, the analytical challenges involved in discriminating between peptides with similar sequences in convoluted spectra have limited its applicability in important cases, such as the detection of single-nucleotide polymorphisms (SNPs) and alternative site localizations in phosphoproteomics data. We report Specter (https://github.com/rpeckner-broad/Specter), an open-source software tool that uses linear algebra to deconvolute DIA mixture spectra directly through comparison to a spectral library, thus circumventing the problems associated with typical fragment-correlation-based approaches. We validate the sensitivity of Specter and its performance relative to that of other methods, and show that Specter is able to successfully analyze cases involving highly similar peptides that are typically challenging for DIA analysis methods.

Approximate analytical solutions in the analysis of elastic structures of complex geometry

NASA Astrophysics Data System (ADS)

Goloskokov, Dmitriy P.; Matrosov, Alexander V.

2018-05-01

A method of analytical decomposition for analysis plane structures of a complex configuration is presented. For each part of the structure in the form of a rectangle all the components of the stress-strain state are constructed by the superposition method. The method is based on two solutions derived in the form of trigonometric series with unknown coefficients using the method of initial functions. The coefficients are determined from the system of linear algebraic equations obtained while satisfying the boundary conditions and the conditions for joining the structure parts. The components of the stress-strain state of a bent plate with holes are calculated using the analytical decomposition method.

Choreographing Patterns and Functions

ERIC Educational Resources Information Center

Hawes, Zachary; Moss, Joan; Finch, Heather; Katz, Jacques

2012-01-01

In this article, the authors begin with a description of an algebraic dance--the translation of composite linear growing patterns into choreographed movement--which was the last component of a research-based instructional unit that focused on fostering an understanding of linear functional rules through geometric growing patterns and…

A high-accuracy optical linear algebra processor for finite element applications

NASA Technical Reports Server (NTRS)

Casasent, D.; Taylor, B. K.

1984-01-01

Optical linear processors are computationally efficient computers for solving matrix-matrix and matrix-vector oriented problems. Optical system errors limit their dynamic range to 30-40 dB, which limits their accuray to 9-12 bits. Large problems, such as the finite element problem in structural mechanics (with tens or hundreds of thousands of variables) which can exploit the speed of optical processors, require the 32 bit accuracy obtainable from digital machines. To obtain this required 32 bit accuracy with an optical processor, the data can be digitally encoded, thereby reducing the dynamic range requirements of the optical system (i.e., decreasing the effect of optical errors on the data) while providing increased accuracy. This report describes a new digitally encoded optical linear algebra processor architecture for solving finite element and banded matrix-vector problems. A linear static plate bending case study is described which quantities the processor requirements. Multiplication by digital convolution is explained, and the digitally encoded optical processor architecture is advanced.

Investigating Years 7 to 12 students' knowledge of linear relationships through different contexts and representations

NASA Astrophysics Data System (ADS)

Wilkie, Karina J.; Ayalon, Michal

2018-02-01

A foundational component of developing algebraic thinking for meaningful calculus learning is the idea of "function" that focuses on the relationship between varying quantities. Students have demonstrated widespread difficulties in learning calculus, particularly interpreting and modeling dynamic events, when they have a poor understanding of relationships between variables. Yet, there are differing views on how to develop students' functional thinking over time. In the Australian curriculum context, linear relationships are introduced to lower secondary students with content that reflects a hybrid of traditional and reform algebra pedagogy. This article discusses an investigation into Australian secondary students' understanding of linear functional relationships from Years 7 to 12 (approximately 12 to 18 years old; n = 215) in their approaches to three tasks (finding rate of change, pattern generalisation and interpretation of gradient) involving four different representations (table, geometric growing pattern, equation and graph). From the findings, it appears that these students' knowledge of linear functions remains context-specific rather than becoming connected over time.

Combinatorics of transformations from standard to non-standard bases in Brauer algebras

NASA Astrophysics Data System (ADS)

Chilla, Vincenzo

2007-05-01

Transformation coefficients between standard bases for irreducible representations of the Brauer centralizer algebra \\mathfrak{B}_f(x) and split bases adapted to the \\mathfrak{B}_{f_1} (x) \\times \\mathfrak{B}_{f_2} (x) \\subset \\mathfrak{B}_f (x) subalgebra (f1 + f2 = f) are considered. After providing the suitable combinatorial background, based on the definition of the i-coupling relation on nodes of the subduction grid, we introduce a generalized version of the subduction graph which extends the one given in Chilla (2006 J. Phys. A: Math. Gen. 39 7657) for symmetric groups. Thus, we can describe the structure of the subduction system arising from the linear method and give an outline of the form of the solution space. An ordering relation on the grid is also given and then, as in the case of symmetric groups, the choices of the phases and of the free factors governing the multiplicity separations are discussed.

Architecting the Finite Element Method Pipeline for the GPU.

PubMed

Fu, Zhisong; Lewis, T James; Kirby, Robert M; Whitaker, Ross T

2014-02-01

The finite element method (FEM) is a widely employed numerical technique for approximating the solution of partial differential equations (PDEs) in various science and engineering applications. Many of these applications benefit from fast execution of the FEM pipeline. One way to accelerate the FEM pipeline is by exploiting advances in modern computational hardware, such as the many-core streaming processors like the graphical processing unit (GPU). In this paper, we present the algorithms and data-structures necessary to move the entire FEM pipeline to the GPU. First we propose an efficient GPU-based algorithm to generate local element information and to assemble the global linear system associated with the FEM discretization of an elliptic PDE. To solve the corresponding linear system efficiently on the GPU, we implement a conjugate gradient method preconditioned with a geometry-informed algebraic multi-grid (AMG) method preconditioner. We propose a new fine-grained parallelism strategy, a corresponding multigrid cycling stage and efficient data mapping to the many-core architecture of GPU. Comparison of our on-GPU assembly versus a traditional serial implementation on the CPU achieves up to an 87 × speedup. Focusing on the linear system solver alone, we achieve a speedup of up to 51 × versus use of a comparable state-of-the-art serial CPU linear system solver. Furthermore, the method compares favorably with other GPU-based, sparse, linear solvers.

Topologically massive gravity and galilean conformal algebra: a study of correlation functions

NASA Astrophysics Data System (ADS)

Bagchi, Arjun

2011-02-01

The Galilean Conformal Algebra (GCA) arises from the conformal algebra in the non-relativistic limit. In two dimensions, one can view it as a limit of linear combinations of the two copies Virasoro algebra. Recently, it has been argued that Topologically Massive Gravity (TMG) realizes the quantum 2d GCA in a particular scaling limit of the gravitational Chern-Simons term. To add strength to this claim, we demonstrate a matching of correlation functions on both sides of this correspondence. A priori looking for spatially dependent correlators seems to force us to deal with high spin operators in the bulk. We get around this difficulty by constructing the non-relativistic Energy-Momentum tensor and considering its correlation functions. On the gravity side, our analysis makes heavy use of recent results of Holographic Renormalization in Topologically Massive Gravity.

Measurements and mathematical formalism of quantum mechanics

NASA Astrophysics Data System (ADS)

Slavnov, D. A.

2007-03-01

A scheme for constructing quantum mechanics is given that does not have Hilbert space and linear operators as its basic elements. Instead, a version of algebraic approach is considered. Elements of a noncommutative algebra (observables) and functionals on this algebra (elementary states) associated with results of single measurements are used as primary components of the scheme. On the one hand, it is possible to use within the scheme the formalism of the standard (Kolmogorov) probability theory, and, on the other hand, it is possible to reproduce the mathematical formalism of standard quantum mechanics, and to study the limits of its applicability. A short outline is given of the necessary material from the theory of algebras and probability theory. It is described how the mathematical scheme of the paper agrees with the theory of quantum measurements, and avoids quantum paradoxes.

ML 3.0 smoothed aggregation user's guide.

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

Sala, Marzio; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen

2004-05-01

ML is a multigrid preconditioning package intended to solve linear systems of equations Az = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. ML should be used on large sparse linear systems arising from partial differential equation (PDE) discretizations. While technically any linear system can be considered, ML should be used on linear systems that correspond to things that work well with multigrid methods (e.g. elliptic PDEs). ML can be used as a stand-alone package ormore » to generate preconditioners for a traditional iterative solver package (e.g. Krylov methods). We have supplied support for working with the AZTEC 2.1 and AZTECOO iterative package [15]. However, other solvers can be used by supplying a few functions. This document describes one specific algebraic multigrid approach: smoothed aggregation. This approach is used within several specialized multigrid methods: one for the eddy current formulation for Maxwell's equations, and a multilevel and domain decomposition method for symmetric and non-symmetric systems of equations (like elliptic equations, or compressible and incompressible fluid dynamics problems). Other methods exist within ML but are not described in this document. Examples are given illustrating the problem definition and exercising multigrid options.« less

ML 3.1 smoothed aggregation user's guide.

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

Sala, Marzio; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen

2004-10-01

ML is a multigrid preconditioning package intended to solve linear systems of equations Ax = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. ML should be used on large sparse linear systems arising from partial differential equation (PDE) discretizations. While technically any linear system can be considered, ML should be used on linear systems that correspond to things that work well with multigrid methods (e.g. elliptic PDEs). ML can be used as a stand-alone package ormore » to generate preconditioners for a traditional iterative solver package (e.g. Krylov methods). We have supplied support for working with the Aztec 2.1 and AztecOO iterative package [16]. However, other solvers can be used by supplying a few functions. This document describes one specific algebraic multigrid approach: smoothed aggregation. This approach is used within several specialized multigrid methods: one for the eddy current formulation for Maxwell's equations, and a multilevel and domain decomposition method for symmetric and nonsymmetric systems of equations (like elliptic equations, or compressible and incompressible fluid dynamics problems). Other methods exist within ML but are not described in this document. Examples are given illustrating the problem definition and exercising multigrid options.« less

Large-scale computation of incompressible viscous flow by least-squares finite element method

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to large-scale/three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations and results in symmetric, positive definite algebraic system which can be solved effectively by simple iterative methods. The first-order velocity-Bernoulli function-vorticity formulation for incompressible viscous flows is also tested. For three-dimensional cases, an additional compatibility equation, i.e., the divergence of the vorticity vector should be zero, is included to make the first-order system elliptic. The simple substitution of the Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. To show the validity of this scheme for large-scale computation, we give numerical results for 2D driven cavity problem at Re = 10000 with 408 x 400 bilinear elements. The flow in a 3D cavity is calculated at Re = 100, 400, and 1,000 with 50 x 50 x 50 trilinear elements. The Taylor-Goertler-like vortices are observed for Re = 1,000.

Transport synthetic acceleration with opposing reflecting boundary conditions

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

Zika, M.R.; Adams, M.L.

2000-02-01

The transport synthetic acceleration (TSA) scheme is extended to problems with opposing reflecting boundary conditions. This synthetic method employs a simplified transport operator as its low-order approximation. A procedure is developed that allows the use of the conjugate gradient (CG) method to solve the resulting low-order system of equations. Several well-known transport iteration algorithms are cast in a linear algebraic form to show their equivalence to standard iterative techniques. Source iteration in the presence of opposing reflecting boundary conditions is shown to be equivalent to a (poorly) preconditioned stationary Richardson iteration, with the preconditioner defined by the method of iteratingmore » on the incident fluxes on the reflecting boundaries. The TSA method (and any synthetic method) amounts to a further preconditioning of the Richardson iteration. The presence of opposing reflecting boundary conditions requires special consideration when developing a procedure to realize the CG method for the proposed system of equations. The CG iteration may be applied only to symmetric positive definite matrices; this condition requires the algebraic elimination of the boundary angular corrections from the low-order equations. As a consequence of this elimination, evaluating the action of the resulting matrix on an arbitrary vector involves two transport sweeps and a transmission iteration. Results of applying the acceleration scheme to a simple test problem are presented.« less

The pre-image problem in kernel methods.

PubMed

Kwok, James Tin-yau; Tsang, Ivor Wai-hung

2004-11-01

In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applications, such as on using kernel principal component analysis (PCA) for image denoising. Unlike the traditional method which relies on nonlinear optimization, our proposed method directly finds the location of the pre-image based on distance constraints in the feature space. It is noniterative, involves only linear algebra and does not suffer from numerical instability or local minimum problems. Evaluations on performing kernel PCA and kernel clustering on the USPS data set show much improved performance.

Aircraft model prototypes which have specified handling-quality time histories

NASA Technical Reports Server (NTRS)

Johnson, S. H.

1978-01-01

Several techniques for obtaining linear constant-coefficient airplane models from specified handling-quality time histories are discussed. The pseudodata method solves the basic problem, yields specified eigenvalues, and accommodates state-variable transfer-function zero suppression. The algebraic equations to be solved are bilinear, at worst. The disadvantages are reduced generality and no assurance that the resulting model will be airplane like in detail. The method is fully illustrated for a fourth-order stability-axis small motion model with three lateral handling quality time histories specified. The FORTRAN program which obtains and verifies the model is included and fully documented.

Material decomposition in an arbitrary number of dimensions using noise compensating projection

NASA Astrophysics Data System (ADS)

O'Donnell, Thomas; Halaweish, Ahmed; Cormode, David; Cheheltani, Rabee; Fayad, Zahi A.; Mani, Venkatesh

2017-03-01

Purpose: Multi-energy CT (e.g., dual energy or photon counting) facilitates the identification of certain compounds via data decomposition. However, the standard approach to decomposition (i.e., solving a system of linear equations) fails if - due to noise - a pixel's vector of HU values falls outside the boundary of values describing possible pure or mixed basis materials. Typically, this is addressed by either throwing away those pixels or projecting them onto the closest point on this boundary. However, when acquiring four (or more) energy volumes, the space bounded by three (or more) materials that may be found in the human body (either naturally or through injection) can be quite small. Noise may significantly limit the number of those pixels to be included within. Therefore, projection onto the boundary becomes an important option. But, projection in higher than 3 dimensional space is not possible with standard vector algebra: the cross-product is not defined. Methods: We describe a technique which employs Clifford Algebra to perform projection in an arbitrary number of dimensions. Clifford Algebra describes a manipulation of vectors that incorporates the concepts of addition, subtraction, multiplication, and division. Thereby, vectors may be operated on like scalars forming a true algebra. Results: We tested our approach on a phantom containing inserts of calcium, gadolinium, iodine, gold nanoparticles and mixtures of pairs thereof. Images were acquired on a prototype photon counting CT scanner under a range of threshold combinations. Comparison of the accuracy of different threshold combinations versus ground truth are presented. Conclusions: Material decomposition is possible with three or more materials and four or more energy thresholds using Clifford Algebra projection to mitigate noise.

Evaluation of out-of-core computer programs for the solution of symmetric banded linear equations. [simultaneous equations

NASA Technical Reports Server (NTRS)

Dunham, R. S.

1976-01-01

FORTRAN coded out-of-core equation solvers that solve using direct methods symmetric banded systems of simultaneous algebraic equations. Banded, frontal and column (skyline) solvers were studied as well as solvers that can partition the working area and thus could fit into any available core. Comparison timings are presented for several typical two dimensional and three dimensional continuum type grids of elements with and without midside nodes. Extensive conclusions are also given.

Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems

NASA Technical Reports Server (NTRS)

Wigton, Larry

1996-01-01

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.

On controllability of homogeneous and inhomogeneous discrete-time multi-input bilinear systems in dimension two

NASA Astrophysics Data System (ADS)

Tie, Lin

2017-08-01

In this paper, the controllability problem of two-dimensional discrete-time multi-input bilinear systems is completely solved. The homogeneous and the inhomogeneous cases are studied separately and necessary and sufficient conditions for controllability are established by using a linear algebraic method, which are easy to apply. Moreover, for the uncontrollable systems, near-controllability is considered and similar necessary and sufficient conditions are also obtained. Finally, examples are provided to demonstrate the results of this paper.

Kinetic Rate Kernels via Hierarchical Liouville-Space Projection Operator Approach.

PubMed

Zhang, Hou-Dao; Yan, YiJing

2016-05-19

Kinetic rate kernels in general multisite systems are formulated on the basis of a nonperturbative quantum dissipation theory, the hierarchical equations of motion (HEOM) formalism, together with the Nakajima-Zwanzig projection operator technique. The present approach exploits the HEOM-space linear algebra. The quantum non-Markovian site-to-site transfer rate can be faithfully evaluated via projected HEOM dynamics. The developed method is exact, as evident by the comparison to the direct HEOM evaluation results on the population evolution.

q-Derivatives, quantization methods and q-algebras

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

Twarock, Reidun

1998-12-15

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

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

Luszczek, Piotr R; Tomov, Stanimire Z; Dongarra, Jack J

We present an efficient and scalable programming model for the development of linear algebra in heterogeneous multi-coprocessor environments. The model incorporates some of the current best design and implementation practices for the heterogeneous acceleration of dense linear algebra (DLA). Examples are given as the basis for solving linear systems' algorithms - the LU, QR, and Cholesky factorizations. To generate the extreme level of parallelism needed for the efficient use of coprocessors, algorithms of interest are redesigned and then split into well-chosen computational tasks. The tasks execution is scheduled over the computational components of a hybrid system of multi-core CPUs andmore » coprocessors using a light-weight runtime system. The use of lightweight runtime systems keeps scheduling overhead low, while enabling the expression of parallelism through otherwise sequential code. This simplifies the development efforts and allows the exploration of the unique strengths of the various hardware components.« less

Gender differences in algebraic thinking ability to solve mathematics problems

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Automorphisms of Order Structures of Abelian Parts of Operator Algebras and Their Role in Quantum Theory

NASA Astrophysics Data System (ADS)

Hamhalter, Jan; Turilova, Ekaterina

2014-10-01

It is shown that any order isomorphism between the structures of unital associative JB subalgebras of JB algebras is given naturally by a partially linear Jordan isomorphism. The same holds for nonunital subalgebras and order isomorphisms preserving the unital subalgebra. Finally, we recover usual action of time evolution group on a von Neumann factor from group of automorphisms of the structure of Abelian subalgebras.

Electrokinetics Models for Micro and Nano Fluidic Impedance Sensors

DTIC Science & Technology

2010-11-01

primitive Differential-Algebraic Equations (DAEs), used to process and interpret the experimentally measured electrical impedance data (Sun and Morgan...field, and species respectively. A second-order scheme was used to calculate the ionic species distribution. The linearized algebraic equations were...is governed by the Poisson equation 2 0 0 r i i i F z cε ε φ∇ + =∑ where ε0 and εr are, respectively, the electrical permittivity in the vacuum

Graphs and matroids weighted in a bounded incline algebra.

PubMed

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.