WorldWideScience

Sample records for graphing linear equations

  1. Hadronic equation of state in the statistical bootstrap model and linear graph theory

    International Nuclear Information System (INIS)

    Fre, P.; Page, R.

    1976-01-01

    Taking a statistical mechanical point og view, the statistical bootstrap model is discussed and, from a critical analysis of the bootstrap volume comcept, it is reached a physical ipothesis, which leads immediately to the hadronic equation of state provided by the bootstrap integral equation. In this context also the connection between the statistical bootstrap and the linear graph theory approach to interacting gases is analyzed

  2. The Use of Graphs in Specific Situations of the Initial Conditions of Linear Differential Equations

    Science.gov (United States)

    Buendía, Gabriela; Cordero, Francisco

    2013-01-01

    In this article, we present a discussion on the role of graphs and its significance in the relation between the number of initial conditions and the order of a linear differential equation, which is known as the initial value problem. We propose to make a functional framework for the use of graphs that intends to broaden the explanations of the…

  3. Allowable graphs of the nonlinear Schrödinger equation and their ...

    Indian Academy of Sciences (India)

    Bich Nguyen

    2017-11-20

    Nov 20, 2017 ... Non-linear Schrödinger equation; graphs; characteristic polynomial; .... Allowable graphs of the NLS and their applications. 795 ...... nonlinear Schroödinger equation, J. Algebra Appl. 16 (2017) 37 pp., https://doi.org/10.1142/.

  4. Half-trek criterion for generic identifiability of linear structural equation models

    NARCIS (Netherlands)

    Foygel, R.; Draisma, J.; Drton, M.

    2012-01-01

    A linear structural equation model relates random variables of interest and corresponding Gaussian noise terms via a linear equation system. Each such model can be represented by a mixed graph in which directed edges encode the linear equations, and bidirected edges indicate possible correlations

  5. Half-trek criterion for generic identifiability of linear structural equation models

    NARCIS (Netherlands)

    Foygel, R.; Draisma, J.; Drton, M.

    2011-01-01

    A linear structural equation model relates random variables of interest and corresponding Gaussian noise terms via a linear equation system. Each such model can be represented by a mixed graph in which directed edges encode the linear equations, and bidirected edges indicate possible correlations

  6. Learning a Nonnegative Sparse Graph for Linear Regression.

    Science.gov (United States)

    Fang, Xiaozhao; Xu, Yong; Li, Xuelong; Lai, Zhihui; Wong, Wai Keung

    2015-09-01

    Previous graph-based semisupervised learning (G-SSL) methods have the following drawbacks: 1) they usually predefine the graph structure and then use it to perform label prediction, which cannot guarantee an overall optimum and 2) they only focus on the label prediction or the graph structure construction but are not competent in handling new samples. To this end, a novel nonnegative sparse graph (NNSG) learning method was first proposed. Then, both the label prediction and projection learning were integrated into linear regression. Finally, the linear regression and graph structure learning were unified within the same framework to overcome these two drawbacks. Therefore, a novel method, named learning a NNSG for linear regression was presented, in which the linear regression and graph learning were simultaneously performed to guarantee an overall optimum. In the learning process, the label information can be accurately propagated via the graph structure so that the linear regression can learn a discriminative projection to better fit sample labels and accurately classify new samples. An effective algorithm was designed to solve the corresponding optimization problem with fast convergence. Furthermore, NNSG provides a unified perceptiveness for a number of graph-based learning methods and linear regression methods. The experimental results showed that NNSG can obtain very high classification accuracy and greatly outperforms conventional G-SSL methods, especially some conventional graph construction methods.

  7. Graph theory and the Virasoro master equation

    International Nuclear Information System (INIS)

    Obers, N.A.J.

    1991-01-01

    A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equation is given. By studying ansaetze of the master equation, the author obtains exact solutions and gains insight in the structure of large slices of affine-Virasoro space. He finds an isomorphism between the constructions in the ansatz SO(n) diag , which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabeled graphs of order n. On the one hand, the conformal constructions, are classified by the graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graph of graph theory. He also defines a class of magic Lie group bases in which the Virasoro master equation admits a simple metric ansatz {g metric }, whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g metric is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n) diag in the Cartesian basis of SO(n), and the ansatz SU(n) metric in the Pauli-like basis of SU(n). Finally, he defines the 'sine-area graphs' of SU(n), which label the conformal field theories of SU(n) metric , and he notes that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g metric

  8. Many-core graph analytics using accelerated sparse linear algebra routines

    Science.gov (United States)

    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.

  9. Global dynamics for switching systems and their extensions by linear differential equations.

    Science.gov (United States)

    Huttinga, Zane; Cummins, Bree; Gedeon, Tomáš; Mischaikow, Konstantin

    2018-03-15

    Switching systems use piecewise constant nonlinearities to model gene regulatory networks. This choice provides advantages in the analysis of behavior and allows the global description of dynamics in terms of Morse graphs associated to nodes of a parameter graph. The parameter graph captures spatial characteristics of a decomposition of parameter space into domains with identical Morse graphs. However, there are many cellular processes that do not exhibit threshold-like behavior and thus are not well described by a switching system. We consider a class of extensions of switching systems formed by a mixture of switching interactions and chains of variables governed by linear differential equations. We show that the parameter graphs associated to the switching system and any of its extensions are identical. For each parameter graph node, there is an order-preserving map from the Morse graph of the switching system to the Morse graph of any of its extensions. We provide counterexamples that show why possible stronger relationships between the Morse graphs are not valid.

  10. Global dynamics for switching systems and their extensions by linear differential equations

    Science.gov (United States)

    Huttinga, Zane; Cummins, Bree; Gedeon, Tomáš; Mischaikow, Konstantin

    2018-03-01

    Switching systems use piecewise constant nonlinearities to model gene regulatory networks. This choice provides advantages in the analysis of behavior and allows the global description of dynamics in terms of Morse graphs associated to nodes of a parameter graph. The parameter graph captures spatial characteristics of a decomposition of parameter space into domains with identical Morse graphs. However, there are many cellular processes that do not exhibit threshold-like behavior and thus are not well described by a switching system. We consider a class of extensions of switching systems formed by a mixture of switching interactions and chains of variables governed by linear differential equations. We show that the parameter graphs associated to the switching system and any of its extensions are identical. For each parameter graph node, there is an order-preserving map from the Morse graph of the switching system to the Morse graph of any of its extensions. We provide counterexamples that show why possible stronger relationships between the Morse graphs are not valid.

  11. A linear graph for digoxin radioimmunoassay

    International Nuclear Information System (INIS)

    Smith, S.E.; Richter, A.

    1975-01-01

    The determination of drug or hormone concentrations by radio-immunoassay involves interpolation of values for radioisotope counts within standard curves, a technique which requires some dexterity in curve drawing and which results in some inaccuracy in practice. Most of the procedures designed to overcome these difficulties are complex and time-consuming. In radioimmunoassays involving saturation of the antibody-binding sites a special case exists in that the bound radioactivity is directly proportional to the specific activity of the ligand in the system. Thus a graph of the ratio of radioactivity bound in the absence to that in the presence of added non-radioactive ligand is linear against the concentration of added ligand (Hales,C.N., and Randle, P.J., 1963, Biochem. J., vol. 88, 137). A description is given of a simple and convenient modification of their method, and its application to the routine clinical determination of digoxin using a commercial kit (Lanoxitest β digoxin radioimmunoassay kit, Wellcome Reagents Ltd.). Specially constructed graph paper, which yields linearity with standard solutions, was designed so that it could be used directly without data transmission. The specific activity function appears as the upper arithmetical horizontal scale; corresponding values of the concentration of non-radioactive ligand in the solution added were individually calculated and appear on the lower scale opposite the appropriate values of the upper scale. The linearity of the graphs obtained confirmed that binding of digoxin was approximately constant through the range of clinical concentrations tested (0.5 to 8ng/ml), although binding declined slightly at higher concentrations. (U.K.)

  12. Graph-based linear scaling electronic structure theory

    Energy Technology Data Exchange (ETDEWEB)

    Niklasson, Anders M. N., E-mail: amn@lanl.gov; Negre, Christian F. A.; Cawkwell, Marc J.; Swart, Pieter J.; Germann, Timothy C.; Bock, Nicolas [Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Mniszewski, Susan M.; Mohd-Yusof, Jamal; Wall, Michael E.; Djidjev, Hristo [Computer, Computational, and Statistical Sciences Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Rubensson, Emanuel H. [Division of Scientific Computing, Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala (Sweden)

    2016-06-21

    We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.

  13. On Graph C*-Algebras with a Linear Ideal Lattice

    DEFF Research Database (Denmark)

    Eilers, Søren; Restorff, Gunnar; Ruiz, Efren

    2010-01-01

    At the cost of restricting the nature of the involved K-groups, we prove a classication result for a hitherto unexplored class of graph C-algebras, allowing us to classify all graph C-algebras on nitely many vertices with a nite linear ideal lattice if all pair of vertices are connected by innitely...

  14. Labeling RDF Graphs for Linear Time and Space Querying

    Science.gov (United States)

    Furche, Tim; Weinzierl, Antonius; Bry, François

    Indices and data structures for web querying have mostly considered tree shaped data, reflecting the view of XML documents as tree-shaped. However, for RDF (and when querying ID/IDREF constraints in XML) data is indisputably graph-shaped. In this chapter, we first study existing indexing and labeling schemes for RDF and other graph datawith focus on support for efficient adjacency and reachability queries. For XML, labeling schemes are an important part of the widespread adoption of XML, in particular for mapping XML to existing (relational) database technology. However, the existing indexing and labeling schemes for RDF (and graph data in general) sacrifice one of the most attractive properties of XML labeling schemes, the constant time (and per-node space) test for adjacency (child) and reachability (descendant). In the second part, we introduce the first labeling scheme for RDF data that retains this property and thus achieves linear time and space processing of acyclic RDF queries on a significantly larger class of graphs than previous approaches (which are mostly limited to tree-shaped data). Finally, we show how this labeling scheme can be applied to (acyclic) SPARQL queries to obtain an evaluation algorithm with time and space complexity linear in the number of resources in the queried RDF graph.

  15. Partition function expansion on region graphs and message-passing equations

    International Nuclear Information System (INIS)

    Zhou, Haijun; Wang, Chuang; Xiao, Jing-Qing; Bi, Zedong

    2011-01-01

    Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods. But finite-dimensional 'real' systems remain very challenging because of the abundance of short loops and strong local correlations. A statistical mechanics theory is constructed in this paper for finite-dimensional models based on the mathematical framework of the partition function expansion and the concept of region graphs. Rigorous expressions for the free energy and grand free energy are derived. Message-passing equations on the region graph, such as belief propagation and survey propagation, are also derived rigorously. (letter)

  16. On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs

    International Nuclear Information System (INIS)

    Bayati, Mohsen; Borgs, Christian; Chayes, Jennifer; Zecchina, Riccardo

    2008-01-01

    We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programing relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution both for synchronous and asynchronous updating. (letter)

  17. Generalizing a categorization of students’ interpretations of linear kinematics graphs

    Directory of Open Access Journals (Sweden)

    Laurens Bollen

    2016-02-01

    Full Text Available We have investigated whether and how a categorization of responses to questions on linear distance-time graphs, based on a study of Irish students enrolled in an algebra-based course, could be adopted and adapted to responses from students enrolled in calculus-based physics courses at universities in Flanders, Belgium (KU Leuven and the Basque Country, Spain (University of the Basque Country. We discuss how we adapted the categorization to accommodate a much more diverse student cohort and explain how the prior knowledge of students may account for many differences in the prevalence of approaches and success rates. Although calculus-based physics students make fewer mistakes than algebra-based physics students, they encounter similar difficulties that are often related to incorrectly dividing two coordinates. We verified that a qualitative understanding of kinematics is an important but not sufficient condition for students to determine a correct value for the speed. When comparing responses to questions on linear distance-time graphs with responses to isomorphic questions on linear water level versus time graphs, we observed that the context of a question influences the approach students use. Neither qualitative understanding nor an ability to find the slope of a context-free graph proved to be a reliable predictor for the approach students use when they determine the instantaneous speed.

  18. Generalizing a categorization of students' interpretations of linear kinematics graphs

    Science.gov (United States)

    Bollen, Laurens; De Cock, Mieke; Zuza, Kristina; Guisasola, Jenaro; van Kampen, Paul

    2016-06-01

    We have investigated whether and how a categorization of responses to questions on linear distance-time graphs, based on a study of Irish students enrolled in an algebra-based course, could be adopted and adapted to responses from students enrolled in calculus-based physics courses at universities in Flanders, Belgium (KU Leuven) and the Basque Country, Spain (University of the Basque Country). We discuss how we adapted the categorization to accommodate a much more diverse student cohort and explain how the prior knowledge of students may account for many differences in the prevalence of approaches and success rates. Although calculus-based physics students make fewer mistakes than algebra-based physics students, they encounter similar difficulties that are often related to incorrectly dividing two coordinates. We verified that a qualitative understanding of kinematics is an important but not sufficient condition for students to determine a correct value for the speed. When comparing responses to questions on linear distance-time graphs with responses to isomorphic questions on linear water level versus time graphs, we observed that the context of a question influences the approach students use. Neither qualitative understanding nor an ability to find the slope of a context-free graph proved to be a reliable predictor for the approach students use when they determine the instantaneous speed.

  19. Local Fractional Laplace Variational Iteration Method for Solving Linear Partial Differential Equations with Local Fractional Derivative

    Directory of Open Access Journals (Sweden)

    Ai-Min Yang

    2014-01-01

    Full Text Available The local fractional Laplace variational iteration method was applied to solve the linear local fractional partial differential equations. The local fractional Laplace variational iteration method is coupled by the local fractional variational iteration method and Laplace transform. The nondifferentiable approximate solutions are obtained and their graphs are also shown.

  20. Linear integral equations and soliton systems

    International Nuclear Information System (INIS)

    Quispel, G.R.W.

    1983-01-01

    A study is presented of classical integrable dynamical systems in one temporal and one spatial dimension. The direct linearizations are given of several nonlinear partial differential equations, for example the Korteweg-de Vries equation, the modified Korteweg-de Vries equation, the sine-Gordon equation, the nonlinear Schroedinger equation, and the equation of motion for the isotropic Heisenberg spin chain; the author also discusses several relations between these equations. The Baecklund transformations of these partial differential equations are treated on the basis of a singular transformation of the measure (or equivalently of the plane-wave factor) occurring in the corresponding linear integral equations, and the Baecklund transformations are used to derive the direct linearization of a chain of so-called modified partial differential equations. Finally it is shown that the singular linear integral equations lead in a natural way to the direct linearizations of various nonlinear difference-difference equations. (Auth.)

  1. Quantum linear Boltzmann equation

    International Nuclear Information System (INIS)

    Vacchini, Bassano; Hornberger, Klaus

    2009-01-01

    We review the quantum version of the linear Boltzmann equation, which describes in a non-perturbative fashion, by means of scattering theory, how the quantum motion of a single test particle is affected by collisions with an ideal background gas. A heuristic derivation of this Lindblad master equation is presented, based on the requirement of translation-covariance and on the relation to the classical linear Boltzmann equation. After analyzing its general symmetry properties and the associated relaxation dynamics, we discuss a quantum Monte Carlo method for its numerical solution. We then review important limiting forms of the quantum linear Boltzmann equation, such as the case of quantum Brownian motion and pure collisional decoherence, as well as the application to matter wave optics. Finally, we point to the incorporation of quantum degeneracies and self-interactions in the gas by relating the equation to the dynamic structure factor of the ambient medium, and we provide an extension of the equation to include internal degrees of freedom.

  2. Time signal filtering by relative neighborhood graph localized linear approximation

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    1994-01-01

    A time signal filtering algorithm based on the relative neighborhood graph (RNG) used for localization of linear filters is proposed. The filter is constructed from a training signal during two stages. During the first stage an RNG is constructed. During the second stage, localized linear filters...

  3. Accurate electrostatic and van der Waals pull-in prediction for fully clamped nano/micro-beams using linear universal graphs of pull-in instability

    Science.gov (United States)

    Tahani, Masoud; Askari, Amir R.

    2014-09-01

    In spite of the fact that pull-in instability of electrically actuated nano/micro-beams has been investigated by many researchers to date, no explicit formula has been presented yet which can predict pull-in voltage based on a geometrically non-linear and distributed parameter model. The objective of present paper is to introduce a simple and accurate formula to predict this value for a fully clamped electrostatically actuated nano/micro-beam. To this end, a non-linear Euler-Bernoulli beam model is employed, which accounts for the axial residual stress, geometric non-linearity of mid-plane stretching, distributed electrostatic force and the van der Waals (vdW) attraction. The non-linear boundary value governing equation of equilibrium is non-dimensionalized and solved iteratively through single-term Galerkin based reduced order model (ROM). The solutions are validated thorough direct comparison with experimental and other existing results reported in previous studies. Pull-in instability under electrical and vdW loads are also investigated using universal graphs. Based on the results of these graphs, non-dimensional pull-in and vdW parameters, which are defined in the text, vary linearly versus the other dimensionless parameters of the problem. Using this fact, some linear equations are presented to predict pull-in voltage, the maximum allowable length, the so-called detachment length, and the minimum allowable gap for a nano/micro-system. These linear equations are also reduced to a couple of universal pull-in formulas for systems with small initial gap. The accuracy of the universal pull-in formulas are also validated by comparing its results with available experimental and some previous geometric linear and closed-form findings published in the literature.

  4. Linear superposition solutions to nonlinear wave equations

    International Nuclear Information System (INIS)

    Liu Yu

    2012-01-01

    The solutions to a linear wave equation can satisfy the principle of superposition, i.e., the linear superposition of two or more known solutions is still a solution of the linear wave equation. We show in this article that many nonlinear wave equations possess exact traveling wave solutions involving hyperbolic, triangle, and exponential functions, and the suitable linear combinations of these known solutions can also constitute linear superposition solutions to some nonlinear wave equations with special structural characteristics. The linear superposition solutions to the generalized KdV equation K(2,2,1), the Oliver water wave equation, and the k(n, n) equation are given. The structure characteristic of the nonlinear wave equations having linear superposition solutions is analyzed, and the reason why the solutions with the forms of hyperbolic, triangle, and exponential functions can form the linear superposition solutions is also discussed

  5. Linear and quasi-linear equations of parabolic type

    CERN Document Server

    Ladyženskaja, O A; Ural′ceva, N N; Uralceva, N N

    1968-01-01

    Equations of parabolic type are encountered in many areas of mathematics and mathematical physics, and those encountered most frequently are linear and quasi-linear parabolic equations of the second order. In this volume, boundary value problems for such equations are studied from two points of view: solvability, unique or otherwise, and the effect of smoothness properties of the functions entering the initial and boundary conditions on the smoothness of the solutions.

  6. Guidelines for a graph-theoretic implementation of structural equation modeling

    Science.gov (United States)

    Grace, James B.; Schoolmaster, Donald R.; Guntenspergen, Glenn R.; Little, Amanda M.; Mitchell, Brian R.; Miller, Kathryn M.; Schweiger, E. William

    2012-01-01

    Structural equation modeling (SEM) is increasingly being chosen by researchers as a framework for gaining scientific insights from the quantitative analyses of data. New ideas and methods emerging from the study of causality, influences from the field of graphical modeling, and advances in statistics are expanding the rigor, capability, and even purpose of SEM. Guidelines for implementing the expanded capabilities of SEM are currently lacking. In this paper we describe new developments in SEM that we believe constitute a third-generation of the methodology. Most characteristic of this new approach is the generalization of the structural equation model as a causal graph. In this generalization, analyses are based on graph theoretic principles rather than analyses of matrices. Also, new devices such as metamodels and causal diagrams, as well as an increased emphasis on queries and probabilistic reasoning, are now included. Estimation under a graph theory framework permits the use of Bayesian or likelihood methods. The guidelines presented start from a declaration of the goals of the analysis. We then discuss how theory frames the modeling process, requirements for causal interpretation, model specification choices, selection of estimation method, model evaluation options, and use of queries, both to summarize retrospective results and for prospective analyses. The illustrative example presented involves monitoring data from wetlands on Mount Desert Island, home of Acadia National Park. Our presentation walks through the decision process involved in developing and evaluating models, as well as drawing inferences from the resulting prediction equations. In addition to evaluating hypotheses about the connections between human activities and biotic responses, we illustrate how the structural equation (SE) model can be queried to understand how interventions might take advantage of an environmental threshold to limit Typha invasions. The guidelines presented provide for

  7. Parallel assembling and equation solving via graph algorithms with an application to the FE simulation of metal extrusion processes

    CERN Document Server

    Unterkircher, A

    2005-01-01

    We propose methods for parallel assembling and iterative equation solving based on graph algorithms. The assembling technique is independent of dimension, element type and model shape. As a parallel solving technique we construct a multiplicative symmetric Schwarz preconditioner for the conjugate gradient method. Both methods have been incorporated into a non-linear FE code to simulate 3D metal extrusion processes. We illustrate the efficiency of these methods on shared memory computers by realistic examples.

  8. Linear determining equations for differential constraints

    International Nuclear Information System (INIS)

    Kaptsov, O V

    1998-01-01

    A construction of differential constraints compatible with partial differential equations is considered. Certain linear determining equations with parameters are used to find such differential constraints. They generalize the classical determining equations used in the search for admissible Lie operators. As applications of this approach equations of an ideal incompressible fluid and non-linear heat equations are discussed

  9. Isomorphism of Intransitive Linear Lie Equations

    Directory of Open Access Journals (Sweden)

    Jose Miguel Martins Veloso

    2009-11-01

    Full Text Available We show that formal isomorphism of intransitive linear Lie equations along transversal to the orbits can be extended to neighborhoods of these transversal. In analytic cases, the word formal is dropped from theorems. Also, we associate an intransitive Lie algebra with each intransitive linear Lie equation, and from the intransitive Lie algebra we recover the linear Lie equation, unless of formal isomorphism. The intransitive Lie algebra gives the structure functions introduced by É. Cartan.

  10. The stationary sine-Gordon equation on metric graphs: Exact analytical solutions for simple topologies

    Science.gov (United States)

    Sabirov, K.; Rakhmanov, S.; Matrasulov, D.; Susanto, H.

    2018-04-01

    We consider the stationary sine-Gordon equation on metric graphs with simple topologies. Exact analytical solutions are obtained for different vertex boundary conditions. It is shown that the method can be extended for tree and other simple graph topologies. Applications of the obtained results to branched planar Josephson junctions and Josephson junctions with tricrystal boundaries are discussed.

  11. Students’ difficulties in solving linear equation problems

    Science.gov (United States)

    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.

  12. Computing with linear equations and matrices

    International Nuclear Information System (INIS)

    Churchhouse, R.F.

    1983-01-01

    Systems of linear equations and matrices arise in many disciplines. The equations may accurately represent conditions satisfied by a system or, more likely, provide an approximation to a more complex system of non-linear or differential equations. The system may involve a few or many thousand unknowns and each individual equation may involve few or many of them. Over the past 50 years a vast literature on methods for solving systems of linear equations and the associated problems of finding the inverse or eigenvalues of a matrix has been produced. These lectures cover those methods which have been found to be most useful for dealing with such types of problem. References are given where appropriate and attention is drawn to the possibility of improved methods for use on vector and parallel processors. (orig.)

  13. Correct Linearization of Einstein's Equations

    Directory of Open Access Journals (Sweden)

    Rabounski D.

    2006-06-01

    Full Text Available Regularly Einstein's equations can be reduced to a wave form (linearly dependent from the second derivatives of the space metric in the absence of gravitation, the space rotation and Christoffel's symbols. As shown here, the origin of the problem is that one uses the general covariant theory of measurement. Here the wave form of Einstein's equations is obtained in the terms of Zelmanov's chronometric invariants (physically observable projections on the observer's time line and spatial section. The obtained equations depend on solely the second derivatives even if gravitation, the space rotation and Christoffel's symbols. The correct linearization proves: the Einstein equations are completely compatible with weak waves of the metric.

  14. Diffusive limits for linear transport equations

    International Nuclear Information System (INIS)

    Pomraning, G.C.

    1992-01-01

    The authors show that the Hibert and Chapman-Enskog asymptotic treatments that reduce the nonlinear Boltzmann equation to the Euler and Navier-Stokes fluid equations have analogs in linear transport theory. In this linear setting, these fluid limits are described by diffusion equations, involving familiar and less familiar diffusion coefficients. Because of the linearity extant, one can carry out explicitly the initial and boundary layer analyses required to obtain asymptotically consistent initial and boundary conditions for the diffusion equations. In particular, the effects of boundary curvature and boundary condition variation along the surface can be included in the boundary layer analysis. A brief review of heuristic (nonasymptotic) diffusion description derivations is also included in our discussion

  15. Spectral theories for linear differential equations

    International Nuclear Information System (INIS)

    Sell, G.R.

    1976-01-01

    The use of spectral analysis in the study of linear differential equations with constant coefficients is not only a fundamental technique but also leads to far-reaching consequences in describing the qualitative behaviour of the solutions. The spectral analysis, via the Jordan canonical form, will not only lead to a representation theorem for a basis of solutions, but will also give a rather precise statement of the (exponential) growth rates of various solutions. Various attempts have been made to extend this analysis to linear differential equations with time-varying coefficients. The most complete such extensions is the Floquet theory for equations with periodic coefficients. For time-varying linear differential equations with aperiodic coefficients several authors have attempted to ''extend'' the Foquet theory. The precise meaning of such an extension is itself a problem, and we present here several attempts in this direction that are related to the general problem of extending the spectral analysis of equations with constant coefficients. The main purpose of this paper is to introduce some problems of current research. The primary problem we shall examine occurs in the context of linear differential equations with almost periodic coefficients. We call it ''the Floquet problem''. (author)

  16. Lie algebras and linear differential equations.

    Science.gov (United States)

    Brockett, R. W.; Rahimi, A.

    1972-01-01

    Certain symmetry properties possessed by the solutions of linear differential equations are examined. For this purpose, some basic ideas from the theory of finite dimensional linear systems are used together with the work of Wei and Norman on the use of Lie algebraic methods in differential equation theory.

  17. Generalizing a Categorization of Students' Interpretations of Linear Kinematics Graphs

    Science.gov (United States)

    Bollen, Laurens; De Cock, Mieke; Zuza, Kristina; Guisasola, Jenaro; van Kampen, Paul

    2016-01-01

    We have investigated whether and how a categorization of responses to questions on linear distance-time graphs, based on a study of Irish students enrolled in an algebra-based course, could be adopted and adapted to responses from students enrolled in calculus-based physics courses at universities in Flanders, Belgium (KU Leuven) and the Basque…

  18. Linear q-nonuniform difference equations

    International Nuclear Information System (INIS)

    Bangerezako, Gaspard

    2010-01-01

    We introduce basic concepts of q-nonuniform differentiation and integration and study linear q-nonuniform difference equations and systems, as well as their application in q-nonuniform difference linear control systems. (author)

  19. Differentiated Learning Environment--A Classroom for Quadratic Equation, Function and Graphs

    Science.gov (United States)

    Dinç, Emre

    2017-01-01

    This paper will cover the design of a learning environment as a classroom regarding the Quadratic Equations, Functions and Graphs. The goal of the learning environment offered in the paper is to design a classroom where students will enjoy the process, use their skills they already have during the learning process, control and plan their learning…

  20. Schwarz maps of algebraic linear ordinary differential equations

    Science.gov (United States)

    Sanabria Malagón, Camilo

    2017-12-01

    A linear ordinary differential equation is called algebraic if all its solution are algebraic over its field of definition. In this paper we solve the problem of finding closed form solution to algebraic linear ordinary differential equations in terms of standard equations. Furthermore, we obtain a method to compute all algebraic linear ordinary differential equations with rational coefficients by studying their associated Schwarz map through the Picard-Vessiot Theory.

  1. Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

    International Nuclear Information System (INIS)

    Rosicka, M; Ramanathan, R; Gnaciński, P; Horodecki, M; Horodecki, K; Horodecki, P; Severini, S

    2016-01-01

    We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions. (paper)

  2. Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

    Science.gov (United States)

    Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S.

    2016-04-01

    We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.

  3. Semigroup methods for evolution equations on networks

    CERN Document Server

    Mugnolo, Delio

    2014-01-01

    This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations.  Yet the topic of differential equations on graphs, ramified spaces, and more general network-like objects has recently gained significant momentum and, well beyond the confines of mathematics, there is a lively interdisciplinary discourse on all aspects of so-called complex networks. Such network-like structures can be found in virtually all branches of science, engineering and the humanities, and future research thus calls for solid theoretical foundations.      This book is specifically devoted to the study of evolution equations – i.e., of time-dependent differential equations such as the heat equation, the wave equation, or the Schrödinger equation (quantum graphs) – bearing in mind that the majority of the literature in the last ten years on the subject of differential equations of graphs has been devoted to ellip...

  4. Basic linear partial differential equations

    CERN Document Server

    Treves, Francois

    1975-01-01

    Focusing on the archetypes of linear partial differential equations, this text for upper-level undergraduates and graduate students features most of the basic classical results. The methods, however, are decidedly nontraditional: in practically every instance, they tend toward a high level of abstraction. This approach recalls classical material to contemporary analysts in a language they can understand, as well as exploiting the field's wealth of examples as an introduction to modern theories.The four-part treatment covers the basic examples of linear partial differential equations and their

  5. Non-local quasi-linear parabolic equations

    International Nuclear Information System (INIS)

    Amann, H

    2005-01-01

    This is a survey of the most common approaches to quasi-linear parabolic evolution equations, a discussion of their advantages and drawbacks, and a presentation of an entirely new approach based on maximal L p regularity. The general results here apply, above all, to parabolic initial-boundary value problems that are non-local in time. This is illustrated by indicating their relevance for quasi-linear parabolic equations with memory and, in particular, for time-regularized versions of the Perona-Malik equation of image processing

  6. State space model extraction of thermohydraulic systems – Part I: A linear graph approach

    International Nuclear Information System (INIS)

    Uren, K.R.; Schoor, G. van

    2013-01-01

    Thermohydraulic simulation codes are increasingly making use of graphical design interfaces. The user can quickly and easily design a thermohydraulic system by placing symbols on the screen resembling system components. These components can then be connected to form a system representation. Such system models may then be used to obtain detailed simulations of the physical system. Usually this kind of simulation models are too complex and not ideal for control system design. Therefore, a need exists for automated techniques to extract lumped parameter models useful for control system design. The goal of this first paper, in a two part series, is to propose a method that utilises a graphical representation of a thermohydraulic system, and a lumped parameter modelling approach, to extract state space models. In this methodology each physical domain of the thermohydraulic system is represented by a linear graph. These linear graphs capture the interaction between all components within and across energy domains – hydraulic, thermal and mechanical. These linear graphs are analysed using a graph-theoretic approach to derive reduced order state space models. These models capture the dominant dynamics of the thermohydraulic system and are ideal for control system design purposes. The proposed state space model extraction method is demonstrated by considering a U-tube system. A non-linear state space model is extracted representing both the hydraulic and thermal domain dynamics of the system. The simulated state space model is compared with a Flownex ® model of the U-tube. Flownex ® is a validated systems thermal-fluid simulation software package. - Highlights: • A state space model extraction methodology based on graph-theoretic concepts. • An energy-based approach to consider multi-domain systems in a common framework. • Allow extraction of transparent (white-box) state space models automatically. • Reduced order models containing only independent state

  7. The Cauchy problem for non-linear Klein-Gordon equations

    International Nuclear Information System (INIS)

    Simon, J.C.H.; Taflin, E.

    1993-01-01

    We consider in R n+1 , n≥2, the non-linear Klein-Gordon equation. We prove for such an equation that there is neighbourhood of zero in a Hilbert space of initial conditions for which the Cauchy problem has global solutions and on which there is asymptotic completeness. The inverse of the wave operator linearizes the non-linear equation. If, moreover, the equation is manifestly Poincare covariant then the non-linear representation of the Poincare-Lie algebra, associated with the non-linear Klein-Gordon equation is integrated to a non-linear representation of the Poincare group on an invariant neighbourhood of zero in the Hilbert space. This representation is linearized by the inverse of the wave operator. The Hilbert space is, in both cases, the closure of the space of the differentiable vectors for the linear representation of the Poincare group, associated with the Klein-Gordon equation, with respect to a norm defined by the representation of the enveloping algebra. (orig.)

  8. Hamiltonian structures of some non-linear evolution equations

    International Nuclear Information System (INIS)

    Tu, G.Z.

    1983-06-01

    The Hamiltonian structure of the O(2,1) non-linear sigma model, generalized AKNS equations, are discussed. By reducing the O(2,1) non-linear sigma model to its Hamiltonian form some new conservation laws are derived. A new hierarchy of non-linear evolution equations is proposed and shown to be generalized Hamiltonian equations with an infinite number of conservation laws. (author)

  9. Solving polynomial differential equations by transforming them to linear functional-differential equations

    OpenAIRE

    Nahay, John Michael

    2008-01-01

    We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order Abel differential equation with two nonlinear terms in order to demonstrate in as much detail as possible the computations necessary for a complete solution. We mention in our section on further developments that the basic transformation idea can be generali...

  10. Linear differential equations to solve nonlinear mechanical problems: A novel approach

    OpenAIRE

    Nair, C. Radhakrishnan

    2004-01-01

    Often a non-linear mechanical problem is formulated as a non-linear differential equation. A new method is introduced to find out new solutions of non-linear differential equations if one of the solutions of a given non-linear differential equation is known. Using the known solution of the non-linear differential equation, linear differential equations are set up. The solutions of these linear differential equations are found using standard techniques. Then the solutions of the linear differe...

  11. Supporting Generative Thinking about Number Lines, the Cartesian Plane, and Graphs of Linear Functions

    Science.gov (United States)

    Earnest, Darrell Steven

    2012-01-01

    This dissertation explores fifth and eighth grade students' interpretations of three kinds of mathematical representations: number lines, the Cartesian plane, and graphs of linear functions. Two studies were conducted. In Study 1, I administered the paper-and-pencil Linear Representations Assessment (LRA) to examine students'…

  12. Linear measure functional differential equations with infinite delay

    OpenAIRE

    Monteiro, G. (Giselle Antunes); Slavík, A.

    2014-01-01

    We use the theory of generalized linear ordinary differential equations in Banach spaces to study linear measure functional differential equations with infinite delay. We obtain new results concerning the existence, uniqueness, and continuous dependence of solutions. Even for equations with a finite delay, our results are stronger than the existing ones. Finally, we present an application to functional differential equations with impulses.

  13. Localization of the eigenvalues of linear integral equations with applications to linear ordinary differential equations.

    Science.gov (United States)

    Sloss, J. M.; Kranzler, S. K.

    1972-01-01

    The equivalence of a considered integral equation form with an infinite system of linear equations is proved, and the localization of the eigenvalues of the infinite system is expressed. Error estimates are derived, and the problems of finding upper bounds and lower bounds for the eigenvalues are solved simultaneously.

  14. Who Will Win?: Predicting the Presidential Election Using Linear Regression

    Science.gov (United States)

    Lamb, John H.

    2007-01-01

    This article outlines a linear regression activity that engages learners, uses technology, and fosters cooperation. Students generated least-squares linear regression equations using TI-83 Plus[TM] graphing calculators, Microsoft[C] Excel, and paper-and-pencil calculations using derived normal equations to predict the 2004 presidential election.…

  15. Customized Steady-State Constraints for Parameter Estimation in Non-Linear Ordinary Differential Equation Models.

    Science.gov (United States)

    Rosenblatt, Marcus; Timmer, Jens; Kaschek, Daniel

    2016-01-01

    Ordinary differential equation models have become a wide-spread approach to analyze dynamical systems and understand underlying mechanisms. Model parameters are often unknown and have to be estimated from experimental data, e.g., by maximum-likelihood estimation. In particular, models of biological systems contain a large number of parameters. To reduce the dimensionality of the parameter space, steady-state information is incorporated in the parameter estimation process. For non-linear models, analytical steady-state calculation typically leads to higher-order polynomial equations for which no closed-form solutions can be obtained. This can be circumvented by solving the steady-state equations for kinetic parameters, which results in a linear equation system with comparatively simple solutions. At the same time multiplicity of steady-state solutions is avoided, which otherwise is problematic for optimization. When solved for kinetic parameters, however, steady-state constraints tend to become negative for particular model specifications, thus, generating new types of optimization problems. Here, we present an algorithm based on graph theory that derives non-negative, analytical steady-state expressions by stepwise removal of cyclic dependencies between dynamical variables. The algorithm avoids multiple steady-state solutions by construction. We show that our method is applicable to most common classes of biochemical reaction networks containing inhibition terms, mass-action and Hill-type kinetic equations. Comparing the performance of parameter estimation for different analytical and numerical methods of incorporating steady-state information, we show that our approach is especially well-tailored to guarantee a high success rate of optimization.

  16. Saturation and linear transport equation

    International Nuclear Information System (INIS)

    Kutak, K.

    2009-03-01

    We show that the GBW saturation model provides an exact solution to the one dimensional linear transport equation. We also show that it is motivated by the BK equation considered in the saturated regime when the diffusion and the splitting term in the diffusive approximation are balanced by the nonlinear term. (orig.)

  17. Linearized pseudo-Einstein equations on the Heisenberg group

    Science.gov (United States)

    Barletta, Elisabetta; Dragomir, Sorin; Jacobowitz, Howard

    2017-02-01

    We study the pseudo-Einstein equation R11bar = 0 on the Heisenberg group H1 = C × R. We consider first order perturbations θɛ =θ0 + ɛ θ and linearize the pseudo-Einstein equation about θ0 (the canonical Tanaka-Webster flat contact form on H1 thought of as a strictly pseudoconvex CR manifold). If θ =e2uθ0 the linearized pseudo-Einstein equation is Δb u - 4 | Lu|2 = 0 where Δb is the sublaplacian of (H1 ,θ0) and L bar is the Lewy operator. We solve the linearized pseudo-Einstein equation on a bounded domain Ω ⊂H1 by applying subelliptic theory i.e. existence and regularity results for weak subelliptic harmonic maps. We determine a solution u to the linearized pseudo-Einstein equation, possessing Heisenberg spherical symmetry, and such that u(x) → - ∞ as | x | → + ∞.

  18. Linear causal modeling with structural equations

    CERN Document Server

    Mulaik, Stanley A

    2009-01-01

    Emphasizing causation as a functional relationship between variables that describe objects, Linear Causal Modeling with Structural Equations integrates a general philosophical theory of causation with structural equation modeling (SEM) that concerns the special case of linear causal relations. In addition to describing how the functional relation concept may be generalized to treat probabilistic causation, the book reviews historical treatments of causation and explores recent developments in experimental psychology on studies of the perception of causation. It looks at how to perceive causal

  19. A componential model of human interaction with graphs: 1. Linear regression modeling

    Science.gov (United States)

    Gillan, Douglas J.; Lewis, Robert

    1994-01-01

    Task analyses served as the basis for developing the Mixed Arithmetic-Perceptual (MA-P) model, which proposes (1) that people interacting with common graphs to answer common questions apply a set of component processes-searching for indicators, encoding the value of indicators, performing arithmetic operations on the values, making spatial comparisons among indicators, and repsonding; and (2) that the type of graph and user's task determine the combination and order of the components applied (i.e., the processing steps). Two experiments investigated the prediction that response time will be linearly related to the number of processing steps according to the MA-P model. Subjects used line graphs, scatter plots, and stacked bar graphs to answer comparison questions and questions requiring arithmetic calculations. A one-parameter version of the model (with equal weights for all components) and a two-parameter version (with different weights for arithmetic and nonarithmetic processes) accounted for 76%-85% of individual subjects' variance in response time and 61%-68% of the variance taken across all subjects. The discussion addresses possible modifications in the MA-P model, alternative models, and design implications from the MA-P model.

  20. Numerical Solution of Heun Equation Via Linear Stochastic Differential Equation

    Directory of Open Access Journals (Sweden)

    Hamidreza Rezazadeh

    2014-05-01

    Full Text Available In this paper, we intend to solve special kind of ordinary differential equations which is called Heun equations, by converting to a corresponding stochastic differential equation(S.D.E.. So, we construct a stochastic linear equation system from this equation which its solution is based on computing fundamental matrix of this system and then, this S.D.E. is solved by numerically methods. Moreover, its asymptotic stability and statistical concepts like expectation and variance of solutions are discussed. Finally, the attained solutions of these S.D.E.s compared with exact solution of corresponding differential equations.

  1. Systems of Inhomogeneous Linear Equations

    Science.gov (United States)

    Scherer, Philipp O. J.

    Many problems in physics and especially computational physics involve systems of linear equations which arise e.g. from linearization of a general nonlinear problem or from discretization of differential equations. If the dimension of the system is not too large standard methods like Gaussian elimination or QR decomposition are sufficient. Systems with a tridiagonal matrix are important for cubic spline interpolation and numerical second derivatives. They can be solved very efficiently with a specialized Gaussian elimination method. Practical applications often involve very large dimensions and require iterative methods. Convergence of Jacobi and Gauss-Seidel methods is slow and can be improved by relaxation or over-relaxation. An alternative for large systems is the method of conjugate gradients.

  2. Diffusion phenomenon for linear dissipative wave equations

    KAUST Repository

    Said-Houari, Belkacem

    2012-01-01

    In this paper we prove the diffusion phenomenon for the linear wave equation. To derive the diffusion phenomenon, a new method is used. In fact, for initial data in some weighted spaces, we prove that for {equation presented} decays with the rate {equation presented} [0,1] faster than that of either u or v, where u is the solution of the linear wave equation with initial data {equation presented} [0,1], and v is the solution of the related heat equation with initial data v 0 = u 0 + u 1. This result improves the result in H. Yang and A. Milani [Bull. Sci. Math. 124 (2000), 415-433] in the sense that, under the above restriction on the initial data, the decay rate given in that paper can be improved by t -γ/2. © European Mathematical Society.

  3. A new linearized equation for servo valve in hydraulic control systems

    International Nuclear Information System (INIS)

    Kim, Tae Hyung; Lee, Ill Yeong

    2002-01-01

    In the procedure of the hydraulic control system analysis, a linearized approximate equation described by the first order term of Taylor's series has been widely used. Such a linearized equation is effective just near the operating point. And, as of now, there are no general standards on how to determine the operating point of a servo valve in the process of applying the linearized equation. So, in this study, a new linearized equation for valve characteristics is proposed as a modified form of the existing linearized equation. And, a method for selecting an optimal operating point is proposed for the new linearized equation. The effectiveness of the new linearized equation is confirmed through numerical simulations and experiments for a model hydraulic control system

  4. Generalizing a categorization of students' interpretations of linear kinematics graphs

    OpenAIRE

    Bollen, Laurens; De Cock, Mieke; Zuza, Kristina; Guisasola, Jenaro; van Kampen, Paul

    2016-01-01

    We have investigated whether and how a categorization of responses to questions on linear distance-time graphs, based on a study of Irish students enrolled in an algebra-based course, could be adopted and adapted to responses from students enrolled in calculus-based physics courses at universities in Flanders, Belgium (KU Leuven) and the Basque Country, Spain (University of the Basque Country). We discuss how we adapted the categorization to accommodate a much more diverse student cohort and ...

  5. A remark on partial linear spaces of girth 5 with an application to strongly regular graphs

    NARCIS (Netherlands)

    Brouwer, A.E.; Neumaier, A.

    1988-01-01

    We derive a lower bound on the number of points of a partial linear space of girth 5. As an application, certain strongly regular graphs with=2 are ruled out by observing that the first subconstituents are partial linear spaces.

  6. Hypocoercivity for linear kinetic equations conserving mass

    KAUST Repository

    Dolbeault, Jean; Mouhot, Clé ment; Schmeiser, Christian

    2015-01-01

    We develop a new method for proving hypocoercivity for a large class of linear kinetic equations with only one conservation law. Local mass conservation is assumed at the level of the collision kernel, while transport involves a confining potential, so that the solution relaxes towards a unique equilibrium state. Our goal is to evaluate in an appropriately weighted $ L^2$ norm the exponential rate of convergence to the equilibrium. The method covers various models, ranging from diffusive kinetic equations like Vlasov-Fokker-Planck equations, to scattering models or models with time relaxation collision kernels corresponding to polytropic Gibbs equilibria, including the case of the linear Boltzmann model. In this last case and in the case of Vlasov-Fokker-Planck equations, any linear or superlinear growth of the potential is allowed. - See more at: http://www.ams.org/journals/tran/2015-367-06/S0002-9947-2015-06012-7/#sthash.ChjyK6rc.dpuf

  7. Hypocoercivity for linear kinetic equations conserving mass

    KAUST Repository

    Dolbeault, Jean

    2015-02-03

    We develop a new method for proving hypocoercivity for a large class of linear kinetic equations with only one conservation law. Local mass conservation is assumed at the level of the collision kernel, while transport involves a confining potential, so that the solution relaxes towards a unique equilibrium state. Our goal is to evaluate in an appropriately weighted $ L^2$ norm the exponential rate of convergence to the equilibrium. The method covers various models, ranging from diffusive kinetic equations like Vlasov-Fokker-Planck equations, to scattering models or models with time relaxation collision kernels corresponding to polytropic Gibbs equilibria, including the case of the linear Boltzmann model. In this last case and in the case of Vlasov-Fokker-Planck equations, any linear or superlinear growth of the potential is allowed. - See more at: http://www.ams.org/journals/tran/2015-367-06/S0002-9947-2015-06012-7/#sthash.ChjyK6rc.dpuf

  8. General solutions of second-order linear difference equations of Euler type

    Directory of Open Access Journals (Sweden)

    Akane Hongyo

    2017-01-01

    Full Text Available The purpose of this paper is to give general solutions of linear difference equations which are related to the Euler-Cauchy differential equation \\(y^{\\prime\\prime}+(\\lambda/t^2y=0\\ or more general linear differential equations. We also show that the asymptotic behavior of solutions of the linear difference equations are similar to solutions of the linear differential equations.

  9. Bond graphs : an integrating tool for design of mechatronic systems

    International Nuclear Information System (INIS)

    Ould Bouamama, B.

    2011-01-01

    Bond graph is a powerful tool well known for dynamic modelling of multi physical systems: This is the only modelling technique to generate automatically state space or non-linear models using dedicated software tools (CAMP-G, 20-Sim, Symbols, Dymola...). Recently several fundamental theories have been developed for using a bond graph model not only for modeling but also as a real integrated tool from conceptual ideas to optimal practical realization of mechatronic system. This keynote presents a synthesis of those new theories which exploit some particular properties (such as causal, structural and behavioral) of this graphical methodology. Based on a pedagogical example, it will be shown how from a physical system (not a transfer function or state equation) and using only one representation (Bond graph), the following results can be performed: modeling (formal state equations generation), Control analysis (observability, controllability, Structural I/O decouplability, dynamic decoupling,...) diagnosis analysis (automatic generation of robust fault indicators, sensor placement, structural diagnosability) and finally sizing of actuators. The presentation will be illustrated by real industrial applications. Limits and perspectives of bond graph theory conclude the keynote.

  10. Inverse Boundary Value Problem for Non-linear Hyperbolic Partial Differential Equations

    OpenAIRE

    Nakamura, Gen; Vashisth, Manmohan

    2017-01-01

    In this article we are concerned with an inverse boundary value problem for a non-linear wave equation of divergence form with space dimension $n\\geq 3$. This non-linear wave equation has a trivial solution, i.e. zero solution. By linearizing this equation at the trivial solution, we have the usual linear isotropic wave equation with the speed $\\sqrt{\\gamma(x)}$ at each point $x$ in a given spacial domain. For any small solution $u=u(t,x)$ of this non-linear equation, we have the linear isotr...

  11. The numerical solution of linear multi-term fractional differential equations: systems of equations

    Science.gov (United States)

    Edwards, John T.; Ford, Neville J.; Simpson, A. Charles

    2002-11-01

    In this paper, we show how the numerical approximation of the solution of a linear multi-term fractional differential equation can be calculated by reduction of the problem to a system of ordinary and fractional differential equations each of order at most unity. We begin by showing how our method applies to a simple class of problems and we give a convergence result. We solve the Bagley Torvik equation as an example. We show how the method can be applied to a general linear multi-term equation and give two further examples.

  12. Infinite sets of conservation laws for linear and non-linear field equations

    International Nuclear Information System (INIS)

    Niederle, J.

    1984-01-01

    The work was motivated by a desire to understand group theoretically the existence of an infinite set of conservation laws for non-interacting fields and to carry over these conservation laws to the case of interacting fields. The relation between an infinite set of conservation laws of a linear field equation and the enveloping algebra of its space-time symmetry group was established. It is shown that in the case of the Korteweg-de Vries (KdV) equation to each symmetry of the corresponding linear equation delta sub(o)uxxx=u sub() determined by an element of the enveloping algebra of the space translation algebra, there corresponds a symmetry of the full KdV equation

  13. Graph-Based Cooperative Localization Using Symmetric Measurement Equations.

    Science.gov (United States)

    Gulati, Dhiraj; Zhang, Feihu; Clarke, Daniel; Knoll, Alois

    2017-06-17

    Precise localization is a key requirement for the success of highly assisted or autonomous vehicles. The diminishing cost of hardware has resulted in a proliferation of the number of sensors in the environment. Cooperative localization (CL) presents itself as a feasible and effective solution for localizing the ego-vehicle and its neighboring vehicles. However, one of the major challenges to fully realize the effective use of infrastructure sensors for jointly estimating the state of a vehicle in cooperative vehicle-infrastructure localization is an effective data association. In this paper, we propose a method which implements symmetric measurement equations within factor graphs in order to overcome the data association challenge with a reduced bandwidth overhead. Simulated results demonstrate the benefits of the proposed approach in comparison with our previously proposed approach of topology factors.

  14. Invariant imbedding equations for linear scattering problems

    International Nuclear Information System (INIS)

    Apresyan, L.

    1988-01-01

    A general form of the invariant imbedding equations is investigated for the linear problem of scattering by a bounded scattering volume. The conditions for the derivability of such equations are described. It is noted that the possibility of the explicit representation of these equations for a sphere and for a layer involves the separation of variables in the unperturbed wave equation

  15. Mechatronic modeling and simulation using bond graphs

    CERN Document Server

    Das, Shuvra

    2009-01-01

    Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...

  16. Designing a graph-based approach to landscape ecological assessment of linear infrastructures

    Energy Technology Data Exchange (ETDEWEB)

    Girardet, Xavier, E-mail: xavier.girardet@univ-fcomte.fr; Foltête, Jean-Christophe, E-mail: jean-christophe.foltete@univ-fcomte.fr; Clauzel, Céline, E-mail: celine.clauzel@univ-fcomte.fr

    2013-09-15

    The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comté (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: • Graph connectivity metrics were integrated into a species distribution model. • SDM was performed before and after the implementation of linear infrastructure. • The local variation of presence provides spatial indicators of the impact.

  17. Designing a graph-based approach to landscape ecological assessment of linear infrastructures

    International Nuclear Information System (INIS)

    Girardet, Xavier; Foltête, Jean-Christophe; Clauzel, Céline

    2013-01-01

    The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comté (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: • Graph connectivity metrics were integrated into a species distribution model. • SDM was performed before and after the implementation of linear infrastructure. • The local variation of presence provides spatial indicators of the impact

  18. Linear Einstein equations and Kerr-Schild maps

    International Nuclear Information System (INIS)

    Gergely, Laszlo A

    2002-01-01

    We prove that given a solution of the Einstein equations g ab for the matter field T ab , an autoparallel null vector field l a and a solution (l a l c , T ac ) of the linearized Einstein equation on the given background, the Kerr-Schild metric g ac + λl a l c (λ arbitrary constant) is an exact solution of the Einstein equation for the energy-momentum tensor T ac + λT ac + λ 2 l (a T c)b l b . The mixed form of the Einstein equation for Kerr-Schild metrics with autoparallel null congruence is also linear. Some more technical conditions hold when the null congruence is not autoparallel. These results generalize previous theorems for vacuum due to Xanthopoulos and for flat seed spacetime due to Guerses and Guersey

  19. Analytical exact solution of the non-linear Schroedinger equation

    International Nuclear Information System (INIS)

    Martins, Alisson Xavier; Rocha Filho, Tarcisio Marciano da

    2011-01-01

    Full text: In this work we present how to classify and obtain analytical solutions of the Schroedinger equation with a generic non-linearity in 1+1 dimensions. Our approach is based on the determination of Lie symmetry transformation mapping solutions into solutions, and non-classical symmetry transformations, mapping a given solution into itself. From these symmetries it is then possible to reduce the equation to a system of ordinary differential equations which can then be solved using standard methods. The generic non-linearity is handled by considering it as an additional unknown in the determining equations for the symmetry transformations. This results in an over-determined system of non-linear partial differential equations. Its solution can then be determined in some cases by reducing it to the so called involutive (triangular) form, and then solved. This reduction is very tedious and can only performed using a computer algebra system. Once the determining system is solved, we obtain the explicit form for the non-linearity admitting a Lie or non-classical symmetry. The analytical solutions are then derived by solving the reduced ordinary differential equations. The non-linear determining system for the non-classical symmetry transformations and Lie symmetry generators are obtaining using the computer algebra package SADE (symmetry analysis of differential equations), developed at our group. (author)

  20. Non-linear wave equations:Mathematical techniques

    International Nuclear Information System (INIS)

    1978-01-01

    An account of certain well-established mathematical methods, which prove useful to deal with non-linear partial differential equations is presented. Within the strict framework of Functional Analysis, it describes Semigroup Techniques in Banach Spaces as well as variational approaches towards critical points. Detailed proofs are given of the existence of local and global solutions of the Cauchy problem and of the stability of stationary solutions. The formal approach based upon invariance under Lie transformations deserves attention due to its wide range of applicability, even if the explicit solutions thus obtained do not allow for a deep analysis of the equations. A compre ensive introduction to the inverse scattering approach and to the solution concept for certain non-linear equations of physical interest are also presented. A detailed discussion is made about certain convergence and stability problems which arise in importance need not be emphasized. (author) [es

  1. Sensitivity theory for general non-linear algebraic equations with constraints

    International Nuclear Information System (INIS)

    Oblow, E.M.

    1977-04-01

    Sensitivity theory has been developed to a high state of sophistication for applications involving solutions of the linear Boltzmann equation or approximations to it. The success of this theory in the field of radiation transport has prompted study of possible extensions of the method to more general systems of non-linear equations. Initial work in the U.S. and in Europe on the reactor fuel cycle shows that the sensitivity methodology works equally well for those non-linear problems studied to date. The general non-linear theory for algebraic equations is summarized and applied to a class of problems whose solutions are characterized by constrained extrema. Such equations form the basis of much work on energy systems modelling and the econometrics of power production and distribution. It is valuable to have a sensitivity theory available for these problem areas since it is difficult to repeatedly solve complex non-linear equations to find out the effects of alternative input assumptions or the uncertainties associated with predictions of system behavior. The sensitivity theory for a linear system of algebraic equations with constraints which can be solved using linear programming techniques is discussed. The role of the constraints in simplifying the problem so that sensitivity methodology can be applied is highlighted. The general non-linear method is summarized and applied to a non-linear programming problem in particular. Conclusions are drawn in about the applicability of the method for practical problems

  2. Graph spectrum

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

  3. Dynamical symmetries of semi-linear Schrodinger and diffusion equations

    International Nuclear Information System (INIS)

    Stoimenov, Stoimen; Henkel, Malte

    2005-01-01

    Conditional and Lie symmetries of semi-linear 1D Schrodinger and diffusion equations are studied if the mass (or the diffusion constant) is considered as an additional variable. In this way, dynamical symmetries of semi-linear Schrodinger equations become related to the parabolic and almost-parabolic subalgebras of a three-dimensional conformal Lie algebra (conf 3 ) C . We consider non-hermitian representations and also include a dimensionful coupling constant of the non-linearity. The corresponding representations of the parabolic and almost-parabolic subalgebras of (conf 3 ) C are classified and the complete list of conditionally invariant semi-linear Schrodinger equations is obtained. Possible applications to the dynamical scaling behaviour of phase-ordering kinetics are discussed

  4. Introduction to linear systems of differential equations

    CERN Document Server

    Adrianova, L Ya

    1995-01-01

    The theory of linear systems of differential equations is one of the cornerstones of the whole theory of differential equations. At its root is the concept of the Lyapunov characteristic exponent. In this book, Adrianova presents introductory material and further detailed discussions of Lyapunov exponents. She also discusses the structure of the space of solutions of linear systems. Classes of linear systems examined are from the narrowest to widest: 1)�autonomous, 2)�periodic, 3)�reducible to autonomous, 4)�nearly reducible to autonomous, 5)�regular. In addition, Adrianova considers the following: stability of linear systems and the influence of perturbations of the coefficients on the stability the criteria of uniform stability and of uniform asymptotic stability in terms of properties of the solutions several estimates of the growth rate of solutions of a linear system in terms of its coefficients How perturbations of the coefficients change all the elements of the spectrum of the system is defin...

  5. GLOBAL LINEARIZATION OF DIFFERENTIAL EQUATIONS WITH SPECIAL STRUCTURES

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    This paper introduces the global linearization of the differential equations with special structures.The function in the differential equation is unbounded.We prove that the differential equation with unbounded function can be topologically linearlized if it has a special structure.

  6. Geometric Insight into Scalar Combination of Linear Equations

    Indian Academy of Sciences (India)

    ... Journals; Resonance – Journal of Science Education; Volume 14; Issue 11. Geometric Insight into Scalar Combination of Linear Equations. Ranjit Konkar. Classroom Volume 14 Issue 11 November 2009 pp 1092-1097 ... Keywords. Linear algebra; linear dependence; linear combination; family of lines; family of planes.

  7. What happens to linear properties as we move from the Klein-Gordon equation to the sine-Gordon equation

    International Nuclear Information System (INIS)

    Kovalyov, Mikhail

    2010-01-01

    In this article the sets of solutions of the sine-Gordon equation and its linearization the Klein-Gordon equation are discussed and compared. It is shown that the set of solutions of the sine-Gordon equation possesses a richer structure which partly disappears during linearization. Just like the solutions of the Klein-Gordon equation satisfy the linear superposition principle, the solutions of the sine-Gordon equation satisfy a nonlinear superposition principle.

  8. Emmy Noether and Linear Evolution Equations

    Directory of Open Access Journals (Sweden)

    P. G. L. Leach

    2013-01-01

    Full Text Available Noether’s Theorem relates the Action Integral of a Lagrangian with symmetries which leave it invariant and the first integrals consequent upon the variational principle and the existence of the symmetries. These each have an equivalent in the Schrödinger Equation corresponding to the Lagrangian and by extension to linear evolution equations in general. The implications of these connections are investigated.

  9. Simplified Linear Equation Solvers users manual

    Energy Technology Data Exchange (ETDEWEB)

    Gropp, W. [Argonne National Lab., IL (United States); Smith, B. [California Univ., Los Angeles, CA (United States)

    1993-02-01

    The solution of large sparse systems of linear equations is at the heart of many algorithms in scientific computing. The SLES package is a set of easy-to-use yet powerful and extensible routines for solving large sparse linear systems. The design of the package allows new techniques to be used in existing applications without any source code changes in the applications.

  10. A linearizing transformation for the Korteweg-de Vries equation; generalizations to higher-dimensional nonlinear partial differential equations

    NARCIS (Netherlands)

    Dorren, H.J.S.

    1998-01-01

    It is shown that the Korteweg–de Vries (KdV) equation can be transformed into an ordinary linear partial differential equation in the wave number domain. Explicit solutions of the KdV equation can be obtained by subsequently solving this linear differential equation and by applying a cascade of

  11. Construction of a Roe linearization for the ideal MHD equations

    International Nuclear Information System (INIS)

    Cargo, P.; Gallice, G.; Raviart, P.A.

    1996-01-01

    In [3], Munz has constructed a Roe linearization for the equations of gas dynamics in Lagrangian coordinates. We extend this construction to the case of the ideal magnetohydrodynamics equations again in Lagrangian coordinates. As a consequence we obtain a Roe linearization for the MHD equations in Eulerian coordinates. (author)

  12. Variational linear algebraic equations method

    International Nuclear Information System (INIS)

    Moiseiwitsch, B.L.

    1982-01-01

    A modification of the linear algebraic equations method is described which ensures a variational bound on the phaseshifts for potentials having a definite sign at all points. The method is illustrated by the elastic scattering of s-wave electrons by the static field of atomic hydrogen. (author)

  13. Rational approximations to solutions of linear differential equations.

    Science.gov (United States)

    Chudnovsky, D V; Chudnovsky, G V

    1983-08-01

    Rational approximations of Padé and Padé type to solutions of differential equations are considered. One of the main results is a theorem stating that a simultaneous approximation to arbitrary solutions of linear differential equations over C(x) cannot be "better" than trivial ones implied by the Dirichlet box principle. This constitutes, in particular, the solution in the linear case of Kolchin's problem that the "Roth's theorem" holds for arbitrary solutions of algebraic differential equations. Complete effective proofs for several valuations are presented based on the Wronskian methods and graded subrings of Picard-Vessiot extensions.

  14. Non-linear effects in the Boltzmann equation

    International Nuclear Information System (INIS)

    Barrachina, R.O.

    1985-01-01

    The Boltzmann equation is studied by defining an integral transformation of the energy distribution function for an isotropic and homogeneous gas. This transformation may be interpreted as a linear superposition of equilibrium states with variable temperatures. It is shown that the temporal evolution features of the distribution function are determined by the singularities of said transformation. This method is applied to Maxwell and Very Hard Particle interaction models. For the latter, the solution of the Boltzmann equation with the solution of its linearized version is compared, finding out many basic discrepancies and non-linear effects. This gives a hint to propose a new rational approximation method with a clear physical meaning. Applying this technique, the relaxation features of the BKW (Bobylev, Krook anf Wu) mode is analyzed, finding a conclusive counter-example for the Krook and Wu conjecture. The anisotropic Boltzmann equation for Maxwell models is solved as an expansion in terms of the eigenfunctions of the corresponding linearized collision operator, finding interesting transient overpopulation and underpopulation effects at thermal energies as well as a new preferential spreading effect. By analyzing the initial collision, a criterion is established to deduce the general features of the final approach to equilibrium. Finally, it is shown how to improve the convergence of the eigenfunction expansion for high energy underpopulated distribution functions. As an application of this theory, the linear cascade model for sputtering is analyzed, thus finding out that many differences experimentally observed are due to non-linear effects. (M.E.L.) [es

  15. Asymptotic properties for half-linear difference equations

    Czech Academy of Sciences Publication Activity Database

    Cecchi, M.; Došlá, Z.; Marini, M.; Vrkoč, Ivo

    2006-01-01

    Roč. 131, č. 4 (2006), s. 347-363 ISSN 0862-7959 R&D Projects: GA ČR(CZ) GA201/04/0580 Institutional research plan: CEZ:AV0Z10190503 Keywords : half-linear second order difference equation * nonoscillatory solutions * Riccati difference equation Subject RIV: BA - General Mathematics

  16. Learning Bayesian network structure: towards the essential graph by integer linear programming tools

    Czech Academy of Sciences Publication Activity Database

    Studený, Milan; Haws, D.

    2014-01-01

    Roč. 55, č. 4 (2014), s. 1043-1071 ISSN 0888-613X R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : learning Bayesian network structure * integer linear programming * characteristic imset * essential graph Subject RIV: BA - General Mathematics Impact factor: 2.451, year: 2014 http://library.utia.cas.cz/separaty/2014/MTR/studeny-0427002.pdf

  17. Students' errors in solving linear equation word problems: Case ...

    African Journals Online (AJOL)

    The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...

  18. New Equating Methods and Their Relationships with Levine Observed Score Linear Equating under the Kernel Equating Framework

    Science.gov (United States)

    Chen, Haiwen; Holland, Paul

    2010-01-01

    In this paper, we develop a new curvilinear equating for the nonequivalent groups with anchor test (NEAT) design under the assumption of the classical test theory model, that we name curvilinear Levine observed score equating. In fact, by applying both the kernel equating framework and the mean preserving linear transformation of…

  19. A non-differentiable solution for the local fractional telegraph equation

    Directory of Open Access Journals (Sweden)

    Li Jie

    2017-01-01

    Full Text Available In this paper, we consider the linear telegraph equations with local fractional derivative. The local fractional Laplace series expansion method is used to handle the local fractional telegraph equation. The analytical solution with the non-differentiable graphs is discussed in detail. The proposed method is efficient and accurate.

  20. High-order quantum algorithm for solving linear differential equations

    International Nuclear Information System (INIS)

    Berry, Dominic W

    2014-01-01

    Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods (where the error over a time step is a high power of the size of the time step) to improve the efficiency. These provide scaling close to Δt 2 in the evolution time Δt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution. (paper)

  1. Periodic feedback stabilization for linear periodic evolution equations

    CERN Document Server

    Wang, Gengsheng

    2016-01-01

    This book introduces a number of recent advances regarding periodic feedback stabilization for linear and time periodic evolution equations. First, it presents selected connections between linear quadratic optimal control theory and feedback stabilization theory for linear periodic evolution equations. Secondly, it identifies several criteria for the periodic feedback stabilization from the perspective of geometry, algebra and analyses respectively. Next, it describes several ways to design periodic feedback laws. Lastly, the book introduces readers to key methods for designing the control machines. Given its coverage and scope, it offers a helpful guide for graduate students and researchers in the areas of control theory and applied mathematics.

  2. Infinite sets of conservation laws for linear and nonlinear field equations

    International Nuclear Information System (INIS)

    Mickelsson, J.

    1984-01-01

    The relation between an infinite set of conservation laws of a linear field equation and the enveloping algebra of the space-time symmetry group is established. It is shown that each symmetric element of the enveloping algebra of the space-time symmetry group of a linear field equation generates a one-parameter group of symmetries of the field equation. The cases of the Maxwell and Dirac equations are studied in detail. Then it is shown that (at least in the sense of a power series in the 'coupling constant') the conservation laws of the linear case can be deformed to conservation laws of a nonlinear field equation which is obtained from the linear one by adding a nonlinear term invariant under the group of space-time symmetries. As an example, our method is applied to the Korteweg-de Vries equation and to the massless Thirring model. (orig.)

  3. A Comparison between Linear IRT Observed-Score Equating and Levine Observed-Score Equating under the Generalized Kernel Equating Framework

    Science.gov (United States)

    Chen, Haiwen

    2012-01-01

    In this article, linear item response theory (IRT) observed-score equating is compared under a generalized kernel equating framework with Levine observed-score equating for nonequivalent groups with anchor test design. Interestingly, these two equating methods are closely related despite being based on different methodologies. Specifically, when…

  4. Dual exponential polynomials and linear differential equations

    Science.gov (United States)

    Wen, Zhi-Tao; Gundersen, Gary G.; Heittokangas, Janne

    2018-01-01

    We study linear differential equations with exponential polynomial coefficients, where exactly one coefficient is of order greater than all the others. The main result shows that a nontrivial exponential polynomial solution of such an equation has a certain dual relationship with the maximum order coefficient. Several examples illustrate our results and exhibit possibilities that can occur.

  5. Exact non-linear equations for cosmological perturbations

    Energy Technology Data Exchange (ETDEWEB)

    Gong, Jinn-Ouk [Asia Pacific Center for Theoretical Physics, Pohang 37673 (Korea, Republic of); Hwang, Jai-chan [Department of Astronomy and Atmospheric Sciences, Kyungpook National University, Daegu 41566 (Korea, Republic of); Noh, Hyerim [Korea Astronomy and Space Science Institute, Daejeon 34055 (Korea, Republic of); Wu, David Chan Lon; Yoo, Jaiyul, E-mail: jinn-ouk.gong@apctp.org, E-mail: jchan@knu.ac.kr, E-mail: hr@kasi.re.kr, E-mail: clwu@physik.uzh.ch, E-mail: jyoo@physik.uzh.ch [Center for Theoretical Astrophysics and Cosmology, Institute for Computational Science, Universität Zürich, CH-8057 Zürich (Switzerland)

    2017-10-01

    We present a complete set of exact and fully non-linear equations describing all three types of cosmological perturbations—scalar, vector and tensor perturbations. We derive the equations in a thoroughly gauge-ready manner, so that any spatial and temporal gauge conditions can be employed. The equations are completely general without any physical restriction except that we assume a flat homogeneous and isotropic universe as a background. We also comment briefly on the application of our formulation to the non-expanding Minkowski background.

  6. System dynamics and control with bond graph modeling

    CERN Document Server

    Kypuros, Javier

    2013-01-01

    Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...

  7. Inverse scattering solution of non-linear evolution equations in one space dimension: an introduction

    International Nuclear Information System (INIS)

    Alvarez-Estrada, R.F.

    1979-01-01

    A comprehensive review of the inverse scattering solution of certain non-linear evolution equations of physical interest in one space dimension is presented. We explain in some detail the interrelated techniques which allow to linearize exactly the following equations: (1) the Korteweg and de Vries equation; (2) the non-linear Schrodinger equation; (3) the modified Korteweg and de Vries equation; (4) the Sine-Gordon equation. We concentrate in discussing the pairs of linear operators which accomplish such an exact linearization and the solution of the associated initial value problem. The application of the method to other non-linear evolution equations is reviewed very briefly

  8. HESS Opinions: Linking Darcy's equation to the linear reservoir

    Science.gov (United States)

    Savenije, Hubert H. G.

    2018-03-01

    In groundwater hydrology, two simple linear equations exist describing the relation between groundwater flow and the gradient driving it: Darcy's equation and the linear reservoir. Both equations are empirical and straightforward, but work at different scales: Darcy's equation at the laboratory scale and the linear reservoir at the watershed scale. Although at first sight they appear similar, it is not trivial to upscale Darcy's equation to the watershed scale without detailed knowledge of the structure or shape of the underlying aquifers. This paper shows that these two equations, combined by the water balance, are indeed identical provided there is equal resistance in space for water entering the subsurface network. This implies that groundwater systems make use of an efficient drainage network, a mostly invisible pattern that has evolved over geological timescales. This drainage network provides equally distributed resistance for water to access the system, connecting the active groundwater body to the stream, much like a leaf is organized to provide all stomata access to moisture at equal resistance. As a result, the timescale of the linear reservoir appears to be inversely proportional to Darcy's conductance, the proportionality being the product of the porosity and the resistance to entering the drainage network. The main question remaining is which physical law lies behind pattern formation in groundwater systems, evolving in a way that resistance to drainage is constant in space. But that is a fundamental question that is equally relevant for understanding the hydraulic properties of leaf veins in plants or of blood veins in animals.

  9. ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations

    Science.gov (United States)

    Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil

    2018-04-01

    In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.

  10. Integration of differential equations by the pseudo-linear (PL) approximation

    International Nuclear Information System (INIS)

    Bonalumi, Riccardo A.

    1998-01-01

    A new method of integrating differential equations was originated with the technique of approximately calculating the integrals called the pseudo-linear (PL) procedure: this method is A-stable. This article contains the following examples: 1st order ordinary differential equations (ODEs), 2nd order linear ODEs, stiff system of ODEs (neutron kinetics), one-dimensional parabolic (diffusion) partial differential equations. In this latter case, this PL method coincides with the Crank-Nicholson method

  11. Interaction graphs

    DEFF Research Database (Denmark)

    Seiller, Thomas

    2016-01-01

    Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

  12. Linear System of Equations, Matrix Inversion, and Linear Programming Using MS Excel

    Science.gov (United States)

    El-Gebeily, M.; Yushau, B.

    2008-01-01

    In this note, we demonstrate with illustrations two different ways that MS Excel can be used to solve Linear Systems of Equation, Linear Programming Problems, and Matrix Inversion Problems. The advantage of using MS Excel is its availability and transparency (the user is responsible for most of the details of how a problem is solved). Further, we…

  13. Linear matrix differential equations of higher-order and applications

    Directory of Open Access Journals (Sweden)

    Mustapha Rachidi

    2008-07-01

    Full Text Available In this article, we study linear differential equations of higher-order whose coefficients are square matrices. The combinatorial method for computing the matrix powers and exponential is adopted. New formulas representing auxiliary results are obtained. This allows us to prove properties of a large class of linear matrix differential equations of higher-order, in particular results of Apostol and Kolodner are recovered. Also illustrative examples and applications are presented.

  14. Equations of motion for a (non-linear) scalar field model as derived from the field equations

    International Nuclear Information System (INIS)

    Kaniel, S.; Itin, Y.

    2006-01-01

    The problem of derivation of the equations of motion from the field equations is considered. Einstein's field equations have a specific analytical form: They are linear in the second order derivatives and quadratic in the first order derivatives of the field variables. We utilize this particular form and propose a novel algorithm for the derivation of the equations of motion from the field equations. It is based on the condition of the balance between the singular terms of the field equation. We apply the algorithm to a non-linear Lorentz invariant scalar field model. We show that it results in the Newton law of attraction between the singularities of the field moved on approximately geodesic curves. The algorithm is applicable to the N-body problem of the Lorentz invariant field equations. (Abstract Copyright [2006], Wiley Periodicals, Inc.)

  15. Large-time asymptotic behaviour of solutions of non-linear Sobolev-type equations

    International Nuclear Information System (INIS)

    Kaikina, Elena I; Naumkin, Pavel I; Shishmarev, Il'ya A

    2009-01-01

    The large-time asymptotic behaviour of solutions of the Cauchy problem is investigated for a non-linear Sobolev-type equation with dissipation. For small initial data the approach taken is based on a detailed analysis of the Green's function of the linear problem and the use of the contraction mapping method. The case of large initial data is also closely considered. In the supercritical case the asymptotic formulae are quasi-linear. The asymptotic behaviour of solutions of a non-linear Sobolev-type equation with a critical non-linearity of the non-convective kind differs by a logarithmic correction term from the behaviour of solutions of the corresponding linear equation. For a critical convective non-linearity, as well as for a subcritical non-convective non-linearity it is proved that the leading term of the asymptotic expression for large times is a self-similar solution. For Sobolev equations with convective non-linearity the asymptotic behaviour of solutions in the subcritical case is the product of a rarefaction wave and a shock wave. Bibliography: 84 titles.

  16. Graphs and matrices

    CERN Document Server

    Bapat, Ravindra B

    2014-01-01

    This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

  17. A General Linear Method for Equating with Small Samples

    Science.gov (United States)

    Albano, Anthony D.

    2015-01-01

    Research on equating with small samples has shown that methods with stronger assumptions and fewer statistical estimates can lead to decreased error in the estimated equating function. This article introduces a new approach to linear observed-score equating, one which provides flexible control over how form difficulty is assumed versus estimated…

  18. A local-global problem for linear differential equations

    NARCIS (Netherlands)

    Put, Marius van der; Reversat, Marc

    An inhomogeneous linear differential equation Ly = f over a global differential field can have a formal solution for each place without having a global solution. The vector space lgl(L) measures this phenomenon. This space is interpreted in terms of cohomology of linear algebraic groups and is

  19. A local-global problem for linear differential equations

    NARCIS (Netherlands)

    Put, Marius van der; Reversat, Marc

    2008-01-01

    An inhomogeneous linear differential equation Ly = f over a global differential field can have a formal solution for each place without having a global solution. The vector space lgl(L) measures this phenomenon. This space is interpreted in terms of cohomology of linear algebraic groups and is

  20. Iterative solution of linear equations in ODE codes. [Krylov subspaces

    Energy Technology Data Exchange (ETDEWEB)

    Gear, C. W.; Saad, Y.

    1981-01-01

    Each integration step of a stiff equation involves the solution of a nonlinear equation, usually by a quasi-Newton method that leads to a set of linear problems. Iterative methods for these linear equations are studied. Of particular interest are methods that do not require an explicit Jacobian, but can work directly with differences of function values using J congruent to f(x + delta) - f(x). Some numerical experiments using a modification of LSODE are reported. 1 figure, 2 tables.

  1. Runge-Kutta Methods for Linear Ordinary Differential Equations

    Science.gov (United States)

    Zingg, David W.; Chisholm, Todd T.

    1997-01-01

    Three new Runge-Kutta methods are presented for numerical integration of systems of linear inhomogeneous ordinary differential equations (ODES) with constant coefficients. Such ODEs arise in the numerical solution of the partial differential equations governing linear wave phenomena. The restriction to linear ODEs with constant coefficients reduces the number of conditions which the coefficients of the Runge-Kutta method must satisfy. This freedom is used to develop methods which are more efficient than conventional Runge-Kutta methods. A fourth-order method is presented which uses only two memory locations per dependent variable, while the classical fourth-order Runge-Kutta method uses three. This method is an excellent choice for simulations of linear wave phenomena if memory is a primary concern. In addition, fifth- and sixth-order methods are presented which require five and six stages, respectively, one fewer than their conventional counterparts, and are therefore more efficient. These methods are an excellent option for use with high-order spatial discretizations.

  2. Dissipative behavior of some fully non-linear KdV-type equations

    Science.gov (United States)

    Brenier, Yann; Levy, Doron

    2000-03-01

    The KdV equation can be considered as a special case of the general equation u t+f(u) x-δg(u xx) x=0, δ>0, where f is non-linear and g is linear, namely f( u)= u2/2 and g( v)= v. As the parameter δ tends to 0, the dispersive behavior of the KdV equation has been throughly investigated (see, e.g., [P.G. Drazin, Solitons, London Math. Soc. Lect. Note Ser. 85, Cambridge University Press, Cambridge, 1983; P.D. Lax, C.D. Levermore, The small dispersion limit of the Korteweg-de Vries equation, III, Commun. Pure Appl. Math. 36 (1983) 809-829; G.B. Whitham, Linear and Nonlinear Waves, Wiley/Interscience, New York, 1974] and the references therein). We show through numerical evidence that a completely different, dissipative behavior occurs when g is non-linear, namely when g is an even concave function such as g( v)=-∣ v∣ or g( v)=- v2. In particular, our numerical results hint that as δ→0 the solutions strongly converge to the unique entropy solution of the formal limit equation, in total contrast with the solutions of the KdV equation.

  3. Darboux transformations and linear parabolic partial differential equations

    International Nuclear Information System (INIS)

    Arrigo, Daniel J.; Hickling, Fred

    2002-01-01

    Solutions for a class of linear parabolic partial differential equation are provided. These solutions are obtained by first solving a system of (n+1) nonlinear partial differential equations. This system arises as the coefficients of a Darboux transformation and is equivalent to a matrix Burgers' equation. This matrix equation is solved using a generalized Hopf-Cole transformation. The solutions for the original equation are given in terms of solutions of the heat equation. These results are applied to the (1+1)-dimensional Schroedinger equation where all bound state solutions are obtained for a 2n-parameter family of potentials. As a special case, the solutions for integral members of the regular and modified Poeschl-Teller potentials are recovered. (author). Letter-to-the-editor

  4. Piecewise-linear and bilinear approaches to nonlinear differential equations approximation problem of computational structural mechanics

    OpenAIRE

    Leibov Roman

    2017-01-01

    This paper presents a bilinear approach to nonlinear differential equations system approximation problem. Sometimes the nonlinear differential equations right-hand sides linearization is extremely difficult or even impossible. Then piecewise-linear approximation of nonlinear differential equations can be used. The bilinear differential equations allow to improve piecewise-linear differential equations behavior and reduce errors on the border of different linear differential equations systems ...

  5. Solvable linear potentials in the Dirac equation

    International Nuclear Information System (INIS)

    Dominguez-Adame, F.; Gonzalez, M.A.

    1990-01-01

    The Dirac equation for some linear potentials leading to Schroedinger-like oscillator equations for the upper and lower components of the Dirac spinor have been solved. Energy levels for the bound states appear in pairs, so that both particles and antiparticles may be bound with the same energy. For weak coupling, the spacing between levels is proportional to the coupling constant while in the strong limit those levels are depressed compared to the nonrelativistic ones

  6. Technological pedagogical content knowledge of junior high school mathematics teachers in teaching linear equation

    Science.gov (United States)

    Wati, S.; Fitriana, L.; Mardiyana

    2018-04-01

    Linear equation is one of the topics in mathematics that are considered difficult. Student difficulties of understanding linear equation can be caused by lack of understanding this concept and the way of teachers teach. TPACK is a way to understand the complex relationships between teaching and content taught through the use of specific teaching approaches and supported by the right technology tools. This study aims to identify TPACK of junior high school mathematics teachers in teaching linear equation. The method used in the study was descriptive. In the first phase, a survey using a questionnaire was carried out on 45 junior high school mathematics teachers in teaching linear equation. While in the second phase, the interview involved three teachers. The analysis of data used were quantitative and qualitative technique. The result PCK revealed teachers emphasized developing procedural and conceptual knowledge through reliance on traditional in teaching linear equation. The result of TPK revealed teachers’ lower capacity to deal with the general information and communications technologies goals across the curriculum in teaching linear equation. The result indicated that PowerPoint constitutes TCK modal technological capability in teaching linear equation. The result of TPACK seems to suggest a low standard in teachers’ technological skills across a variety of mathematics education goals in teaching linear equation. This means that the ability of teachers’ TPACK in teaching linear equation still needs to be improved.

  7. On some perturbation techniques for quasi-linear parabolic equations

    Directory of Open Access Journals (Sweden)

    Igor Malyshev

    1990-01-01

    Full Text Available We study a nonhomogeneous quasi-linear parabolic equation and introduce a method that allows us to find the solution of a nonlinear boundary value problem in “explicit” form. This task is accomplished by perturbing the original equation with a source function, which is then found as a solution of some nonlinear operator equation.

  8. Bond Graph Modelling for Fault Detection and Isolation of an Ultrasonic Linear Motor

    Directory of Open Access Journals (Sweden)

    Mabrouk KHEMLICHE

    2010-12-01

    Full Text Available In this paper Bond Graph modeling, simulation and monitoring of ultrasonic linear motors are presented. Only the vibration of piezoelectric ceramics and stator will be taken into account. Contact problems between stator and rotor are not treated here. So, standing and travelling waves will be briefly presented since the majority of the motors use another wave type to generate the stator vibration and thus obtain the elliptic trajectory of the points on the surface of the stator in the first time. Then, electric equivalent circuit will be presented with the aim for giving a general idea of another way of graphical modelling of the vibrator introduced and developed. The simulations of an ultrasonic linear motor are then performed and experimental results on a prototype built at the laboratory are presented. Finally, validation of the Bond Graph method for modelling is carried out, comparing both simulation and experiment results. This paper describes the application of the FDI approach to an electrical system. We demonstrate the FDI effectiveness with real data collected from our automotive test. We introduce the analysis of the problem involved in the faults localization in this process. We propose a method of fault detection applied to the diagnosis and to determine the gravity of a detected fault. We show the possibilities of application of the new approaches to the complex system control.

  9. Linearized gyro-kinetic equation

    International Nuclear Information System (INIS)

    Catto, P.J.; Tsang, K.T.

    1976-01-01

    An ordering of the linearized Fokker-Planck equation is performed in which gyroradius corrections are retained to lowest order and the radial dependence appropriate for sheared magnetic fields is treated without resorting to a WKB technique. This description is shown to be necessary to obtain the proper radial dependence when the product of the poloidal wavenumber and the gyroradius is large (k rho much greater than 1). A like particle collision operator valid for arbitrary k rho also has been derived. In addition, neoclassical, drift, finite β (plasma pressure/magnetic pressure), and unperturbed toroidal electric field modifications are treated

  10. Adventures in graph theory

    CERN Document Server

    Joyner, W David

    2017-01-01

    This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

  11. Experimental quantum computing to solve systems of linear equations.

    Science.gov (United States)

    Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

    2013-06-07

    Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

  12. Oscillation and non-oscillation criterion for Riemann–Weber type half-linear differential equations

    Directory of Open Access Journals (Sweden)

    Petr Hasil

    2016-08-01

    Full Text Available By the combination of the modified half-linear Prüfer method and the Riccati technique, we study oscillatory properties of half-linear differential equations. Taking into account the transformation theory of half-linear equations and using some known results, we show that the analysed equations in the Riemann–Weber form with perturbations in both terms are conditionally oscillatory. Within the process, we identify the critical oscillation values of their coefficients and, consequently, we decide when the considered equations are oscillatory and when they are non-oscillatory. As a direct corollary of our main result, we solve the so-called critical case for a certain type of half-linear non-perturbed equations.

  13. Solution methods for large systems of linear equations in BACCHUS

    International Nuclear Information System (INIS)

    Homann, C.; Dorr, B.

    1993-05-01

    The computer programme BACCHUS is used to describe steady state and transient thermal-hydraulic behaviour of a coolant in a fuel element with intact geometry in a fast breeder reactor. In such computer programmes generally large systems of linear equations with sparse matrices of coefficients, resulting from discretization of coolant conservation equations, must be solved thousands of times giving rise to large demands of main storage and CPU time. Direct and iterative solution methods of the systems of linear equations, available in BACCHUS, are described, giving theoretical details and experience with their use in the programme. Besides use of a method of lines, a Runge-Kutta-method, for solution of the partial differential equation is outlined. (orig.) [de

  14. Perturbations of linear delay differential equations at the verge of instability.

    Science.gov (United States)

    Lingala, N; Namachchivaya, N Sri

    2016-06-01

    The characteristic equation for a linear delay differential equation (DDE) has countably infinite roots on the complex plane. This paper considers linear DDEs that are on the verge of instability, i.e., a pair of roots of the characteristic equation lies on the imaginary axis of the complex plane and all other roots have negative real parts. It is shown that when small noise perturbations are present, the probability distribution of the dynamics can be approximated by the probability distribution of a certain one-dimensional stochastic differential equation (SDE) without delay. This is advantageous because equations without delay are easier to simulate and one-dimensional SDEs are analytically tractable. When the perturbations are also linear, it is shown that the stability depends on a specific complex number. The theory is applied to study oscillators with delayed feedback. Some errors in other articles that use multiscale approach are pointed out.

  15. Local energy decay for linear wave equations with variable coefficients

    Science.gov (United States)

    Ikehata, Ryo

    2005-06-01

    A uniform local energy decay result is derived to the linear wave equation with spatial variable coefficients. We deal with this equation in an exterior domain with a star-shaped complement. Our advantage is that we do not assume any compactness of the support on the initial data, and its proof is quite simple. This generalizes a previous famous result due to Morawetz [The decay of solutions of the exterior initial-boundary value problem for the wave equation, Comm. Pure Appl. Math. 14 (1961) 561-568]. In order to prove local energy decay, we mainly apply two types of ideas due to Ikehata-Matsuyama [L2-behaviour of solutions to the linear heat and wave equations in exterior domains, Sci. Math. Japon. 55 (2002) 33-42] and Todorova-Yordanov [Critical exponent for a nonlinear wave equation with damping, J. Differential Equations 174 (2001) 464-489].

  16. Constructive Development of the Solutions of Linear Equations in Introductory Ordinary Differential Equations

    Science.gov (United States)

    Mallet, D. G.; McCue, S. W.

    2009-01-01

    The solution of linear ordinary differential equations (ODEs) is commonly taught in first-year undergraduate mathematics classrooms, but the understanding of the concept of a solution is not always grasped by students until much later. Recognizing what it is to be a solution of a linear ODE and how to postulate such solutions, without resorting to…

  17. Linear orbit parameters for the exact equations of motion

    International Nuclear Information System (INIS)

    Parzen, G.

    1995-01-01

    This paper defines the beta function and other linear orbit parameters using the exact equations of motion. The β, α and ψ functions are redefined using the exact equations. Expressions are found for the transfer matrix and the emittance. The differential equations for η = x/β 1/2 is found. New relationships between α, β, ψ and ν are derived

  18. Approximate Method for Solving the Linear Fuzzy Delay Differential Equations

    Directory of Open Access Journals (Sweden)

    S. Narayanamoorthy

    2015-01-01

    Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.

  19. A canonical form of the equation of motion of linear dynamical systems

    Science.gov (United States)

    Kawano, Daniel T.; Salsa, Rubens Goncalves; Ma, Fai; Morzfeld, Matthias

    2018-03-01

    The equation of motion of a discrete linear system has the form of a second-order ordinary differential equation with three real and square coefficient matrices. It is shown that, for almost all linear systems, such an equation can always be converted by an invertible transformation into a canonical form specified by two diagonal coefficient matrices associated with the generalized acceleration and displacement. This canonical form of the equation of motion is unique up to an equivalence class for non-defective systems. As an important by-product, a damped linear system that possesses three symmetric and positive definite coefficients can always be recast as an undamped and decoupled system.

  20. The cavity approach to parallel dynamics of Ising spins on a graph

    International Nuclear Information System (INIS)

    Neri, I; Bollé, D

    2009-01-01

    We use the cavity method to study the parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single-site probabilities of paths propagating along the edges of the graph. These equations are analogous to the cavity equations for equilibrium models and are exact on a tree. On graphs with exclusively directed edges we find an exact expression for the stationary distribution. We present the phase diagrams for an Ising model on an asymmetric Bethe lattice and for a neural network with Hebbian interactions on an asymmetric scale-free graph. For graphs with a nonzero fraction of symmetric edges the equations can be solved for a finite number of time steps. Theoretical predictions are confirmed by simulations. Using a heuristic method the cavity equations are extended to a set of equations that determine the marginals of the stationary distribution of Ising models on graphs with a nonzero fraction of symmetric edges. The results from this method are discussed and compared with simulations

  1. An implicit spectral formula for generalized linear Schroedinger equations

    International Nuclear Information System (INIS)

    Schulze-Halberg, A.; Garcia-Ravelo, J.; Pena Gil, Jose Juan

    2009-01-01

    We generalize the semiclassical Bohr–Sommerfeld quantization rule to an exact, implicit spectral formula for linear, generalized Schroedinger equations admitting a discrete spectrum. Special cases include the position-dependent mass Schroedinger equation or the Schroedinger equation for weighted energy. Requiring knowledge of the potential and the solution associated with the lowest spectral value, our formula predicts the complete spectrum in its exact form. (author)

  2. Linear Equating for the NEAT Design: Parameter Substitution Models and Chained Linear Relationship Models

    Science.gov (United States)

    Kane, Michael T.; Mroch, Andrew A.; Suh, Youngsuk; Ripkey, Douglas R.

    2009-01-01

    This paper analyzes five linear equating models for the "nonequivalent groups with anchor test" (NEAT) design with internal anchors (i.e., the anchor test is part of the full test). The analysis employs a two-dimensional framework. The first dimension contrasts two general approaches to developing the equating relationship. Under a "parameter…

  3. Dynamic Representations of Sparse Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Fagerberg, Rolf

    1999-01-01

    We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

  4. An Evaluation of Five Linear Equating Methods for the NEAT Design

    Science.gov (United States)

    Mroch, Andrew A.; Suh, Youngsuk; Kane, Michael T.; Ripkey, Douglas R.

    2009-01-01

    This study uses the results of two previous papers (Kane, Mroch, Suh, & Ripkey, this issue; Suh, Mroch, Kane, & Ripkey, this issue) and the literature on linear equating to evaluate five linear equating methods along several dimensions, including the plausibility of their assumptions and their levels of bias and root mean squared difference…

  5. SUPPORTING STUDENTS’ UNDERSTANDING OF LINEAR EQUATIONS WITH ONE VARIABLE USING ALGEBRA TILES

    Directory of Open Access Journals (Sweden)

    Sari Saraswati

    2016-01-01

    Full Text Available This research aimed to describe how algebra tiles can support students’ understanding of linear equations with one variable. This article is a part of a larger research on learning design of linear equations with one variable using algebra tiles combined with balancing method. Therefore, it will merely discuss one activity focused on how students use the algebra tiles to find a method to solve linear equations with one variable. Design research was used as an approach in this study. It consists of three phases, namely preliminary design, teaching experiment and retrospective analysis. Video registrations, students’ written works, pre-test, post-test, field notes, and interview are technic to collect data. The data were analyzed by comparing the hypothetical learning trajectory (HLT and the actual learning process. The result shows that algebra tiles could supports students’ understanding to find the formal solution of linear equation with one variable.Keywords: linear equation with one variable, algebra tiles, design research, balancing method, HLT DOI: http://dx.doi.org/10.22342/jme.7.1.2814.19-30

  6. New approach to solve fully fuzzy system of linear equations using ...

    Indian Academy of Sciences (India)

    This paper proposes two new methods to solve fully fuzzy system of linear equations. The fuzzy system has been converted to a crisp system of linear equations by using single and double parametric form of fuzzy numbers to obtain the non-negative solution. Double parametric form of fuzzy numbers is defined and applied ...

  7. Growth of meromorphic solutions of higher-order linear differential equations

    Directory of Open Access Journals (Sweden)

    Wenjuan Chen

    2009-01-01

    Full Text Available In this paper, we investigate the higher-order linear differential equations with meromorphic coefficients. We improve and extend a result of M.S. Liu and C.L. Yuan, by using the estimates for the logarithmic derivative of a transcendental meromorphic function due to Gundersen, and the extended Winman-Valiron theory which proved by J. Wang and H.X. Yi. In addition, we also consider the nonhomogeneous linear differential equations.

  8. SUPPORTING STUDENTS’ UNDERSTANDING OF LINEAR EQUATIONS WITH ONE VARIABLE USING ALGEBRA TILES

    Directory of Open Access Journals (Sweden)

    Sari Saraswati

    2016-01-01

    Full Text Available This research aimed to describe how algebra tiles can support students’ understanding of linear equations with one variable. This article is a part of a larger research on learning design of linear equations with one variable using algebra tiles combined with balancing method. Therefore, it will merely discuss one activity focused on how students use the algebra tiles to find a method to solve linear equations with one variable. Design research was used as an approach in this study. It consists of three phases, namely preliminary design, teaching experiment and retrospective analysis. Video registrations, students’ written works, pre-test, post-test, field notes, and interview are technic to collect data. The data were analyzed by comparing the hypothetical learning trajectory (HLT and the actual learning process. The result shows that algebra tiles could supports students’ understanding to find the formal solution of linear equation with one variable.

  9. On a conjecture concerning helly circle graphs

    Directory of Open Access Journals (Sweden)

    Durán Guillermo

    2003-01-01

    Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

  10. New non-linear modified massless Klein-Gordon equation

    Energy Technology Data Exchange (ETDEWEB)

    Asenjo, Felipe A. [Universidad Adolfo Ibanez, UAI Physics Center, Santiago (Chile); Universidad Adolfo Ibanez, Facultad de Ingenieria y Ciencias, Santiago (Chile); Hojman, Sergio A. [Universidad Adolfo Ibanez, UAI Physics Center, Santiago (Chile); Universidad Adolfo Ibanez, Departamento de Ciencias, Facultad de Artes Liberales, Santiago (Chile); Universidad de Chile, Departamento de Fisica, Facultad de Ciencias, Santiago (Chile); Centro de Recursos Educativos Avanzados, CREA, Santiago (Chile)

    2017-11-15

    The massless Klein-Gordon equation on arbitrary curved backgrounds allows for solutions which develop ''tails'' inside the light cone and, therefore, do not strictly follow null geodesics as discovered by DeWitt and Brehme almost 60 years ago. A modification of the massless Klein-Gordon equation is presented, which always exhibits null geodesic propagation of waves on arbitrary curved spacetimes. This new equation is derived from a Lagrangian which exhibits current-current interaction. Its non-linearity is due to a self-coupling term which is related to the quantum mechanical Bohm potential. (orig.)

  11. A discrete homotopy perturbation method for non-linear Schrodinger equation

    Directory of Open Access Journals (Sweden)

    H. A. Wahab

    2015-12-01

    Full Text Available A general analysis is made by homotopy perturbation method while taking the advantages of the initial guess, appearance of the embedding parameter, different choices of the linear operator to the approximated solution to the non-linear Schrodinger equation. We are not dependent upon the Adomian polynomials and find the linear forms of the components without these calculations. The discretised forms of the nonlinear Schrodinger equation allow us whether to apply any numerical technique on the discritisation forms or proceed for perturbation solution of the problem. The discretised forms obtained by constructed homotopy provide the linear parts of the components of the solution series and hence a new discretised form is obtained. The general discretised form for the NLSE allows us to choose any initial guess and the solution in the closed form.

  12. On index-2 linear implicit difference equations

    NARCIS (Netherlands)

    Nguyen Huu Du, [No Value; Le Cong Loi, [No Value; Trinh Khanh Duy, [No Value; Vu Tien Viet, [No Value

    2011-01-01

    This paper deals with an index-2 notion for linear implicit difference equations (LIDEs) and with the solvability of initial value problems (IVPs) for index-2 LIDEs. Besides, the cocycle property as well as the multiplicative ergodic theorem of Oseledets type are also proved. (C) 2010 Elsevier Inc.

  13. Singular Linear Differential Equations in Two Variables

    NARCIS (Netherlands)

    Braaksma, B.L.J.; Put, M. van der

    2008-01-01

    The formal and analytic classification of integrable singular linear differential equations has been studied among others by R. Gerard and Y. Sibuya. We provide a simple proof of their main result, namely: For certain irregular systems in two variables there is no Stokes phenomenon, i.e. there is no

  14. Kuramoto model for infinite graphs with kernels

    KAUST Repository

    Canale, Eduardo

    2015-01-07

    In this paper we study the Kuramoto model of weakly coupled oscillators for the case of non trivial network with large number of nodes. We approximate of such configurations by a McKean-Vlasov stochastic differential equation based on infinite graph. We focus on circulant graphs which have enough symmetries to make the computations easier. We then focus on the asymptotic regime where an integro-partial differential equation is derived. Numerical analysis and convergence proofs of the Fokker-Planck-Kolmogorov equation are conducted. Finally, we provide numerical examples that illustrate the convergence of our method.

  15. Schouten identities for Feynman graph amplitudes; The Master Integrals for the two-loop massive sunrise graph

    International Nuclear Information System (INIS)

    Remiddi, Ettore; Tancredi, Lorenzo

    2014-01-01

    A new class of identities for Feynman graph amplitudes, dubbed Schouten identities, valid at fixed integer value of the dimension d is proposed. The identities are then used in the case of the two-loop sunrise graph with arbitrary masses for recovering the second-order differential equation for the scalar amplitude in d=2 dimensions, as well as a chained set of equations for all the coefficients of the expansions in (d−2). The shift from d≈2 to d≈4 dimensions is then discussed

  16. Visual construction of characteristic equations of linear electric circuits

    Directory of Open Access Journals (Sweden)

    V.V. Kostyukov

    2013-12-01

    Full Text Available A visual identification method with application of partial circuits is developed for characteristic equation coefficients of transients in linear electric circuits. The method is based on interrelationship between the roots of algebraic polynomial and its coefficients. The method is illustrated with an example of a third-order linear electric circuit.

  17. Numerical method for solving linear Fredholm fuzzy integral equations of the second kind

    Energy Technology Data Exchange (ETDEWEB)

    Abbasbandy, S. [Department of Mathematics, Imam Khomeini International University, P.O. Box 288, Ghazvin 34194 (Iran, Islamic Republic of)]. E-mail: saeid@abbasbandy.com; Babolian, E. [Faculty of Mathematical Sciences and Computer Engineering, Teacher Training University, Tehran 15618 (Iran, Islamic Republic of); Alavi, M. [Department of Mathematics, Arak Branch, Islamic Azad University, Arak 38135 (Iran, Islamic Republic of)

    2007-01-15

    In this paper we use parametric form of fuzzy number and convert a linear fuzzy Fredholm integral equation to two linear system of integral equation of the second kind in crisp case. We can use one of the numerical method such as Nystrom and find the approximation solution of the system and hence obtain an approximation for fuzzy solution of the linear fuzzy Fredholm integral equations of the second kind. The proposed method is illustrated by solving some numerical examples.

  18. Nonoscillation of half-linear dynamic equations

    Czech Academy of Sciences Publication Activity Database

    Matucci, S.; Řehák, Pavel

    2010-01-01

    Roč. 60, č. 5 (2010), s. 1421-1429 ISSN 0898-1221 R&D Projects: GA AV ČR KJB100190701 Grant - others:GA ČR(CZ) GA201/07/0145 Institutional research plan: CEZ:AV0Z10190503 Keywords : half-linear dynamic equation * time scale * (non)oscillation * Riccati technique Subject RIV: BA - General Mathematics Impact factor: 1.472, year: 2010 http://www.sciencedirect.com/science/article/pii/S0898122110004384

  19. Subroutine for series solutions of linear differential equations

    International Nuclear Information System (INIS)

    Tasso, H.; Steuerwald, J.

    1976-02-01

    A subroutine for Taylor series solutions of systems of ordinary linear differential equations is descriebed. It uses the old idea of Lie series but allows simple implementation and is time-saving for symbolic manipulations. (orig.) [de

  20. A fast iterative scheme for the linearized Boltzmann equation

    Science.gov (United States)

    Wu, Lei; Zhang, Jun; Liu, Haihu; Zhang, Yonghao; Reese, Jason M.

    2017-06-01

    Iterative schemes to find steady-state solutions to the Boltzmann equation are efficient for highly rarefied gas flows, but can be very slow to converge in the near-continuum flow regime. In this paper, a synthetic iterative scheme is developed to speed up the solution of the linearized Boltzmann equation by penalizing the collision operator L into the form L = (L + Nδh) - Nδh, where δ is the gas rarefaction parameter, h is the velocity distribution function, and N is a tuning parameter controlling the convergence rate. The velocity distribution function is first solved by the conventional iterative scheme, then it is corrected such that the macroscopic flow velocity is governed by a diffusion-type equation that is asymptotic-preserving into the Navier-Stokes limit. The efficiency of this new scheme is assessed by calculating the eigenvalue of the iteration, as well as solving for Poiseuille and thermal transpiration flows. We find that the fastest convergence of our synthetic scheme for the linearized Boltzmann equation is achieved when Nδ is close to the average collision frequency. The synthetic iterative scheme is significantly faster than the conventional iterative scheme in both the transition and the near-continuum gas flow regimes. Moreover, due to its asymptotic-preserving properties, the synthetic iterative scheme does not need high spatial resolution in the near-continuum flow regime, which makes it even faster than the conventional iterative scheme. Using this synthetic scheme, with the fast spectral approximation of the linearized Boltzmann collision operator, Poiseuille and thermal transpiration flows between two parallel plates, through channels of circular/rectangular cross sections and various porous media are calculated over the whole range of gas rarefaction. Finally, the flow of a Ne-Ar gas mixture is solved based on the linearized Boltzmann equation with the Lennard-Jones intermolecular potential for the first time, and the difference

  1. Asymptotic solutions and spectral theory of linear wave equations

    International Nuclear Information System (INIS)

    Adam, J.A.

    1982-01-01

    This review contains two closely related strands. Firstly the asymptotic solution of systems of linear partial differential equations is discussed, with particular reference to Lighthill's method for obtaining the asymptotic functional form of the solution of a scalar wave equation with constant coefficients. Many of the applications of this technique are highlighted. Secondly, the methods and applications of the theory of the reduced (one-dimensional) wave equation - particularly spectral theory - are discussed. While the breadth of application and power of the techniques is emphasised throughout, the opportunity is taken to present to a wider readership, developments of the methods which have occured in some aspects of astrophysical (particularly solar) and geophysical fluid dynamics. It is believed that the topics contained herein may be of relevance to the applied mathematician or theoretical physicist interest in problems of linear wave propagation in these areas. (orig./HSI)

  2. Appearance of eigen modes for the linearized Vlasov-Poisson equation

    International Nuclear Information System (INIS)

    Degond, P.

    1983-01-01

    In order to determine the asymptotic behaviour, when the time goes to infinity, of the solution of the linearized Vlasov-Poisson equation, we use eigen modes, associated to continuous linear functionals on a Banach space of analytic functions [fr

  3. The heat kernel as the pagerank of a graph

    Science.gov (United States)

    Chung, Fan

    2007-01-01

    The concept of pagerank was first started as a way for determining the ranking of Web pages by Web search engines. Based on relations in interconnected networks, pagerank has become a major tool for addressing fundamental problems arising in general graphs, especially for large information networks with hundreds of thousands of nodes. A notable notion of pagerank, introduced by Brin and Page and denoted by PageRank, is based on random walks as a geometric sum. In this paper, we consider a notion of pagerank that is based on the (discrete) heat kernel and can be expressed as an exponential sum of random walks. The heat kernel satisfies the heat equation and can be used to analyze many useful properties of random walks in a graph. A local Cheeger inequality is established, which implies that, by focusing on cuts determined by linear orderings of vertices using the heat kernel pageranks, the resulting partition is within a quadratic factor of the optimum. This is true, even if we restrict the volume of the small part separated by the cut to be close to some specified target value. This leads to a graph partitioning algorithm for which the running time is proportional to the size of the targeted volume (instead of the size of the whole graph).

  4. Linear algebra a first course with applications to differential equations

    CERN Document Server

    Apostol, Tom M

    2014-01-01

    Developed from the author's successful two-volume Calculus text this book presents Linear Algebra without emphasis on abstraction or formalization. To accommodate a variety of backgrounds, the text begins with a review of prerequisites divided into precalculus and calculus prerequisites. It continues to cover vector algebra, analytic geometry, linear spaces, determinants, linear differential equations and more.

  5. Approximate Controllability for Linear Stochastic Differential Equations in Infinite Dimensions

    International Nuclear Information System (INIS)

    Goreac, D.

    2009-01-01

    The objective of the paper is to investigate the approximate controllability property of a linear stochastic control system with values in a separable real Hilbert space. In a first step we prove the existence and uniqueness for the solution of the dual linear backward stochastic differential equation. This equation has the particularity that in addition to an unbounded operator acting on the Y-component of the solution there is still another one acting on the Z-component. With the help of this dual equation we then deduce the duality between approximate controllability and observability. Finally, under the assumption that the unbounded operator acting on the state process of the forward equation is an infinitesimal generator of an exponentially stable semigroup, we show that the generalized Hautus test provides a necessary condition for the approximate controllability. The paper generalizes former results by Buckdahn, Quincampoix and Tessitore (Stochastic Partial Differential Equations and Applications, Series of Lecture Notes in Pure and Appl. Math., vol. 245, pp. 253-260, Chapman and Hall, London, 2006) and Goreac (Applied Analysis and Differential Equations, pp. 153-164, World Scientific, Singapore, 2007) from the finite dimensional to the infinite dimensional case

  6. Spectrum of the linearized operator for the Ginzburg-Landau equation

    Directory of Open Access Journals (Sweden)

    Tai-Chia Lin

    2000-06-01

    Full Text Available We study the spectrum of the linearized operator for the Ginzburg-Landau equation about a symmetric vortex solution with degree one. We show that the smallest eigenvalue of the linearized operator has multiplicity two, and then we describe its behavior as a small parameter approaches zero. We also find a positive lower bound for all the other eigenvalues, and find estimates of the first eigenfunction. Then using these results, we give partial results on the dynamics of vortices in the nonlinear heat and Schrodinger equations.

  7. Stability of numerical method for semi-linear stochastic pantograph differential equations

    Directory of Open Access Journals (Sweden)

    Yu Zhang

    2016-01-01

    Full Text Available Abstract As a particular expression of stochastic delay differential equations, stochastic pantograph differential equations have been widely used in nonlinear dynamics, quantum mechanics, and electrodynamics. In this paper, we mainly study the stability of analytical solutions and numerical solutions of semi-linear stochastic pantograph differential equations. Some suitable conditions for the mean-square stability of an analytical solution are obtained. Then we proved the general mean-square stability of the exponential Euler method for a numerical solution of semi-linear stochastic pantograph differential equations, that is, if an analytical solution is stable, then the exponential Euler method applied to the system is mean-square stable for arbitrary step-size h > 0 $h>0$ . Numerical examples further illustrate the obtained theoretical results.

  8. Quantum osp-invariant non-linear Schroedinger equation

    International Nuclear Information System (INIS)

    Kulish, P.P.

    1985-04-01

    The generalizations of the non-linear Schroedinger equation (NS) associated with the orthosymplectic superalgebras are formulated. The simplest osp(1/2)-NS model is solved by the quantum inverse scattering method on a finite interval under periodic boundary conditions as well as on the wholeline in the case of a finite number of excitations. (author)

  9. Supporting Students' Understanding of Linear Equations with One Variable Using Algebra Tiles

    Science.gov (United States)

    Saraswati, Sari; Putri, Ratu Ilma Indra; Somakim

    2016-01-01

    This research aimed to describe how algebra tiles can support students' understanding of linear equations with one variable. This article is a part of a larger research on learning design of linear equations with one variable using algebra tiles combined with balancing method. Therefore, it will merely discuss one activity focused on how students…

  10. Novel algorithm of large-scale simultaneous linear equations

    International Nuclear Information System (INIS)

    Fujiwara, T; Hoshi, T; Yamamoto, S; Sogabe, T; Zhang, S-L

    2010-01-01

    We review our recently developed methods of solving large-scale simultaneous linear equations and applications to electronic structure calculations both in one-electron theory and many-electron theory. This is the shifted COCG (conjugate orthogonal conjugate gradient) method based on the Krylov subspace, and the most important issue for applications is the shift equation and the seed switching method, which greatly reduce the computational cost. The applications to nano-scale Si crystals and the double orbital extended Hubbard model are presented.

  11. Dark energy cosmology with generalized linear equation of state

    International Nuclear Information System (INIS)

    Babichev, E; Dokuchaev, V; Eroshenko, Yu

    2005-01-01

    Dark energy with the usually used equation of state p = wρ, where w const 0 ), where the constants α and ρ 0 are free parameters. This non-homogeneous linear equation of state provides the description of both hydrodynamically stable (α > 0) and unstable (α < 0) fluids. In particular, the considered cosmological model describes the hydrodynamically stable dark (and phantom) energy. The possible types of cosmological scenarios in this model are determined and classified in terms of attractors and unstable points by using phase trajectories analysis. For the dark energy case, some distinctive types of cosmological scenarios are possible: (i) the universe with the de Sitter attractor at late times, (ii) the bouncing universe, (iii) the universe with the big rip and with the anti-big rip. In the framework of a linear equation of state the universe filled with a phantom energy, w < -1, may have either the de Sitter attractor or the big rip

  12. POSITIVE SOLUTIONS TO SEMI-LINEAR SECOND-ORDER ORDINARY DIFFERENTIAL EQUATIONS IN BANACH SPACE

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this paper,we study the existence of positive periodic solution to some second- order semi-linear differential equation in Banach space.By the fixed point index theory, we prove that the semi-linear differential equation has two positive periodic solutions.

  13. Focal decompositions for linear differential equations of the second order

    Directory of Open Access Journals (Sweden)

    L. Birbrair

    2003-01-01

    two-points problems to itself such that the image of the focal decomposition associated to the first equation is a focal decomposition associated to the second one. In this paper, we present a complete classification for linear second-order equations with respect to this equivalence relation.

  14. Prolongation structure and linear eigenvalue equations for Einstein-Maxwell fields

    International Nuclear Information System (INIS)

    Kramer, D.; Neugebauer, G.

    1981-01-01

    The Einstein-Maxwell equations for stationary axisymmetric exterior fields are shown to be the integrability conditions of a set of linear eigenvalue equations for pseudopotentials. Using the method of Wahlquist and Estabrook (J. Math Phys.; 16:1 (1975)) it is shown that the prolongation structure of the Einstein-Maxwell equations contains the SU(2,1) Lie algebra. A new mapping of known solutions to other solutions has been found. (author)

  15. From the hypergeometric differential equation to a non-linear Schrödinger one

    International Nuclear Information System (INIS)

    Plastino, A.; Rocca, M.C.

    2015-01-01

    We show that the q-exponential function is a hypergeometric function. Accordingly, it obeys the hypergeometric differential equation. We demonstrate that this differential equation can be transformed into a non-linear Schrödinger equation (NLSE). This NLSE exhibits both similarities and differences vis-a-vis the Nobre–Rego-Monteiro–Tsallis one. - Highlights: • We show that the q-exponential is a hypergeometric function. • It thus obeys the hypergeometric differential equation (HDE). • We show that the HDE can be cast as a non-linear Schrödinger equation. • This is different from the Nobre, Rego-Monteiro, Tsallis one.

  16. Exact solution of some linear matrix equations using algebraic methods

    Science.gov (United States)

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

    1977-01-01

    A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis 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 action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.

  17. Construction of local and non-local conservation laws for non-linear field equations

    International Nuclear Information System (INIS)

    Vladimirov, V.S.; Volovich, I.V.

    1984-08-01

    A method of constructing conserved currents for non-linear field equations is presented. More explicitly for non-linear equations, which can be derived from compatibility conditions of some linear system with a parameter, a procedure of obtaining explicit expressions for local and non-local currents is developed. Some examples such as the classical Heisenberg spin chain and supersymmetric Yang-Mills theory are considered. (author)

  18. A Hamiltonian structure for the linearized Einstein vacuum field equations

    International Nuclear Information System (INIS)

    Torres del Castillo, G.F.

    1991-01-01

    By considering the Einstein vacuum field equations linearized about the Minkowski metric, the evolution equations for the gauge-invariant quantities characterizing the gravitational field are written in a Hamiltonian form. A Poisson bracket between functionals of the field, compatible with the constraints satisfied by the field variables, is obtained (Author)

  19. Collective spin by linearization of the Schrodinger equation for nuclear collective motion

    International Nuclear Information System (INIS)

    Greiner, M.; Scheid, W.; Herrmann, R.

    1988-01-01

    The free Schrodinger equation for multipole degrees of freedom is linearized so that energy and momentum operators appear only in first order. As an example, the authors demonstrate the linearization procedure for quadrupole degrees of freedom. The wave function solving this equation carries a spin. The authors derive the operator of the collective spin and its eigen values depending on multipolarity

  20. Two-dimensional differential transform method for solving linear and non-linear Schroedinger equations

    International Nuclear Information System (INIS)

    Ravi Kanth, A.S.V.; Aruna, K.

    2009-01-01

    In this paper, we propose a reliable algorithm to develop exact and approximate solutions for the linear and nonlinear Schroedinger equations. The approach rest mainly on two-dimensional differential transform method which is one of the approximate methods. The method can easily be applied to many linear and nonlinear problems and is capable of reducing the size of computational work. Exact solutions can also be achieved by the known forms of the series solutions. Several illustrative examples are given to demonstrate the effectiveness of the present method.

  1. Solutions of the linearized Bach-Einstein equation in the static spherically symmetric case

    International Nuclear Information System (INIS)

    Schmidt, H.J.

    1985-01-01

    The Bach-Einstein equation linearized around Minkowski space-time is completely solved. The set of solutions depends on three parameters; a two-parameter subset of it becomes asymptotically flat. In that region the gravitational potential is of the type phi = -m/r + epsilon exp (-r/l). Because of the different asymptotic behaviour of both terms, it became necessary to linearize also around the Schwarzschild solution phi = -m/r. The linearized equation resulting in this case is discussed using qualitative methods. The result is that for m = 2l phi = -m/r + epsilon r -2 exp (-r/l) u, where u is some bounded function; m is arbitrary and epsilon again small. Further, the relation between the solution of the linearized and the full equation is discussed. (author)

  2. On a representation of linear differential equations

    Czech Academy of Sciences Publication Activity Database

    Neuman, František

    2010-01-01

    Roč. 52, 1-2 (2010), s. 355-360 ISSN 0895-7177 Grant - others:GA ČR(CZ) GA201/08/0469 Institutional research plan: CEZ:AV0Z10190503 Keywords : Brandt and Ehresmann groupoinds * transformations * canonical forms * linear differential equations Subject RIV: BA - General Mathematics Impact factor: 1.066, year: 2010 http://www.sciencedirect.com/science/article/pii/S0895717710001184

  3. Multiple graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2013-10-01

    Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.

  4. CFORM- LINEAR CONTROL SYSTEM DESIGN AND ANALYSIS: CLOSED FORM SOLUTION AND TRANSIENT RESPONSE OF THE LINEAR DIFFERENTIAL EQUATION

    Science.gov (United States)

    Jamison, J. W.

    1994-01-01

    CFORM was developed by the Kennedy Space Center Robotics Lab to assist in linear control system design and analysis using closed form and transient response mechanisms. The program computes the closed form solution and transient response of a linear (constant coefficient) differential equation. CFORM allows a choice of three input functions: the Unit Step (a unit change in displacement); the Ramp function (step velocity); and the Parabolic function (step acceleration). It is only accurate in cases where the differential equation has distinct roots, and does not handle the case for roots at the origin (s=0). Initial conditions must be zero. Differential equations may be input to CFORM in two forms - polynomial and product of factors. In some linear control analyses, it may be more appropriate to use a related program, Linear Control System Design and Analysis (KSC-11376), which uses root locus and frequency response methods. CFORM was written in VAX FORTRAN for a VAX 11/780 under VAX VMS 4.7. It has a central memory requirement of 30K. CFORM was developed in 1987.

  5. The non-linear coupled spin 2-spin 3 Cotton equation in three dimensions

    Energy Technology Data Exchange (ETDEWEB)

    Linander, Hampus; Nilsson, Bengt E.W. [Department of Physics, Theoretical PhysicsChalmers University of Technology, S-412 96 Göteborg (Sweden)

    2016-07-05

    In the context of three-dimensional conformal higher spin theory we derive, in the frame field formulation, the full non-linear spin 3 Cotton equation coupled to spin 2. This is done by solving the corresponding Chern-Simons gauge theory system of equations, that is, using F=0 to eliminate all auxiliary fields and thus expressing the Cotton equation in terms of just the spin 3 frame field and spin 2 covariant derivatives and tensors (Schouten). In this derivation we neglect the spin 4 and higher spin sectors and approximate the star product commutator by a Poisson bracket. The resulting spin 3 Cotton equation is complicated but can be related to linearized versions in the metric formulation obtained previously by other authors. The expected symmetry (spin 3 “translation”, “Lorentz” and “dilatation”) properties are verified for Cotton and other relevant tensors but some perhaps unexpected features emerge in the process, in particular in relation to the non-linear equations. We discuss the structure of this non-linear spin 3 Cotton equation but its explicit form is only presented here, in an exact but not completely refined version, in appended files obtained by computer algebra methods. Both the frame field and metric formulations are provided.

  6. GDTM-Padé technique for the non-linear differential-difference equation

    Directory of Open Access Journals (Sweden)

    Lu Jun-Feng

    2013-01-01

    Full Text Available This paper focuses on applying the GDTM-Padé technique to solve the non-linear differential-difference equation. The bell-shaped solitary wave solution of Belov-Chaltikian lattice equation is considered. Comparison between the approximate solutions and the exact ones shows that this technique is an efficient and attractive method for solving the differential-difference equations.

  7. On the Liouvillian solution of second-order linear differential equations and algebraic invariant curves

    International Nuclear Information System (INIS)

    Man, Yiu-Kwong

    2010-01-01

    In this communication, we present a method for computing the Liouvillian solution of second-order linear differential equations via algebraic invariant curves. The main idea is to integrate Kovacic's results on second-order linear differential equations with the Prelle-Singer method for computing first integrals of differential equations. Some examples on using this approach are provided. (fast track communication)

  8. On the economical solution method for a system of linear algebraic equations

    Directory of Open Access Journals (Sweden)

    Jan Awrejcewicz

    2004-01-01

    Full Text Available The present work proposes a novel optimal and exact method of solving large systems of linear algebraic equations. In the approach under consideration, the solution of a system of algebraic linear equations is found as a point of intersection of hyperplanes, which needs a minimal amount of computer operating storage. Two examples are given. In the first example, the boundary value problem for a three-dimensional stationary heat transfer equation in a parallelepiped in ℝ3 is considered, where boundary value problems of first, second, or third order, or their combinations, are taken into account. The governing differential equations are reduced to algebraic ones with the help of the finite element and boundary element methods for different meshes applied. The obtained results are compared with known analytical solutions. The second example concerns computation of a nonhomogeneous shallow physically and geometrically nonlinear shell subject to transversal uniformly distributed load. The partial differential equations are reduced to a system of nonlinear algebraic equations with the error of O(hx12+hx22. The linearization process is realized through either Newton method or differentiation with respect to a parameter. In consequence, the relations of the boundary condition variations along the shell side and the conditions for the solution matching are reported.

  9. On the stability, the periodic solutions and the resolution of certain types of non linear equations, and of non linearly coupled systems of these equations, appearing in betatronic oscillations

    International Nuclear Information System (INIS)

    Valat, J.

    1960-12-01

    Universal stability diagrams have been calculated and experimentally checked for Hill-Meissner type equations with square-wave coefficients. The study of these equations in the phase-plane has then made it possible to extend the periodic solution calculations to the case of non-linear differential equations with periodic square-wave coefficients. This theory has been checked experimentally. For non-linear coupled systems with constant coefficients, a search was first made for solutions giving an algebraic motion. The elliptical and Fuchs's functions solve such motions. The study of non-algebraic motions is more delicate, apart from the study of nonlinear Lissajous's motions. A functional analysis shows that it is possible however in certain cases to decouple the system and to find general solutions. For non-linear coupled systems with periodic square-wave coefficients it is then possible to calculate the conditions leading to periodic solutions, if the two non-linear associated systems with constant coefficients fall into one of the categories of the above paragraph. (author) [fr

  10. Inhomogeneous linear equation in Rota-Baxter algebra

    OpenAIRE

    Pietrzkowski, Gabriel

    2014-01-01

    We consider a complete filtered Rota-Baxter algebra of weight $\\lambda$ over a commutative ring. Finding the unique solution of a non-homogeneous linear algebraic equation in this algebra, we generalize Spitzer's identity in both commutative and non-commutative cases. As an application, considering the Rota-Baxter algebra of power series in one variable with q-integral as the Rota-Baxter operator, we show certain Eulerian identities.

  11. Planar graphs theory and algorithms

    CERN Document Server

    Nishizeki, T

    1988-01-01

    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

  12. Solution of systems of linear algebraic equations by the method of summation of divergent series

    International Nuclear Information System (INIS)

    Kirichenko, G.A.; Korovin, Ya.S.; Khisamutdinov, M.V.; Shmojlov, V.I.

    2015-01-01

    A method for solving systems of linear algebraic equations has been proposed on the basis on the summation of the corresponding continued fractions. The proposed algorithm for solving systems of linear algebraic equations is classified as direct algorithms providing an exact solution in a finite number of operations. Examples of solving systems of linear algebraic equations have been presented and the effectiveness of the algorithm has been estimated [ru

  13. Stability of the trivial solution for linear stochastic differential equations with Poisson white noise

    International Nuclear Information System (INIS)

    Grigoriu, Mircea; Samorodnitsky, Gennady

    2004-01-01

    Two methods are considered for assessing the asymptotic stability of the trivial solution of linear stochastic differential equations driven by Poisson white noise, interpreted as the formal derivative of a compound Poisson process. The first method attempts to extend a result for diffusion processes satisfying linear stochastic differential equations to the case of linear equations with Poisson white noise. The developments for the method are based on Ito's formula for semimartingales and Lyapunov exponents. The second method is based on a geometric ergodic theorem for Markov chains providing a criterion for the asymptotic stability of the solution of linear stochastic differential equations with Poisson white noise. Two examples are presented to illustrate the use and evaluate the potential of the two methods. The examples demonstrate limitations of the first method and the generality of the second method

  14. Approximate labeling via graph cuts based on linear programming.

    Science.gov (United States)

    Komodakis, Nikos; Tziritas, Georgios

    2007-08-01

    A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \\alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \\alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems.

  15. Factorization of a class of almost linear second-order differential equations

    International Nuclear Information System (INIS)

    Estevez, P G; Kuru, S; Negro, J; Nieto, L M

    2007-01-01

    A general type of almost linear second-order differential equations, which are directly related to several interesting physical problems, is characterized. The solutions of these equations are obtained using the factorization technique, and their non-autonomous invariants are also found by means of scale transformations

  16. Variations in the Solution of Linear First-Order Differential Equations. Classroom Notes

    Science.gov (United States)

    Seaman, Brian; Osler, Thomas J.

    2004-01-01

    A special project which can be given to students of ordinary differential equations is described in detail. Students create new differential equations by changing the dependent variable in the familiar linear first-order equation (dv/dx)+p(x)v=q(x) by means of a substitution v=f(y). The student then creates a table of the new equations and…

  17. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions

    Directory of Open Access Journals (Sweden)

    Golovaty Yuriy

    2017-04-01

    Full Text Available We are interested in the evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a metric graph is studied. The hyperbolic equation becomes degenerate on a part of the graph as a small parameter goes to zero. In addition, the rates of degeneration may differ in different edges of the graph. Using the boundary layer method the complete asymptotic expansions of solutions are constructed and justified.

  18. A Proposed Method for Solving Fuzzy System of Linear Equations

    Directory of Open Access Journals (Sweden)

    Reza Kargar

    2014-01-01

    Full Text Available This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m×n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.

  19. On a class of fourth order linear recurrence equations

    Directory of Open Access Journals (Sweden)

    Sui-Sun Cheng

    1984-01-01

    Full Text Available This paper is concerned with sequences that satisfy a class of fourth order linear recurrence equations. Basic properties of such sequences are derived. In addition, we discuss the oscillatory and nonoscillatory behavior of such sequences.

  20. Could solitons be adiabatic invariants attached to certain non linear equations

    International Nuclear Information System (INIS)

    Lochak, P.

    1984-01-01

    Arguments are given to support the claim that solitons should be the adiabatic invariants associated to certain non linear partial differential equations; a precise mathematical form of this conjecture is then stated. As a particular case of the conjecture, the Korteweg-de Vries equation is studied. (Auth.)

  1. On a Linear Equation Arising in Isometric Embedding of Torus-like Surface

    Institute of Scientific and Technical Information of China (English)

    Chunhe LI

    2009-01-01

    The solvability of a linear equation and the regularity of the solution are discussed.The equation is arising in a geometric problem which is concerned with the realization of Alexandroff's positive annul in R3.

  2. On the nullity number of graphs

    Directory of Open Access Journals (Sweden)

    Mustapha Aouchiche

    2017-10-01

    Full Text Available The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007 60--67] that $\\eta \\le n - D$, where $\\eta$, n and D denote the nullity number, the order and the diameter of a connected graph, respectively. We first give a necessary condition on the extremal graphs corresponding to that bound, and then we strengthen the bound itself using the maximum clique number. In addition, we prove bounds on the nullity using the number of pendant neighbors in a graph. One of those bounds is an improvement of a known bound involving the domination number.

  3. Stochastic modeling of mode interactions via linear parabolized stability equations

    Science.gov (United States)

    Ran, Wei; Zare, Armin; Hack, M. J. Philipp; Jovanovic, Mihailo

    2017-11-01

    Low-complexity approximations of the Navier-Stokes equations have been widely used in the analysis of wall-bounded shear flows. In particular, the parabolized stability equations (PSE) and Floquet theory have been employed to capture the evolution of primary and secondary instabilities in spatially-evolving flows. We augment linear PSE with Floquet analysis to formally treat modal interactions and the evolution of secondary instabilities in the transitional boundary layer via a linear progression. To this end, we leverage Floquet theory by incorporating the primary instability into the base flow and accounting for different harmonics in the flow state. A stochastic forcing is introduced into the resulting linear dynamics to model the effect of nonlinear interactions on the evolution of modes. We examine the H-type transition scenario to demonstrate how our approach can be used to model nonlinear effects and capture the growth of the fundamental and subharmonic modes observed in direct numerical simulations and experiments.

  4. Quantum chaos on discrete graphs

    International Nuclear Information System (INIS)

    Smilansky, Uzy

    2007-01-01

    Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

  5. KAM for the non-linear Schroedinger equation

    CERN Document Server

    Eliasson, L H

    2006-01-01

    We consider the $d$-dimensional nonlinear Schr\\"o\\-dinger equation under periodic boundary conditions:-i\\dot u=\\Delta u+V(x)*u+\\ep|u|^2u;\\quad u=u(t,x),\\;x\\in\\T^dwhere $V(x)=\\sum \\hat V(a)e^{i\\sc{a,x}}$ is an analytic function with $\\hat V$ real. (This equation is a popular model for the `real' NLS equation, where instead of the convolution term $V*u$ we have the potential term $Vu$.) For $\\ep=0$ the equation is linear and has time--quasi-periodic solutions $u$,u(t,x)=\\sum_{s\\in \\AA}\\hat u_0(a)e^{i(|a|^2+\\hat V(a))t}e^{i\\sc{a,x}}, \\quad 0<|\\hat u_0(a)|\\le1,where $\\AA$ is any finite subset of $\\Z^d$. We shall treat $\\omega_a=|a|^2+\\hat V(a)$, $a\\in\\AA$, as free parameters in some domain $U\\subset\\R^{\\AA}$. This is a Hamiltonian system in infinite degrees of freedom, degenerate but with external parameters, and we shall describe a KAM-theory which, in particular, will have the following consequence: \\smallskip {\\it If $|\\ep|$ is sufficiently small, then there is a large subset $U'$ of $U$ such that for all $...

  6. Minimal solution of linear formed fuzzy matrix equations

    Directory of Open Access Journals (Sweden)

    Maryam Mosleh

    2012-10-01

    Full Text Available In this paper according to the structured element method, the $mimes n$ inconsistent fuzzy matrix equation $Ailde{X}=ilde{B},$ which are linear formed by fuzzy structured element, is investigated. The necessary and sufficient condition for the existence of a fuzzy solution is also discussed. some examples are presented to illustrate the proposed method.

  7. A New Theory of Non-Linear Thermo-Elastic Constitutive Equation of Isotropic Hyperelastic Materials

    Science.gov (United States)

    Li, Chen; Liao, Yufei

    2018-03-01

    Considering the influence of temperature and strain variables on materials. According to the relationship of conjugate stress-strain, a complete and irreducible non-linear constitutive equation of isotropic hyperelastic materials is derived and the constitutive equations of 16 types of isotropic hyperelastic materials are given we study the transformation methods and routes of 16 kinds of constitutive equations and the study proves that transformation of two forms of constitutive equation. As an example of application, the non-linear thermo-elastic constitutive equation of isotropic hyperelastic materials is combined with the natural vulcanized rubber experimental data in the existing literature base on MATLAB, The results show that the fitting accuracy is satisfactory.

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

    Science.gov (United States)

    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.

  9. Some Additional Remarks on the Cumulant Expansion for Linear Stochastic Differential Equations

    NARCIS (Netherlands)

    Roerdink, J.B.T.M.

    1984-01-01

    We summarize our previous results on cumulant expansions for linear stochastic differential equations with correlated multipliclative and additive noise. The application of the general formulas to equations with statistically independent multiplicative and additive noise is reconsidered in detail,

  10. Some additional remarks on the cumulant expansion for linear stochastic differential equations

    NARCIS (Netherlands)

    Roerdink, J.B.T.M.

    1984-01-01

    We summarize our previous results on cumular expasions for linear stochastic differential equations with correlated multipliclative and additive noise. The application of the general formulas to equations with statistically independent multiplicative and additive noise is reconsidered in detail,

  11. Hyers-Ulam stability for second-order linear differential equations with boundary conditions

    Directory of Open Access Journals (Sweden)

    Pasc Gavruta

    2011-06-01

    Full Text Available We prove the Hyers-Ulam stability of linear differential equations of second-order with boundary conditions or with initial conditions. That is, if y is an approximate solution of the differential equation $y''+ eta (x y = 0$ with $y(a = y(b =0$, then there exists an exact solution of the differential equation, near y.

  12. Asymptotic integration of a linear fourth order differential equation of Poincaré type

    Directory of Open Access Journals (Sweden)

    Anibal Coronel

    2015-11-01

    Full Text Available This article deals with the asymptotic behavior of nonoscillatory solutions of fourth order linear differential equation where the coefficients are perturbations of constants. We define a change of variable and deduce that the new variable satisfies a third order nonlinear differential equation. We assume three hypotheses. The first hypothesis is related to the constant coefficients and set up that the characteristic polynomial associated with the fourth order linear equation has simple and real roots. The other two hypotheses are related to the behavior of the perturbation functions and establish asymptotic integral smallness conditions of the perturbations. Under these general hypotheses, we obtain four main results. The first two results are related to the application of a fixed point argument to prove that the nonlinear third order equation has a unique solution. The next result concerns with the asymptotic behavior of the solutions of the nonlinear third order equation. The fourth main theorem is introduced to establish the existence of a fundamental system of solutions and to precise the formulas for the asymptotic behavior of the linear fourth order differential equation. In addition, we present an example to show that the results introduced in this paper can be applied in situations where the assumptions of some classical theorems are not satisfied.

  13. Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs

    Science.gov (United States)

    Biazzo, Indaco; Braunstein, Alfredo; Zecchina, Riccardo

    2012-08-01

    We study the behavior of an algorithm derived from the cavity method for the prize-collecting steiner tree (PCST) problem on graphs. The algorithm is based on the zero temperature limit of the cavity equations and as such is formally simple (a fixed point equation resolved by iteration) and distributed (parallelizable). We provide a detailed comparison with state-of-the-art algorithms on a wide range of existing benchmarks, networks, and random graphs. Specifically, we consider an enhanced derivative of the Goemans-Williamson heuristics and the dhea solver, a branch and cut integer linear programming based approach. The comparison shows that the cavity algorithm outperforms the two algorithms in most large instances both in running time and quality of the solution. Finally we prove a few optimality properties of the solutions provided by our algorithm, including optimality under the two postprocessing procedures defined in the Goemans-Williamson derivative and global optimality in some limit cases.

  14. Open Graphs and Computational Reasoning

    Directory of Open Access Journals (Sweden)

    Lucas Dixon

    2010-06-01

    Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.

  15. On oscillation of second-order linear ordinary differential equations

    Czech Academy of Sciences Publication Activity Database

    Lomtatidze, A.; Šremr, Jiří

    2011-01-01

    Roč. 54, - (2011), s. 69-81 ISSN 1512-0015 Institutional research plan: CEZ:AV0Z10190503 Keywords : linear second-order ordinary differential equation * Kamenev theorem * oscillation Subject RIV: BA - General Mathematics http://www.rmi.ge/jeomj/memoirs/vol54/abs54-4.htm

  16. An inhomogeneous wave equation and non-linear Diophantine approximation

    DEFF Research Database (Denmark)

    Beresnevich, V.; Dodson, M. M.; Kristensen, S.

    2008-01-01

    A non-linear Diophantine condition involving perfect squares and arising from an inhomogeneous wave equation on the torus guarantees the existence of a smooth solution. The exceptional set associated with the failure of the Diophantine condition and hence of the existence of a smooth solution...

  17. Fermions and loops on graphs: I. Loop calculus for determinants

    International Nuclear Information System (INIS)

    Chernyak, Vladimir Y; Chertkov, Michael

    2008-01-01

    This paper is the first in a series devoted to evaluation of the partition function in statistical models on graphs with loops in terms of the Berezin/fermion integrals. The paper focuses on a representation of the determinant of a square matrix in terms of a finite series, where each term corresponds to a loop on the graph. The representation is based on a fermion version of the loop calculus, previously introduced by the authors for graphical models with finite alphabets. Our construction contains two levels. First, we represent the determinant in terms of an integral over anti-commuting Grassmann variables, with some reparametrization/gauge freedom hidden in the formulation. Second, we show that a special choice of the gauge, called the BP (Bethe–Peierls or belief propagation) gauge, yields the desired loop representation. The set of gauge fixing BP conditions is equivalent to the Gaussian BP equations, discussed in the past as efficient (linear scaling) heuristics for estimating the covariance of a sparse positive matrix

  18. Improved harmonic balance approach to periodic solutions of non-linear jerk equations

    International Nuclear Information System (INIS)

    Wu, B.S.; Lim, C.W.; Sun, W.P.

    2006-01-01

    An analytical approximate approach for determining periodic solutions of non-linear jerk equations involving third-order time-derivative is presented. This approach incorporates salient features of both Newton's method and the method of harmonic balance. By appropriately imposing the method of harmonic balance to the linearized equation, the approach requires only one or two iterations to predict very accurate analytical approximate solutions for a large range of initial velocity amplitude. One typical example is used to verify and illustrate the usefulness and effectiveness of the proposed approach

  19. Graph-cut based discrete-valued image reconstruction.

    Science.gov (United States)

    Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

    2015-05-01

    Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

  20. Supporting second grade lower secondary school students’ understanding of linear equation system in two variables using ethnomathematics

    Science.gov (United States)

    Nursyahidah, F.; Saputro, B. A.; Rubowo, M. R.

    2018-03-01

    The aim of this research is to know the students’ understanding of linear equation system in two variables using Ethnomathematics and to acquire learning trajectory of linear equation system in two variables for the second grade of lower secondary school students. This research used methodology of design research that consists of three phases, there are preliminary design, teaching experiment, and retrospective analysis. Subject of this study is 28 second grade students of Sekolah Menengah Pertama (SMP) 37 Semarang. The result of this research shows that the students’ understanding in linear equation system in two variables can be stimulated by using Ethnomathematics in selling buying tradition in Peterongan traditional market in Central Java as a context. All of strategies and model that was applied by students and also their result discussion shows how construction and contribution of students can help them to understand concept of linear equation system in two variables. All the activities that were done by students produce learning trajectory to gain the goal of learning. Each steps of learning trajectory of students have an important role in understanding the concept from informal to the formal level. Learning trajectory using Ethnomathematics that is produced consist of watching video of selling buying activity in Peterongan traditional market to construct linear equation in two variables, determine the solution of linear equation in two variables, construct model of linear equation system in two variables from contextual problem, and solving a contextual problem related to linear equation system in two variables.

  1. Nonoscillation criteria for half-linear second order difference equations

    Czech Academy of Sciences Publication Activity Database

    Došlý, Ondřej; Řehák, Pavel

    2001-01-01

    Roč. 42, - (2001), s. 453-464 ISSN 0898-1221 R&D Projects: GA ČR GA201/98/0677; GA ČR GA201/99/0295 Keywords : half-linear difference equation%nonoscillation criteria%variational principle Subject RIV: BA - General Mathematics Impact factor: 0.383, year: 2001

  2. Lie symmetries and differential galois groups of linear equations

    NARCIS (Netherlands)

    Oudshoorn, W.R.; Put, M. van der

    2002-01-01

    For a linear ordinary differential equation the Lie algebra of its infinitesimal Lie symmetries is compared with its differential Galois group. For this purpose an algebraic formulation of Lie symmetries is developed. It turns out that there is no direct relation between the two above objects. In

  3. A new analysis of the Fornberg-Whitham equation pertaining to a fractional derivative with Mittag-Leffler-type kernel

    Science.gov (United States)

    Kumar, Devendra; Singh, Jagdev; Baleanu, Dumitru

    2018-02-01

    The mathematical model of breaking of non-linear dispersive water waves with memory effect is very important in mathematical physics. In the present article, we examine a novel fractional extension of the non-linear Fornberg-Whitham equation occurring in wave breaking. We consider the most recent theory of differentiation involving the non-singular kernel based on the extended Mittag-Leffler-type function to modify the Fornberg-Whitham equation. We examine the existence of the solution of the non-linear Fornberg-Whitham equation of fractional order. Further, we show the uniqueness of the solution. We obtain the numerical solution of the new arbitrary order model of the non-linear Fornberg-Whitham equation with the aid of the Laplace decomposition technique. The numerical outcomes are displayed in the form of graphs and tables. The results indicate that the Laplace decomposition algorithm is a very user-friendly and reliable scheme for handling such type of non-linear problems of fractional order.

  4. Solving Fully Fuzzy Linear System of Equations in General Form

    Directory of Open Access Journals (Sweden)

    A. Yousefzadeh

    2012-06-01

    Full Text Available In this work, we propose an approach for computing the positive solution of a fully fuzzy linear system where the coefficient matrix is a fuzzy $nimes n$ matrix. To do this, we use arithmetic operations on fuzzy numbers that introduced by Kaffman in and convert the fully fuzzy linear system into two $nimes n$ and $2nimes 2n$ crisp linear systems. If the solutions of these linear systems don't satisfy in positive fuzzy solution condition, we introduce the constrained least squares problem to obtain optimal fuzzy vector solution by applying the ranking function in given fully fuzzy linear system. Using our proposed method, the fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.

  5. Hierarchy of modular graph identities

    Energy Technology Data Exchange (ETDEWEB)

    D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)

    2016-11-09

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  6. Hierarchy of modular graph identities

    International Nuclear Information System (INIS)

    D’Hoker, Eric; Kaidi, Justin

    2016-01-01

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  7. Linear fractional diffusion-wave equation for scientists and engineers

    CERN Document Server

    Povstenko, Yuriy

    2015-01-01

    This book systematically presents solutions to the linear time-fractional diffusion-wave equation. It introduces the integral transform technique and discusses the properties of the Mittag-Leffler, Wright, and Mainardi functions that appear in the solutions. The time-nonlocal dependence between the flux and the gradient of the transported quantity with the “long-tail” power kernel results in the time-fractional diffusion-wave equation with the Caputo fractional derivative. Time-nonlocal generalizations of classical Fourier’s, Fick’s and Darcy’s laws are considered and different kinds of boundary conditions for this equation are discussed (Dirichlet, Neumann, Robin, perfect contact). The book provides solutions to the fractional diffusion-wave equation with one, two and three space variables in Cartesian, cylindrical and spherical coordinates. The respective sections of the book can be used for university courses on fractional calculus, heat and mass transfer, transport processes in porous media and ...

  8. Local linearization methods for the numerical integration of ordinary differential equations: An overview

    International Nuclear Information System (INIS)

    Jimenez, J.C.

    2009-06-01

    Local Linearization (LL) methods conform a class of one-step explicit integrators for ODEs derived from the following primary and common strategy: the vector field of the differential equation is locally (piecewise) approximated through a first-order Taylor expansion at each time step, thus obtaining successive linear equations that are explicitly integrated. Hereafter, the LL approach may include some additional strategies to improve that basic affine approximation. Theoretical and practical results have shown that the LL integrators have a number of convenient properties. These include arbitrary order of convergence, A-stability, linearization preserving, regularity under quite general conditions, preservation of the dynamics of the exact solution around hyperbolic equilibrium points and periodic orbits, integration of stiff and high-dimensional equations, low computational cost, and others. In this paper, a review of the LL methods and their properties is presented. (author)

  9. On the Linearized Darboux Equation Arising in Isometric Embedding of the Alexandrov Positive Annulus

    Institute of Scientific and Technical Information of China (English)

    Chunhe LI

    2013-01-01

    In the present paper,the solvability condition of the linearized Gauss-Codazzi system and the solutions to the homogenous system are given.In the meantime,the Solvability of a relevant linearized Darboux equation is given.The equations are arising in a geometric problem which is concerned with the realization of the Alexandrov's positive annulus in R3.

  10. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-04-25

    In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

  11. Non-linear partial differential equations an algebraic view of generalized solutions

    CERN Document Server

    Rosinger, Elemer E

    1990-01-01

    A massive transition of interest from solving linear partial differential equations to solving nonlinear ones has taken place during the last two or three decades. The availability of better computers has often made numerical experimentations progress faster than the theoretical understanding of nonlinear partial differential equations. The three most important nonlinear phenomena observed so far both experimentally and numerically, and studied theoretically in connection with such equations have been the solitons, shock waves and turbulence or chaotical processes. In many ways, these phenomen

  12. Anti-symmetrically fused model and non-linear integral equations in the three-state Uimin-Sutherland model

    International Nuclear Information System (INIS)

    Fujii, Akira; Kluemper, Andreas

    1999-01-01

    We derive the non-linear integral equations determining the free energy of the three-state pure bosonic Uimin-Sutherland model. In order to find a complete set of auxiliary functions, the anti-symmetric fusion procedure is utilized. We solve the non-linear integral equations numerically and see that the low-temperature behavior coincides with that predicted by conformal field theory. The magnetization and magnetic susceptibility are also calculated by means of the non-linear integral equation

  13. Asymptotic formulae for solutions of half-linear differential equations

    Czech Academy of Sciences Publication Activity Database

    Řehák, Pavel

    2017-01-01

    Roč. 292, January (2017), s. 165-177 ISSN 0096-3003 Institutional support: RVO:67985840 Keywords : half-linear differential equation * nonoscillatory solution * regular variation Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.738, year: 2016 http://www.sciencedirect.com/science/article/pii/S0096300316304581

  14. Calculations of stationary solutions for the non linear viscous resistive MHD equations in slab geometry

    International Nuclear Information System (INIS)

    Edery, D.

    1983-11-01

    The reduced system of the non linear resistive MHD equations is used in the 2-D one helicity approximation in the numerical computations of stationary tearing modes. The critical magnetic Raynolds number S (S=tausub(r)/tausub(H) where tausub(R) and tausub(H) are respectively the characteristic resistive and hydro magnetic times) and the corresponding linear solution are computed as a starting approximation for the full non linear equations. These equations are then treated numerically by an iterative procedure which is shown to be rapidly convergent. A numerical application is given in the last part of this paper

  15. Quasi-linear landau kinetic equations for magnetized plasmas: compact propagator formalism, rotation matrices and interaction

    International Nuclear Information System (INIS)

    Misguich, J.H.

    2004-04-01

    As a first step toward a nonlinear renormalized description of turbulence phenomena in magnetized plasmas, the lowest order quasi-linear description is presented here from a unified point of view for collisionless as well as for collisional plasmas in a constant magnetic field. The quasi-linear approximation is applied to a general kinetic equation obtained previously from the Klimontovich exact equation, by means of a generalised Dupree-Weinstock method. The so-obtained quasi-linear description of electromagnetic turbulence in a magnetoplasma is applied to three separate physical cases: -) weak electrostatic turbulence, -) purely magnetic field fluctuations (the classical quasi-linear results are obtained for cosmic ray diffusion in the 'slab model' of magnetostatic turbulence in the solar wind), and -) collisional kinetic equations of magnetized plasmas. This mathematical technique has allowed us to derive basic kinetic equations for turbulent plasmas and collisional plasmas, respectively in the quasi-linear and Landau approximation. In presence of a magnetic field we have shown that the systematic use of rotation matrices describing the helical particle motion allows for a much more compact derivation than usually performed. Moreover, from the formal analogy between turbulent and collisional plasmas, the results derived here in detail for the turbulent plasmas, can be immediately translated to obtain explicit results for the Landau kinetic equation

  16. Quasi-linear landau kinetic equations for magnetized plasmas: compact propagator formalism, rotation matrices and interaction

    Energy Technology Data Exchange (ETDEWEB)

    Misguich, J.H

    2004-04-01

    As a first step toward a nonlinear renormalized description of turbulence phenomena in magnetized plasmas, the lowest order quasi-linear description is presented here from a unified point of view for collisionless as well as for collisional plasmas in a constant magnetic field. The quasi-linear approximation is applied to a general kinetic equation obtained previously from the Klimontovich exact equation, by means of a generalised Dupree-Weinstock method. The so-obtained quasi-linear description of electromagnetic turbulence in a magnetoplasma is applied to three separate physical cases: -) weak electrostatic turbulence, -) purely magnetic field fluctuations (the classical quasi-linear results are obtained for cosmic ray diffusion in the 'slab model' of magnetostatic turbulence in the solar wind), and -) collisional kinetic equations of magnetized plasmas. This mathematical technique has allowed us to derive basic kinetic equations for turbulent plasmas and collisional plasmas, respectively in the quasi-linear and Landau approximation. In presence of a magnetic field we have shown that the systematic use of rotation matrices describing the helical particle motion allows for a much more compact derivation than usually performed. Moreover, from the formal analogy between turbulent and collisional plasmas, the results derived here in detail for the turbulent plasmas, can be immediately translated to obtain explicit results for the Landau kinetic equation.

  17. Diffusion phenomenon for linear dissipative wave equations in an exterior domain

    Science.gov (United States)

    Ikehata, Ryo

    Under the general condition of the initial data, we will derive the crucial estimates which imply the diffusion phenomenon for the dissipative linear wave equations in an exterior domain. In order to derive the diffusion phenomenon for dissipative wave equations, the time integral method which was developed by Ikehata and Matsuyama (Sci. Math. Japon. 55 (2002) 33) plays an effective role.

  18. Exponential estimates for solutions of half-linear differential equations

    Czech Academy of Sciences Publication Activity Database

    Řehák, Pavel

    2015-01-01

    Roč. 147, č. 1 (2015), s. 158-171 ISSN 0236-5294 Institutional support: RVO:67985840 Keywords : half-linear differential equation * decreasing solution * increasing solution * asymptotic behavior Subject RIV: BA - General Mathematics Impact factor: 0.469, year: 2015 http://link.springer.com/article/10.1007%2Fs10474-015-0522-9

  19. On the equivalence between particular types of Navier-Stokes and non-linear Schroedinger equations

    International Nuclear Information System (INIS)

    Dietrich, K.; Vautherin, D.

    1985-01-01

    We derive a Schroedinger equation equivalent to the Navier-Stokes equation in the special case of constant kinematic viscosities. This equation contains a non-linear term similar to that proposed by Kostin for a quantum description of friction [fr

  20. Giant Components in Biased Graph Processes

    OpenAIRE

    Amir, Gideon; Gurel-Gurevich, Ori; Lubetzky, Eyal; Singer, Amit

    2005-01-01

    A random graph process, $\\Gorg[1](n)$, is a sequence of graphs on $n$ vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known that in such a process a giant component (of linear size) typically emerges after $(1+o(1))\\frac{n}{2}$ edges (a phenomenon known as ``the double jump''), i.e., at time $t=1$ when using a timescale of $n/2$ edges in each step. We consider a generalization of ...

  1. Label Information Guided Graph Construction for Semi-Supervised Learning.

    Science.gov (United States)

    Zhuang, Liansheng; Zhou, Zihan; Gao, Shenghua; Yin, Jingwen; Lin, Zhouchen; Ma, Yi

    2017-09-01

    In the literature, most existing graph-based semi-supervised learning methods only use the label information of observed samples in the label propagation stage, while ignoring such valuable information when learning the graph. In this paper, we argue that it is beneficial to consider the label information in the graph learning stage. Specifically, by enforcing the weight of edges between labeled samples of different classes to be zero, we explicitly incorporate the label information into the state-of-the-art graph learning methods, such as the low-rank representation (LRR), and propose a novel semi-supervised graph learning method called semi-supervised low-rank representation. This results in a convex optimization problem with linear constraints, which can be solved by the linearized alternating direction method. Though we take LRR as an example, our proposed method is in fact very general and can be applied to any self-representation graph learning methods. Experiment results on both synthetic and real data sets demonstrate that the proposed graph learning method can better capture the global geometric structure of the data, and therefore is more effective for semi-supervised learning tasks.

  2. Shifted Legendre method with residual error estimation for delay linear Fredholm integro-differential equations

    Directory of Open Access Journals (Sweden)

    Şuayip Yüzbaşı

    2017-03-01

    Full Text Available In this paper, we suggest a matrix method for obtaining the approximate solutions of the delay linear Fredholm integro-differential equations with constant coefficients using the shifted Legendre polynomials. The problem is considered with mixed conditions. Using the required matrix operations, the delay linear Fredholm integro-differential equation is transformed into a matrix equation. Additionally, error analysis for the method is presented using the residual function. Illustrative examples are given to demonstrate the efficiency of the method. The results obtained in this study are compared with the known results.

  3. Asymptotic behavior of solutions of linear multi-order fractional differential equation systems

    OpenAIRE

    Diethelm, Kai; Siegmund, Stefan; Tuan, H. T.

    2017-01-01

    In this paper, we investigate some aspects of the qualitative theory for multi-order fractional differential equation systems. First, we obtain a fundamental result on the existence and uniqueness for multi-order fractional differential equation systems. Next, a representation of solutions of homogeneous linear multi-order fractional differential equation systems in series form is provided. Finally, we give characteristics regarding the asymptotic behavior of solutions to some classes of line...

  4. Non-linear analysis of wave progagation using transform methods and plates and shells using integral equations

    Science.gov (United States)

    Pipkins, Daniel Scott

    Two diverse topics of relevance in modern computational mechanics are treated. The first involves the modeling of linear and non-linear wave propagation in flexible, lattice structures. The technique used combines the Laplace Transform with the Finite Element Method (FEM). The procedure is to transform the governing differential equations and boundary conditions into the transform domain where the FEM formulation is carried out. For linear problems, the transformed differential equations can be solved exactly, hence the method is exact. As a result, each member of the lattice structure is modeled using only one element. In the non-linear problem, the method is no longer exact. The approximation introduced is a spatial discretization of the transformed non-linear terms. The non-linear terms are represented in the transform domain by making use of the complex convolution theorem. A weak formulation of the resulting transformed non-linear equations yields a set of element level matrix equations. The trial and test functions used in the weak formulation correspond to the exact solution of the linear part of the transformed governing differential equation. Numerical results are presented for both linear and non-linear systems. The linear systems modeled are longitudinal and torsional rods and Bernoulli-Euler and Timoshenko beams. For non-linear systems, a viscoelastic rod and Von Karman type beam are modeled. The second topic is the analysis of plates and shallow shells under-going finite deflections by the Field/Boundary Element Method. Numerical results are presented for two plate problems. The first is the bifurcation problem associated with a square plate having free boundaries which is loaded by four, self equilibrating corner forces. The results are compared to two existing numerical solutions of the problem which differ substantially. linear model are compared to those

  5. Students' errors in solving linear equation word problems: Case ...

    African Journals Online (AJOL)

    kofi.mereku

    Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.

  6. On nonnegative solutions of second order linear functional differential equations

    Czech Academy of Sciences Publication Activity Database

    Lomtatidze, Alexander; Vodstrčil, Petr

    2004-01-01

    Roč. 32, č. 1 (2004), s. 59-88 ISSN 1512-0015 Institutional research plan: CEZ:AV0Z1019905 Keywords : second order linear functional differential equations * nonnegative solution * two-point boundary value problem Subject RIV: BA - General Mathematics

  7. A Hamiltonian functional for the linearized Einstein vacuum field equations

    International Nuclear Information System (INIS)

    Rosas-RodrIguez, R

    2005-01-01

    By considering the Einstein vacuum field equations linearized about the Minkowski metric, the evolution equations for the gauge-invariant quantities characterizing the gravitational field are written in a Hamiltonian form by using a conserved functional as Hamiltonian; this Hamiltonian is not the analog of the energy of the field. A Poisson bracket between functionals of the field, compatible with the constraints satisfied by the field variables, is obtained. The generator of spatial translations associated with such bracket is also obtained

  8. New exact solutions of the Tzitzéica-type equations in non-linear optics using the expa function method

    Science.gov (United States)

    Hosseini, K.; Ayati, Z.; Ansari, R.

    2018-04-01

    One specific class of non-linear evolution equations, known as the Tzitzéica-type equations, has received great attention from a group of researchers involved in non-linear science. In this article, new exact solutions of the Tzitzéica-type equations arising in non-linear optics, including the Tzitzéica, Dodd-Bullough-Mikhailov and Tzitzéica-Dodd-Bullough equations, are obtained using the expa function method. The integration technique actually suggests a useful and reliable method to extract new exact solutions of a wide range of non-linear evolution equations.

  9. An introduction to linear ordinary differential equations using the impulsive response method and factorization

    CERN Document Server

    Camporesi, Roberto

    2016-01-01

    This book presents a method for solving linear ordinary differential equations based on the factorization of the differential operator. The approach for the case of constant coefficients is elementary, and only requires a basic knowledge of calculus and linear algebra. In particular, the book avoids the use of distribution theory, as well as the other more advanced approaches: Laplace transform, linear systems, the general theory of linear equations with variable coefficients and variation of parameters. The case of variable coefficients is addressed using Mammana’s result for the factorization of a real linear ordinary differential operator into a product of first-order (complex) factors, as well as a recent generalization of this result to the case of complex-valued coefficients.

  10. Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Ponce, Colin [Cornell Univ., Ithaca, NY (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2016-02-18

    We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.

  11. Spectral stability of shifted states on star graphs

    Science.gov (United States)

    Kairzhan, Adilbek; Pelinovsky, Dmitry E.

    2018-03-01

    We consider the nonlinear Schrödinger (NLS) equation with the subcritical power nonlinearity on a star graph consisting of N edges and a single vertex under generalized Kirchhoff boundary conditions. The stationary NLS equation may admit a family of solitary waves parameterized by a translational parameter, which we call the shifted states. The two main examples include (i) the star graph with even N under the classical Kirchhoff boundary conditions and (ii) the star graph with one incoming edge and N  -  1 outgoing edges under a single constraint on coefficients of the generalized Kirchhoff boundary conditions. We obtain the general counting results on the Morse index of the shifted states and apply them to the two examples. In the case of (i), we prove that the shifted states with even N ≥slant 4 are saddle points of the action functional which are spectrally unstable under the NLS flow. In the case of (ii), we prove that the shifted states with the monotone profiles in the N  -  1 edges are spectrally stable, whereas the shifted states with non-monotone profiles in the N  -  1 edges are spectrally unstable, the two families intersect at the half-soliton states which are spectrally stable but nonlinearly unstable under the NLS flow. Since the NLS equation on a star graph with shifted states can be reduced to the homogeneous NLS equation on an infinite line, the spectral instability of shifted states is due to the perturbations breaking this reduction. We give a simple argument suggesting that the spectrally stable shifted states in the case of (ii) are nonlinearly unstable under the NLS flow due to the perturbations breaking the reduction to the homogeneous NLS equation.

  12. Some applications of linear difference equations in finance with wolfram|alpha and maple

    Directory of Open Access Journals (Sweden)

    Dana Rıhová

    2014-12-01

    Full Text Available The principle objective of this paper is to show how linear difference equations can be applied to solve some issues of financial mathematics. We focus on the area of compound interest and annuities. In both cases we determine appropriate recursive rules, which constitute the first order linear difference equations with constant coefficients, and derive formulas required for calculating examples. Finally, we present possibilities of application of two selected computer algebra systems Wolfram|Alpha and Maple in this mathematical area.

  13. Quantum complexity of graph and algebraic problems

    International Nuclear Information System (INIS)

    Doern, Sebastian

    2008-01-01

    This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

  14. Quantum complexity of graph and algebraic problems

    Energy Technology Data Exchange (ETDEWEB)

    Doern, Sebastian

    2008-02-04

    This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

  15. Unsteady Solution of Non-Linear Differential Equations Using Walsh Function Series

    Science.gov (United States)

    Gnoffo, Peter A.

    2015-01-01

    Walsh functions form an orthonormal basis set consisting of square waves. The discontinuous nature of square waves make the system well suited for representing functions with discontinuities. The product of any two Walsh functions is another Walsh function - a feature that can radically change an algorithm for solving non-linear partial differential equations (PDEs). The solution algorithm of non-linear differential equations using Walsh function series is unique in that integrals and derivatives may be computed using simple matrix multiplication of series representations of functions. Solutions to PDEs are derived as functions of wave component amplitude. Three sample problems are presented to illustrate the Walsh function series approach to solving unsteady PDEs. These include an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the use of the Walsh function solution algorithms, exploiting Fast Walsh Transforms in multi-dimensions (O(Nlog(N))). Details of a Fast Walsh Reciprocal, defined here for the first time, enable inversion of aWalsh Symmetric Matrix in O(Nlog(N)) operations. Walsh functions have been derived using a fractal recursion algorithm and these fractal patterns are observed in the progression of pairs of wave number amplitudes in the solutions. These patterns are most easily observed in a remapping defined as a fractal fingerprint (FFP). A prolongation of existing solutions to the next highest order exploits these patterns. The algorithms presented here are considered a work in progress that provide new alternatives and new insights into the solution of non-linear PDEs.

  16. Graph Mining Meets the Semantic Web

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

  17. Tangent Lines without Derivatives for Quadratic and Cubic Equations

    Science.gov (United States)

    Carroll, William J.

    2009-01-01

    In the quadratic equation, y = ax[superscript 2] + bx + c, the equation y = bx + c is identified as the equation of the line tangent to the parabola at its y-intercept. This is extended to give a convenient method of graphing tangent lines at any point on the graph of a quadratic or a cubic equation. (Contains 5 figures.)

  18. A linear multiple balance method for discrete ordinates neutron transport equations

    International Nuclear Information System (INIS)

    Park, Chang Je; Cho, Nam Zin

    2000-01-01

    A linear multiple balance method (LMB) is developed to provide more accurate and positive solutions for the discrete ordinates neutron transport equations. In this multiple balance approach, one mesh cell is divided into two subcells with quadratic approximation of angular flux distribution. Four multiple balance equations are used to relate center angular flux with average angular flux by Simpson's rule. From the analysis of spatial truncation error, the accuracy of the linear multiple balance scheme is ο(Δ 4 ) whereas that of diamond differencing is ο(Δ 2 ). To accelerate the linear multiple balance method, we also describe a simplified additive angular dependent rebalance factor scheme which combines a modified boundary projection acceleration scheme and the angular dependent rebalance factor acceleration schme. It is demonstrated, via fourier analysis of a simple model problem as well as numerical calculations, that the additive angular dependent rebalance factor acceleration scheme is unconditionally stable with spectral radius < 0.2069c (c being the scattering ration). The numerical results tested so far on slab-geometry discrete ordinates transport problems show that the solution method of linear multiple balance is effective and sufficiently efficient

  19. Nonlinear and linear wave equations for propagation in media with frequency power law losses

    Science.gov (United States)

    Szabo, Thomas L.

    2003-10-01

    The Burgers, KZK, and Westervelt wave equations used for simulating wave propagation in nonlinear media are based on absorption that has a quadratic dependence on frequency. Unfortunately, most lossy media, such as tissue, follow a more general frequency power law. The authors first research involved measurements of loss and dispersion associated with a modification to Blackstock's solution to the linear thermoviscous wave equation [J. Acoust. Soc. Am. 41, 1312 (1967)]. A second paper by Blackstock [J. Acoust. Soc. Am. 77, 2050 (1985)] showed the loss term in the Burgers equation for plane waves could be modified for other known instances of loss. The authors' work eventually led to comprehensive time-domain convolutional operators that accounted for both dispersion and general frequency power law absorption [Szabo, J. Acoust. Soc. Am. 96, 491 (1994)]. Versions of appropriate loss terms were developed to extend the standard three nonlinear wave equations to these more general losses. Extensive experimental data has verified the predicted phase velocity dispersion for different power exponents for the linear case. Other groups are now working on methods suitable for solving wave equations numerically for these types of loss directly in the time domain for both linear and nonlinear media.

  20. Non-monotone positive solutions of second-order linear differential equations: existence, nonexistence and criteria

    Directory of Open Access Journals (Sweden)

    Mervan Pašić

    2016-10-01

    Full Text Available We study non-monotone positive solutions of the second-order linear differential equations: $(p(tx'' + q(t x = e(t$, with positive $p(t$ and $q(t$. For the first time, some criteria as well as the existence and nonexistence of non-monotone positive solutions are proved in the framework of some properties of solutions $\\theta (t$ of the corresponding integrable linear equation: $(p(t\\theta''=e(t$. The main results are illustrated by many examples dealing with equations which allow exact non-monotone positive solutions not necessarily periodic. Finally, we pose some open questions.

  1. Quasi-linear equation for magnetoplasma oscillations in the weakly relativistic approximation

    International Nuclear Information System (INIS)

    Rizzato, F.B.

    1985-01-01

    Some limitations which are present in the dynamical equations for collisionless plasmas are discussed. Some elementary corrections to the linear theories are obtained in a heuristic form, which directly lead to the so-called quasi-linear theories in its non-relativistic and relativistic forms. The effect of the relativistic variation of the gyrofrequency on the diffusion coefficient is examined in a typically perturbative approximation. (author)

  2. Hyers-Ulam stability of linear second-order differential equations in complex Banach spaces

    Directory of Open Access Journals (Sweden)

    Yongjin Li

    2013-08-01

    Full Text Available We prove the Hyers-Ulam stability of linear second-order differential equations in complex Banach spaces. That is, if y is an approximate solution of the differential equation $y''+ alpha y'(t +eta y = 0$ or $y''+ alpha y'(t +eta y = f(t$, then there exists an exact solution of the differential equation near to y.

  3. A three operator split-step method covering a larger set of non-linear partial differential equations

    Science.gov (United States)

    Zia, Haider

    2017-06-01

    This paper describes an updated exponential Fourier based split-step method that can be applied to a greater class of partial differential equations than previous methods would allow. These equations arise in physics and engineering, a notable example being the generalized derivative non-linear Schrödinger equation that arises in non-linear optics with self-steepening terms. These differential equations feature terms that were previously inaccessible to model accurately with low computational resources. The new method maintains a 3rd order error even with these additional terms and models the equation in all three spatial dimensions and time. The class of non-linear differential equations that this method applies to is shown. The method is fully derived and implementation of the method in the split-step architecture is shown. This paper lays the mathematical ground work for an upcoming paper employing this method in white-light generation simulations in bulk material.

  4. Solution of second order linear fuzzy difference equation by Lagrange's multiplier method

    Directory of Open Access Journals (Sweden)

    Sankar Prasad Mondal

    2016-06-01

    Full Text Available In this paper we execute the solution procedure for second order linear fuzzy difference equation by Lagrange's multiplier method. In crisp sense the difference equation are easy to solve, but when we take in fuzzy sense it forms a system of difference equation which is not so easy to solve. By the help of Lagrange's multiplier we can solved it easily. The results are illustrated by two different numerical examples and followed by two applications.

  5. Solution of linear transport equation using Chebyshev polynomials and Laplace transform

    International Nuclear Information System (INIS)

    Cardona, A.V.; Vilhena, M.T.M.B. de

    1994-01-01

    The Chebyshev polynomials and the Laplace transform are combined to solve, analytically, the linear transport equation in planar geometry, considering isotropic scattering and the one-group model. Numerical simulation is presented. (author)

  6. On a class of strongly degenerate and singular linear elliptic equation

    International Nuclear Information System (INIS)

    Duong Minh Duc, D.M.; Le Dung.

    1992-11-01

    We consider a class of strongly degenerate linear elliptic equation. The boundedness and the Holder regularity of the weak solutions in the weighted Sobolev-Hardy spaces will be studied. (author). 9 refs

  7. A study on linear and nonlinear Schrodinger equations by the variational iteration method

    International Nuclear Information System (INIS)

    Wazwaz, Abdul-Majid

    2008-01-01

    In this work, we introduce a framework to obtain exact solutions to linear and nonlinear Schrodinger equations. The He's variational iteration method (VIM) is used for analytic treatment of these equations. Numerical examples are tested to show the pertinent features of this method

  8. Bounded solutions of self-adjoint second order linear difference equations with periodic coeffients

    Directory of Open Access Journals (Sweden)

    Encinas A.M.

    2018-02-01

    Full Text Available In this work we obtain easy characterizations for the boundedness of the solutions of the discrete, self–adjoint, second order and linear unidimensional equations with periodic coefficients, including the analysis of the so-called discrete Mathieu equations as particular cases.

  9. On the classical theory of ordinary linear differential equations of the second order and the Schroedinger equation for power law potentials

    International Nuclear Information System (INIS)

    Lima, M.L.; Mignaco, J.A.

    1983-01-01

    The power law potentials in the Schroedinger equation solved recently are shown to come from the classical treatment of the singularities of a linear, second order differential equation. This allows to enlarge the class of solvable power law potentials. (Author) [pt

  10. Radial solutions to semilinear elliptic equations via linearized operators

    Directory of Open Access Journals (Sweden)

    Phuong Le

    2017-04-01

    Full Text Available Let $u$ be a classical solution of semilinear elliptic equations in a ball or an annulus in $\\mathbb{R}^N$ with zero Dirichlet boundary condition where the nonlinearity has a convex first derivative. In this note, we prove that if the $N$-th eigenvalue of the linearized operator at $u$ is positive, then $u$ must be radially symmetric.

  11. Using graph theory for automated electric circuit solving

    International Nuclear Information System (INIS)

    Toscano, L; Stella, S; Milotti, E

    2015-01-01

    Graph theory plays many important roles in modern physics and in many different contexts, spanning diverse topics such as the description of scale-free networks and the structure of the universe as a complex directed graph in causal set theory. Graph theory is also ideally suited to describe many concepts in computer science. Therefore it is increasingly important for physics students to master the basic concepts of graph theory. Here we describe a student project where we develop a computational approach to electric circuit solving which is based on graph theoretic concepts. This highly multidisciplinary approach combines abstract mathematics, linear algebra, the physics of circuits, and computer programming to reach the ambitious goal of implementing automated circuit solving. (paper)

  12. Non-linear mixed-effects pharmacokinetic/pharmacodynamic modelling in NLME using differential equations

    DEFF Research Database (Denmark)

    Tornøe, Christoffer Wenzel; Agersø, Henrik; Madsen, Henrik

    2004-01-01

    The standard software for non-linear mixed-effect analysis of pharmacokinetic/phar-macodynamic (PK/PD) data is NONMEM while the non-linear mixed-effects package NLME is an alternative as tong as the models are fairly simple. We present the nlmeODE package which combines the ordinary differential...... equation (ODE) solver package odesolve and the non-Linear mixed effects package NLME thereby enabling the analysis of complicated systems of ODEs by non-linear mixed-effects modelling. The pharmacokinetics of the anti-asthmatic drug theophylline is used to illustrate the applicability of the nlme...

  13. The H-N method for solving linear transport equation: theory and application

    International Nuclear Information System (INIS)

    Kaskas, A.; Gulecyuz, M.C.; Tezcan, C.

    2002-01-01

    The system of singular integral equation which is obtained from the integro-differential form of the linear transport equation as a result of Placzec lemma is solved. Application are given using the exit distributions and the infinite medium Green's function. The same theoretical results are also obtained with the use of the singular eigenfunction of the method of elementary solutions

  14. Fault diagnosis of air conditioning systems based on qualitative bond graph

    International Nuclear Information System (INIS)

    Ghiaus, C.

    1999-01-01

    The bond graph method represents a unified approach for modeling engineering systems. The main idea is that power transfer bonds the components of a system. The bond graph model is the same for both quantitative representation, in which parameters have numerical values, and qualitative approach, in which they are classified qualitatively. To infer the cause of faults using a qualitative method, a system of qualitative equations must be solved. However, the characteristics of qualitative operators require specific methods for solving systems of equations having qualitative variables. This paper proposes both a method for recursively solving the qualitative system of equations derived from bond graph, and a bond graph model of a direct-expansion, mechanical vapor-compression air conditioning system. Results from diagnosing two faults in a real air conditioning system are presented and discussed. Occasionally, more than one fault candidate is inferred for the same set of qualitative values derived from measurements. In these cases, additional information is required to localize the fault. Fault diagnosis is initiated by a fault detection mechanism which also classifies the quantitative measurements into qualitative values; the fault detection is not presented here. (author)

  15. Piecewise linear emulator of the nonlinear Schroedinger equation and the resulting analytic solutions for Bose-Einstein condensates

    International Nuclear Information System (INIS)

    Theodorakis, Stavros

    2003-01-01

    We emulate the cubic term Ψ 3 in the nonlinear Schroedinger equation by a piecewise linear term, thus reducing the problem to a set of uncoupled linear inhomogeneous differential equations. The resulting analytic expressions constitute an excellent approximation to the exact solutions, as is explicitly shown in the case of the kink, the vortex, and a δ function trap. Such a piecewise linear emulation can be used for any differential equation where the only nonlinearity is a Ψ 3 one. In particular, it can be used for the nonlinear Schroedinger equation in the presence of harmonic traps, giving analytic Bose-Einstein condensate solutions that reproduce very accurately the numerically calculated ones in one, two, and three dimensions

  16. An implicit iterative scheme for solving large systems of linear equations

    International Nuclear Information System (INIS)

    Barry, J.M.; Pollard, J.P.

    1986-12-01

    An implicit iterative scheme for the solution of large systems of linear equations arising from neutron diffusion studies is presented. The method is applied to three-dimensional reactor studies and its performance is compared with alternative iterative approaches

  17. The Schroedinger equation for central power law potentials and the classical theory of ordinary linear differential equations of the second order

    International Nuclear Information System (INIS)

    Lima, M.L.; Mignaco, J.A.

    1985-01-01

    It is shown that the rational power law potentials in the two-body radial Schoedinger equation admit a systematic treatment available from the classical theory of ordinary linear differential equations of the second order. The admissible potentials come into families evolved from equations having a fixed number of elementary singularities. As a consequence, relations are found and discussed among the several potentials in a family. (Author) [pt

  18. Contact symmetries of general linear second-order ordinary differential equations: letter to the editor

    NARCIS (Netherlands)

    Martini, Ruud; Kersten, P.H.M.

    1983-01-01

    Using 1-1 mappings, the complete symmetry groups of contact transformations of general linear second-order ordinary differential equations are determined from two independent solutions of those equations, and applied to the harmonic oscillator with and without damping.

  19. Optical generation of matter qubit graph states

    International Nuclear Information System (INIS)

    Benjamin, S C; Eisert, J; Stace, T M

    2005-01-01

    We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus

  20. Chromatic polynomials of random graphs

    International Nuclear Information System (INIS)

    Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

    2010-01-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  1. On the calculation of linear stability with the aid of asymptotic solutions of Orr-Sommerfeld equation, 1

    International Nuclear Information System (INIS)

    Fujimura, Kaoru

    1980-11-01

    The numerical treatment of Orr-Sommerfeld equation which is the fundamental equation of linear hydrodynamic stability theory is described. Present calculation procedure is applied to the two-dimensional quasi-parallel flow for which linearized disturbance equation (Orr-Sommerfeld equation) contains one simple turning point and αR >> 1. The numerical procedure for this problem and one numerical example for Jeffery-Hamel flow (J-H III 1 ) are presented. These treatment can be extended to the other velocity profiles by slight midifications. (author)

  2. About simple nonlinear and linear superpositions of special exact solutions of Veselov-Novikov equation

    International Nuclear Information System (INIS)

    Dubrovsky, V. G.; Topovsky, A. V.

    2013-01-01

    New exact solutions, nonstationary and stationary, of Veselov-Novikov (VN) equation in the forms of simple nonlinear and linear superpositions of arbitrary number N of exact special solutions u (n) , n= 1, …, N are constructed via Zakharov and Manakov ∂-dressing method. Simple nonlinear superpositions are represented up to a constant by the sums of solutions u (n) and calculated by ∂-dressing on nonzero energy level of the first auxiliary linear problem, i.e., 2D stationary Schrödinger equation. It is remarkable that in the zero energy limit simple nonlinear superpositions convert to linear ones in the form of the sums of special solutions u (n) . It is shown that the sums u=u (k 1 ) +...+u (k m ) , 1 ⩽k 1 2 m ⩽N of arbitrary subsets of these solutions are also exact solutions of VN equation. The presented exact solutions include as superpositions of special line solitons and also superpositions of plane wave type singular periodic solutions. By construction these exact solutions represent also new exact transparent potentials of 2D stationary Schrödinger equation and can serve as model potentials for electrons in planar structures of modern electronics.

  3. Non self-similar collapses described by the non-linear Schroedinger equation

    International Nuclear Information System (INIS)

    Berge, L.; Pesme, D.

    1992-01-01

    We develop a rapid method in order to find the contraction rates of the radially symmetric collapsing solutions of the nonlinear Schroedinger equation defined for space dimensions exceeding a threshold value. We explicitly determine the asymptotic behaviour of these latter solutions by solving the non stationary linear problem relative to the nonlinear Schroedinger equation. We show that the self-similar states associated with the collapsing solutions are characterized by a spatial extent which is bounded from the top by a cut-off radius

  4. Computer programs for the solution of systems of linear algebraic equations

    Science.gov (United States)

    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.

  5. Personalized PageRank Clustering: A graph clustering algorithm based on random walks

    Science.gov (United States)

    A. Tabrizi, Shayan; Shakery, Azadeh; Asadpour, Masoud; Abbasi, Maziar; Tavallaie, Mohammad Ali

    2013-11-01

    Graph clustering has been an essential part in many methods and thus its accuracy has a significant effect on many applications. In addition, exponential growth of real-world graphs such as social networks, biological networks and electrical circuits demands clustering algorithms with nearly-linear time and space complexity. In this paper we propose Personalized PageRank Clustering (PPC) that employs the inherent cluster exploratory property of random walks to reveal the clusters of a given graph. We combine random walks and modularity to precisely and efficiently reveal the clusters of a graph. PPC is a top-down algorithm so it can reveal inherent clusters of a graph more accurately than other nearly-linear approaches that are mainly bottom-up. It also gives a hierarchy of clusters that is useful in many applications. PPC has a linear time and space complexity and has been superior to most of the available clustering algorithms on many datasets. Furthermore, its top-down approach makes it a flexible solution for clustering problems with different requirements.

  6. Geon-type solutions of the non-linear Heisenberg-Klein-Gordon equation

    International Nuclear Information System (INIS)

    Mielke, E.W.; Scherzer, R.

    1980-10-01

    As a model for a ''unitary'' field theory of extended particles we consider the non-linear Klein-Gordon equation - associated with a ''squared'' Heisenberg-Pauli-Weyl non-linear spinor equation - coupled to strong gravity. Using a stationary spherical ansatz for the complex scalar field as well as for the background metric generated via Einstein's field equation, we are able to study the effects of the scalar self-interaction as well as of the classical tensor forces. By numerical integration we obtain a continuous spectrum of localized, gravitational solitons resembling the geons previously constructed for the Einstein-Maxwell system by Wheeler. A self-generated curvature potential originating from the curved background partially confines the Schroedinger type wave functions within the ''scalar geon''. For zero angular momentum states and normalized scalar charge the spectrum for the total gravitational energy of these solitons exhibits a branching with respect to the number of nodes appearing in the radial part of the scalar field. Preliminary studies for higher values of the corresponding ''principal quantum number'' reveal that a kind of fine splitting of the energy levels occurs, which may indicate a rich, particle-like structure of these ''quantized geons''. (author)

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

    Science.gov (United States)

    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.

  8. Solving Linear Equations by Classical Jacobi-SR Based Hybrid Evolutionary Algorithm with Uniform Adaptation Technique

    OpenAIRE

    Jamali, R. M. Jalal Uddin; Hashem, M. M. A.; Hasan, M. Mahfuz; Rahman, Md. Bazlar

    2013-01-01

    Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is sparse. The rate of convergence of iteration method is increased by using Successive Relaxation (SR) technique. But SR technique is very much sensitive to relaxation factor, {\\omega}. Recently, hybridization of classical Gauss-Seidel based successive relaxation t...

  9. Optimal Homotopy Asymptotic Method for Solving the Linear Fredholm Integral Equations of the First Kind

    Directory of Open Access Journals (Sweden)

    Mohammad Almousa

    2013-01-01

    Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.

  10. The Schroedinger equation for central power law potentials and the classical theory of ordinary linear differential equations of the second order

    International Nuclear Information System (INIS)

    Lima, M.L.; Mignaco, J.A.

    1985-01-01

    It is shown that the rational power law potentials in the two-body radial Schrodinger equations admit a systematic treatment available from the classical theory of ordinary linear differential equations of the second order. The resulting potentials come into families evolved from equations having a fixed number of elementary regular singularities. As a consequence, relations are found and discussed among the several potentials in a family. (Author) [pt

  11. STABILITY OF LINEAR MULTIAGENT SCALAR SYSTEMS AND ITS DEPENDENCE ON CONNECTIVITY GRAPH

    Directory of Open Access Journals (Sweden)

    S. I. Tomashevich

    2014-03-01

    Full Text Available Multiagent systems are now finding increasingly wide applications in various engineering fields such as energy, transportation, robotics, aviation and others. There are two main aspects to be focused on when organizing multiagent systems: the dynamics of the agents themselves and the ways of their interaction. This interaction is determined by the structure of information connections between agents. Thus, there are several key points of multiagent systems study: the dynamics of individual agents and shape of the information graph. Formation dynamics, in general, is determined by a set of properties of agents and connectivity graph. The paper deals with the relationship between dynamics of agents and Laplace matrix, which is used to set the graph connections. The present research is based on the results given in the known paper by A. Fax and R. Murray (IEEE Trans. AC, 2004. An illustrative example is given, and the application problem of studying the formation dynamics consisting of the group of quadrocopters is presented. Information exchange between agents is determined in the paper by means of the conventional set of graphs. The paper presents an interpretation of the stability conditions and the method of system performance improvement based on these conditions. Motion of quadrocopters group along the flight height is used as an example for methodology application. The simulation results demonstrate the basic dependencies between the information graph shape (and, consequently, the eigenvalues of the Laplacian, which describes this graph and formation stability. Simulation and consideration of Nyquist diagram connection with the key points give an indication of the system stability and take steps to change the control laws. Necessary conditions for the formation stability are obtained on the basis of this research method. Research result makes it possible to create local control laws for agents to ensure the stability of motion in the selected

  12. Flux networks in metabolic graphs

    International Nuclear Information System (INIS)

    Warren, P B; Queiros, S M Duarte; Jones, J L

    2009-01-01

    A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms

  13. Insights into the School Mathematics Tradition from Solving Linear Equations

    Science.gov (United States)

    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…

  14. Oscillatory solutions of the Cauchy problem for linear differential equations

    Directory of Open Access Journals (Sweden)

    Gro Hovhannisyan

    2015-06-01

    Full Text Available We consider the Cauchy problem for second and third order linear differential equations with constant complex coefficients. We describe necessary and sufficient conditions on the data for the existence of oscillatory solutions. It is known that in the case of real coefficients the oscillatory behavior of solutions does not depend on initial values, but we show that this is no longer true in the complex case: hence in practice it is possible to control oscillatory behavior by varying the initial conditions. Our Proofs are based on asymptotic analysis of the zeros of solutions, represented as linear combinations of exponential functions.

  15. Role of statistical linearization in the solution of nonlinear stochastic equations

    International Nuclear Information System (INIS)

    Budgor, A.B.

    1977-01-01

    The solution of a generalized Langevin equation is referred to as a stochastic process. If the external forcing function is Gaussian white noise, the forward Kolmogarov equation yields the transition probability density function. Nonlinear problems must be handled by approximation procedures e.g., perturbation theories, eigenfunction expansions, and nonlinear optimization procedures. After some comments on the first two of these, attention is directed to the third, and the method of statistical linearization is used to demonstrate a relation to the former two. Nonlinear stochastic systems exhibiting sustained or forced oscillations and the centered nonlinear Schroedinger equation in the presence of Gaussian white noise excitation are considered as examples. 5 figures, 2 tables

  16. Analytical approach to linear fractional partial differential equations arising in fluid mechanics

    International Nuclear Information System (INIS)

    Momani, Shaher; Odibat, Zaid

    2006-01-01

    In this Letter, we implement relatively new analytical techniques, the variational iteration method and the Adomian decomposition method, for solving linear fractional partial differential equations arising in fluid mechanics. The fractional derivatives are described in the Caputo sense. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of fractional differential equations. In these methods, the solution takes the form of a convergent series with easily computable components. The corresponding solutions of the integer order equations are found to follow as special cases of those of fractional order equations. Some numerical examples are presented to illustrate the efficiency and reliability of the two methods

  17. Local Ray-Based Traveltime Computation Using the Linearized Eikonal Equation

    KAUST Repository

    Almubarak, Mohammed S.

    2013-05-01

    The computation of traveltimes plays a critical role in the conventional implementations of Kirchhoff migration. Finite-difference-based methods are considered one of the most effective approaches for traveltime calculations and are therefore widely used. However, these eikonal solvers are mainly used to obtain early-arrival traveltime. Ray tracing can be used to pick later traveltime branches, besides the early arrivals, which may lead to an improvement in velocity estimation or in seismic imaging. In this thesis, I improved the accuracy of the solution of the linearized eikonal equation by constructing a linear system of equations (LSE) based on finite-difference approximation, which is of second-order accuracy. The ill-conditioned LSE is initially regularized and subsequently solved to calculate the traveltime update. Numerical tests proved that this method is as accurate as the second-order eikonal solver. Later arrivals are picked using ray tracing. These traveltimes are binned to the nearest node on a regular grid and empty nodes are estimated by interpolating the known values. The resulting traveltime field is used as an input to the linearized eikonal algorithm, which improves the accuracy of the interpolated nodes and yields a local ray-based traveltime. This is a preliminary study and further investigation is required to test the efficiency and the convergence of the solutions.

  18. Linear stochastic differential equations with anticipating initial conditions

    DEFF Research Database (Denmark)

    Khalifa, Narjess; Kuo, Hui-Hsiung; Ouerdiane, Habib

    In this paper we use the new stochastic integral introduced by Ayed and Kuo (2008) and the results obtained by Kuo et al. (2012b) to find a solution to a drift-free linear stochastic differential equation with anticipating initial condition. Our solution is based on well-known results from...... classical Itô theory and anticipative Itô formula results from Kue et al. (2012b). We also show that the solution obtained by our method is consistent with the solution obtained by the methods of Malliavin calculus, e.g. Buckdahn and Nualart (1994)....

  19. A general method for enclosing solutions of interval linear equations

    Czech Academy of Sciences Publication Activity Database

    Rohn, Jiří

    2012-01-01

    Roč. 6, č. 4 (2012), s. 709-717 ISSN 1862-4472 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval linear equations * solution set * enclosure * absolute value inequality Subject RIV: BA - General Mathematics Impact factor: 1.654, year: 2012

  20. An efficient parallel algorithm for the solution of a tridiagonal linear system of equations

    Science.gov (United States)

    Stone, H. S.

    1971-01-01

    Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

  1. Some oscillation criteria for the second-order linear delay differential equation

    Czech Academy of Sciences Publication Activity Database

    Opluštil, Z.; Šremr, Jiří

    2011-01-01

    Roč. 136, č. 2 (2011), s. 195-204 ISSN 0862-7959 Institutional research plan: CEZ:AV0Z10190503 Keywords : second-order linear differential equation with a delay * oscillatory solution Subject RIV: BA - General Mathematics http://www.dml.cz/handle/10338.dmlcz/141582

  2. Refined Fuchs inequalities for systems of linear differential equations

    International Nuclear Information System (INIS)

    Gontsov, R R

    2004-01-01

    We refine the Fuchs inequalities obtained by Corel for systems of linear meromorphic differential equations given on the Riemann sphere. Fuchs inequalities enable one to estimate the sum of exponents of the system over all its singular points. We refine these well-known inequalities by considering the Jordan structure of the leading coefficient of the Laurent series for the matrix of the right-hand side of the system in the neighbourhood of a singular point

  3. A non linear half space problem for radiative transfer equations. Application to the Rosseland approximation

    International Nuclear Information System (INIS)

    Sentis, R.

    1984-07-01

    The radiative transfer equations may be approximated by a non linear diffusion equation (called Rosseland equation) when the mean free paths of the photons are small with respect to the size of the medium. Some technical assomptions are made, namely about the initial conditions, to avoid any problem of initial layer terms

  4. Dynamical and geometric aspects of Hamilton-Jacobi and linearized Monge-Ampère equations VIASM 2016

    CERN Document Server

    Tran, Hung

    2017-01-01

    Consisting of two parts, the first part of this volume is an essentially self-contained exposition of the geometric aspects of local and global regularity theory for the Monge–Ampère and linearized Monge–Ampère equations. As an application, we solve the second boundary value problem of the prescribed affine mean curvature equation, which can be viewed as a coupling of the latter two equations. Of interest in its own right, the linearized Monge–Ampère equation also has deep connections and applications in analysis, fluid mechanics and geometry, including the semi-geostrophic equations in atmospheric flows, the affine maximal surface equation in affine geometry and the problem of finding Kahler metrics of constant scalar curvature in complex geometry. Among other topics, the second part provides a thorough exposition of the large time behavior and discounted approximation of Hamilton–Jacobi equations, which have received much attention in the last two decades, and a new approach to the subject, the n...

  5. Kuramoto model for infinite graphs with kernels

    KAUST Repository

    Canale, Eduardo; Tembine, Hamidou; Tempone, Raul; Zouraris, Georgios E.

    2015-01-01

    . We focus on circulant graphs which have enough symmetries to make the computations easier. We then focus on the asymptotic regime where an integro-partial differential equation is derived. Numerical analysis and convergence proofs of the Fokker

  6. Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

    Science.gov (United States)

    Vanchurin, Vitaly

    2018-05-01

    Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

  7. Solution of linear ordinary differential equations by means of the method of variation of arbitrary constants

    DEFF Research Database (Denmark)

    Mejlbro, Leif

    1997-01-01

    An alternative formula for the solution of linear differential equations of order n is suggested. When applicable, the suggested method requires fewer and simpler computations than the well-known method using Wronskians.......An alternative formula for the solution of linear differential equations of order n is suggested. When applicable, the suggested method requires fewer and simpler computations than the well-known method using Wronskians....

  8. Linear and nonlinear analogues of the Schroedinger equation in the contextual approach in quantum mechanics

    International Nuclear Information System (INIS)

    Khrennikov, A.Yu.

    2005-01-01

    One derived the general evolutionary differential equation within the Hilbert space describing dynamics of the wave function. The derived contextual model is more comprehensive in contrast to a quantum one. The contextual equation may be a nonlinear one. Paper presents the conditions ensuring linearity of the evolution and derivation of the Schroedinger equation [ru

  9. Graph topology and gap topology for unstable systems

    NARCIS (Netherlands)

    Zhu, S.Q.

    1989-01-01

    A reformation is provided of the graph topology and the gap topology for a general setting (including lumped linear time-invariant systems and distributed linear time-invariant systems) in the frequency domain. Some essential properties and their comparisons are clearly presented in the

  10. Multi-point boundary value problems for linear functional-differential equations

    Czech Academy of Sciences Publication Activity Database

    Domoshnitsky, A.; Hakl, Robert; Půža, Bedřich

    2017-01-01

    Roč. 24, č. 2 (2017), s. 193-206 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : boundary value problems * linear functional-differential equations * functional-differential inequalities Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0076/gmj-2016-0076. xml

  11. Multi-point boundary value problems for linear functional-differential equations

    Czech Academy of Sciences Publication Activity Database

    Domoshnitsky, A.; Hakl, Robert; Půža, Bedřich

    2017-01-01

    Roč. 24, č. 2 (2017), s. 193-206 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : boundary value problems * linear functional- differential equations * functional- differential inequalities Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0076/gmj-2016-0076.xml

  12. Edge irregular total labellings for graphs of linear size

    DEFF Research Database (Denmark)

    Brandt, Stephan; Rautenbach, D.; Miškuf, J.

    2009-01-01

    As an edge variant of the well-known irregularity strength of a graph G = (V, E) we investigate edge irregular total labellings, i.e. functions f : V ∪ E → {1, 2, ..., k} such that f (u) + f (u v) + f (v) ≠ f (u) + f (u v) + f (v) for every pair of different edges u v, u v ∈ E. The smallest possi...

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

    Science.gov (United States)

    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.

  14. First order linear ordinary differential equations in associative algebras

    Directory of Open Access Journals (Sweden)

    Gordon Erlebacher

    2004-01-01

    Full Text Available In this paper, we study the linear differential equation $$ frac{dx}{dt}=sum_{i=1}^n a_i(t x b_i(t + f(t $$ in an associative but non-commutative algebra $mathcal{A}$, where the $b_i(t$ form a set of commuting $mathcal{A}$-valued functions expressed in a time-independent spectral basis consisting of mutually annihilating idempotents and nilpotents. Explicit new closed solutions are derived, and examples are presented to illustrate the theory.

  15. Myshkis type oscillation criteria for second-order linear delay differential equations

    Czech Academy of Sciences Publication Activity Database

    Opluštil, Z.; Šremr, Jiří

    2015-01-01

    Roč. 178, č. 1 (2015), s. 143-161 ISSN 0026-9255 Institutional support: RVO:67985840 Keywords : linear second-order delay differential equation * oscillation criteria Subject RIV: BA - General Mathematics Impact factor: 0.664, year: 2015 http://link.springer.com/article/10.1007%2Fs00605-014-0719-y

  16. Comparison of nonlinearities in oscillation theory of half-linear differential equations

    Czech Academy of Sciences Publication Activity Database

    Řehák, Pavel

    2008-01-01

    Roč. 121, č. 2 (2008), s. 93-105 ISSN 0236-5294 R&D Projects: GA AV ČR KJB100190701 Institutional research plan: CEZ:AV0Z10190503 Keywords : half-linear differential equation * comparison theorem * Riccati technique Subject RIV: BA - General Mathematics Impact factor: 0.317, year: 2008

  17. Linear hyperbolic functional-differential equations with essentially bounded right-hand side

    Czech Academy of Sciences Publication Activity Database

    Domoshnitsky, A.; Lomtatidze, Alexander; Maghakyan, A.; Šremr, Jiří

    2011-01-01

    Roč. 2011, - (2011), s. 242965 ISSN 1085-3375 Institutional research plan: CEZ:AV0Z10190503 Keywords : linear functional-differential equation of hyperbolic type * Darboux problem * unique solvability Subject RIV: BA - General Mathematics Impact factor: 1.318, year: 2011 http://www.hindawi.com/journals/ aaa /2011/242965/

  18. Homotopy perturbation method with Laplace Transform (LT-HPM) for solving Lane-Emden type differential equations (LETDEs).

    Science.gov (United States)

    Tripathi, Rajnee; Mishra, Hradyesh Kumar

    2016-01-01

    In this communication, we describe the Homotopy Perturbation Method with Laplace Transform (LT-HPM), which is used to solve the Lane-Emden type differential equations. It's very difficult to solve numerically the Lane-Emden types of the differential equation. Here we implemented this method for two linear homogeneous, two linear nonhomogeneous, and four nonlinear homogeneous Lane-Emden type differential equations and use their appropriate comparisons with exact solutions. In the current study, some examples are better than other existing methods with their nearer results in the form of power series. The Laplace transform used to accelerate the convergence of power series and the results are shown in the tables and graphs which have good agreement with the other existing method in the literature. The results show that LT-HPM is very effective and easy to implement.

  19. Linear Scaling Solution of the Time-Dependent Self-Consistent-Field Equations

    Directory of Open Access Journals (Sweden)

    Matt Challacombe

    2014-03-01

    Full Text Available A new approach to solving the Time-Dependent Self-Consistent-Field equations is developed based on the double quotient formulation of Tsiper 2001 (J. Phys. B. Dual channel, quasi-independent non-linear optimization of these quotients is found to yield convergence rates approaching those of the best case (single channel Tamm-Dancoff approximation. This formulation is variational with respect to matrix truncation, admitting linear scaling solution of the matrix-eigenvalue problem, which is demonstrated for bulk excitons in the polyphenylene vinylene oligomer and the (4,3 carbon nanotube segment.

  20. A novel algebraic procedure for solving non-linear evolution equations of higher order

    International Nuclear Information System (INIS)

    Huber, Alfred

    2007-01-01

    We report here a systematic approach that can easily be used for solving non-linear partial differential equations (nPDE), especially of higher order. We restrict the analysis to the so called evolution equations describing any wave propagation. The proposed new algebraic approach leads us to traveling wave solutions and moreover, new class of solution can be obtained. The crucial step of our method is the basic assumption that the solutions satisfy an ordinary differential equation (ODE) of first order that can be easily integrated. The validity and reliability of the method is tested by its application to some non-linear evolution equations. The important aspect of this paper however is the fact that we are able to calculate distinctive class of solutions which cannot be found in the current literature. In other words, using this new algebraic method the solution manifold is augmented to new class of solution functions. Simultaneously we would like to stress the necessity of such sophisticated methods since a general theory of nPDE does not exist. Otherwise, for practical use the algebraic construction of new class of solutions is of fundamental interest

  1. OSCILLATION OF A SECOND-ORDER HALF-LINEAR NEUTRAL DAMPED DIFFERENTIAL EQUATION WITH TIME-DELAY

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    In this paper,the oscillation for a class of second-order half-linear neutral damped differential equation with time-delay is studied.By means of Yang-inequality,the generalized Riccati transformation and a certain function,some new sufficient conditions for the oscillation are given for all solutions to the equation.

  2. Mathematics Literacy of Secondary Students in Solving Simultanenous Linear Equations

    Science.gov (United States)

    Sitompul, R. S. I.; Budayasa, I. K.; Masriyah

    2018-01-01

    This study examines the profile of secondary students’ mathematical literacy in solving simultanenous linear equations problems in terms of cognitive style of visualizer and verbalizer. This research is a descriptive research with qualitative approach. The subjects in this research consist of one student with cognitive style of visualizer and one student with cognitive style of verbalizer. The main instrument in this research is the researcher herself and supporting instruments are cognitive style tests, mathematics skills tests, problem-solving tests and interview guidelines. Research was begun by determining the cognitive style test and mathematics skill test. The subjects chosen were given problem-solving test about simultaneous linear equations and continued with interview. To ensure the validity of the data, the researcher conducted data triangulation; the steps of data reduction, data presentation, data interpretation, and conclusion drawing. The results show that there is a similarity of visualizer and verbalizer-cognitive style in identifying and understanding the mathematical structure in the process of formulating. There are differences in how to represent problems in the process of implementing, there are differences in designing strategies and in the process of interpreting, and there are differences in explaining the logical reasons.

  3. On the Cauchy problem for a Sobolev-type equation with quadratic non-linearity

    International Nuclear Information System (INIS)

    Aristov, Anatoly I

    2011-01-01

    We investigate the asymptotic behaviour as t→∞ of the solution of the Cauchy problem for a Sobolev-type equation with quadratic non-linearity and develop ideas used by I. A. Shishmarev and other authors in the study of classical and Sobolev-type equations. Conditions are found under which it is possible to consider the case of an arbitrary dimension of the spatial variable.

  4. A generalized variational algebra and conserved densities for linear evolution equations

    International Nuclear Information System (INIS)

    Abellanas, L.; Galindo, A.

    1978-01-01

    The symbolic algebra of Gel'fand and Dikii is generalized to the case of n variables. Using this algebraic approach a rigorous characterization of the polynomial kernel of the variational derivative is given. This is applied to classify all the conservation laws for linear polynomial evolution equations of arbitrary order. (Auth.)

  5. Peculiarities in power type comparison results for half-linear dynamic equations

    Czech Academy of Sciences Publication Activity Database

    Řehák, Pavel

    2012-01-01

    Roč. 42, č. 6 (2012), s. 1995-2013 ISSN 0035-7596 R&D Projects: GA AV ČR KJB100190701 Institutional support: RVO:67985840 Keywords : half-linear dynamic equation * time scale * comparison theorem Subject RIV: BA - General Mathematics Impact factor: 0.389, year: 2012 http://projecteuclid.org/euclid.rmjm/1361800616

  6. A linear time algorithm for minimum fill-in and treewidth for distance heredity graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Dahlhaus, E.; Kloks, A.J.J.; Kloks, T.

    2000-01-01

    A graph is distance hereditary if it preserves distances in all its connected induced subgraphs. The MINIMUM FILL-IN problem is the problem of finding a chordal supergraph with the smallest possible number of edges. The TREEWIDTH problem is the problem of finding a chordal embedding of the graph

  7. About simple nonlinear and linear superpositions of special exact solutions of Veselov-Novikov equation

    Energy Technology Data Exchange (ETDEWEB)

    Dubrovsky, V. G.; Topovsky, A. V. [Novosibirsk State Technical University, Karl Marx prosp. 20, Novosibirsk 630092 (Russian Federation)

    2013-03-15

    New exact solutions, nonstationary and stationary, of Veselov-Novikov (VN) equation in the forms of simple nonlinear and linear superpositions of arbitrary number N of exact special solutions u{sup (n)}, n= 1, Horizontal-Ellipsis , N are constructed via Zakharov and Manakov {partial_derivative}-dressing method. Simple nonlinear superpositions are represented up to a constant by the sums of solutions u{sup (n)} and calculated by {partial_derivative}-dressing on nonzero energy level of the first auxiliary linear problem, i.e., 2D stationary Schroedinger equation. It is remarkable that in the zero energy limit simple nonlinear superpositions convert to linear ones in the form of the sums of special solutions u{sup (n)}. It is shown that the sums u=u{sup (k{sub 1})}+...+u{sup (k{sub m})}, 1 Less-Than-Or-Slanted-Equal-To k{sub 1} < k{sub 2} < Horizontal-Ellipsis < k{sub m} Less-Than-Or-Slanted-Equal-To N of arbitrary subsets of these solutions are also exact solutions of VN equation. The presented exact solutions include as superpositions of special line solitons and also superpositions of plane wave type singular periodic solutions. By construction these exact solutions represent also new exact transparent potentials of 2D stationary Schroedinger equation and can serve as model potentials for electrons in planar structures of modern electronics.

  8. Chaotic dynamics and diffusion in a piecewise linear equation

    International Nuclear Information System (INIS)

    Shahrear, Pabel; Glass, Leon; Edwards, Rod

    2015-01-01

    Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems

  9. Chaotic dynamics and diffusion in a piecewise linear equation

    Science.gov (United States)

    Shahrear, Pabel; Glass, Leon; Edwards, Rod

    2015-03-01

    Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.

  10. Dyson-Schwinger equations for the non-linear σ-model

    International Nuclear Information System (INIS)

    Drouffe, J.M.; Flyvbjerg, H.

    1989-08-01

    Dyson-Schwinger equations for the O(N)-symmetric non-linear σ-model are derived. They are polynomials in N, hence 1/N-expanded ab initio. A finite, closed set of equations is obtained by keeping only the leading term and the first correction term in this 1/N-series. These equations are solved numerically in two dimensions on square lattices measuring 50x50, 100x100, 200x200, and 400x400. They are also solved analytically at strong coupling and at weak coupling in a finite volume. In these two limits the solution is asymptotically identical to the exact strong- and weak-coupling series through the first three terms. Between these two limits, results for the magnetic susceptibility and the mass gap are identical to the Monte Carlo results available for N=3 and N=4 within a uniform systematic error of O(1/N 3 ), i.e. the results seem good to O(1/N 2 ), though obtained from equations that are exact only to O(1/N). This is understood by seeing the results as summed infinite subseries of the 1/N-series for the exact susceptibility and mass gap. We conclude that the kind of 1/N-expansion presented here converges as well as one might ever hope for, even for N as small as 3. (orig.)

  11. SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

    Energy Technology Data Exchange (ETDEWEB)

    Yang, R [University of Alberta, Edmonton, AB (Canada); Fallone, B [University of Alberta, Edmonton, AB (Canada); Cross Cancer Institute, Edmonton, AB (Canada); MagnetTx Oncology Solutions, Edmonton, AB (Canada); St Aubin, J [University of Alberta, Edmonton, AB (Canada); Cross Cancer Institute, Edmonton, AB (Canada)

    2016-06-15

    Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. The LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been

  12. Perfect state transfer in unitary Cayley graphs over local rings

    Directory of Open Access Journals (Sweden)

    Yotsanan Meemark

    2014-12-01

    Full Text Available In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph. Moreover, we have some developments when $R$ is a product of local rings.

  13. Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

    Directory of Open Access Journals (Sweden)

    Tomasz Kajdanowicz

    2016-09-01

    Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

  14. Probabilistic Decision Graphs - Combining Verification and AI Techniques for Probabilistic Inference

    DEFF Research Database (Denmark)

    Jaeger, Manfred

    2004-01-01

    We adopt probabilistic decision graphs developed in the field of automated verification as a tool for probabilistic model representation and inference. We show that probabilistic inference has linear time complexity in the size of the probabilistic decision graph, that the smallest probabilistic ...

  15. Isotropic covariance functions on graphs and their edges

    DEFF Research Database (Denmark)

    Anderes, E.; Møller, Jesper; Rasmussen, Jakob Gulddahl

    We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, i.e., graphs with edges viewed as line segments or more general sets with a coordinate system allowing us to consider points on the graph which are vertices or points...... on an edge. Our covariance functions are defined on the vertices and edge points of these graphs and are isotropic in the sense that they depend only on the geodesic distance or on a new metric called the resistance metric (which extends the classical resistance metric developed in electrical network theory...... functions in the spatial statistics literature (the power exponential, Matérn, generalized Cauchy, and Dagum classes) are shown to be valid with respect to the resistance metric for any graph with Euclidean edges, whilst they are only valid with respect to the geodesic metric in more special cases....

  16. Application of perturbation theory to the non-linear vibration analysis of a string including the bending moment effects

    International Nuclear Information System (INIS)

    Esmaeilzadeh Khadem, S.; Rezaee, M.

    2001-01-01

    In this paper the large amplitude and non-linear vibration of a string is considered. The initial tension, lateral vibration amplitude, diameter and the modulus of elasticity of the string have main effects on its natural frequencies. Increasing the lateral vibration amplitude makes the assumption of constant initial tension invalid. In this case, therefore, it is impossible to use the classical equation of string with small amplitude transverse motion assumption. On the other hand, by increasing the string diameter, the bending moment effect will increase dramatically, and acts as an impressive restoring moment. Considering the effects of the bending moments, the nonlinear equation governing the large amplitude transverse vibration of a string is derived. The time dependent portion of the governing equation has the from of Duff ing equation is solved using the perturbation theory. The results of the analysis are shown in appropriate graphs, and the natural frequencies of the string due to the non-linear factors are compared with the natural frequencies of the linear vibration os a string without bending moment effects

  17. Recent developments in the Virasoro master equation

    International Nuclear Information System (INIS)

    Halpern, M.B.

    1991-01-01

    The Virasoro master equation collects all possible Virasoro constructions which are quadratic in the currents of affine Lie g. The solution space of this system is immense, with generically irrational central charge, and solutions which have so far been observed are generically unitary. Other developments reviewed include the exact C-function, the superconformal master equation and partial classification of solutions by graph theory and generalized graph theories. 37 refs., 1 fig., 1 tab

  18. An Improved Recurrent Neural Network for Complex-Valued Systems of Linear Equation and Its Application to Robotic Motion Tracking.

    Science.gov (United States)

    Ding, Lei; Xiao, Lin; Liao, Bolin; Lu, Rongbo; Peng, Hua

    2017-01-01

    To obtain the online solution of complex-valued systems of linear equation in complex domain with higher precision and higher convergence rate, a new neural network based on Zhang neural network (ZNN) is investigated in this paper. First, this new neural network for complex-valued systems of linear equation in complex domain is proposed and theoretically proved to be convergent within finite time. Then, the illustrative results show that the new neural network model has the higher precision and the higher convergence rate, as compared with the gradient neural network (GNN) model and the ZNN model. Finally, the application for controlling the robot using the proposed method for the complex-valued systems of linear equation is realized, and the simulation results verify the effectiveness and superiorness of the new neural network for the complex-valued systems of linear equation.

  19. A piecewise linear finite element discretization of the diffusion equation for arbitrary polyhedral grids

    Energy Technology Data Exchange (ETDEWEB)

    Bailey, T S; Adams, M L [Texas A M Univ., Dept. of Nuclear Engineering, College Station, TX (United States); Yang, B; Zika, M R [Lawrence Livermore National Lab., Livermore, CA (United States)

    2005-07-01

    We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses piecewise linear weight and basis functions in the finite element approximation, and it can be applied on arbitrary polygonal (2-dimensional) or polyhedral (3-dimensional) grids. We show that this new PWL method gives solutions comparable to those from Palmer's finite-volume method. However, since the PWL method produces a symmetric positive definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids. (authors)

  20. Solutions of half-linear differential equations in the classes Gamma and Pi

    Czech Academy of Sciences Publication Activity Database

    Řehák, Pavel; Taddei, V.

    2016-01-01

    Roč. 29, 7-8 (2016), s. 683-714 ISSN 0893-4983 Institutional support: RVO:67985840 Keywords : half-linear differential equation * positive solution * asymptotic formula Subject RIV: BA - General Mathematics Impact factor: 0.565, year: 2016 http://projecteuclid.org/euclid.die/1462298681

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

    Science.gov (United States)

    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…

  2. Herdable Systems Over Signed, Directed Graphs

    KAUST Repository

    Ruf, Sebastian F.; Egerstedt, Magnus; Shamma, Jeff S.

    2018-01-01

    This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.

  3. Herdable Systems Over Signed, Directed Graphs

    KAUST Repository

    Ruf, Sebastian F.

    2018-04-11

    This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.

  4. Stochastic differential equation model for linear growth birth and death processes with immigration and emigration

    International Nuclear Information System (INIS)

    Granita; Bahar, A.

    2015-01-01

    This paper discusses on linear birth and death with immigration and emigration (BIDE) process to stochastic differential equation (SDE) model. Forward Kolmogorov equation in continuous time Markov chain (CTMC) with a central-difference approximation was used to find Fokker-Planckequation corresponding to a diffusion process having the stochastic differential equation of BIDE process. The exact solution, mean and variance function of BIDE process was found

  5. Stochastic differential equation model for linear growth birth and death processes with immigration and emigration

    Energy Technology Data Exchange (ETDEWEB)

    Granita, E-mail: granitafc@gmail.com [Dept. Mathematical Education, State Islamic University of Sultan Syarif Kasim Riau, 28293 Indonesia and Dept. of Mathematical Science, Universiti Teknologi Malaysia, 81310,Johor (Malaysia); Bahar, A. [Dept. of Mathematical Science, Universiti Teknologi Malaysia, 81310,Johor Malaysia and UTM Center for Industrial and Applied Mathematics (UTM-CIAM) (Malaysia)

    2015-03-09

    This paper discusses on linear birth and death with immigration and emigration (BIDE) process to stochastic differential equation (SDE) model. Forward Kolmogorov equation in continuous time Markov chain (CTMC) with a central-difference approximation was used to find Fokker-Planckequation corresponding to a diffusion process having the stochastic differential equation of BIDE process. The exact solution, mean and variance function of BIDE process was found.

  6. Disformal invariance of continuous media with linear equation of state

    Energy Technology Data Exchange (ETDEWEB)

    Celoria, Marco [Gran Sasso Science Institute (INFN), Viale Francesco Crispi 7, L' Aquila, I-67100 Italy (Italy); Matarrese, Sabino [Dipartimento di Fisica e Astronomia ' G. Galilei' , Università degli Studi di Padova, via Marzolo 8, Padova, I-35131 Italy (Italy); Pilo, Luigi, E-mail: marco.celoria@gssi.infn.it, E-mail: sabino.matarrese@pd.infn.it, E-mail: luigi.pilo@aquila.infn.it [Dipartimento di Fisica, Università di L' Aquila, L' Aquila, I-67010 Italy (Italy)

    2017-02-01

    We show that the effective theory describing single component continuous media with a linear and constant equation of state of the form p = w ρ is invariant under a 1-parameter family of continuous disformal transformations. In the special case of w =1/3 (ultrarelativistic gas), such a family reduces to conformal transformations. As examples, perfect fluids, irrotational dust (mimetic matter) and homogeneous and isotropic solids are discussed.

  7. Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

    KAUST Repository

    Jamour, Fuad Tarek

    2017-10-17

    Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be performed incrementally. This is challenging because updating even a single edge may trigger the computation of all-pairs shortest paths in the entire graph. Existing approaches cannot scale to large graphs: they either require excessive memory (i.e., quadratic to the size of the input graph) or perform unnecessary computations rendering them prohibitively slow. We propose iCentral; a novel incremental algorithm for computing betweenness centrality in evolving graphs. We decompose the graph into biconnected components and prove that processing can be localized within the affected components. iCentral is the first algorithm to support incremental betweeness centrality computation within a graph component. This is done efficiently, in linear space; consequently, iCentral scales to large graphs. We demonstrate with real datasets that the serial implementation of iCentral is up to 3.7 times faster than existing serial methods. Our parallel implementation that scales to large graphs, is an order of magnitude faster than the state-of-the-art parallel algorithm, while using an order of magnitude less computational resources.

  8. Laplacian eigenvectors of graphs Perron-Frobenius and Faber-Krahn type theorems

    CERN Document Server

    Biyikoğu, Türker; Stadler, Peter F

    2007-01-01

    Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors. The volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology.

  9. Path integral solution of linear second order partial differential equations I: the general construction

    International Nuclear Information System (INIS)

    LaChapelle, J.

    2004-01-01

    A path integral is presented that solves a general class of linear second order partial differential equations with Dirichlet/Neumann boundary conditions. Elementary kernels are constructed for both Dirichlet and Neumann boundary conditions. The general solution can be specialized to solve elliptic, parabolic, and hyperbolic partial differential equations with boundary conditions. This extends the well-known path integral solution of the Schroedinger/diffusion equation in unbounded space. The construction is based on a framework for functional integration introduced by Cartier/DeWitt-Morette

  10. Improved pedagogy for linear differential equations by reconsidering how we measure the size of solutions

    Science.gov (United States)

    Tisdell, Christopher C.

    2017-11-01

    For over 50 years, the learning of teaching of a priori bounds on solutions to linear differential equations has involved a Euclidean approach to measuring the size of a solution. While the Euclidean approach to a priori bounds on solutions is somewhat manageable in the learning and teaching of the proofs involving second-order, linear problems with constant co-efficients, we believe it is not pedagogically optimal. Moreover, the Euclidean method becomes pedagogically unwieldy in the proofs involving higher-order cases. The purpose of this work is to propose a simpler pedagogical approach to establish a priori bounds on solutions by considering a different way of measuring the size of a solution to linear problems, which we refer to as the Uber size. The Uber form enables a simplification of pedagogy from the literature and the ideas are accessible to learners who have an understanding of the Fundamental Theorem of Calculus and the exponential function, both usually seen in a first course in calculus. We believe that this work will be of mathematical and pedagogical interest to those who are learning and teaching in the area of differential equations or in any of the numerous disciplines where linear differential equations are used.

  11. On oscillations of solutions to second-order linear delay differential equations

    Czech Academy of Sciences Publication Activity Database

    Opluštil, Z.; Šremr, Jiří

    2013-01-01

    Roč. 20, č. 1 (2013), s. 65-94 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : linear second-order delay differential equation * oscillatory solution Subject RIV: BA - General Mathematics Impact factor: 0.340, year: 2013 http://www.degruyter.com/view/j/gmj.2013.20.issue-1/gmj-2013-0001/gmj-2013-0001.xml?format=INT

  12. On oscillations of solutions to second-order linear delay differential equations

    Czech Academy of Sciences Publication Activity Database

    Opluštil, Z.; Šremr, Jiří

    2013-01-01

    Roč. 20, č. 1 (2013), s. 65-94 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : linear second-order delay differential equation * oscillatory solution Subject RIV: BA - General Mathematics Impact factor: 0.340, year: 2013 http://www.degruyter.com/view/j/gmj.2013.20.issue-1/gmj-2013-0001/gmj-2013-0001. xml ?format=INT

  13. Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.

    Science.gov (United States)

    Shang, Yilun

    2015-01-01

    Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices.

  14. Linear representation of algebras with non-associative operations which are satisfy in the balanced functional equations

    International Nuclear Information System (INIS)

    Ehsani, Amir

    2015-01-01

    Algebras with a pair of non-associative binary operations (f, g) which are satisfy in the balanced quadratic functional equations with four object variables considered. First, we obtain a linear representation for the operations, of this kind of binary algebras (A,f,g), over an abelian group (A, +) and then we generalize the linear representation of operations, to an algebra (A,F) with non-associative binary operations which are satisfy in the balanced quadratic functional equations with four object variables. (paper)

  15. On The Determinant of q-Distance Matrix of a Graph

    Directory of Open Access Journals (Sweden)

    Li Hong-Hai

    2014-02-01

    Full Text Available In this note, we show how the determinant of the q-distance matrix Dq(T of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph G by adding the weighted branches to G, and so generalize in part the results obtained by Bapat et al. [R.B. Bapat, S. Kirkland and M. Neumann, On distance matrices and Laplacians, Linear Algebra Appl. 401 (2005 193- 209]. In particular, as a consequence, determinantal formulae of q-distance matrices for unicyclic graphs and one class of bicyclic graphs are presented.

  16. A piecewise linear finite element discretization of the diffusion equation for arbitrary polyhedral grids

    Energy Technology Data Exchange (ETDEWEB)

    Bailey, T.S.; Adams, M.L. [Texas A M Univ., Dept. of Nuclear Engineering, College Station, TX (United States); Yang, B.; Zika, M.R. [Lawrence Livermore National Lab., Livermore, CA (United States)

    2005-07-01

    We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses piecewise linear weight and basis functions in the finite element approximation, and it can be applied on arbitrary polygonal (2-dimensional) or polyhedral (3-dimensional) grids. We show that this new PWL method gives solutions comparable to those from Palmer's finite-volume method. However, since the PWL method produces a symmetric positive definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids. (authors)

  17. KAM for the non-linear Schroedinger equation a short presentation

    CERN Document Server

    Eliasson, H L

    2006-01-01

    We consider the $d$-dimensional nonlinear Schr\\"o\\-dinger equation under periodic boundary conditions:-i\\dot u=\\Delta u+V(x)*u+\\ep \\frac{\\p F}{\\p \\bar u}(x,u,\\bar u) ;\\quad u=u(t,x),\\;x\\in\\T^dwhere $V(x)=\\sum \\hat V(a)e^{i\\sc{a,x}}$ is an analytic function with $\\hat V$ real and $F$ is a real analytic function in $\\Re u$, $\\Im u$ and $x$. (This equation is a popular model for the `real' NLS equation, where instead of the convolution term $V*u$ we have the potential term $Vu$.) For $\\ep=0$ the equation is linear and has time--quasi-periodic solutions $u$,u(t,x)=\\sum_{s\\in \\AA}\\hat u_0(a)e^{i(|a|^2+\\hat V(a))t}e^{i\\sc{a,x}}, \\quad 0<|\\hat u_0(a)|\\le1,where $\\AA$ is any finite subset of $\\Z^d$. We shall treat $\\omega_a=|a|^2+\\hat V(a)$, $a\\in\\AA$, as free parameters in some domain $U\\subset\\R^{\\AA}$. This is a Hamiltonian system in infinite degrees of freedom, degenerate but with external parameters, and we shall describe a KAM-theory which, in particular, will have the following consequence: \\smallskip {\\it ...

  18. Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming

    KAUST Repository

    Claudel, Christian G.; Chamoin, Timothee; Bayen, Alexandre M.

    2014-01-01

    This brief presents new convex formulations for solving estimation problems in systems modeled by scalar Hamilton-Jacobi (HJ) equations. Using a semi-analytic formula, we show that the constraints resulting from a HJ equation are convex, and can be written as a set of linear inequalities. We use this fact to pose various (and seemingly unrelated) estimation problems related to traffic flow-engineering as a set of linear programs. In particular, we solve data assimilation and data reconciliation problems for estimating the state of a system when the model and measurement constraints are incompatible. We also solve traffic estimation problems, such as travel time estimation or density estimation. For all these problems, a numerical implementation is performed using experimental data from the Mobile Century experiment. In the context of reproducible research, the code and data used to compute the results presented in this brief have been posted online and are accessible to regenerate the results. © 2013 IEEE.

  19. Approximate Forward Difference Equations for the Lower Order Non-Stationary Statistics of Geometrically Non-Linear Systems subject to Random Excitation

    DEFF Research Database (Denmark)

    Köylüoglu, H. U.; Nielsen, Søren R. K.; Cakmak, A. S.

    Geometrically non-linear multi-degree-of-freedom (MDOF) systems subject to random excitation are considered. New semi-analytical approximate forward difference equations for the lower order non-stationary statistical moments of the response are derived from the stochastic differential equations...... of motion, and, the accuracy of these equations is numerically investigated. For stationary excitations, the proposed method computes the stationary statistical moments of the response from the solution of non-linear algebraic equations....

  20. Particle transport in breathing quantum graph

    International Nuclear Information System (INIS)

    Matrasulov, D.U.; Yusupov, J.R.; Sabirov, K.K.; Sobirov, Z.A.

    2012-01-01

    Full text: Particle transport in nanoscale networks and discrete structures is of fundamental and practical importance. Usually such systems are modeled by so-called quantum graphs, the systems attracting much attention in physics and mathematics during past two decades [1-5]. During last two decades quantum graphs found numerous applications in modeling different discrete structures and networks in nanoscale and mesoscopic physics (e.g., see reviews [1-3]). Despite considerable progress made in the study of particle dynamics most of the problems deal with unperturbed case and the case of time-dependent perturbation has not yet be explored. In this work we treat particle dynamics for quantum star graph with time-dependent bonds. In particular, we consider harmonically breathing quantum star graphs, the cases of monotonically contracting and expanding graphs. The latter can be solved exactly analytically. Edge boundaries are considered to be time-dependent, while branching point is assumed to be fixed. Quantum dynamics of a particle in such graphs is studied by solving Schrodinger equation with time-dependent boundary conditions given on a star graph. Time-dependence of the average kinetic energy is analyzed. Space-time evolution of the Gaussian wave packet is treated for harmonically breathing star graph. It is found that for certain frequencies energy is a periodic function of time, while for others it can be non-monotonically growing function of time. Such a feature can be caused by possible synchronization of the particles motion and the motions of the moving edges of graph bonds. (authors) References: [1] Tsampikos Kottos and Uzy Smilansky, Ann. Phys., 76, 274 (1999). [2] Sven Gnutzmann and Uzy Smilansky, Adv. Phys. 55, 527 (2006). [3] S. GnutzmannJ.P. Keating, F. Piotet, Ann. Phys., 325, 2595 (2010). [4] P.Exner, P.Seba, P.Stovicek, J. Phys. A: Math. Gen. 21, 4009 (1988). [5] J. Boman, P. Kurasov, Adv. Appl. Math., 35, 58 (2005)

  1. Non-linear corrections to the time-covariance function derived from a multi-state chemical master equation.

    Science.gov (United States)

    Scott, M

    2012-08-01

    The time-covariance function captures the dynamics of biochemical fluctuations and contains important information about the underlying kinetic rate parameters. Intrinsic fluctuations in biochemical reaction networks are typically modelled using a master equation formalism. In general, the equation cannot be solved exactly and approximation methods are required. For small fluctuations close to equilibrium, a linearisation of the dynamics provides a very good description of the relaxation of the time-covariance function. As the number of molecules in the system decrease, deviations from the linear theory appear. Carrying out a systematic perturbation expansion of the master equation to capture these effects results in formidable algebra; however, symbolic mathematics packages considerably expedite the computation. The authors demonstrate that non-linear effects can reveal features of the underlying dynamics, such as reaction stoichiometry, not available in linearised theory. Furthermore, in models that exhibit noise-induced oscillations, non-linear corrections result in a shift in the base frequency along with the appearance of a secondary harmonic.

  2. Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs

    Science.gov (United States)

    2013-06-28

    3380. [DEL12a] Xavier Desquesnes, Abderrahim Elmoataz, and Olivier Lézoray, Eikonal equation adapta- tion on weighted graphs: Fast geometric diffusion...Abderrahim Elmoataz, Olivier Lézoray, and Vinh-Thong Ta, Efficient algorithms for image and high dimensional data processing using eikonal equation on

  3. An Explicit Enclosure of the Solution Set of Overdetermined Interval Linear Equations

    Czech Academy of Sciences Publication Activity Database

    Rohn, Jiří

    2017-01-01

    Roč. 24, February (2017), s. 1-10 ISSN 1573-1340 Institutional support: RVO:67985807 Keywords : interval linear equations * interval hull * unit midpoint * enclosure Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics http://interval.louisiana.edu/ reliable -computing-journal/volume-24/ reliable -computing-24-pp-001-010.pdf

  4. Scilab software as an alternative low-cost computing in solving the linear equations problem

    Science.gov (United States)

    Agus, Fahrul; Haviluddin

    2017-02-01

    Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.

  5. Mellin-Barnes representations of Feynman diagrams, linear systems of differential equations, and polynomial solutions

    International Nuclear Information System (INIS)

    Kalmykov, Mikhail Yu.; Kniehl, Bernd A.

    2012-05-01

    We argue that the Mellin-Barnes representations of Feynman diagrams can be used for obtaining linear systems of homogeneous differential equations for the original Feynman diagrams with arbitrary powers of propagators without recourse to the integration-by-parts technique. These systems of differential equation can be used (i) for the differential reductions to sets of basic functions and (ii) for counting the numbers of master-integrals.

  6. q-analogue of summability of formal solutions of some linear q-difference-differential equations

    Directory of Open Access Journals (Sweden)

    Hidetoshi Tahara

    2015-01-01

    Full Text Available Let \\(q\\gt 1\\. The paper considers a linear \\(q\\-difference-differential equation: it is a \\(q\\-difference equation in the time variable \\(t\\, and a partial differential equation in the space variable \\(z\\. Under suitable conditions and by using \\(q\\-Borel and \\(q\\-Laplace transforms (introduced by J.-P. Ramis and C. Zhang, the authors show that if it has a formal power series solution \\(\\hat{X}(t,z\\ one can construct an actual holomorphic solution which admits \\(\\hat{X}(t,z\\ as a \\(q\\-Gevrey asymptotic expansion of order \\(1\\.

  7. A graph rewriting programming language for graph drawing

    OpenAIRE

    Rodgers, Peter

    1998-01-01

    This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

  8. Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.

    Directory of Open Access Journals (Sweden)

    Yilun Shang

    Full Text Available Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices.

  9. A Solution to the Fundamental Linear Fractional Order Differential Equation

    Science.gov (United States)

    Hartley, Tom T.; Lorenzo, Carl F.

    1998-01-01

    This paper provides a solution to the fundamental linear fractional order differential equation, namely, (sub c)d(sup q, sub t) + ax(t) = bu(t). The impulse response solution is shown to be a series, named the F-function, which generalizes the normal exponential function. The F-function provides the basis for a qth order "fractional pole". Complex plane behavior is elucidated and a simple example, the inductor terminated semi- infinite lossy line, is used to demonstrate the theory.

  10. Value distribution of meromorphic solutions of homogeneous and non-homogeneous complex linear differential-difference equations

    Directory of Open Access Journals (Sweden)

    Luo Li-Qin

    2016-01-01

    Full Text Available In this paper, we investigate the value distribution of meromorphic solutions of homogeneous and non-homogeneous complex linear differential-difference equations, and obtain the results on the relations between the order of the solutions and the convergence exponents of the zeros, poles, a-points and small function value points of the solutions, which show the relations in the case of non-homogeneous equations are sharper than the ones in the case of homogeneous equations.

  11. Quadratic-linear pattern in cancer fractional radiotherapy. Equations for a computering program

    International Nuclear Information System (INIS)

    Burgos, D.; Bullejos, J.; Garcia Puche, J.L.; Pedraza, V.

    1990-01-01

    Knowledge of equivalence between different tratment schemes with the same iso-effect is the essential thing in clinical cancer radiotherapy. For this purpose it is very useful the group of ideas derived from quadratic-linear pattern (Q-L) proposed in order to analyze cell survival curve to radiation. Iso-effect definition caused by several irradiation rules is done by extrapolated tolerance dose (ETD). Because equations for ETD are complex, a computering program have been carried out. In this paper, iso-effect equations for well defined therapeutic situations and flow diagram proposed for resolution, have been studied. (Author)

  12. Fast solution of elliptic partial differential equations using linear combinations of plane waves.

    Science.gov (United States)

    Pérez-Jordá, José M

    2016-02-01

    Given an arbitrary elliptic partial differential equation (PDE), a procedure for obtaining its solution is proposed based on the method of Ritz: the solution is written as a linear combination of plane waves and the coefficients are obtained by variational minimization. The PDE to be solved is cast as a system of linear equations Ax=b, where the matrix A is not sparse, which prevents the straightforward application of standard iterative methods in order to solve it. This sparseness problem can be circumvented by means of a recursive bisection approach based on the fast Fourier transform, which makes it possible to implement fast versions of some stationary iterative methods (such as Gauss-Seidel) consuming O(NlogN) memory and executing an iteration in O(Nlog(2)N) time, N being the number of plane waves used. In a similar way, fast versions of Krylov subspace methods and multigrid methods can also be implemented. These procedures are tested on Poisson's equation expressed in adaptive coordinates. It is found that the best results are obtained with the GMRES method using a multigrid preconditioner with Gauss-Seidel relaxation steps.

  13. On two examples in linear topological spaces

    International Nuclear Information System (INIS)

    Iyahen, S.O.

    1985-11-01

    This note first gives examples of B-complete linear topological spaces, and shows that neither the closed graph theorem nor the open mapping theorem holds for linear mappings from such a space to itself. It then looks at Hausdorff linear topological spaces for which coarser Hausdorff linear topologies can be extended from hyperplanes. For B-complete spaces, those which are barrelled necessarily have countable dimension, and conversely. The paper had been motivated by two questions arising in earlier studies related to the closed graph and open mapping theorems; answers to these questions are contained therein. (author)

  14. Approximate solution to neutron transport equation with linear anisotropic scattering

    International Nuclear Information System (INIS)

    Coppa, G.; Ravetto, P.; Sumini, M.

    1983-01-01

    A method to obtain an approximate solution to the transport equation, when both sources and collisions show a linearly anisotropic behavior, is outlined and the possible implications for numerical calculations in applied neutronics as well as shielding evaluations are investigated. The form of the differential system of equations taken by the method is quite handy and looks simpler and more manageable than any other today available technique. To go deeper into the efficiency of the method, some typical calculations concerning critical dimension of multiplying systems are then performed and the results are compared with the ones coming from the classical Ssub(N) approximations. The outcome of such calculations leads us to think of interesting developments of the method which could be quite useful in alternative to other today widespread approximate procedures, for any geometry, but especially for curved ones. (author)

  15. On a class of graphs with prescribed mean curvature

    International Nuclear Information System (INIS)

    Duong Minh Duc; Costa Salavessa, I.M. de

    1989-11-01

    We study a class of quasilinear elliptic equations on the unit ball of R n and apply these results to get the existence of graphs with prescribed mean curvature on n-hyperbolic spaces. (author). 18 refs

  16. Direction of Auditory Pitch-Change Influences Visual Search for Slope From Graphs.

    Science.gov (United States)

    Parrott, Stacey; Guzman-Martinez, Emmanuel; Orte, Laura; Grabowecky, Marcia; Huntington, Mark D; Suzuki, Satoru

    2015-01-01

    Linear trend (slope) is important information conveyed by graphs. We investigated how sounds influenced slope detection in a visual search paradigm. Four bar graphs or scatter plots were presented on each trial. Participants looked for a positive-slope or a negative-slope target (in blocked trials), and responded to targets in a go or no-go fashion. For example, in a positive-slope-target block, the target graph displayed a positive slope while other graphs displayed negative slopes (a go trial), or all graphs displayed negative slopes (a no-go trial). When an ascending or descending sound was presented concurrently, ascending sounds slowed detection of negative-slope targets whereas descending sounds slowed detection of positive-slope targets. The sounds had no effect when they immediately preceded the visual search displays, suggesting that the results were due to crossmodal interaction rather than priming. The sounds also had no effect when targets were words describing slopes, such as "positive," "negative," "increasing," or "decreasing," suggesting that the results were unlikely due to semantic-level interactions. Manipulations of spatiotemporal similarity between sounds and graphs had little effect. These results suggest that ascending and descending sounds influence visual search for slope based on a general association between the direction of auditory pitch-change and visual linear trend.

  17. Generalized multivariate Fokker-Planck equations derived from kinetic transport theory and linear nonequilibrium thermodynamics

    International Nuclear Information System (INIS)

    Frank, T.D.

    2002-01-01

    We study many particle systems in the context of mean field forces, concentration-dependent diffusion coefficients, generalized equilibrium distributions, and quantum statistics. Using kinetic transport theory and linear nonequilibrium thermodynamics we derive for these systems a generalized multivariate Fokker-Planck equation. It is shown that this Fokker-Planck equation describes relaxation processes, has stationary maximum entropy distributions, can have multiple stationary solutions and stationary solutions that differ from Boltzmann distributions

  18. SpectralNET – an application for spectral graph analysis and visualization

    Directory of Open Access Journals (Sweden)

    Schreiber Stuart L

    2005-10-01

    Full Text Available Abstract Background Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks of genes, proteins, small molecules, or other objects of study can be represented as graphs of nodes (vertices and interactions (edges that can carry different weights. SpectralNET is a flexible application for analyzing and visualizing these biological and chemical networks. Results Available both as a standalone .NET executable and as an ASP.NET web application, SpectralNET was designed specifically with the analysis of graph-theoretic metrics in mind, a computational task not easily accessible using currently available applications. Users can choose either to upload a network for analysis using a variety of input formats, or to have SpectralNET generate an idealized random network for comparison to a real-world dataset. Whichever graph-generation method is used, SpectralNET displays detailed information about each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree, and average distance by degree. In addition, extensive information about the selected vertex is shown, including degree, clustering coefficient, various distance metrics, and the corresponding components of the adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear dimensionality reduction for uploaded datasets (Principal Components Analysis and a non-linear dimensionality reduction that provides an elegant view of global graph structure (Laplacian eigenvectors. Conclusion SpectralNET provides an easily accessible means of analyzing graph-theoretic metrics for data modeling and dimensionality reduction. SpectralNET is publicly available as both a .NET application and an ASP.NET web application from http://chembank.broad.harvard.edu/resources/. Source code is

  19. Exact solutions of linearized Schwinger endash Dyson equation of fermion self-energy

    International Nuclear Information System (INIS)

    Zhou, B.

    1997-01-01

    The Schwinger endash Dyson equation of fermion self-energy in the linearization approximation is solved exactly in a theory with gauge and effective four-fermion interactions. Different expressions for the independent solutions, which, respectively, submit to irregular and regular ultraviolet boundary condition are derived and expounded. copyright 1997 American Institute of Physics

  20. Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue

    Directory of Open Access Journals (Sweden)

    Shu-Guang Guo

    2016-05-01

    Full Text Available Abstract A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013 and Liu et al. (Electron. J. Linear Algebra 26:333-344, 2013 determined, independently, the unique unicyclic graph whose least Q-eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three non-bipartite unicyclic graphs of order n with k pendant vertices ordering by least Q-eigenvalue.

  1. Oscillation of solutions of some higher order linear differential equations

    Directory of Open Access Journals (Sweden)

    Hong-Yan Xu

    2009-11-01

    Full Text Available In this paper, we deal with the order of growth and the hyper order of solutions of higher order linear differential equations $$f^{(k}+B_{k-1}f^{(k-1}+\\cdots+B_1f'+B_0f=F$$ where $B_j(z (j=0,1,\\ldots,k-1$ and $F$ are entire functions or polynomials. Some results are obtained which improve and extend previous results given by Z.-X. Chen, J. Wang, T.-B. Cao and C.-H. Li.

  2. Hardy inequality on time scales and its application to half-linear dynamic equations

    Directory of Open Access Journals (Sweden)

    Řehák Pavel

    2005-01-01

    Full Text Available A time-scale version of the Hardy inequality is presented, which unifies and extends well-known Hardy inequalities in the continuous and in the discrete setting. An application in the oscillation theory of half-linear dynamic equations is given.

  3. Exploring inductive linearization for pharmacokinetic-pharmacodynamic systems of nonlinear ordinary differential equations.

    Science.gov (United States)

    Hasegawa, Chihiro; Duffull, Stephen B

    2018-02-01

    Pharmacokinetic-pharmacodynamic systems are often expressed with nonlinear ordinary differential equations (ODEs). While there are numerous methods to solve such ODEs these methods generally rely on time-stepping solutions (e.g. Runge-Kutta) which need to be matched to the characteristics of the problem at hand. The primary aim of this study was to explore the performance of an inductive approximation which iteratively converts nonlinear ODEs to linear time-varying systems which can then be solved algebraically or numerically. The inductive approximation is applied to three examples, a simple nonlinear pharmacokinetic model with Michaelis-Menten elimination (E1), an integrated glucose-insulin model and an HIV viral load model with recursive feedback systems (E2 and E3, respectively). The secondary aim of this study was to explore the potential advantages of analytically solving linearized ODEs with two examples, again E3 with stiff differential equations and a turnover model of luteinizing hormone with a surge function (E4). The inductive linearization coupled with a matrix exponential solution provided accurate predictions for all examples with comparable solution time to the matched time-stepping solutions for nonlinear ODEs. The time-stepping solutions however did not perform well for E4, particularly when the surge was approximated by a square wave. In circumstances when either a linear ODE is particularly desirable or the uncertainty in matching the integrator to the ODE system is of potential risk, then the inductive approximation method coupled with an analytical integration method would be an appropriate alternative.

  4. TBA equations for the mass gap in the O(2r) non-linear σ-models

    International Nuclear Information System (INIS)

    Balog, Janos; Hegedues, Arpad

    2005-01-01

    We propose TBA integral equations for 1-particle states in the O(n) non-linear σ-model for even n. The equations are conjectured on the basis of the analytic properties of the large volume asymptotics of the problem, which is explicitly constructed starting from Luscher's asymptotic formula. For small volumes the mass gap values computed numerically from the TBA equations agree very well with results of three-loop perturbation theory calculations, providing support for the validity of the proposed TBA system

  5. Equations for the non linear evolution of the resistive tearing modes in toroidal plasmas

    International Nuclear Information System (INIS)

    Edery, D.; Pellat, R.; Soule, J.L.

    1979-09-01

    Following the tokamak ordering, we simplify the resistive MHD equations in toroidal geometry. We obtain a closed system of non linear equations for two scalar potentials of the magnetic and velocity fields and for plasma density and temperature. If we expand these equations in the inverse of aspect ratio they are exact to the two first orders. Our formalism should correctly describe the mode coupling by curvature effects /1/ and the toroidal displacement of magnetic surfaces /2/. It provides a natural extension of the well known cylindrical model /3/ and is now being solved on computer

  6. Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.

    Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

  7. Anisotropic compacts stars on paraboloidal spacetime with linear equation of state

    Energy Technology Data Exchange (ETDEWEB)

    Thomas, V.O. [The Maharaja Sayajirao University of Baroda, Department of Mathematics, Faculty of Science, Vadodara, Gujarat (India); Pandya, D.M. [Pandit Deendayal Petroleum University, Department of Mathematics and Computer Science, Gandhinagar, Gujarat (India)

    2017-06-15

    New exact solutions of Einstein's field equations (EFEs) by assuming a linear equation of state, p{sub r} = α(ρ-ρ{sub R}), where p{sub r} is the radial pressure and ρ{sub R} is the surface density, are obtained on the background of a paraboloidal spacetime. By assuming estimated mass and radius of strange star candidate 4U 1820-30, various physical and energy conditions are used for estimating the range of parameter α. The suitability of the model for describing pulsars like PSR J1903+327, Vela X-1, Her X-1 and SAX J1808.4-3658 has been explored and respective ranges of α, for which all physical and energy conditions are satisfied throughout the distribution, are obtained. (orig.)

  8. Study of a class of photovoltaic systems using a bond graph approach. Modeling, analysis and control; Etude d'une classe de systemes photovoltaiques par une approche bond graph. Modelisation, analyse et commande

    Energy Technology Data Exchange (ETDEWEB)

    Andoulsi, R.

    2001-12-01

    We present in this thesis a study of a class of photovoltaic system by a bond graph approach. This study concerns the modelling, the analysis and the control of some configurations including PV generator, DC/DC converters and DC motor-pumps. The modelling of the different elements of a photovoltaic system is an indispensable stage that must precede all application of sizing, identification or simulation. However, theses PV systems are of hybrid type and their modelling is complex. It is why we use a unified modelling approach based on the bond graph technique. This methodology is completely systematic and has a sufficient flexibility for allowing the introduction of different components in the system. In the first chapter, we recall the principle of functioning of a photovoltaic generator and we treat mainly the MPPT (Maximum Power Point Tracking) working. In the second chapter, we elaborate bond graph models of various photovoltaic system configurations. For the PV source, we elaborate, in a first stage, a complete model taking into account the various physical phenomena influencing the quality of the PV source. In a second stage, we deduce a reduced bond graph model more easy to use for analysis and control purposes. For the DC/DC converters, we recall the bond graph modelling of switching elements and the average bond graph of the DC/DC converters developed in the literature. Thus, we deduce the bond graphs models of the various DC/DC converters to be used. The third chapter presents a dynamic study of some configurations stability in linear procedure. In the fourth chapter, we study the feasibility of non linear controllers by input/output linearization for some configurations of PV systems. In this study, we use the concept of inverse bond graph to determine, by a bond graph approach, the expression of the control input and the nature of the stability of the internal dynamics (dynamics of zeros). The fifth chapter is dedicated for the presentation of some

  9. Linear energy divergences in Coulomb gauge QCD

    OpenAIRE

    Andrasi, A.

    2011-01-01

    The structure of linear energy divergences is analysed on the example of one graph to 3-loop order. Such dangerous divergences do cancel when all graphs are added, but next to leading divergences do not cancel out.

  10. Remark on zeros of solutions of second-order linear ordinary differential equations

    Czech Academy of Sciences Publication Activity Database

    Dosoudilová, M.; Lomtatidze, Alexander

    2016-01-01

    Roč. 23, č. 4 (2016), s. 571-577 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : second-order linear equation * zeros of solutions * periodic boundary value problem Subject RIV: BA - General Mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2016.23.issue-4/gmj-2016-0052/gmj-2016-0052. xml

  11. Remark on zeros of solutions of second-order linear ordinary differential equations

    Czech Academy of Sciences Publication Activity Database

    Dosoudilová, M.; Lomtatidze, Alexander

    2016-01-01

    Roč. 23, č. 4 (2016), s. 571-577 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : second-order linear equation * zero s of solutions * periodic boundary value problem Subject RIV: BA - General Mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2016.23.issue-4/gmj-2016-0052/gmj-2016-0052.xml

  12. A General Construction of Linear Differential Equations with Solutions of Prescribed Properties

    Czech Academy of Sciences Publication Activity Database

    Neuman, František

    2004-01-01

    Roč. 17, č. 1 (2004), s. 71-76 ISSN 0893-9659 R&D Projects: GA AV ČR IAA1019902; GA ČR GA201/99/0295 Institutional research plan: CEZ:AV0Z1019905 Keywords : construction of linear differential equations * prescribed qualitative properties of solutions Subject RIV: BA - General Mathematics Impact factor: 0.414, year: 2004

  13. An Empirical Comparison of Five Linear Equating Methods for the NEAT Design

    Science.gov (United States)

    Suh, Youngsuk; Mroch, Andrew A.; Kane, Michael T.; Ripkey, Douglas R.

    2009-01-01

    In this study, a data base containing the responses of 40,000 candidates to 90 multiple-choice questions was used to mimic data sets for 50-item tests under the "nonequivalent groups with anchor test" (NEAT) design. Using these smaller data sets, we evaluated the performance of five linear equating methods for the NEAT design with five levels of…

  14. Linear Equating for the NEAT Design: A Rejoinder and Some Further Comments

    Science.gov (United States)

    Kane, Michael T.; Mroch, Andrew A.; Suh, Youngsuk; Ripkey, Douglas R.

    2010-01-01

    This article presents the authors' rejoinder to commentaries on linear equating and the NEAT design. The authors appreciate the insightful work of the commentary writers. Each has made a number of interesting points, many of which the authors had not considered at all. Before responding to some of those points, the authors reiterate what they see…

  15. On Attainability of Optimal Solutions for Linear Elliptic Equations with Unbounded Coefficients

    Directory of Open Access Journals (Sweden)

    P. I. Kogut

    2011-12-01

    Full Text Available We study an optimal boundary control problem (OCP associated to a linear elliptic equation —div (Vj/ + A(xVy = f describing diffusion in a turbulent flow. The characteristic feature of this equation is the fact that, in applications, the stream matrix A(x = [a,ij(x]i,j=i,...,N is skew-symmetric, ац(х = —a,ji(x, measurable, and belongs to L -space (rather than L°°. An optimal solution to such problem can inherit a singular character of the original stream matrix A. We show that optimal solutions can be attainable by solutions of special optimal boundary control problems.

  16. On the prolongation structure and Backlund transformation for new non-linear Klein-Gordon equations

    International Nuclear Information System (INIS)

    Roy Chowdhury, A.; Mukherjee, J.

    1986-07-01

    We have considered the complete integrability of two nonlinear equations which are some kind of extensions of usual Sine-Gordon and Sinh-Gordon equations. The first one is of non-autonomous version of Sinh-Gordon system and the second is closely related to the usual Sine-Gordon theory. The first problem indicates how (x,t) dependent non-linear equations can be treated in the prolongation theory and how a Backlund map can be constructed. The second one is a variation of the usual Sine-Gordon equation and suggests that there may be other equations (similar to Sine-Gordon) which are completely integrable. In both cases we have been able to construct the Lax pair. We then construct an auto-Backlund map by following the idea of Konno and Wadati, for the generation of multisolution states. (author)

  17. Bond graph model-based fault diagnosis of hybrid systems

    CERN Document Server

    Borutzky, Wolfgang

    2015-01-01

    This book presents a bond graph model-based approach to fault diagnosis in mechatronic systems appropriately represented by a hybrid model. The book begins by giving a survey of the fundamentals of fault diagnosis and failure prognosis, then recalls state-of-art developments referring to latest publications, and goes on to discuss various bond graph representations of hybrid system models, equations formulation for switched systems, and simulation of their dynamic behavior. The structured text: • focuses on bond graph model-based fault detection and isolation in hybrid systems; • addresses isolation of multiple parametric faults in hybrid systems; • considers system mode identification; • provides a number of elaborated case studies that consider fault scenarios for switched power electronic systems commonly used in a variety of applications; and • indicates that bond graph modelling can also be used for failure prognosis. In order to facilitate the understanding of fault diagnosis and the presented...

  18. A frequency domain linearized Navier-Stokes equations approach to acoustic propagation in flow ducts with sharp edges.

    Science.gov (United States)

    Kierkegaard, Axel; Boij, Susann; Efraimsson, Gunilla

    2010-02-01

    Acoustic wave propagation in flow ducts is commonly modeled with time-domain non-linear Navier-Stokes equation methodologies. To reduce computational effort, investigations of a linearized approach in frequency domain are carried out. Calculations of sound wave propagation in a straight duct are presented with an orifice plate and a mean flow present. Results of transmission and reflections at the orifice are presented on a two-port scattering matrix form and are compared to measurements with good agreement. The wave propagation is modeled with a frequency domain linearized Navier-Stokes equation methodology. This methodology is found to be efficient for cases where the acoustic field does not alter the mean flow field, i.e., when whistling does not occur.

  19. Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

    Science.gov (United States)

    Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

    2017-06-01

    Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

  20. On the stability, the periodic solutions and the resolution of certain types of non linear equations, and of non linearly coupled systems of these equations, appearing in betatronic oscillations; Sur la stabilite, les solutions periodiques et la resolution de certaines categories d'equations et systemes d'equations differentielles couplees non lineaires apparaissant dans les oscillations betatroniques

    Energy Technology Data Exchange (ETDEWEB)

    Valat, J [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

    1960-12-15

    Universal stability diagrams have been calculated and experimentally checked for Hill-Meissner type equations with square-wave coefficients. The study of these equations in the phase-plane has then made it possible to extend the periodic solution calculations to the case of non-linear differential equations with periodic square-wave coefficients. This theory has been checked experimentally. For non-linear coupled systems with constant coefficients, a search was first made for solutions giving an algebraic motion. The elliptical and Fuchs's functions solve such motions. The study of non-algebraic motions is more delicate, apart from the study of nonlinear Lissajous's motions. A functional analysis shows that it is possible however in certain cases to decouple the system and to find general solutions. For non-linear coupled systems with periodic square-wave coefficients it is then possible to calculate the conditions leading to periodic solutions, if the two non-linear associated systems with constant coefficients fall into one of the categories of the above paragraph. (author) [French] Pour les equations du genre de Hill-Meissner a coefficients creneles, on a calcule des diagrammes universels de stabilite et ceux-ci ont ete verifies experimentalement. L'etude de ces equations dans le plan de phase a permis ensuite d'etendre le calcul des solutions periodiques au cas des equations differentielles non lineaires a coefficients periodiques creneles. Cette theorie a ete verifiee experimentalement. Pour Jes systemes couples non lineaires a coefficients constants, on a d'abord cherche les solutions menant a des mouvements algebriques. Les fonctions elliptiques et fuchsiennes uniformisent de tels mouvements. L'etude de mouvements non algebriques est plus delicate, a part l'etude des mouvements de Lissajous non lineaires. Une analyse fonctionnelle montre qu'il est toutefois possible dans certains cas de decoupler le systeme et de trouver des solutions generales. Pour les

  1. TOEPLITZ, Solution of Linear Equation System with Toeplitz or Circulant Matrix

    International Nuclear Information System (INIS)

    Garbow, B.

    1984-01-01

    Description of program or function: TOEPLITZ is a collection of FORTRAN subroutines for solving linear systems Ax=b, where A is a Toeplitz matrix, a Circulant matrix, or has one or several block structures based on Toeplitz or Circulant matrices. Such systems arise in problems of electrodynamics, acoustics, mathematical statistics, algebra, in the numerical solution of integral equations with a difference kernel, and in the theory of stationary time series and signals

  2. Excited-state lifetime measurements: Linearization of the Foerster equation by the phase-plane method

    International Nuclear Information System (INIS)

    Love, J.C.; Demas, J.N.

    1983-01-01

    The Foerster equation describes excited-state decay curves involving resonance intermolecular energy transfer. A linearized solution based on the phase-plane method has been developed. The new method is quick, insensitive to the fitting region, accurate, and precise

  3. Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks

    International Nuclear Information System (INIS)

    Ni Xiaohui; Jiang Zhiqiang; Zhou Weixing

    2009-01-01

    The dynamics of a complex system is usually recorded in the form of time series, which can be studied through its visibility graph from a complex network perspective. We investigate the visibility graphs extracted from fractional Brownian motions and multifractal random walks, and find that the degree distributions exhibit power-law behaviors, in which the power-law exponent α is a linear function of the Hurst index H of the time series. We also find that the degree distribution of the visibility graph is mainly determined by the temporal correlation of the original time series with minor influence from the possible multifractal nature. As an example, we study the visibility graphs constructed from three Chinese stock market indexes and unveil that the degree distributions have power-law tails, where the tail exponents of the visibility graphs and the Hurst indexes of the indexes are close to the α∼H linear relationship.

  4. Complexity of Products of Some Complete and Complete Bipartite Graphs

    Directory of Open Access Journals (Sweden)

    S. N. Daoud

    2013-01-01

    Full Text Available The number of spanning trees in graphs (networks is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete and complete bipartite graphs such as cartesian product, normal product, composition product, tensor product, and symmetric product, using linear algebra and matrix analysis techniques.

  5. Existence and uniqueness to the Cauchy problem for linear and semilinear parabolic equations with local conditions⋆

    Directory of Open Access Journals (Sweden)

    Rubio Gerardo

    2011-03-01

    Full Text Available We consider the Cauchy problem in ℝd for a class of semilinear parabolic partial differential equations that arises in some stochastic control problems. We assume that the coefficients are unbounded and locally Lipschitz, not necessarily differentiable, with continuous data and local uniform ellipticity. We construct a classical solution by approximation with linear parabolic equations. The linear equations involved can not be solved with the traditional results. Therefore, we construct a classical solution to the linear Cauchy problem under the same hypotheses on the coefficients for the semilinear equation. Our approach is using stochastic differential equations and parabolic differential equations in bounded domains. Finally, we apply the results to a stochastic optimal consumption problem. Nous considérons le problème de Cauchy dans ℝd pour une classe d’équations aux dérivées partielles paraboliques semi linéaires qui se pose dans certains problèmes de contrôle stochastique. Nous supposons que les coefficients ne sont pas bornés et sont localement Lipschitziennes, pas nécessairement différentiables, avec des données continues et ellipticité local uniforme. Nous construisons une solution classique par approximation avec les équations paraboliques linéaires. Les équations linéaires impliquées ne peuvent être résolues avec les résultats traditionnels. Par conséquent, nous construisons une solution classique au problème de Cauchy linéaire sous les mêmes hypothèses sur les coefficients pour l’équation semi-linéaire. Notre approche utilise les équations différentielles stochastiques et les équations différentielles paraboliques dans les domaines bornés. Enfin, nous appliquons les résultats à un problème stochastique de consommation optimale.

  6. On the solution of a class of fuzzy system of linear equations

    Indian Academy of Sciences (India)

    J. Mathematics and Comput. Sci. 1: 1–5. Salkuyeh D K 2011 On the solution of the fuzzy Sylvester matrix equation. Soft Computing 15: 953–961. Senthilkumar P and Rajendran G 2011 New approach to solve symmetric fully fuzzy linear systems. S¯adhan¯a 36: 933–940. Wang K and Zheng B 2007 Block iterative methods ...

  7. Text categorization of biomedical data sets using graph kernels and a controlled vocabulary.

    Science.gov (United States)

    Bleik, Said; Mishra, Meenakshi; Huan, Jun; Song, Min

    2013-01-01

    Recently, graph representations of text have been showing improved performance over conventional bag-of-words representations in text categorization applications. In this paper, we present a graph-based representation for biomedical articles and use graph kernels to classify those articles into high-level categories. In our representation, common biomedical concepts and semantic relationships are identified with the help of an existing ontology and are used to build a rich graph structure that provides a consistent feature set and preserves additional semantic information that could improve a classifier's performance. We attempt to classify the graphs using both a set-based graph kernel that is capable of dealing with the disconnected nature of the graphs and a simple linear kernel. Finally, we report the results comparing the classification performance of the kernel classifiers to common text-based classifiers.

  8. Operational matrices with respect to Hermite polynomials and their applications in solving linear dierential equations with variable coecients

    Directory of Open Access Journals (Sweden)

    A. Aminataei

    2014-05-01

    Full Text Available In this paper, a new and ecient approach is applied for numerical approximation of the linear dierential equations with variable coecients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansioncoecients for the moments of derivatives of any dierentiable function in terms of the original expansion coecients of the function itself are given in the matrix form. The mainimportance of this scheme is that using this approach reduces solving the linear dierentialequations to solve a system of linear algebraic equations, thus greatly simplifying the problem. In addition, two experiments are given to demonstrate the validity and applicability of the method

  9. Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

    Science.gov (United States)

    Hasnain, Shahid; Saqib, Muhammad; Mashat, Daoud Suleiman

    2017-07-01

    This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit) to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

  10. Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

    Directory of Open Access Journals (Sweden)

    Shahid Hasnain

    2017-07-01

    Full Text Available This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

  11. Chromatic graph theory

    CERN Document Server

    Chartrand, Gary; Rosen, Kenneth H

    2008-01-01

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

  12. Oscillation and nonoscillation results for solutions of half-linear equations with deviated argument

    Czech Academy of Sciences Publication Activity Database

    Drábek, P.; Kufner, Alois; Kuliev, K.

    2017-01-01

    Roč. 447, č. 1 (2017), s. 371-382 ISSN 0022-247X Institutional support: RVO:67985840 Keywords : half-linear equation * oscillatory solution * nonoscillatory solution Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.064, year: 2016 http://www.sciencedirect.com/science/article/pii/S0022247X16306059

  13. Direct linearizing transform for three-dimensional discrete integrable systems: the lattice AKP, BKP and CKP equations.

    Science.gov (United States)

    Fu, Wei; Nijhoff, Frank W

    2017-07-01

    A unified framework is presented for the solution structure of three-dimensional discrete integrable systems, including the lattice AKP, BKP and CKP equations. This is done through the so-called direct linearizing transform, which establishes a general class of integral transforms between solutions. As a particular application, novel soliton-type solutions for the lattice CKP equation are obtained.

  14. Modeling of tethered satellite formations using graph theory

    DEFF Research Database (Denmark)

    Larsen, Martin Birkelund; Smith, Roy S; Blanke, Mogens

    2011-01-01

    satellite formation and proposes a method to deduce the equations of motion for the attitude dynamics of the formation in a compact form. The use of graph theory and Lagrange mechanics together allows a broad class of formations to be described using the same framework. A method is stated for finding...

  15. Hölder Regularity of the 2D Dual Semigeostrophic Equations via Analysis of Linearized Monge-Ampère Equations

    Science.gov (United States)

    Le, Nam Q.

    2018-05-01

    We obtain the Hölder regularity of time derivative of solutions to the dual semigeostrophic equations in two dimensions when the initial potential density is bounded away from zero and infinity. Our main tool is an interior Hölder estimate in two dimensions for an inhomogeneous linearized Monge-Ampère equation with right hand side being the divergence of a bounded vector field. As a further application of our Hölder estimate, we prove the Hölder regularity of the polar factorization for time-dependent maps in two dimensions with densities bounded away from zero and infinity. Our applications improve previous work by G. Loeper who considered the cases of densities sufficiently close to a positive constant.

  16. Analysis and enumeration algorithms for biological graphs

    CERN Document Server

    Marino, Andrea

    2015-01-01

    In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions...

  17. Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs

    International Nuclear Information System (INIS)

    Samatova, N F; Schmidt, M C; Hendrix, W; Breimyer, P; Thomas, K; Park, B-H

    2008-01-01

    Data-driven construction of predictive models for biological systems faces challenges from data intensity, uncertainty, and computational complexity. Data-driven model inference is often considered a combinatorial graph problem where an enumeration of all feasible models is sought. The data-intensive and the NP-hard nature of such problems, however, challenges existing methods to meet the required scale of data size and uncertainty, even on modern supercomputers. Maximal clique enumeration (MCE) in a graph derived from such biological data is often a rate-limiting step in detecting protein complexes in protein interaction data, finding clusters of co-expressed genes in microarray data, or identifying clusters of orthologous genes in protein sequence data. We report two key advances that address this challenge. We designed and implemented the first (to the best of our knowledge) parallel MCE algorithm that scales linearly on thousands of processors running MCE on real-world biological networks with thousands and hundreds of thousands of vertices. In addition, we proposed and developed the Graph Perturbation Theory (GPT) that establishes a foundation for efficiently solving the MCE problem in perturbed graphs, which model the uncertainty in the data. GPT formulates necessary and sufficient conditions for detecting the differences between the sets of maximal cliques in the original and perturbed graphs and reduces the enumeration time by more than 80% compared to complete recomputation

  18. A High-Accuracy Linear Conservative Difference Scheme for Rosenau-RLW Equation

    Directory of Open Access Journals (Sweden)

    Jinsong Hu

    2013-01-01

    Full Text Available We study the initial-boundary value problem for Rosenau-RLW equation. We propose a three-level linear finite difference scheme, which has the theoretical accuracy of Oτ2+h4. The scheme simulates two conservative properties of original problem well. The existence, uniqueness of difference solution, and a priori estimates in infinite norm are obtained. Furthermore, we analyze the convergence and stability of the scheme by energy method. At last, numerical experiments demonstrate the theoretical results.

  19. Decoherence of histories and hydrodynamic equations for a linear oscillator chain

    International Nuclear Information System (INIS)

    Halliwell, J.J.

    2003-01-01

    We investigate the decoherence of histories of local densities for linear oscillators models. It is shown that histories of local number, momentum and energy density are approximately decoherent, when coarse grained over sufficiently large volumes. Decoherence arises directly from the proximity of these variables to exactly conserved quantities (which are exactly decoherent), and not from environmentally induced decoherence. We discuss the approach to local equilibrium and the subsequent emergence of hydrodynamic equations for the local densities

  20. A Discrete-Time Recurrent Neural Network for Solving Rank-Deficient Matrix Equations With an Application to Output Regulation of Linear Systems.

    Science.gov (United States)

    Liu, Tao; Huang, Jie

    2017-04-17

    This paper presents a discrete-time recurrent neural network approach to solving systems of linear equations with two features. First, the system of linear equations may not have a unique solution. Second, the system matrix is not known precisely, but a sequence of matrices that converges to the unknown system matrix exponentially is known. The problem is motivated from solving the output regulation problem for linear systems. Thus, an application of our main result leads to an online solution to the output regulation problem for linear systems.

  1. Remark on periodic boundary-value problem for second-order linear ordinary differential equations

    Czech Academy of Sciences Publication Activity Database

    Dosoudilová, M.; Lomtatidze, Alexander

    2018-01-01

    Roč. 2018, č. 13 (2018), s. 1-7 ISSN 1072-6691 Institutional support: RVO:67985840 Keywords : second-order linear equation * periodic boundary value problem * unique solvability Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.954, year: 2016 https://ejde.math.txstate.edu/Volumes/2018/13/abstr.html

  2. A Lie-Deprit perturbation algorithm for linear differential equations with periodic coefficients

    OpenAIRE

    Casas Pérez, Fernando; Chiralt Monleon, Cristina

    2014-01-01

    A perturbative procedure based on the Lie-Deprit algorithm of classical mechanics is proposed to compute analytic approximations to the fundamental matrix of linear di erential equations with periodic coe cients. These approximations reproduce the structure assured by the Floquet theorem. Alternatively, the algorithm provides explicit approximations to the Lyapunov transformation reducing the original periodic problem to an autonomous sys- tem and also to its characteristic ...

  3. A piecewise linear finite element discretization of the diffusion equation for arbitrary polyhedral grids

    Energy Technology Data Exchange (ETDEWEB)

    Bailey, Teresa S. [Texas A and M University, Department of Nuclear Engineering, College Station, TX 77843-3133 (United States)], E-mail: baileyte@tamu.edu; Adams, Marvin L. [Texas A and M University, Department of Nuclear Engineering, College Station, TX 77843-3133 (United States)], E-mail: mladams@tamu.edu; Yang, Brian [Lawrence Livermore National Laboratory, Livermore, CA 94551 (United States); Zika, Michael R. [Lawrence Livermore National Laboratory, Livermore, CA 94551 (United States)], E-mail: zika@llnl.gov

    2008-04-01

    We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses recently introduced piecewise linear weight and basis functions in the finite element approximation and it can be applied on arbitrary polygonal (2D) or polyhedral (3D) grids. We first demonstrate some analytical properties of the PWL method and perform a simple mode analysis to compare the PWL method with Palmer's vertex-centered finite-volume method and with a bilinear continuous finite element method. We then show that this new PWL method gives solutions comparable to those from Palmer's. However, since the PWL method produces a symmetric positive-definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids.

  4. A piecewise linear finite element discretization of the diffusion equation for arbitrary polyhedral grids

    International Nuclear Information System (INIS)

    Bailey, Teresa S.; Adams, Marvin L.; Yang, Brian; Zika, Michael R.

    2008-01-01

    We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses recently introduced piecewise linear weight and basis functions in the finite element approximation and it can be applied on arbitrary polygonal (2D) or polyhedral (3D) grids. We first demonstrate some analytical properties of the PWL method and perform a simple mode analysis to compare the PWL method with Palmer's vertex-centered finite-volume method and with a bilinear continuous finite element method. We then show that this new PWL method gives solutions comparable to those from Palmer's. However, since the PWL method produces a symmetric positive-definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids

  5. The structure of solutions of the matrix linear unilateral polynomial equation with two variables

    Directory of Open Access Journals (Sweden)

    N. S. Dzhaliuk

    2017-07-01

    Full Text Available We investigate the structure of solutions of the matrix linear polynomial equation $A(\\lambdaX(\\lambda+B(\\lambdaY(\\lambda=C(\\lambda,$ in particular, possible degrees of the solutions. The solving of this equation is reduced to the solving of the equivalent matrix polynomial equation with matrix coefficients in triangular forms with invariant factors on the main diagonals, to which the matrices $A (\\lambda, B(\\lambda$ \\ and \\ $C(\\lambda$ are reduced by means of semiscalar equivalent transformations. On the basis of it, we have pointed out the bounds of the degrees of the matrix polynomial equation solutions. Necessary and sufficient conditions for the uniqueness of a solution with a minimal degree are established. An effective method for constructing minimal degree solutions of the equations is suggested. In this article, unlike well-known results about the estimations of the degrees of the solutions of the matrix polynomial equations in which both matrix coefficients are regular or at least one of them is regular, we have considered the case when the matrix polynomial equation has arbitrary matrix coefficients $A(\\lambda$ and $B(\\lambda.$ 

  6. A linear evolution for non-linear dynamics and correlations in realistic nuclei

    International Nuclear Information System (INIS)

    Levin, E.; Lublinsky, M.

    2004-01-01

    A new approach to high energy evolution based on a linear equation for QCD generating functional is developed. This approach opens a possibility for systematic study of correlations inside targets, and, in particular, inside realistic nuclei. Our results are presented as three new equations. The first one is a linear equation for QCD generating functional (and for scattering amplitude) that sums the 'fan' diagrams. For the amplitude this equation is equivalent to the non-linear Balitsky-Kovchegov equation. The second equation is a generalization of the Balitsky-Kovchegov non-linear equation to interactions with realistic nuclei. It includes a new correlation parameter which incorporates, in a model-dependent way, correlations inside the nuclei. The third equation is a non-linear equation for QCD generating functional (and for scattering amplitude) that in addition to the 'fan' diagrams sums the Glauber-Mueller multiple rescatterings

  7. A critical oscillation constant as a variable of time scales for half-linear dynamic equations

    Czech Academy of Sciences Publication Activity Database

    Řehák, Pavel

    2010-01-01

    Roč. 60, č. 2 (2010), s. 237-256 ISSN 0139-9918 R&D Projects: GA AV ČR KJB100190701 Institutional research plan: CEZ:AV0Z10190503 Keywords : dynamic equation * time scale * half-linear equation * (non)oscillation criteria * Hille-Nehari criteria * Kneser criteria * critical constant * oscillation constant * Hardy inequality Subject RIV: BA - General Mathematics Impact factor: 0.316, year: 2010 http://link.springer.com/article/10.2478%2Fs12175-010-0009-7

  8. Cerebral blood flow measurement using 123I-IMP graph plot method with SPECT. Comparison with autoradiography method

    International Nuclear Information System (INIS)

    Shinohara, Yuki; Kamitani, Hideki; Ishibashi, Minako; Ito, Satoru; Ogawa, Toshihide

    2011-01-01

    The purpose of this study was to evaluate quantification of cerebral blood flow (CBF) values using 123 I-iodoamphetamine (IMP) graph plot (GP) method with single photon emission computed tomography (SPECT), compared with autoradiography (ARG) method. IMP-SPECT by GP combined with ARG method at rest was performed in 40 patients to determine the equation of linear regression for GP method in our institution. In addition, we compared regional CBF (rCBF) values at rest between GP and ARG methods in 10 other patients. Among all 50 patients, acetazolamide (ACZ)-challenged SPECT by GP combined with ARG method using 2-day protocol was performed in 10 patients. We also compared the rCBF values after ACZ challenge between GP and ARG methods in these 10 patients. The equation of linear regression for GP method in our institution was y=1.945x+20.36 (R 2 =0.586, P 2 =0.624, P 2 =0.150, P<0.001). IMP-SPECT by GP method at rest is useful to measure reliable rCBF values without arterial blood sampling, although we need pay attention to interpret the result of 2-day protocol ACZ-challenged SPECT by GP method. (author)

  9. On the multisummability of WKB solutions of certain singularly perturbed linear ordinary differential equations

    Directory of Open Access Journals (Sweden)

    Yoshitsugu Takei

    2015-01-01

    Full Text Available Using two concrete examples, we discuss the multisummability of WKB solutions of singularly perturbed linear ordinary differential equations. Integral representations of solutions and a criterion for the multisummability based on the Cauchy-Heine transform play an important role in the proof.

  10. A parallel algorithm for solving linear equations arising from one-dimensional network problems

    International Nuclear Information System (INIS)

    Mesina, G.L.

    1991-01-01

    One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs

  11. Stabilized linear semi-implicit schemes for the nonlocal Cahn-Hilliard equation

    Science.gov (United States)

    Du, Qiang; Ju, Lili; Li, Xiao; Qiao, Zhonghua

    2018-06-01

    Comparing with the well-known classic Cahn-Hilliard equation, the nonlocal Cahn-Hilliard equation is equipped with a nonlocal diffusion operator and can describe more practical phenomena for modeling phase transitions of microstructures in materials. On the other hand, it evidently brings more computational costs in numerical simulations, thus efficient and accurate time integration schemes are highly desired. In this paper, we propose two energy-stable linear semi-implicit methods with first and second order temporal accuracies respectively for solving the nonlocal Cahn-Hilliard equation. The temporal discretization is done by using the stabilization technique with the nonlocal diffusion term treated implicitly, while the spatial discretization is carried out by the Fourier collocation method with FFT-based fast implementations. The energy stabilities are rigorously established for both methods in the fully discrete sense. Numerical experiments are conducted for a typical case involving Gaussian kernels. We test the temporal convergence rates of the proposed schemes and make a comparison of the nonlocal phase transition process with the corresponding local one. In addition, long-time simulations of the coarsening dynamics are also performed to predict the power law of the energy decay.

  12. Graph sampling

    OpenAIRE

    Zhang, L.-C.; Patone, M.

    2017-01-01

    We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

  13. Graph-theoretic approach to quantum correlations.

    Science.gov (United States)

    Cabello, Adán; Severini, Simone; Winter, Andreas

    2014-01-31

    Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

  14. An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations

    Science.gov (United States)

    Melckenbeeck, Ine; Audenaert, Pieter; Michoel, Tom; Colle, Didier; Pickavet, Mario

    2016-01-01

    Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at https://github.com/IneMelckenbeeck/equation-generator and https://github.com/IneMelckenbeeck/graphlet-naming. PMID:26797021

  15. Entity-Linking via Graph-Distance Minimization

    Directory of Open Access Journals (Sweden)

    Roi Blanco

    2014-07-01

    Full Text Available Entity-linking is a natural-language–processing task that consists in identifying the entities mentioned in a piece of text, linking each to an appropriate item in some knowledge base; when the knowledge base is Wikipedia, the problem comes to be known as wikification (in this case, items are wikipedia articles. One instance of entity-linking can be formalized as an optimization problem on the underlying concept graph, where the quantity to be optimized is the average distance between chosen items. Inspired by this application, we define a new graph problem which is a natural variant of the Maximum Capacity Representative Set. We prove that our problem is NP-hard for general graphs; nonetheless, under some restrictive assumptions, it turns out to be solvable in linear time. For the general case, we propose two heuristics: one tries to enforce the above assumptions and another one is based on the notion of hitting distance; we show experimentally how these approaches perform with respect to some baselines on a real-world dataset.

  16. Unique solvability of a non-linear non-local boundary-value problem for systems of non-linear functional differential equations

    Czech Academy of Sciences Publication Activity Database

    Dilna, N.; Rontó, András

    2010-01-01

    Roč. 60, č. 3 (2010), s. 327-338 ISSN 0139-9918 R&D Projects: GA ČR(CZ) GA201/06/0254 Institutional research plan: CEZ:AV0Z10190503 Keywords : non-linear boundary value-problem * functional differential equation * non-local condition * unique solvability * differential inequality Subject RIV: BA - General Mathematics Impact factor: 0.316, year: 2010 http://link.springer.com/article/10.2478%2Fs12175-010-0015-9

  17. Algorithms for Planar Graphs and Graphs in Metric Spaces

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

  18. Accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations on rectangular domains

    Science.gov (United States)

    Ji, Songsong; Yang, Yibo; Pang, Gang; Antoine, Xavier

    2018-01-01

    The aim of this paper is to design some accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations in rectangular domains. The Laplace transform in time and discrete Fourier transform in space are applied to get Green's functions of the semi-discretized equations in unbounded domains with single-source. An algorithm is given to compute these Green's functions accurately through some recurrence relations. Furthermore, the finite-difference method is used to discretize the reduced problem with accurate boundary conditions. Numerical simulations are presented to illustrate the accuracy of our method in the case of the linear Schrödinger and heat equations. It is shown that the reflection at the corners is correctly eliminated.

  19. Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

    International Nuclear Information System (INIS)

    Bonnet, M.; Meurant, G.

    1978-01-01

    Different methods of solution of linear and nonlinear algebraic systems are applied to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems, methods in general use of alternating directions type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method on nonlinear conjugate gradient is studied as also Newton's method and some of its variants. It should be noted, however that Newton's method is found to be more efficient when coupled with a good method for solution of the linear system. To conclude, such methods are used to solve a nonlinear diffusion problem and the numerical results obtained are to be compared [fr

  20. Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

    International Nuclear Information System (INIS)

    Bonnet, M.; Meurant, G.

    1978-01-01

    The object of this study is to compare different methods of solving linear and nonlinear algebraic systems and to apply them to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems the conventional methods of alternating direction type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method of nonlinear conjugate gradient is studied together with Newton's method and some of its variants. It should be noted, however, that Newton's method is found to be more efficient when coupled with a good method for solving the linear system. As a conclusion, these methods are used to solve a nonlinear diffusion problem and the numerical results obtained are compared [fr

  1. Linear indices in nonlinear structural equation models : best fitting proper indices and other composites

    NARCIS (Netherlands)

    Dijkstra, T.K.; Henseler, J.

    2011-01-01

    The recent advent of nonlinear structural equation models with indices poses a new challenge to the measurement of scientific constructs. We discuss, exemplify and add to a family of statistical methods aimed at creating linear indices, and compare their suitability in a complex path model with

  2. A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate

    Directory of Open Access Journals (Sweden)

    Min Sun

    2014-01-01

    Full Text Available A matrix-free method for constrained equations is proposed, which is a combination of the well-known PRP (Polak-Ribière-Polyak conjugate gradient method and the famous hyperplane projection method. The new method is not only derivative-free, but also completely matrix-free, and consequently, it can be applied to solve large-scale constrained equations. We obtain global convergence of the new method without any differentiability requirement on the constrained equations. Compared with the existing gradient methods for solving such problem, the new method possesses linear convergence rate under standard conditions, and a relax factor γ is attached in the update step to accelerate convergence. Preliminary numerical results show that it is promising in practice.

  3. Investigating Integer Restrictions in Linear Programming

    Science.gov (United States)

    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…

  4. Linear algebra and matrices topics for a second course

    CERN Document Server

    Shapiro, Helene

    2015-01-01

    Linear algebra and matrix theory are fundamental tools for almost every area of mathematics, both pure and applied. This book combines coverage of core topics with an introduction to some areas in which linear algebra plays a key role, for example, block designs, directed graphs, error correcting codes, and linear dynamical systems. Notable features include a discussion of the Weyr characteristic and Weyr canonical forms, and their relationship to the better-known Jordan canonical form; the use of block cyclic matrices and directed graphs to prove Frobenius's theorem on the structure of the eigenvalues of a nonnegative, irreducible matrix; and the inclusion of such combinatorial topics as BIBDs, Hadamard matrices, and strongly regular graphs. Also included are McCoy's theorem about matrices with property P, the Bruck-Ryser-Chowla theorem on the existence of block designs, and an introduction to Markov chains. This book is intended for those who are familiar with the linear algebra covered in a typical first c...

  5. Perturbation Solutions for Random Linear Structural Systems subject to Random Excitation using Stochastic Differential Equations

    DEFF Research Database (Denmark)

    Köyluoglu, H.U.; Nielsen, Søren R.K.; Cakmak, A.S.

    1994-01-01

    perturbation method using stochastic differential equations. The joint statistical moments entering the perturbation solution are determined by considering an augmented dynamic system with state variables made up of the displacement and velocity vector and their first and second derivatives with respect......The paper deals with the first and second order statistical moments of the response of linear systems with random parameters subject to random excitation modelled as white-noise multiplied by an envelope function with random parameters. The method of analysis is basically a second order...... to the random parameters of the problem. Equations for partial derivatives are obtained from the partial differentiation of the equations of motion. The zero time-lag joint statistical moment equations for the augmented state vector are derived from the Itô differential formula. General formulation is given...

  6. Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

    Directory of Open Access Journals (Sweden)

    P. Anusha Devi

    2015-10-01

    Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

  7. Bond graph to digraph conversion: A sensor placement optimization ...

    Indian Academy of Sciences (India)

    In this paper, we consider the optimal sensors placement problem for ... is due to the fact that the construction is generally done from the state equations, ... The Bond Graph (BG) tool defined in Paynter (1961) formal- ... Sensor placement and structural problem formulation .... Thus the obtained four matrices are as follows:.

  8. Stationary solutions of linear stochastic delay differential equations: applications to biological systems.

    Science.gov (United States)

    Frank, T D; Beek, P J

    2001-08-01

    Recently, Küchler and Mensch [Stochastics Stochastics Rep. 40, 23 (1992)] derived exact stationary probability densities for linear stochastic delay differential equations. This paper presents an alternative derivation of these solutions by means of the Fokker-Planck approach introduced by Guillouzic [Phys. Rev. E 59, 3970 (1999); 61, 4906 (2000)]. Applications of this approach, which is argued to have greater generality, are discussed in the context of stochastic models for population growth and tracking movements.

  9. Stationary distributions of stochastic processes described by a linear neutral delay differential equation

    International Nuclear Information System (INIS)

    Frank, T D

    2005-01-01

    Stationary distributions of processes are derived that involve a time delay and are defined by a linear stochastic neutral delay differential equation. The distributions are Gaussian distributions. The variances of the Gaussian distributions are either monotonically increasing or decreasing functions of the time delays. The variances become infinite when fixed points of corresponding deterministic processes become unstable. (letter to the editor)

  10. On one two-point BVP for the fourth order linear ordinary differential equation

    Czech Academy of Sciences Publication Activity Database

    Mukhigulashvili, Sulkhan; Manjikashvili, M.

    2017-01-01

    Roč. 24, č. 2 (2017), s. 265-275 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : fourth order linear ordinary differential equations * two-point boundary value problems Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0077/gmj-2016-0077. xml

  11. On one two-point BVP for the fourth order linear ordinary differential equation

    Czech Academy of Sciences Publication Activity Database

    Mukhigulashvili, Sulkhan; Manjikashvili, M.

    2017-01-01

    Roč. 24, č. 2 (2017), s. 265-275 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : fourth order linear ordinary differential equations * two-point boundary value problems Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0077/gmj-2016-0077.xml

  12. Oscillation theory of linear differential equations

    Czech Academy of Sciences Publication Activity Database

    Došlý, Ondřej

    2000-01-01

    Roč. 36, č. 5 (2000), s. 329-343 ISSN 0044-8753 R&D Projects: GA ČR GA201/98/0677 Keywords : discrete oscillation theory %Sturm-Liouville equation%Riccati equation Subject RIV: BA - General Mathematics

  13. Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

    Energy Technology Data Exchange (ETDEWEB)

    Pilipchuk, L. A., E-mail: pilipchik@bsu.by [Belarussian State University, 220030 Minsk, 4, Nezavisimosti avenue, Republic of Belarus (Belarus); Pilipchuk, A. S., E-mail: an.pilipchuk@gmail.com [The Natural Resources and Environmental Protestion Ministry of the Republic of Belarus, 220004 Minsk, 10 Kollektornaya Street, Republic of Belarus (Belarus)

    2015-11-30

    In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure.

  14. Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

    International Nuclear Information System (INIS)

    Pilipchuk, L. A.; Pilipchuk, A. S.

    2015-01-01

    In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure

  15. Resummation of the 1/N-expansion of the non-linear σ-model by Dyson-Schwinger equations

    International Nuclear Information System (INIS)

    Drouffe, J.M.; Flyvbjerg, H.

    1988-02-01

    Dyson-Schwinger equations for the O(N)-symmetric non-linear σ-model are derived and expanded in 1/N. A closed set of equations is obtained by keeping only the leading term and the first correction term in this expansion. These equations are solved numerically in 2 dimensions on square lattices of sizes 50x50 and 100x100. Results for the magnetic susceptibility and the mass gap are compared with predictions of the ordinary 1/N-expansion and with Monte Carlo results. The results obtained with the Dyson-Schwinger equations show the same scaling behavior as found in the Monte Carlo results. This is not the behavior predicted by the perturbative renormalization group. (orig.)

  16. Introduction to graph theory

    CERN Document Server

    Trudeau, Richard J

    1994-01-01

    Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

  17. Inhomogeneous Linear Random Differential Equations with Mutual Correlations between Multiplicative, Additive and Initial-Value Terms

    NARCIS (Netherlands)

    Roerdink, J.B.T.M.

    1981-01-01

    The cumulant expansion for linear stochastic differential equations is extended to the general case in which the coefficient matrix, the inhomogeneous part and the initial condition are all random and, moreover, statistically interdependent. The expansion now involves not only the autocorrelation

  18. Graph Theory. 2. Vertex Descriptors and Graph Coloring

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

  19. On an edge partition and root graphs of some classes of line graphs

    Directory of Open Access Journals (Sweden)

    K Pravas

    2017-04-01

    Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

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

    Science.gov (United States)

    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.

  1. A block Krylov subspace time-exact solution method for linear ordinary differential equation systems

    NARCIS (Netherlands)

    Bochev, Mikhail A.

    2013-01-01

    We propose a time-exact Krylov-subspace-based method for solving linear ordinary differential equation systems of the form $y'=-Ay+g(t)$ and $y"=-Ay+g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of

  2. Development and adjustment of programs for solving systems of linear equations

    International Nuclear Information System (INIS)

    Fujimura, Toichiro

    1978-03-01

    Programs for solving the systems of linear equations have been adjusted and developed in expanding the scientific subroutine library SSL. The principal programs adjusted are based on the congruent method, method of product form of the inverse, orthogonal method, Crout's method for sparse system, and acceleration of iterative methods. The programs developed are based on the escalator method, direct parallel residue method and block tridiagonal method for band system. Described are usage of the programs developed and their future improvement. FORTRAN lists with simple examples in tests of the programs are also given. (auth.)

  3. "Real-Time Optical Laboratory Linear Algebra Solution Of Partial Differential Equations"

    Science.gov (United States)

    Casasent, David; Jackson, James

    1986-03-01

    A Space Integrating (SI) Optical Linear Algebra Processor (OLAP) employing space and frequency-multiplexing, new partitioning and data flow, and achieving high accuracy performance with a non base-2 number system is described. Laboratory data on the performance of this system and the solution of parabolic Partial Differential Equations (PDEs) is provided. A multi-processor OLAP system is also described for the first time. It use in the solution of multiple banded matrices that frequently arise is then discussed. The utility and flexibility of this processor compared to digital systolic architectures should be apparent.

  4. Graphs cospectral with a friendship graph or its complement

    Directory of Open Access Journals (Sweden)

    Alireza Abdollahi

    2013-12-01

    Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

  5. Higher derivative discontinuous solutions to linear ordinary differential equations: a new route to complexity?

    International Nuclear Information System (INIS)

    Datta, Dhurjati Prasad; Bose, Manoj Kumar

    2004-01-01

    We present a new one parameter family of second derivative discontinuous solutions to the simplest scale invariant linear ordinary differential equation. We also point out how the construction could be extended to generate families of higher derivative discontinuous solutions as well. The discontinuity can occur only for a subset of even order derivatives, viz., 2nd, 4th, 8th, 16th,.... The solutions are shown to break the discrete parity (reflection) symmetry of the underlying equation. These results are expected to gain significance in the contemporary search of a new dynamical principle for understanding complex phenomena in nature

  6. Engineering equations for characterizing non-linear laser intensity propagation in air with loss.

    Science.gov (United States)

    Karr, Thomas; Stotts, Larry B; Tellez, Jason A; Schmidt, Jason D; Mansell, Justin D

    2018-02-19

    The propagation of high peak-power laser beams in real atmospheres will be affected at long range by both linear and nonlinear effects contained therein. Arguably, J. H. Marburger is associated with the mathematical characterization of this phenomenon. This paper provides a validated set of engineering equations for characterizing the self-focusing distance from a laser beam propagating through non-turbulent air with, and without, loss as well as three source configurations: (1) no lens, (2) converging lens and (3) diverging lens. The validation was done against wave-optics simulation results. Some validated equations follow Marburger completely, but others do not, requiring modification of the original theory. Our results can provide a guide for numerical simulations and field experiments.

  7. The linearized pressure Poisson equation for global instability analysis of incompressible flows

    Science.gov (United States)

    Theofilis, Vassilis

    2017-12-01

    The linearized pressure Poisson equation (LPPE) is used in two and three spatial dimensions in the respective matrix-forming solution of the BiGlobal and TriGlobal eigenvalue problem in primitive variables on collocated grids. It provides a disturbance pressure boundary condition which is compatible with the recovery of perturbation velocity components that satisfy exactly the linearized continuity equation. The LPPE is employed to analyze instability in wall-bounded flows and in the prototype open Blasius boundary layer flow. In the closed flows, excellent agreement is shown between results of the LPPE and those of global linear instability analyses based on the time-stepping nektar++, Semtex and nek5000 codes, as well as with those obtained from the FreeFEM++ matrix-forming code. In the flat plate boundary layer, solutions extracted from the two-dimensional LPPE eigenvector at constant streamwise locations are found to be in very good agreement with profiles delivered by the NOLOT/PSE space marching code. Benchmark eigenvalue data are provided in all flows analyzed. The performance of the LPPE is seen to be superior to that of the commonly used pressure compatibility (PC) boundary condition: at any given resolution, the discrete part of the LPPE eigenspectrum contains converged and not converged, but physically correct, eigenvalues. By contrast, the PC boundary closure delivers some of the LPPE eigenvalues and, in addition, physically wrong eigenmodes. It is concluded that the LPPE should be used in place of the PC pressure boundary closure, when BiGlobal or TriGlobal eigenvalue problems are solved in primitive variables by the matrix-forming approach on collocated grids.

  8. Chemical Equation Balancing.

    Science.gov (United States)

    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)

  9. On the Evaluation of Computational Results Obtained from Solving System of linear Equations With matlab The Dual affine Scalling interior Point

    International Nuclear Information System (INIS)

    Murfi, Hendri; Basaruddin, T.

    2001-01-01

    The interior point method for linear programming has gained extraordinary interest as an alternative to simplex method since Karmarkar presented a polynomial-time algorithm for linear programming based on interior point method. In implementation of the algorithm of this method, there are two important things that have impact heavily to performance of the algorithm; they are data structure and used method to solve linear equation system in the algorithm. This paper describes about solving linear equation system in variants of the algorithm called dual-affine scaling algorithm. Next, we evaluate experimentally results of some used methods, either direct method or iterative method. The experimental evaluation used Matlab

  10. An implicit meshless scheme for the solution of transient non-linear Poisson-type equations

    KAUST Repository

    Bourantas, Georgios

    2013-07-01

    A meshfree point collocation method is used for the numerical simulation of both transient and steady state non-linear Poisson-type partial differential equations. Particular emphasis is placed on the application of the linearization method with special attention to the lagging of coefficients method and the Newton linearization method. The localized form of the Moving Least Squares (MLS) approximation is employed for the construction of the shape functions, in conjunction with the general framework of the point collocation method. Computations are performed for regular nodal distributions, stressing the positivity conditions that make the resulting system stable and convergent. The accuracy and the stability of the proposed scheme are demonstrated through representative and well-established benchmark problems. © 2013 Elsevier Ltd.

  11. An implicit meshless scheme for the solution of transient non-linear Poisson-type equations

    KAUST Repository

    Bourantas, Georgios; Burganos, Vasilis N.

    2013-01-01

    A meshfree point collocation method is used for the numerical simulation of both transient and steady state non-linear Poisson-type partial differential equations. Particular emphasis is placed on the application of the linearization method with special attention to the lagging of coefficients method and the Newton linearization method. The localized form of the Moving Least Squares (MLS) approximation is employed for the construction of the shape functions, in conjunction with the general framework of the point collocation method. Computations are performed for regular nodal distributions, stressing the positivity conditions that make the resulting system stable and convergent. The accuracy and the stability of the proposed scheme are demonstrated through representative and well-established benchmark problems. © 2013 Elsevier Ltd.

  12. Modeling Individual Damped Linear Oscillator Processes with Differential Equations: Using Surrogate Data Analysis to Estimate the Smoothing Parameter

    Science.gov (United States)

    Deboeck, Pascal R.; Boker, Steven M.; Bergeman, C. S.

    2008-01-01

    Among the many methods available for modeling intraindividual time series, differential equation modeling has several advantages that make it promising for applications to psychological data. One interesting differential equation model is that of the damped linear oscillator (DLO), which can be used to model variables that have a tendency to…

  13. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-11-12

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

  14. Topics in graph theory graphs and their Cartesian product

    CERN Document Server

    Imrich, Wilfried; Rall, Douglas F

    2008-01-01

    From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

  15. Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

    Science.gov (United States)

    Nagarathinam, R.; Parvathi, N.

    2018-04-01

    Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

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

    Science.gov (United States)

    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.

  17. On the Use of Linearized Euler Equations in the Prediction of Jet Noise

    Science.gov (United States)

    Mankbadi, Reda R.; Hixon, R.; Shih, S.-H.; Povinelli, L. A.

    1995-01-01

    Linearized Euler equations are used to simulate supersonic jet noise generation and propagation. Special attention is given to boundary treatment. The resulting solution is stable and nearly free from boundary reflections without the need for artificial dissipation, filtering, or a sponge layer. The computed solution is in good agreement with theory and observation and is much less CPU-intensive as compared to large-eddy simulations.

  18. Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

    Science.gov (United States)

    Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

    2018-02-01

    In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

  19. Parallels between control PDE's (Partial Differential Equations) and systems of ODE's (Ordinary Differential Equations)

    Science.gov (United States)

    Hunt, L. R.; Villarreal, Ramiro

    1987-01-01

    System theorists understand that the same mathematical objects which determine controllability for nonlinear control systems of ordinary differential equations (ODEs) also determine hypoellipticity for linear partial differentail equations (PDEs). Moreover, almost any study of ODE systems begins with linear systems. It is remarkable that Hormander's paper on hypoellipticity of second order linear p.d.e.'s starts with equations due to Kolmogorov, which are shown to be analogous to the linear PDEs. Eigenvalue placement by state feedback for a controllable linear system can be paralleled for a Kolmogorov equation if an appropriate type of feedback is introduced. Results concerning transformations of nonlinear systems to linear systems are similar to results for transforming a linear PDE to a Kolmogorov equation.

  20. Geometrical and Graphical Solutions of Quadratic Equations.

    Science.gov (United States)

    Hornsby, E. John, Jr.

    1990-01-01

    Presented are several geometrical and graphical methods of solving quadratic equations. Discussed are Greek origins, Carlyle's method, von Staudt's method, fixed graph methods and imaginary solutions. (CW)

  1. Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

    International Nuclear Information System (INIS)

    Gene Golub; Kwok Ko

    2009-01-01

    The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

  2. A bivariate Chebyshev spectral collocation quasilinearization method for nonlinear evolution parabolic equations.

    Science.gov (United States)

    Motsa, S S; Magagula, V M; Sibanda, P

    2014-01-01

    This paper presents a new method for solving higher order nonlinear evolution partial differential equations (NPDEs). The method combines quasilinearisation, the Chebyshev spectral collocation method, and bivariate Lagrange interpolation. In this paper, we use the method to solve several nonlinear evolution equations, such as the modified KdV-Burgers equation, highly nonlinear modified KdV equation, Fisher's equation, Burgers-Fisher equation, Burgers-Huxley equation, and the Fitzhugh-Nagumo equation. The results are compared with known exact analytical solutions from literature to confirm accuracy, convergence, and effectiveness of the method. There is congruence between the numerical results and the exact solutions to a high order of accuracy. Tables were generated to present the order of accuracy of the method; convergence graphs to verify convergence of the method and error graphs are presented to show the excellent agreement between the results from this study and the known results from literature.

  3. A Bivariate Chebyshev Spectral Collocation Quasilinearization Method for Nonlinear Evolution Parabolic Equations

    Directory of Open Access Journals (Sweden)

    S. S. Motsa

    2014-01-01

    Full Text Available This paper presents a new method for solving higher order nonlinear evolution partial differential equations (NPDEs. The method combines quasilinearisation, the Chebyshev spectral collocation method, and bivariate Lagrange interpolation. In this paper, we use the method to solve several nonlinear evolution equations, such as the modified KdV-Burgers equation, highly nonlinear modified KdV equation, Fisher's equation, Burgers-Fisher equation, Burgers-Huxley equation, and the Fitzhugh-Nagumo equation. The results are compared with known exact analytical solutions from literature to confirm accuracy, convergence, and effectiveness of the method. There is congruence between the numerical results and the exact solutions to a high order of accuracy. Tables were generated to present the order of accuracy of the method; convergence graphs to verify convergence of the method and error graphs are presented to show the excellent agreement between the results from this study and the known results from literature.

  4. Difference equations theory, applications and advanced topics

    CERN Document Server

    Mickens, Ronald E

    2015-01-01

    THE DIFFERENCE CALCULUS GENESIS OF DIFFERENCE EQUATIONS DEFINITIONS DERIVATION OF DIFFERENCE EQUATIONS EXISTENCE AND UNIQUENESS THEOREM OPERATORS ∆ AND E ELEMENTARY DIFFERENCE OPERATORS FACTORIAL POLYNOMIALS OPERATOR ∆−1 AND THE SUM CALCULUS FIRST-ORDER DIFFERENCE EQUATIONS INTRODUCTION GENERAL LINEAR EQUATION CONTINUED FRACTIONS A GENERAL FIRST-ORDER EQUATION: GEOMETRICAL METHODS A GENERAL FIRST-ORDER EQUATION: EXPANSION TECHNIQUES LINEAR DIFFERENCE EQUATIONSINTRODUCTION LINEARLY INDEPENDENT FUNCTIONS FUNDAMENTAL THEOREMS FOR HOMOGENEOUS EQUATIONSINHOMOGENEOUS EQUATIONS SECOND-ORDER EQUATIONS STURM-LIOUVILLE DIFFERENCE EQUATIONS LINEAR DIFFERENCE EQUATIONS INTRODUCTION HOMOGENEOUS EQUATIONS CONSTRUCTION OF A DIFFERENCE EQUATION HAVING SPECIFIED SOLUTIONS RELATIONSHIP BETWEEN LINEAR DIFFERENCE AND DIFFERENTIAL EQUATIONS INHOMOGENEOUS EQUATIONS: METHOD OF UNDETERMINED COEFFICIENTS INHOMOGENEOUS EQUATIONS: OPERATOR METHODS z-TRANSFORM METHOD SYSTEMS OF DIFFERENCE EQUATIONS LINEAR PARTIAL DIFFERENCE EQUATI...

  5. Handbook of graph grammars and computing by graph transformation

    CERN Document Server

    Engels, G; Kreowski, H J; Rozenberg, G

    1999-01-01

    Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran

  6. A characterization of horizontal visibility graphs and combinatorics on words

    Science.gov (United States)

    Gutin, Gregory; Mansour, Toufik; Severini, Simone

    2011-06-01

    A Horizontal Visibility Graph (HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between randomness and chaos Luque et al. [B. Luque, L. Lacasa, F. Ballesteros, J. Luque, Horizontal visibility graphs: exact results for random time series, Phys. Rev. E 80 (2009), 046103]. We prove that a graph is an HVG if and only if it is outerplanar and has a Hamilton path. Therefore, an HVG is a noncrossing graph, as defined in algebraic combinatorics Flajolet and Noy [P. Flajolet, M. Noy, Analytic combinatorics of noncrossing configurations, Discrete Math., 204 (1999) 203-229]. Our characterization of HVGs implies a linear time recognition algorithm. Treating ordered sets as words, we characterize subfamilies of HVGs highlighting various connections with combinatorial statistics and introducing the notion of a visible pair. With this technique, we determine asymptotically the average number of edges of HVGs.

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

    Science.gov (United States)

    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.

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

    International Nuclear Information System (INIS)

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

    2017-01-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. (paper)

  9. First-order systems of linear partial differential equations: normal forms, canonical systems, transform methods

    Directory of Open Access Journals (Sweden)

    Heinz Toparkus

    2014-04-01

    Full Text Available In this paper we consider first-order systems with constant coefficients for two real-valued functions of two real variables. This is both a problem in itself, as well as an alternative view of the classical linear partial differential equations of second order with constant coefficients. The classification of the systems is done using elementary methods of linear algebra. Each type presents its special canonical form in the associated characteristic coordinate system. Then you can formulate initial value problems in appropriate basic areas, and you can try to achieve a solution of these problems by means of transform methods.

  10. Linear analysis of neoclassical tearing mode based on the four-field reduced neoclassical MHD equation

    International Nuclear Information System (INIS)

    Furuya, Atsushi; Yagi, Masatoshi; Itoh, Sanae-I.

    2003-01-01

    The linear neoclassical tearing mode is investigated using the four-field reduced neoclassical MHD equations, in which the fluctuating ion parallel flow and ion neoclassical viscosity are taken into account. The dependences of the neoclassical tearing mode on collisionality, diamagnetic drift and q profile are investigated. These results are compared with the results from the conventional three-field model. It is shown that the linear neoclassical tearing mode is stabilized by the ion neoclassical viscosity in the banana regime even if Δ' > 0. (author)

  11. From modular invariants to graphs: the modular splitting method

    International Nuclear Information System (INIS)

    Isasi, E; Schieber, G

    2007-01-01

    We start with a given modular invariant M of a two-dimensional su-hat(n) k conformal field theory (CFT) and present a general method for solving the Ocneanu modular splitting equation and then determine, in a step-by-step explicit construction (1) the generalized partition functions corresponding to the introduction of boundary conditions and defect lines; (2) the quantum symmetries of the higher ADE graph G associated with the initial modular invariant M. Note that one does not suppose here that the graph G is already known, since it appears as a by-product of the calculations. We analyse several su-hat(3) k exceptional cases at levels 5 and 9

  12. Asymptotically linear Schrodinger equation with zero on the boundary of the spectrum

    Directory of Open Access Journals (Sweden)

    Dongdong Qin

    2015-08-01

    Full Text Available This article concerns the Schr\\"odinger equation $$\\displaylines{ -\\Delta u+V(xu=f(x, u, \\quad \\text{for } x\\in\\mathbb{R}^N,\\cr u(x\\to 0, \\quad \\text{as } |x| \\to \\infty, }$$ where V and f are periodic in x, and 0 is a boundary point of the spectrum $\\sigma(-\\Delta+V$. Assuming that f(x,u is asymptotically linear as $|u|\\to\\infty$, existence of a ground state solution is established using some new techniques.

  13. Monge-Ampere equations and tensorial functors

    International Nuclear Information System (INIS)

    Tunitsky, Dmitry V

    2009-01-01

    We consider differential-geometric structures associated with Monge-Ampere equations on manifolds and use them to study the contact linearization of such equations. We also consider the category of Monge-Ampere equations (the morphisms are contact diffeomorphisms) and a number of subcategories. We are chiefly interested in subcategories of Monge-Ampere equations whose objects are locally contact equivalent to equations linear in the second derivatives (semilinear equations), linear in derivatives, almost linear, linear in the second derivatives and independent of the first derivatives, linear, linear and independent of the first derivatives, equations with constant coefficients or evolution equations. We construct a number of functors from the category of Monge-Ampere equations and from some of its subcategories to the category of tensorial objects (that is, multi-valued sections of tensor bundles). In particular, we construct a pseudo-Riemannian metric for every generic Monge-Ampere equation. These functors enable us to establish effectively verifiable criteria for a Monge-Ampere equation to belong to the subcategories listed above.

  14. Introduction to differential equations

    CERN Document Server

    Taylor, Michael E

    2011-01-01

    The mathematical formulations of problems in physics, economics, biology, and other sciences are usually embodied in differential equations. The analysis of the resulting equations then provides new insight into the original problems. This book describes the tools for performing that analysis. The first chapter treats single differential equations, emphasizing linear and nonlinear first order equations, linear second order equations, and a class of nonlinear second order equations arising from Newton's laws. The first order linear theory starts with a self-contained presentation of the exponen

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

    Science.gov (United States)

    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…

  16. Brain Graph Topology Changes Associated with Anti-Epileptic Drug Use

    Science.gov (United States)

    Levin, Harvey S.; Chiang, Sharon

    2015-01-01

    Abstract Neuroimaging studies of functional connectivity using graph theory have furthered our understanding of the network structure in temporal lobe epilepsy (TLE). Brain network effects of anti-epileptic drugs could influence such studies, but have not been systematically studied. Resting-state functional MRI was analyzed in 25 patients with TLE using graph theory analysis. Patients were divided into two groups based on anti-epileptic medication use: those taking carbamazepine/oxcarbazepine (CBZ/OXC) (n=9) and those not taking CBZ/OXC (n=16) as a part of their medication regimen. The following graph topology metrics were analyzed: global efficiency, betweenness centrality (BC), clustering coefficient, and small-world index. Multiple linear regression was used to examine the association of CBZ/OXC with graph topology. The two groups did not differ from each other based on epilepsy characteristics. Use of CBZ/OXC was associated with a lower BC. Longer epilepsy duration was also associated with a lower BC. These findings can inform graph theory-based studies in patients with TLE. The changes observed are discussed in relation to the anti-epileptic mechanism of action and adverse effects of CBZ/OXC. PMID:25492633

  17. Vertex maps on graphs -- Perron-Frobenius Theory

    OpenAIRE

    Bernhardt, Chris

    2015-01-01

    The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of periodic orbits, about the concepts of transitivity and topological mixing, and about horseshoes and topological entropy. This is a preprint. The final version will appear in the Journal of Difference Equations and Applications.

  18. Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

    Directory of Open Access Journals (Sweden)

    Katona Gyula Y.

    2014-11-01

    Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

  19. Max-plus algebraic throughput analysis of synchronous dataflow graphs

    NARCIS (Netherlands)

    de Groote, Robert; Kuper, Jan; Broersma, Haitze J.; Smit, Gerardus Johannes Maria

    2012-01-01

    In this paper we present a novel approach to throughput analysis of synchronous dataflow (SDF) graphs. Our approach is based on describing the evolution of actor firing times as a linear time-invariant system in max-plus algebra. Experimental results indicate that our approach is faster than

  20. Optimal Control Strategies in a Two Dimensional Differential Game Using Linear Equation under a Perturbed System

    Directory of Open Access Journals (Sweden)

    Musa Danjuma SHEHU

    2008-06-01

    Full Text Available This paper lays emphasis on formulation of two dimensional differential games via optimal control theory and consideration of control systems whose dynamics is described by a system of Ordinary Differential equation in the form of linear equation under the influence of two controls U(. and V(.. Base on this, strategies were constructed. Hence we determine the optimal strategy for a control say U(. under a perturbation generated by the second control V(. within a given manifold M.