Visualising the Roots of Quadratic Equations with Complex Coefficients

ERIC Educational Resources Information Center

Bardell, Nicholas S.

2014-01-01

This paper is a natural extension of the root visualisation techniques first presented by Bardell (2012) for quadratic equations with real coefficients. Consideration is now given to the familiar quadratic equation "y = ax[superscript 2] + bx + c" in which the coefficients "a," "b," "c" are generally…

Bianchi type-I universe in Lyra manifold with quadratic equation of state

NASA Astrophysics Data System (ADS)

Şen, R.; Aygün, S.

2017-02-01

In this study, we have solved Einstein field equations for Bianchi type I universe model in Lyra manifold with quadratic equation of state (EoS) p = ap(t)2 - ρ(t). Where α ≠0 is an important constant. Cosmic pressure, density and displacement vector (β2) are related with α constant. In this study β2 is a decreasing function of time and behaves like a cosmological constant. These solutions agree with the studies of Halford, Pradhan and Singh, Aygün et al., Agarwal et al., Yadav and Haque as well as SN Ia observations.

Scaling Laws for the Multidimensional Burgers Equation with Quadratic External Potential

NASA Astrophysics Data System (ADS)

Leonenko, N. N.; Ruiz-Medina, M. D.

2006-07-01

The reordering of the multidimensional exponential quadratic operator in coordinate-momentum space (see X. Wang, C.H. Oh and L.C. Kwek (1998). J. Phys. A.: Math. Gen. 31:4329-4336) is applied to derive an explicit formulation of the solution to the multidimensional heat equation with quadratic external potential and random initial conditions. The solution to the multidimensional Burgers equation with quadratic external potential under Gaussian strongly dependent scenarios is also obtained via the Hopf-Cole transformation. The limiting distributions of scaling solutions to the multidimensional heat and Burgers equations with quadratic external potential are then obtained under such scenarios.

A neuro approach to solve fuzzy Riccati differential equations

NASA Astrophysics Data System (ADS)

Shahrir, Mohammad Shazri; Kumaresan, N.; Kamali, M. Z. M.; Ratnavelu, Kurunathan

2015-10-01

There are many applications of optimal control theory especially in the area of control systems in engineering. In this paper, fuzzy quadratic Riccati differential equation is estimated using neural networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). The solution can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that NN approach shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over RK4.

A neuro approach to solve fuzzy Riccati differential equations

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

Shahrir, Mohammad Shazri, E-mail: mshazri@gmail.com; Telekom Malaysia, R&D TM Innovation Centre, LingkaranTeknokrat Timur, 63000 Cyberjaya, Selangor; Kumaresan, N., E-mail: drnk2008@gmail.com

There are many applications of optimal control theory especially in the area of control systems in engineering. In this paper, fuzzy quadratic Riccati differential equation is estimated using neural networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). The solution can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that NN approach shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over RK4.

On the Rigorous Derivation of the 3D Cubic Nonlinear Schrödinger Equation with a Quadratic Trap

NASA Astrophysics Data System (ADS)

Chen, Xuwen

2013-11-01

We consider the dynamics of the three-dimensional N-body Schrödinger equation in the presence of a quadratic trap. We assume the pair interaction potential is N 3 β-1 V( N β x). We justify the mean-field approximation and offer a rigorous derivation of the three-dimensional cubic nonlinear Schrödinger equation (NLS) with a quadratic trap. We establish the space-time bound conjectured by Klainerman and Machedon (Commun Math Phys 279:169-185, 2008) for by adapting and simplifying an argument in Chen and Pavlović (Annales Henri Poincaré, 2013) which solves the problem for in the absence of a trap.

Geometrical Solutions of Some Quadratic Equations with Non-Real Roots

ERIC Educational Resources Information Center

Pathak, H. K.; Grewal, A. S.

2002-01-01

This note gives geometrical/graphical methods of finding solutions of the quadratic equation ax[squared] + bx + c = 0, a [not equal to] 0, with non-real roots. Three different cases which give rise to non-real roots of the quadratic equation have been discussed. In case I a geometrical construction and its proof for finding the solutions of the…

Exact solutions to quadratic gravity

NASA Astrophysics Data System (ADS)

Pravda, V.; Pravdová, A.; Podolský, J.; Švarc, R.

2017-04-01

Since all Einstein spacetimes are vacuum solutions to quadratic gravity in four dimensions, in this paper we study various aspects of non-Einstein vacuum solutions to this theory. Most such known solutions are of traceless Ricci and Petrov type N with a constant Ricci scalar. Thus we assume the Ricci scalar to be constant which leads to a substantial simplification of the field equations. We prove that a vacuum solution to quadratic gravity with traceless Ricci tensor of type N and aligned Weyl tensor of any Petrov type is necessarily a Kundt spacetime. This will considerably simplify the search for new non-Einstein solutions. Similarly, a vacuum solution to quadratic gravity with traceless Ricci type III and aligned Weyl tensor of Petrov type II or more special is again necessarily a Kundt spacetime. Then we study the general role of conformal transformations in constructing vacuum solutions to quadratic gravity. We find that such solutions can be obtained by solving one nonlinear partial differential equation for a conformal factor on any Einstein spacetime or, more generally, on any background with vanishing Bach tensor. In particular, we show that all geometries conformal to Kundt are either Kundt or Robinson-Trautman, and we provide some explicit Kundt and Robinson-Trautman solutions to quadratic gravity by solving the above mentioned equation on certain Kundt backgrounds.

Polynomial mixture method of solving ordinary differential equations

NASA Astrophysics Data System (ADS)

Shahrir, Mohammad Shazri; Nallasamy, Kumaresan; Ratnavelu, Kuru; Kamali, M. Z. M.

2017-11-01

In this paper, a numerical solution of fuzzy quadratic Riccati differential equation is estimated using a proposed new approach that provides mixture of polynomials where iteratively the right mixture will be generated. This mixture provide a generalized formalism of traditional Neural Networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). This can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that Polynomial Mixture Method (PMM) shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over Mabood et al, RK-4, Multi-Agent NN and Neuro Method (NM).

Geometric Approaches to Quadratic Equations from Other Times and Places.

ERIC Educational Resources Information Center

Allaire, Patricia R.; Bradley, Robert E.

2001-01-01

Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)

Analysis of Students' Error in Learning of Quadratic Equations

ERIC Educational Resources Information Center

Zakaria, Effandi; Ibrahim; Maat, Siti Mistima

2010-01-01

The purpose of the study was to determine the students' error in learning quadratic equation. The samples were 30 form three students from a secondary school in Jambi, Indonesia. Diagnostic test was used as the instrument of this study that included three components: factorization, completing the square and quadratic formula. Diagnostic interview…

Some Comments on the Use of de Moivre's Theorem to Solve Quadratic Equations with Real or Complex Coefficients

ERIC Educational Resources Information Center

Bardell, Nicholas S.

2014-01-01

This paper describes how a simple application of de Moivre's theorem may be used to not only find the roots of a quadratic equation with real or generally complex coefficients but also to pinpoint their location in the Argand plane. This approach is much simpler than the comprehensive analysis presented by Bardell (2012, 2014), but it does not…

Sketching the General Quadratic Equation Using Dynamic Geometry Software

ERIC Educational Resources Information Center

Stols, G. H.

2005-01-01

This paper explores a geometrical way to sketch graphs of the general quadratic in two variables with Geometer's Sketchpad. To do this, a geometric procedure as described by De Temple is used, bearing in mind that this general quadratic equation (1) represents all the possible conics (conics sections), and the fact that five points (no three of…

A Unified Approach to Teaching Quadratic and Cubic Equations.

ERIC Educational Resources Information Center

Ward, A. J. B.

2003-01-01

Presents a simple method for teaching the algebraic solution of cubic equations via completion of the cube. Shows that this method is readily accepted by students already familiar with completion of the square as a method for quadratic equations. (Author/KHR)

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1991-01-01

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

Solving Differential Equations in R: Package deSolve

EPA Science Inventory

In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...

Investigating Students' Mathematical Difficulties with Quadratic Equations

ERIC Educational Resources Information Center

O'Connor, Bronwyn Reid; Norton, Stephen

2016-01-01

This paper examines the factors that hinder students' success in working with and understanding the mathematics of quadratic equations using a case study analysis of student error patterns. Twenty-five Year 11 students were administered a written test to examine their understanding of concepts and procedures associated with this topic. The…

Finite-dimensional linear approximations of solutions to general irregular nonlinear operator equations and equations with quadratic operators

NASA Astrophysics Data System (ADS)

Kokurin, M. Yu.

2010-11-01

A general scheme for improving approximate solutions to irregular nonlinear operator equations in Hilbert spaces is proposed and analyzed in the presence of errors. A modification of this scheme designed for equations with quadratic operators is also examined. The technique of universal linear approximations of irregular equations is combined with the projection onto finite-dimensional subspaces of a special form. It is shown that, for finite-dimensional quadratic problems, the proposed scheme provides information about the global geometric properties of the intersections of quadrics.

Differences between quadratic equations and functions: Indonesian pre-service secondary mathematics teachers’ views

NASA Astrophysics Data System (ADS)

Aziz, T. A.; Pramudiani, P.; Purnomo, Y. W.

2018-01-01

Difference between quadratic equation and quadratic function as perceived by Indonesian pre-service secondary mathematics teachers (N = 55) who enrolled at one private university in Jakarta City was investigated. Analysis of participants’ written responses and interviews were conducted consecutively. Participants’ written responses highlighted differences between quadratic equation and function by referring to their general terms, main characteristics, processes, and geometrical aspects. However, they showed several obstacles in describing the differences such as inappropriate constraints and improper interpretations. Implications of the study are discussed.

Analysis of Quadratic Diophantine Equations with Fibonacci Number Solutions

ERIC Educational Resources Information Center

Leyendekkers, J. V.; Shannon, A. G.

2004-01-01

An analysis is made of the role of Fibonacci numbers in some quadratic Diophantine equations. A general solution is obtained for finding factors in sums of Fibonacci numbers. Interpretation of the results is facilitated by the use of a modular ring which also permits extension of the analysis.

One-Dimensional Fokker-Planck Equation with Quadratically Nonlinear Quasilocal Drift

NASA Astrophysics Data System (ADS)

Shapovalov, A. V.

2018-04-01

The Fokker-Planck equation in one-dimensional spacetime with quadratically nonlinear nonlocal drift in the quasilocal approximation is reduced with the help of scaling of the coordinates and time to a partial differential equation with a third derivative in the spatial variable. Determining equations for the symmetries of the reduced equation are derived and the Lie symmetries are found. A group invariant solution having the form of a traveling wave is found. Within the framework of Adomian's iterative method, the first iterations of an approximate solution of the Cauchy problem are obtained. Two illustrative examples of exact solutions are found.

Smoothing optimization of supporting quadratic surfaces with Zernike polynomials

NASA Astrophysics Data System (ADS)

Zhang, Hang; Lu, Jiandong; Liu, Rui; Ma, Peifu

2018-03-01

A new optimization method to get a smooth freeform optical surface from an initial surface generated by the supporting quadratic method (SQM) is proposed. To smooth the initial surface, a 9-vertex system from the neighbor quadratic surface and the Zernike polynomials are employed to establish a linear equation system. A local optimized surface to the 9-vertex system can be build by solving the equations. Finally, a continuous smooth optimization surface is constructed by stitching the above algorithm on the whole initial surface. The spot corresponding to the optimized surface is no longer discrete pixels but a continuous distribution.

A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.

PubMed

Li, Shuai; Li, Yangming; Wang, Zheng

2013-03-01

This paper presents a class of recurrent neural networks to solve quadratic programming problems. Different from most existing recurrent neural networks for solving quadratic programming problems, the proposed neural network model converges in finite time and the activation function is not required to be a hard-limiting function for finite convergence time. The stability, finite-time convergence property and the optimality of the proposed neural network for solving the original quadratic programming problem are proven in theory. Extensive simulations are performed to evaluate the performance of the neural network with different parameters. In addition, the proposed neural network is applied to solving the k-winner-take-all (k-WTA) problem. Both theoretical analysis and numerical simulations validate the effectiveness of our method for solving the k-WTA problem. Copyright © 2012 Elsevier Ltd. All rights reserved.

Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

NASA Astrophysics Data System (ADS)

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.

A curve fitting method for solving the flutter equation. M.S. Thesis

NASA Technical Reports Server (NTRS)

Cooper, J. L.

1972-01-01

A curve fitting approach was developed to solve the flutter equation for the critical flutter velocity. The psi versus nu curves are approximated by cubic and quadratic equations. The curve fitting technique utilized the first and second derivatives of psi with respect to nu. The method was tested for two structures, one structure being six times the total mass of the other structure. The algorithm never showed any tendency to diverge from the solution. The average time for the computation of a flutter velocity was 3.91 seconds on an IBM Model 50 computer for an accuracy of five per cent. For values of nu close to the critical root of the flutter equation the algorithm converged on the first attempt. The maximum number of iterations for convergence to the critical flutter velocity was five with an assumed value of nu relatively distant from the actual crossover.

Using Simple Quadratic Equations to Estimate Equilibrium Concentrations of an Acid

ERIC Educational Resources Information Center

Brilleslyper, Michael A.

2004-01-01

Application of quadratic equations to standard problem in chemistry like finding equilibrium concentrations of ions in an acid solution is explained. This clearly shows that pure mathematical analysis has meaningful applications in other areas as well.

Design of Linear Quadratic Regulators and Kalman Filters

NASA Technical Reports Server (NTRS)

Lehtinen, B.; Geyser, L.

1986-01-01

AESOP solves problems associated with design of controls and state estimators for linear time-invariant systems. Systems considered are modeled in state-variable form by set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are linear quadratic regulator (LQR) design problem and steady-state Kalman filter design problem. AESOP is interactive. User solves design problems and analyzes solutions in single interactive session. Both numerical and graphical information available to user during the session.

Finding Optimal Gains In Linear-Quadratic Control Problems

NASA Technical Reports Server (NTRS)

Milman, Mark H.; Scheid, Robert E., Jr.

1990-01-01

Analytical method based on Volterra factorization leads to new approximations for optimal control gains in finite-time linear-quadratic control problem of system having infinite number of dimensions. Circumvents need to analyze and solve Riccati equations and provides more transparent connection between dynamics of system and optimal gain.

Application of the sequential quadratic programming algorithm for reconstructing the distribution of optical parameters based on the time-domain radiative transfer equation.

PubMed

Qi, Hong; Qiao, Yao-Bin; Ren, Ya-Tao; Shi, Jing-Wen; Zhang, Ze-Yu; Ruan, Li-Ming

2016-10-17

Sequential quadratic programming (SQP) is used as an optimization algorithm to reconstruct the optical parameters based on the time-domain radiative transfer equation (TD-RTE). Numerous time-resolved measurement signals are obtained using the TD-RTE as forward model. For a high computational efficiency, the gradient of objective function is calculated using an adjoint equation technique. SQP algorithm is employed to solve the inverse problem and the regularization term based on the generalized Gaussian Markov random field (GGMRF) model is used to overcome the ill-posed problem. Simulated results show that the proposed reconstruction scheme performs efficiently and accurately.

Analytical approximations for the oscillators with anti-symmetric quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Alal Hosen, Md.; Chowdhury, M. S. H.; Yeakub Ali, Mohammad; Faris Ismail, Ahmad

2017-12-01

A second-order ordinary differential equation involving anti-symmetric quadratic nonlinearity changes sign. The behaviour of the oscillators with an anti-symmetric quadratic nonlinearity is assumed to oscillate different in the positive and negative directions. In this reason, Harmonic Balance Method (HBM) cannot be directly applied. The main purpose of the present paper is to propose an analytical approximation technique based on the HBM for obtaining approximate angular frequencies and the corresponding periodic solutions of the oscillators with anti-symmetric quadratic nonlinearity. After applying HBM, a set of complicated nonlinear algebraic equations is found. Analytical approach is not always fruitful for solving such kinds of nonlinear algebraic equations. In this article, two small parameters are found, for which the power series solution produces desired results. Moreover, the amplitude-frequency relationship has also been determined in a novel analytical way. The presented technique gives excellent results as compared with the corresponding numerical results and is better than the existing ones.

Quadratic Damping

ERIC Educational Resources Information Center

Fay, Temple H.

2012-01-01

Quadratic friction involves a discontinuous damping term in equations of motion in order that the frictional force always opposes the direction of the motion. Perhaps for this reason this topic is usually omitted from beginning texts in differential equations and physics. However, quadratic damping is more realistic than viscous damping in many…

Numerical solution of quadratic matrix equations for free vibration analysis of structures

NASA Technical Reports Server (NTRS)

Gupta, K. K.

1975-01-01

This paper is concerned with the efficient and accurate solution of the eigenvalue problem represented by quadratic matrix equations. Such matrix forms are obtained in connection with the free vibration analysis of structures, discretized by finite 'dynamic' elements, resulting in frequency-dependent stiffness and inertia matrices. The paper presents a new numerical solution procedure of the quadratic matrix equations, based on a combined Sturm sequence and inverse iteration technique enabling economical and accurate determination of a few required eigenvalues and associated vectors. An alternative procedure based on a simultaneous iteration procedure is also described when only the first few modes are the usual requirement. The employment of finite dynamic elements in conjunction with the presently developed eigenvalue routines results in a most significant economy in the dynamic analysis of structures.

Solving Equations Today.

ERIC Educational Resources Information Center

Shumway, Richard J.

1989-01-01

Illustrated is the problem of solving equations and some different strategies students might employ when using available technology. Gives illustrations for: exact solutions, approximate solutions, and approximate solutions which are graphically generated. (RT)

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

NASA Astrophysics Data System (ADS)

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

2007-02-01

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

Linear quadratic regulators with eigenvalue placement in a horizontal strip

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Dib, Hani M.; Ganesan, Sekar

1987-01-01

A method for optimally shifting the imaginary parts of the open-loop poles of a multivariable control system to the desirable closed-loop locations is presented. The optimal solution with respect to a quadratic performance index is obtained by solving a linear matrix Liapunov equation.

Visualising the Complex Roots of Quadratic Equations with Real Coefficients

ERIC Educational Resources Information Center

Bardell, Nicholas S.

2012-01-01

The roots of the general quadratic equation y = ax[superscript 2] + bx + c (real a, b, c) are known to occur in the following sets: (i) real and distinct; (ii) real and coincident; and (iii) a complex conjugate pair. Case (iii), which provides the focus for this investigation, can only occur when the values of the real coefficients a, b, and c are…

Neural network for solving convex quadratic bilevel programming problems.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

2014-03-01

In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

Students' Equation Understanding and Solving in Iran

ERIC Educational Resources Information Center

Barahmand, Ali; Shahvarani, Ahmad

2014-01-01

The purpose of the present article is to investigate how 15-year-old Iranian students interpret the concept of equation, its solution, and studying the relation between the students' equation understanding and solving. Data from two equation-solving exercises are reported. Data analysis shows that there is a significant relationship between…

Quadratic Optimisation with One Quadratic Equality Constraint

DTIC Science & Technology

2010-06-01

This report presents a theoretical framework for minimising a quadratic objective function subject to a quadratic equality constraint. The first part of the report gives a detailed algorithm which computes the global minimiser without calling special nonlinear optimisation solvers. The second part of the report shows how the developed theory can be applied to solve the time of arrival geolocation problem.

Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography.

PubMed

Biswas, Samir Kumar; Kanhirodan, Rajan; Vasu, Ram Mohan; Roy, Debasish

2011-08-01

We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data.

Observational constraints on cosmological models with Chaplygin gas and quadratic equation of state

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

Sharov, G.S., E-mail: german.sharov@mail.ru

Observational manifestations of accelerated expansion of the universe, in particular, recent data for Type Ia supernovae, baryon acoustic oscillations, for the Hubble parameter H ( z ) and cosmic microwave background constraints are described with different cosmological models. We compare the ΛCDM, the models with generalized and modified Chaplygin gas and the model with quadratic equation of state. For these models we estimate optimal model parameters and their permissible errors with different approaches to calculation of sound horizon scale r {sub s} ( z {sub d} ). Among the considered models the best value of χ{sup 2} is achieved formore » the model with quadratic equation of state, but it has 2 additional parameters in comparison with the ΛCDM and therefore is not favored by the Akaike information criterion.« less

Solving Cubic Equations by Polynomial Decomposition

ERIC Educational Resources Information Center

Kulkarni, Raghavendra G.

2011-01-01

Several mathematicians struggled to solve cubic equations, and in 1515 Scipione del Ferro reportedly solved the cubic while participating in a local mathematical contest, but did not bother to publish his method. Then it was Cardano (1539) who first published the solution to the general cubic equation in his book "The Great Art, or, The Rules of…

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

ERIC Educational Resources Information Center

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…

Quadratic equations in Banach space, perturbation techniques and applications to Chandrasekhar's and related equations

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

Argyros, I.K.

1984-01-01

In this dissertation perturbation techniques are developed, based on the contraction mapping principle which can be used to prove existence and uniqueness for the quadratic equation x = y + lambdaB(x,x) (1) in a Banach space X; here B: XxX..-->..X is a bounded, symmetric bilinear operator, lambda is a positive parameter and y as a subset of X is fixed. The following is the main result. Theorem. Suppose F: XxX..-->..X is a bounded, symmetric bilinear operator and that the equation z = y + lambdaF(z,z) has a solution z/sup */ of sufficiently small norm. Then equation (1) has a uniquemore » solution in a certain closed ball centered at z/sup */. Applications. The theorem is applied to the famous Chandrasekhar equation and to the Anselone-Moore system which are of the form (1) above and yields existence and uniqueness for a solution of (1) for larger values of lambda than previously known, as well as more accurate information on the location of solutions.« less

Failures and Inabilities of High School Students about Quadratic Equations and Functions

ERIC Educational Resources Information Center

Memnun, Dilek Sezgin; Aydin, Bünyamin; Dinç, Emre; Çoban, Merve; Sevindik, Fatma

2015-01-01

In this research study, it was aimed to examine failures and inabilities of eleventh grade students about quadratic equations and functions. For this purpose, these students were asked ten open-ended questions. The analysis of the answers given by the students to these questions indicated that a significant part of these students had failures and…

Students’ difficulties in solving linear equation problems

NASA Astrophysics Data System (ADS)

Wati, S.; Fitriana, L.; Mardiyana

2018-03-01

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

A General Method for Solving Systems of Non-Linear Equations

NASA Technical Reports Server (NTRS)

Nachtsheim, Philip R.; Deiss, Ron (Technical Monitor)

1995-01-01

The method of steepest descent is modified so that accelerated convergence is achieved near a root. It is assumed that the function of interest can be approximated near a root by a quadratic form. An eigenvector of the quadratic form is found by evaluating the function and its gradient at an arbitrary point and another suitably selected point. The terminal point of the eigenvector is chosen to lie on the line segment joining the two points. The terminal point found lies on an axis of the quadratic form. The selection of a suitable step size at this point leads directly to the root in the direction of steepest descent in a single step. Newton's root finding method not infrequently diverges if the starting point is far from the root. However, the current method in these regions merely reverts to the method of steepest descent with an adaptive step size. The current method's performance should match that of the Levenberg-Marquardt root finding method since they both share the ability to converge from a starting point far from the root and both exhibit quadratic convergence near a root. The Levenberg-Marquardt method requires storage for coefficients of linear equations. The current method which does not require the solution of linear equations requires more time for additional function and gradient evaluations. The classic trade off of time for space separates the two methods.

Lump solutions to nonlinear partial differential equations via Hirota bilinear forms

NASA Astrophysics Data System (ADS)

Ma, Wen-Xiu; Zhou, Yuan

2018-02-01

Lump solutions are analytical rational function solutions localized in all directions in space. We analyze a class of lump solutions, generated from quadratic functions, to nonlinear partial differential equations. The basis of success is the Hirota bilinear formulation and the primary object is the class of positive multivariate quadratic functions. A complete determination of quadratic functions positive in space and time is given, and positive quadratic functions are characterized as sums of squares of linear functions. Necessary and sufficient conditions for positive quadratic functions to solve Hirota bilinear equations are presented, and such polynomial solutions yield lump solutions to nonlinear partial differential equations under the dependent variable transformations u = 2(ln ⁡ f) x and u = 2(ln ⁡ f) xx, where x is one spatial variable. Applications are made for a few generalized KP and BKP equations.

Managing Element Interactivity in Equation Solving

ERIC Educational Resources Information Center

Ngu, Bing Hiong; Phan, Huy P.; Yeung, Alexander Seeshing; Chung, Siu Fung

2018-01-01

Between two popular teaching methods (i.e., balance method vs. inverse method) for equation solving, the main difference occurs at the operational line (e.g., +2 on both sides vs. -2 becomes +2), whereby it alters the state of the equation and yet maintains its equality. Element interactivity occurs on both sides of the equation in the balance…

Cognitive Load in Algebra: Element Interactivity in Solving Equations

ERIC Educational Resources Information Center

Ngu, Bing Hiong; Chung, Siu Fung; Yeung, Alexander Seeshing

2015-01-01

Central to equation solving is the maintenance of equivalence on both sides of the equation. However, when the process involves an interaction of multiple elements, solving an equation can impose a high cognitive load. The balance method requires operations on both sides of the equation, whereas the inverse method involves operations on one side…

Graphical Representation of Complex Solutions of the Quadratic Equation in the "xy" Plane

ERIC Educational Resources Information Center

McDonald, Todd

2006-01-01

This paper presents a visual representation of complex solutions of quadratic equations in the xy plane. Rather than moving to the complex plane, students are able to experience a geometric interpretation of the solutions in the xy plane. I am also working on these types of representations with higher order polynomials with some success.

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

NASA Astrophysics Data System (ADS)

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.

Parallel Algorithm Solves Coupled Differential Equations

NASA Technical Reports Server (NTRS)

Hayashi, A.

1987-01-01

Numerical methods adapted to concurrent processing. Algorithm solves set of coupled partial differential equations by numerical integration. Adapted to run on hypercube computer, algorithm separates problem into smaller problems solved concurrently. Increase in computing speed with concurrent processing over that achievable with conventional sequential processing appreciable, especially for large problems.

A new numerical approach to solve Thomas-Fermi model of an atom using bio-inspired heuristics integrated with sequential quadratic programming.

PubMed

Raja, Muhammad Asif Zahoor; Zameer, Aneela; Khan, Aziz Ullah; Wazwaz, Abdul Majid

2016-01-01

In this study, a novel bio-inspired computing approach is developed to analyze the dynamics of nonlinear singular Thomas-Fermi equation (TFE) arising in potential and charge density models of an atom by exploiting the strength of finite difference scheme (FDS) for discretization and optimization through genetic algorithms (GAs) hybrid with sequential quadratic programming. The FDS procedures are used to transform the TFE differential equations into a system of nonlinear equations. A fitness function is constructed based on the residual error of constituent equations in the mean square sense and is formulated as the minimization problem. Optimization of parameters for the system is carried out with GAs, used as a tool for viable global search integrated with SQP algorithm for rapid refinement of the results. The design scheme is applied to solve TFE for five different scenarios by taking various step sizes and different input intervals. Comparison of the proposed results with the state of the art numerical and analytical solutions reveals that the worth of our scheme in terms of accuracy and convergence. The reliability and effectiveness of the proposed scheme are validated through consistently getting optimal values of statistical performance indices calculated for a sufficiently large number of independent runs to establish its significance.

A garden of orchids: a generalized Harper equation at quadratic irrational frequencies

NASA Astrophysics Data System (ADS)

Mestel, B. D.; Osbaldestin, A. H.

2004-10-01

We consider a generalized Harper equation at quadratic irrational flux, showing, in the strong coupling limit, the fluctuations of the exponentially decaying eigenfunctions are governed by the dynamics of a renormalization operator on a renormalization strange set. This work generalizes previous analyses which have considered only the golden mean case. Projections of the renormalization strange sets are illustrated analogous to the 'orchid' present in the golden mean case.

A Versatile Technique for Solving Quintic Equations

ERIC Educational Resources Information Center

Kulkarni, Raghavendra G.

2006-01-01

In this paper we present a versatile technique to solve several types of solvable quintic equations. In the technique described here, the given quintic is first converted to a sextic equation by adding a root, and the resulting sextic equation is decomposed into two cubic polynomials as factors in a novel fashion. The resultant cubic equations are…

Inverse Scattering Problem For The Schrödinger Equation With An Additional Quadratic Potential On The Entire Axis

NASA Astrophysics Data System (ADS)

Guseinov, I. M.; Khanmamedov, A. Kh.; Mamedova, A. F.

2018-04-01

We consider the Schrödinger equation with an additional quadratic potential on the entire axis and use the transformation operator method to study the direct and inverse problems of the scattering theory. We obtain the main integral equations of the inverse problem and prove that the basic equations are uniquely solvable.

Solving Absolute Value Equations Algebraically and Geometrically

ERIC Educational Resources Information Center

Shiyuan, Wei

2005-01-01

The way in which students can improve their comprehension by understanding the geometrical meaning of algebraic equations or solving algebraic equation geometrically is described. Students can experiment with the conditions of the absolute value equation presented, for an interesting way to form an overall understanding of the concept.

W-algebra for solving problems with fuzzy parameters

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Encouraging Students to Think Strategically when Learning to Solve Linear Equations

ERIC Educational Resources Information Center

Robson, Daphne; Abell, Walt; Boustead, Therese

2012-01-01

Students who are preparing to study science and engineering need to understand equation solving but adult students returning to study can find this difficult. In this paper, the design of an online resource, Equations2go, for helping students learn to solve linear equations is investigated. Students learning to solve equations need to consider…

Eye Movements Reveal Students' Strategies in Simple Equation Solving

ERIC Educational Resources Information Center

Susac, Ana; Bubic, Andreja; Kaponja, Jurica; Planinic, Maja; Palmovic, Marijan

2014-01-01

Equation rearrangement is an important skill required for problem solving in mathematics and science. Eye movements of 40 university students were recorded while they were rearranging simple algebraic equations. The participants also reported on their strategies during equation solving in a separate questionnaire. The analysis of the behavioral…

Solving Equations of Multibody Dynamics

NASA Technical Reports Server (NTRS)

Jain, Abhinandan; Lim, Christopher

2007-01-01

Darts++ is a computer program for solving the equations of motion of a multibody system or of a multibody model of a dynamic system. It is intended especially for use in dynamical simulations performed in designing and analyzing, and developing software for the control of, complex mechanical systems. Darts++ is based on the Spatial-Operator- Algebra formulation for multibody dynamics. This software reads a description of a multibody system from a model data file, then constructs and implements an efficient algorithm that solves the dynamical equations of the system. The efficiency and, hence, the computational speed is sufficient to make Darts++ suitable for use in realtime closed-loop simulations. Darts++ features an object-oriented software architecture that enables reconfiguration of system topology at run time; in contrast, in related prior software, system topology is fixed during initialization. Darts++ provides an interface to scripting languages, including Tcl and Python, that enable the user to configure and interact with simulation objects at run time.

On supporting students' understanding of solving linear equation by using flowchart

NASA Astrophysics Data System (ADS)

Toyib, Muhamad; Kusmayadi, Tri Atmojo; Riyadi

2017-05-01

The aim of this study was to support 7th graders to gradually understand the concepts and procedures of solving linear equation. Thirty-two 7th graders of a Junior High School in Surakarta, Indonesia were involved in this study. Design research was used as the research approach to achieve the aim. A set of learning activities in solving linear equation with one unknown were designed based on Realistic Mathematics Education (RME) approach. The activities were started by playing LEGO to find a linear equation then solve the equation by using flowchart. The results indicate that using the realistic problems, playing LEGO could stimulate students to construct linear equation. Furthermore, Flowchart used to encourage students' reasoning and understanding on the concepts and procedures of solving linear equation with one unknown.

Optimal linear-quadratic control of coupled parabolic-hyperbolic PDEs

NASA Astrophysics Data System (ADS)

Aksikas, I.; Moghadam, A. Alizadeh; Forbes, J. F.

2017-10-01

This paper focuses on the optimal control design for a system of coupled parabolic-hypebolic partial differential equations by using the infinite-dimensional state-space description and the corresponding operator Riccati equation. Some dynamical properties of the coupled system of interest are analysed to guarantee the existence and uniqueness of the solution of the linear-quadratic (LQ)-optimal control problem. A state LQ-feedback operator is computed by solving the operator Riccati equation, which is converted into a set of algebraic and differential Riccati equations, thanks to the eigenvalues and the eigenvectors of the parabolic operator. The results are applied to a non-isothermal packed-bed catalytic reactor. The LQ-optimal controller designed in the early portion of the paper is implemented for the original nonlinear model. Numerical simulations are performed to show the controller performances.

Random vibrations of quadratic damping systems. [optimum damping analysis for automobile suspension system

NASA Technical Reports Server (NTRS)

Sireteanu, T.

1974-01-01

An oscillating system with quadratic damping subjected to white noise excitation is replaced by a nonlinear, statistically equivalent system for which the associated Fokker-Planck equation can be exactly solved. The mean square responses are calculated and the optimum damping coefficient is determined with respect to the minimum mean square acceleration criteria. An application of these results to the optimization of automobile suspension damping is given.

A quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints

NASA Technical Reports Server (NTRS)

Hanson, R. J.; Krogh, Fred T.

1992-01-01

A new algorithm for solving nonlinear least-squares and nonlinear equation problems is proposed which is based on approximating the nonlinear functions using the quadratic-tensor model by Schnabel and Frank. The algorithm uses a trust region defined by a box containing the current values of the unknowns. The algorithm is found to be effective for problems with linear constraints and dense Jacobian matrices.

Method of Conjugate Radii for Solving Linear and Nonlinear Systems

NASA Technical Reports Server (NTRS)

Nachtsheim, Philip R.

1999-01-01

This paper describes a method to solve a system of N linear equations in N steps. A quadratic form is developed involving the sum of the squares of the residuals of the equations. Equating the quadratic form to a constant yields a surface which is an ellipsoid. For different constants, a family of similar ellipsoids can be generated. Starting at an arbitrary point an orthogonal basis is constructed and the center of the family of similar ellipsoids is found in this basis by a sequence of projections. The coordinates of the center in this basis are the solution of linear system of equations. A quadratic form in N variables requires N projections. That is, the current method is an exact method. It is shown that the sequence of projections is equivalent to a special case of the Gram-Schmidt orthogonalization process. The current method enjoys an advantage not shared by the classic Method of Conjugate Gradients. The current method can be extended to nonlinear systems without modification. For nonlinear equations the Method of Conjugate Gradients has to be augmented with a line-search procedure. Results for linear and nonlinear problems are presented.

Solving constant-coefficient differential equations with dielectric metamaterials

NASA Astrophysics Data System (ADS)

Zhang, Weixuan; Qu, Che; Zhang, Xiangdong

2016-07-01

Recently, the concept of metamaterial analog computing has been proposed (Silva et al 2014 Science 343 160-3). Some mathematical operations such as spatial differentiation, integration, and convolution, have been performed by using designed metamaterial blocks. Motivated by this work, we propose a practical approach based on dielectric metamaterial to solve differential equations. The ordinary differential equation can be solved accurately by the correctly designed metamaterial system. The numerical simulations using well-established numerical routines have been performed to successfully verify all theoretical analyses.

The algebraic decoding of the (41, 21, 9) quadratic residue code

NASA Technical Reports Server (NTRS)

Reed, Irving S.; Truong, T. K.; Chen, Xuemin; Yin, Xiaowei

1992-01-01

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

Solution of quadratic matrix equations for free vibration analysis of structures.

NASA Technical Reports Server (NTRS)

Gupta, K. K.

1973-01-01

An efficient digital computer procedure and the related numerical algorithm are presented herein for the solution of quadratic matrix equations associated with free vibration analysis of structures. Such a procedure enables accurate and economical analysis of natural frequencies and associated modes of discretized structures. The numerically stable algorithm is based on the Sturm sequence method, which fully exploits the banded form of associated stiffness and mass matrices. The related computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be substantially more accurate and economical than other existing procedures of such analysis. Numerical examples are presented for two structures - a cantilever beam and a semicircular arch.

Solving Nonlinear Euler Equations with Arbitrary Accuracy

NASA Technical Reports Server (NTRS)

Dyson, Rodger W.

2005-01-01

A computer program that efficiently solves the time-dependent, nonlinear Euler equations in two dimensions to an arbitrarily high order of accuracy has been developed. The program implements a modified form of a prior arbitrary- accuracy simulation algorithm that is a member of the class of algorithms known in the art as modified expansion solution approximation (MESA) schemes. Whereas millions of lines of code were needed to implement the prior MESA algorithm, it is possible to implement the present MESA algorithm by use of one or a few pages of Fortran code, the exact amount depending on the specific application. The ability to solve the Euler equations to arbitrarily high accuracy is especially beneficial in simulations of aeroacoustic effects in settings in which fully nonlinear behavior is expected - for example, at stagnation points of fan blades, where linearizing assumptions break down. At these locations, it is necessary to solve the full nonlinear Euler equations, and inasmuch as the acoustical energy is of the order of 4 to 5 orders of magnitude below that of the mean flow, it is necessary to achieve an overall fractional error of less than 10-6 in order to faithfully simulate entropy, vortical, and acoustical waves.

Chirped self-similar waves for quadratic-cubic nonlinear Schrödinger equation

NASA Astrophysics Data System (ADS)

Pal, Ritu; Loomba, Shally; Kumar, C. N.

2017-12-01

We have constructed analytical self-similar wave solutions for quadratic-cubic Nonlinear Schrödinger equation (QC-NLSE) by means of similarity transformation method. Then, we have investigated the role of chirping on these self-similar waves as they propagate through the tapered graded index waveguide. We have revealed that the chirping leads to interesting features and allows us to control the propagation of self-similar waves. This has been demonstrated for two cases (i) periodically distributed system and (ii) constant choice of system parameters. We expect our results to be useful in designing high performance optical devices.

[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (2)].

PubMed

Murase, Kenya

2015-01-01

In this issue, symbolic methods for solving differential equations were firstly introduced. Of the symbolic methods, Laplace transform method was also introduced together with some examples, in which this method was applied to solving the differential equations derived from a two-compartment kinetic model and an equivalent circuit model for membrane potential. Second, series expansion methods for solving differential equations were introduced together with some examples, in which these methods were used to solve Bessel's and Legendre's differential equations. In the next issue, simultaneous differential equations and various methods for solving these differential equations will be introduced together with some examples in medical physics.

Matrix algorithms for solving (in)homogeneous bound state equations

PubMed Central

Blank, M.; Krassnigg, A.

2011-01-01

In the functional approach to quantum chromodynamics, the properties of hadronic bound states are accessible via covariant integral equations, e.g. the Bethe–Salpeter equation for mesons. In particular, one has to deal with linear, homogeneous integral equations which, in sophisticated model setups, use numerical representations of the solutions of other integral equations as part of their input. Analogously, inhomogeneous equations can be constructed to obtain off-shell information in addition to bound-state masses and other properties obtained from the covariant analogue to a wave function of the bound state. These can be solved very efficiently using well-known matrix algorithms for eigenvalues (in the homogeneous case) and the solution of linear systems (in the inhomogeneous case). We demonstrate this by solving the homogeneous and inhomogeneous Bethe–Salpeter equations and find, e.g. that for the calculation of the mass spectrum it is as efficient or even advantageous to use the inhomogeneous equation as compared to the homogeneous. This is valuable insight, in particular for the study of baryons in a three-quark setup and more involved systems. PMID:21760640

Experimental quantum computing to solve systems of linear equations.

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (1)].

PubMed

Murase, Kenya

2014-01-01

Utilization of differential equations and methods for solving them in medical physics are presented. First, the basic concept and the kinds of differential equations were overviewed. Second, separable differential equations and well-known first-order and second-order differential equations were introduced, and the methods for solving them were described together with several examples. In the next issue, the symbolic and series expansion methods for solving differential equations will be mainly introduced.

Synthesizing Strategies Creatively: Solving Linear Equations

ERIC Educational Resources Information Center

Ponce, Gregorio A.; Tuba, Imre

2015-01-01

New strategies can ignite teachers' imagination to create new lessons or adapt lessons created by others. In this article, the authors present the experience of an algebra teacher and his students solving linear and literal equations and explain how the use of ideas found in past NCTM journals helped bring this lesson to life. The…

An Unexpected Influence on a Quadratic

ERIC Educational Resources Information Center

Davis, Jon D.

2013-01-01

Using technology to explore the coefficients of a quadratic equation can lead to an unexpected result. This article describes an investigation that involves sliders and dynamically linked representations. It guides students to notice the effect that the parameter "a" has on the graphical representation of a quadratic function in the form…

Reverse and direct methods for solving the characteristic equation

NASA Astrophysics Data System (ADS)

Lozhkin, Alexander; Bozek, Pavol; Lyalin, Vadim; Tarasov, Vladimir; Tothova, Maria; Sultanov, Ravil

2016-06-01

Fundamentals of information-linguistic interpretation of the geometry presented shortly. The method of solving the characteristic equation based on Euler's formula is described. The separation of the characteristic equation for several disassembled for Jordan curves. Applications of the theory for problems of mechatronics outlined briefly.

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows

PubMed Central

Wang, Di; Kleinberg, Robert D.

2009-01-01

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C2, C3, C4,…. It is known that C2 can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing Ck (k > 2) require solving a linear program. In this paper we prove that C3 can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}n, this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network. PMID:20161596

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.

PubMed

Wang, Di; Kleinberg, Robert D

2009-11-28

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),…. It is known that C(2) can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing C(k) (k > 2) require solving a linear program. In this paper we prove that C(3) can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}(n), this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.

The generalized quadratic knapsack problem. A neuronal network approach.

PubMed

Talaván, Pedro M; Yáñez, Javier

2006-05-01

The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved. This problem, denoted as the generalized quadratic knapsack problem (GQKP), includes as particular cases well-known problems such as the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). This new energy function generalizes those proposed by other authors. Through this energy function, any GQKP can be solved with an appropriate parameter setting procedure, which is detailed in this paper. As a particular case, and in order to test this generalized energy function, some computational experiments solving the traveling salesman problem are also included.

Quadratic spline subroutine package

USGS Publications Warehouse

Rasmussen, Lowell A.

1982-01-01

A continuous piecewise quadratic function with continuous first derivative is devised for approximating a single-valued, but unknown, function represented by a set of discrete points. The quadratic is proposed as a treatment intermediate between using the angular (but reliable, easily constructed and manipulated) piecewise linear function and using the smoother (but occasionally erratic) cubic spline. Neither iteration nor the solution of a system of simultaneous equations is necessary to determining the coefficients. Several properties of the quadratic function are given. A set of five short FORTRAN subroutines is provided for generating the coefficients (QSC), finding function value and derivatives (QSY), integrating (QSI), finding extrema (QSE), and computing arc length and the curvature-squared integral (QSK). (USGS)

exponential finite difference technique for solving partial differential equations

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

Handschuh, R.F.

1987-01-01

An exponential finite difference algorithm, as first presented by Bhattacharya for one-dimensianal steady-state, heat conduction in Cartesian coordinates, has been extended. The finite difference algorithm developed was used to solve the diffusion equation in one-dimensional cylindrical coordinates and applied to two- and three-dimensional problems in Cartesian coordinates. The method was also used to solve nonlinear partial differential equations in one (Burger's equation) and two (Boundary Layer equations) dimensional Cartesian coordinates. Predicted results were compared to exact solutions where available, or to results obtained by other numerical methods. It was found that the exponential finite difference method produced results that weremore » more accurate than those obtained by other numerical methods, especially during the initial transient portion of the solution. Other applications made using the exponential finite difference technique included unsteady one-dimensional heat transfer with temperature varying thermal conductivity and the development of the temperature field in a laminar Couette flow.« less

Solving Nonlinear Differential Equations in the Engineering Curriculum

ERIC Educational Resources Information Center

Auslander, David M.

1977-01-01

Described is the Dynamic System Simulation Language (SIM) mini-computer system utilized at the University of California, Los Angeles. It is used by engineering students for solving nonlinear differential equations. (SL)

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

NASA Technical Reports Server (NTRS)

Armstrong, E. S.

1978-01-01

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

Matrix Methods for Solving Hartree-Fock Equations in Atomic Structure Calculations and Line Broadening

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

Gomez, Thomas; Nagayama, Taisuke; Fontes, Chris

Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods). Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numericalmore » complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange) part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. Here, this technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.« less

Matrix Methods for Solving Hartree-Fock Equations in Atomic Structure Calculations and Line Broadening

DOE PAGES

Gomez, Thomas; Nagayama, Taisuke; Fontes, Chris; ...

2018-04-23

Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods). Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numericalmore » complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange) part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. Here, this technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.« less

A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TRIANGULATED SURFACES*

PubMed Central

Fu, Zhisong; Jeong, Won-Ki; Pan, Yongsheng; Kirby, Robert M.; Whitaker, Ross T.

2012-01-01

This paper presents an efficient, fine-grained parallel algorithm for solving the Eikonal equation on triangular meshes. The Eikonal equation, and the broader class of Hamilton–Jacobi equations to which it belongs, have a wide range of applications from geometric optics and seismology to biological modeling and analysis of geometry and images. The ability to solve such equations accurately and efficiently provides new capabilities for exploring and visualizing parameter spaces and for solving inverse problems that rely on such equations in the forward model. Efficient solvers on state-of-the-art, parallel architectures require new algorithms that are not, in many cases, optimal, but are better suited to synchronous updates of the solution. In previous work [W. K. Jeong and R. T. Whitaker, SIAM J. Sci. Comput., 30 (2008), pp. 2512–2534], the authors proposed the fast iterative method (FIM) to efficiently solve the Eikonal equation on regular grids. In this paper we extend the fast iterative method to solve Eikonal equations efficiently on triangulated domains on the CPU and on parallel architectures, including graphics processors. We propose a new local update scheme that provides solutions of first-order accuracy for both architectures. We also propose a novel triangle-based update scheme and its corresponding data structure for efficient irregular data mapping to parallel single-instruction multiple-data (SIMD) processors. We provide detailed descriptions of the implementations on a single CPU, a multicore CPU with shared memory, and SIMD architectures with comparative results against state-of-the-art Eikonal solvers. PMID:22641200

Ten-Year-Old Students Solving Linear Equations

ERIC Educational Resources Information Center

Brizuela, Barbara; Schliemann, Analucia

2004-01-01

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

Vectorial finite elements for solving the radiative transfer equation

NASA Astrophysics Data System (ADS)

Badri, M. A.; Jolivet, P.; Rousseau, B.; Le Corre, S.; Digonnet, H.; Favennec, Y.

2018-06-01

The discrete ordinate method coupled with the finite element method is often used for the spatio-angular discretization of the radiative transfer equation. In this paper we attempt to improve upon such a discretization technique. Instead of using standard finite elements, we reformulate the radiative transfer equation using vectorial finite elements. In comparison to standard finite elements, this reformulation yields faster timings for the linear system assemblies, as well as for the solution phase when using scattering media. The proposed vectorial finite element discretization for solving the radiative transfer equation is cross-validated against a benchmark problem available in literature. In addition, we have used the method of manufactured solutions to verify the order of accuracy for our discretization technique within different absorbing, scattering, and emitting media. For solving large problems of radiation on parallel computers, the vectorial finite element method is parallelized using domain decomposition. The proposed domain decomposition method scales on large number of processes, and its performance is unaffected by the changes in optical thickness of the medium. Our parallel solver is used to solve a large scale radiative transfer problem of the Kelvin-cell radiation.

Adomian decomposition method used to solve the one-dimensional acoustic equations

NASA Astrophysics Data System (ADS)

Dispini, Meta; Mungkasi, Sudi

2017-05-01

In this paper we propose the use of Adomian decomposition method to solve one-dimensional acoustic equations. This recursive method can be calculated easily and the result is an approximation of the exact solution. We use the Maple software to compute the series in the Adomian decomposition. We obtain that the Adomian decomposition method is able to solve the acoustic equations with the physically correct behavior.

The Riemannian geometry is not sufficient for the geometrization of the Maxwell's equations

NASA Astrophysics Data System (ADS)

Kulyabov, Dmitry S.; Korolkova, Anna V.; Velieva, Tatyana R.

2018-04-01

The transformation optics uses geometrized Maxwell's constitutive equations to solve the inverse problem of optics, namely to solve the problem of finding the parameters of the medium along the paths of propagation of the electromagnetic field. For the geometrization of Maxwell's constitutive equations, the quadratic Riemannian geometry is usually used. This is due to the use of the approaches of the general relativity. However, there arises the question of the insufficiency of the Riemannian structure for describing the constitutive tensor of the Maxwell's equations. The authors analyze the structure of the constitutive tensor and correlate it with the structure of the metric tensor of Riemannian geometry. It is concluded that the use of the quadratic metric for the geometrization of Maxwell's equations is insufficient, since the number of components of the metric tensor is less than the number of components of the constitutive tensor. A possible solution to this problem may be a transition to Finslerian geometry, in particular, the use of the Berwald-Moor metric to establish the structural correspondence between the field tensors of the electromagnetic field.

On method of solving third-order ordinary differential equations directly using Bernstein polynomials

NASA Astrophysics Data System (ADS)

Khataybeh, S. N.; Hashim, I.

2018-04-01

In this paper, we propose for the first time a method based on Bernstein polynomials for solving directly a class of third-order ordinary differential equations (ODEs). This method gives a numerical solution by converting the equation into a system of algebraic equations which is solved directly. Some numerical examples are given to show the applicability of the method.

Preconditioning Strategies for Solving Elliptic Difference Equations on a Multiprocessor.

DTIC Science & Technology

1982-01-01

162, 1977. (MiGr8O] Mitchell, A., Griffiths, D., The Finite Difference Method in Partial Differential Equations , John Wiley & Sons, 1980. [Munk80...ADAL1b T35 AIR FO"CE INST OF TECH WRITG-PATTERSON AFS OH F/6 12/17PR CO ITIONIN STRATEGIES FOR SOLVING ELLIPTIC DIFFERENCE EWA-ETClU) 9UN S C K...TI TLE (ard S.tbr,,I) 5 TYPE OF REP’ORT & F IFIOD C_JVEFO Preconditioning Strategies for Solving Elliptic THESIS/VYYRY#YY0N Difference Equations on

Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (3).

PubMed

Murase, Kenya

2016-01-01

In this issue, simultaneous differential equations were introduced. These differential equations are often used in the field of medical physics. The methods for solving them were also introduced, which include Laplace transform and matrix methods. Some examples were also introduced, in which Laplace transform and matrix methods were applied to solving simultaneous differential equations derived from a three-compartment kinetic model for analyzing the glucose metabolism in tissues and Bloch equations for describing the behavior of the macroscopic magnetization in magnetic resonance imaging.In the next (final) issue, partial differential equations and various methods for solving them will be introduced together with some examples in medical physics.

Solving the Helmholtz equation in conformal mapped ARROW structures using homotopy perturbation method.

PubMed

Reck, Kasper; Thomsen, Erik V; Hansen, Ole

2011-01-31

The scalar wave equation, or Helmholtz equation, describes within a certain approximation the electromagnetic field distribution in a given system. In this paper we show how to solve the Helmholtz equation in complex geometries using conformal mapping and the homotopy perturbation method. The solution of the mapped Helmholtz equation is found by solving an infinite series of Poisson equations using two dimensional Fourier series. The solution is entirely based on analytical expressions and is not mesh dependent. The analytical results are compared to a numerical (finite element method) solution.

Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation.

PubMed

Li, Shuai; Li, Yangming

2013-10-28

The Sylvester equation is often encountered in mathematics and control theory. For the general time-invariant Sylvester equation problem, which is defined in the domain of complex numbers, the Bartels-Stewart algorithm and its extensions are effective and widely used with an O(n³) time complexity. When applied to solving the time-varying Sylvester equation, the computation burden increases intensively with the decrease of sampling period and cannot satisfy continuous realtime calculation requirements. For the special case of the general Sylvester equation problem defined in the domain of real numbers, gradient-based recurrent neural networks are able to solve the time-varying Sylvester equation in real time, but there always exists an estimation error while a recently proposed recurrent neural network by Zhang et al [this type of neural network is called Zhang neural network (ZNN)] converges to the solution ideally. The advancements in complex-valued neural networks cast light to extend the existing real-valued ZNN for solving the time-varying real-valued Sylvester equation to its counterpart in the domain of complex numbers. In this paper, a complex-valued ZNN for solving the complex-valued Sylvester equation problem is investigated and the global convergence of the neural network is proven with the proposed nonlinear complex-valued activation functions. Moreover, a special type of activation function with a core function, called sign-bi-power function, is proven to enable the ZNN to converge in finite time, which further enhances its advantage in online processing. In this case, the upper bound of the convergence time is also derived analytically. Simulations are performed to evaluate and compare the performance of the neural network with different parameters and activation functions. Both theoretical analysis and numerical simulations validate the effectiveness of the proposed method.

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

An efficient inverse radiotherapy planning method for VMAT using quadratic programming optimization.

PubMed

Hoegele, W; Loeschel, R; Merkle, N; Zygmanski, P

2012-01-01

The purpose of this study is to investigate the feasibility of an inverse planning optimization approach for the Volumetric Modulated Arc Therapy (VMAT) based on quadratic programming and the projection method. The performance of this method is evaluated against a reference commercial planning system (eclipse(TM) for rapidarc(TM)) for clinically relevant cases. The inverse problem is posed in terms of a linear combination of basis functions representing arclet dose contributions and their respective linear coefficients as degrees of freedom. MLC motion is decomposed into basic motion patterns in an intuitive manner leading to a system of equations with a relatively small number of equations and unknowns. These equations are solved using quadratic programming under certain limiting physical conditions for the solution, such as the avoidance of negative dose during optimization and Monitor Unit reduction. The modeling by the projection method assures a unique treatment plan with beneficial properties, such as the explicit relation between organ weightings and the final dose distribution. Clinical cases studied include prostate and spine treatments. The optimized plans are evaluated by comparing isodose lines, DVH profiles for target and normal organs, and Monitor Units to those obtained by the clinical treatment planning system eclipse(TM). The resulting dose distributions for a prostate (with rectum and bladder as organs at risk), and for a spine case (with kidneys, liver, lung and heart as organs at risk) are presented. Overall, the results indicate that similar plan qualities for quadratic programming (QP) and rapidarc(TM) could be achieved at significantly more efficient computational and planning effort using QP. Additionally, results for the quasimodo phantom [Bohsung et al., "IMRT treatment planning: A comparative inter-system and inter-centre planning exercise of the estro quasimodo group," Radiother. Oncol. 76(3), 354-361 (2005)] are presented as an example

Solving the interval type-2 fuzzy polynomial equation using the ranking method

NASA Astrophysics Data System (ADS)

Rahman, Nurhakimah Ab.; Abdullah, Lazim

2014-07-01

Polynomial equations with trapezoidal and triangular fuzzy numbers have attracted some interest among researchers in mathematics, engineering and social sciences. There are some methods that have been developed in order to solve these equations. In this study we are interested in introducing the interval type-2 fuzzy polynomial equation and solving it using the ranking method of fuzzy numbers. The ranking method concept was firstly proposed to find real roots of fuzzy polynomial equation. Therefore, the ranking method is applied to find real roots of the interval type-2 fuzzy polynomial equation. We transform the interval type-2 fuzzy polynomial equation to a system of crisp interval type-2 fuzzy polynomial equation. This transformation is performed using the ranking method of fuzzy numbers based on three parameters, namely value, ambiguity and fuzziness. Finally, we illustrate our approach by numerical example.

Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

PubMed Central

Southern, James A.; Plank, Gernot; Vigmond, Edward J.; Whiteley, Jonathan P.

2017-01-01

The bidomain equations are frequently used to model the propagation of cardiac action potentials across cardiac tissue. At the whole organ level the size of the computational mesh required makes their solution a significant computational challenge. As the accuracy of the numerical solution cannot be compromised, efficiency of the solution technique is important to ensure that the results of the simulation can be obtained in a reasonable time whilst still encapsulating the complexities of the system. In an attempt to increase efficiency of the solver, the bidomain equations are often decoupled into one parabolic equation that is computationally very cheap to solve and an elliptic equation that is much more expensive to solve. In this study the performance of this uncoupled solution method is compared with an alternative strategy in which the bidomain equations are solved as a coupled system. This seems counter-intuitive as the alternative method requires the solution of a much larger linear system at each time step. However, in tests on two 3-D rabbit ventricle benchmarks it is shown that the coupled method is up to 80% faster than the conventional uncoupled method — and that parallel performance is better for the larger coupled problem. PMID:19457741

Solving Fuzzy Fractional Differential Equations Using Zadeh's Extension Principle

PubMed Central

Ahmad, M. Z.; Hasan, M. K.; Abbasbandy, S.

2013-01-01

We study a fuzzy fractional differential equation (FFDE) and present its solution using Zadeh's extension principle. The proposed study extends the case of fuzzy differential equations of integer order. We also propose a numerical method to approximate the solution of FFDEs. To solve nonlinear problems, the proposed numerical method is then incorporated into an unconstrained optimisation technique. Several numerical examples are provided. PMID:24082853

New Galerkin operational matrices for solving Lane-Emden type equations

NASA Astrophysics Data System (ADS)

Abd-Elhameed, W. M.; Doha, E. H.; Saad, A. S.; Bassuony, M. A.

2016-04-01

Lane-Emden type equations model many phenomena in mathematical physics and astrophysics, such as thermal explosions. This paper is concerned with introducing third and fourth kind Chebyshev-Galerkin operational matrices in order to solve such problems. The principal idea behind the suggested algorithms is based on converting the linear or nonlinear Lane-Emden problem, through the application of suitable spectral methods, into a system of linear or nonlinear equations in the expansion coefficients, which can be efficiently solved. The main advantage of the proposed algorithm in the linear case is that the resulting linear systems are specially structured, and this of course reduces the computational effort required to solve such systems. As an application, we consider the solar model polytrope with n=3 to show that the suggested solutions in this paper are in good agreement with the numerical results.

Performance of parallel computation using CUDA for solving the one-dimensional elasticity equations

NASA Astrophysics Data System (ADS)

Darmawan, J. B. B.; Mungkasi, S.

2017-01-01

In this paper, we investigate the performance of parallel computation in solving the one-dimensional elasticity equations. Elasticity equations are usually implemented in engineering science. Solving these equations fast and efficiently is desired. Therefore, we propose the use of parallel computation. Our parallel computation uses CUDA of the NVIDIA. Our research results show that parallel computation using CUDA has a great advantage and is powerful when the computation is of large scale.

Computational complexities and storage requirements of some Riccati equation solvers

NASA Technical Reports Server (NTRS)

Utku, Senol; Garba, John A.; Ramesh, A. V.

1989-01-01

The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.

A method of solving simple harmonic oscillator Schroedinger equation

NASA Technical Reports Server (NTRS)

Maury, Juan Carlos F.

1995-01-01

A usual step in solving totally Schrodinger equation is to try first the case when dimensionless position independent variable w is large. In this case the Harmonic Oscillator equation takes the form (d(exp 2)/dw(exp 2) - w(exp 2))F = 0, and following W.K.B. method, it gives the intermediate corresponding solution F = exp(-w(exp 2)/2), which actually satisfies exactly another equation, (d(exp 2)/dw(exp 2) + 1 - w(exp 2))F = 0. We apply a different method, useful in anharmonic oscillator equations, similar to that of Rampal and Datta, and although it is slightly more complicated however it is also more general and systematic.

Using Computer Symbolic Algebra to Solve Differential Equations.

ERIC Educational Resources Information Center

Mathews, John H.

1989-01-01

This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)

Will learning to solve one-step equations pose a challenge to 8th grade students?

NASA Astrophysics Data System (ADS)

Ngu, Bing Hiong; Phan, Huy P.

2017-08-01

Assimilating multiple interactive elements simultaneously in working memory to allow understanding to occur, while solving an equation, would impose a high cognitive load. Element interactivity arises from the interaction between elements within and across operational and relational lines. Moreover, operating with special features (e.g. negative pronumeral) poses additional challenge to master equation solving skills. In an experiment, 41 8th grade students (girls = 16, boys = 25) sat for a pre-test, attended a session about equation solving, completed an acquisition phase which constituted the main intervention and were tested again in a post-test. The results showed that at post-test, students performed better on one-step equations tapping low rather than high element interactivity knowledge. In addition, students performed better on those one-step equations that contained no special features. Thus, both the degree of element interactivity and the operation with special features affect the challenge posed to 8th grade students on learning how to solve one-step equations.

A mixed finite-element method for solving the poroelastic Biot equations with electrokinetic coupling

NASA Astrophysics Data System (ADS)

Pain, C. C.; Saunders, J. H.; Worthington, M. H.; Singer, J. M.; Stuart-Bruges, W.; Mason, G.; Goddard, A.

2005-02-01

In this paper, a numerical method for solving the Biot poroelastic equations is developed. These equations comprise acoustic (typically water) and elastic (porous medium frame) equations, which are coupled mainly through fluid/solid drag terms. This wave solution is coupled to a simplified form of Maxwell's equations, which is solved for the streaming potential resulting from electrokinesis. The ultimate aim is to use the generated electrical signals to provide porosity, permeability and other information about the formation surrounding a borehole. The electrical signals are generated through electrokinesis by seismic waves causing movement of the fluid through pores or fractures of a porous medium. The focus of this paper is the numerical solution of the Biot equations in displacement form, which is achieved using a mixed finite-element formulation with a different finite-element representation for displacements and stresses. The mixed formulation is used in order to reduce spurious displacement modes and fluid shear waves in the numerical solutions. These equations are solved in the time domain using an implicit unconditionally stable time-stepping method using iterative solution methods amenable to solving large systems of equations. The resulting model is embodied in the MODELLING OF ACOUSTICS, POROELASTICS AND ELECTROKINETICS (MAPEK) computer model for electroseismic analysis.

Regge trajectories for heavy quarkonia from the quadratic form of the spinless Salpeter-type equation

NASA Astrophysics Data System (ADS)

Chen, Jiao-Kai

2018-03-01

In this paper, we present one new form of the Regge trajectories for heavy quarkonia which is obtained from the quadratic form of the spinless Salpeter-type equation (QSSE) by employing the Bohr-Sommerfeld quantization approach. The obtained Regge trajectories take the parameterized form M^2={β }({c_l}l+{π }n_r+c_0)^{2/3}+c_1, which are different from the present Regge trajectories. Then we apply the obtained Regge trajectories to fit the spectra of charmonia and bottomonia. The fitted Regge trajectories are in good agreement with the experimental data and the theoretical predictions.

Solving the Hamilton-Jacobi equation for general relativity

NASA Astrophysics Data System (ADS)

Parry, J.; Salopek, D. S.; Stewart, J. M.

1994-03-01

We demonstrate a systematic method for solving the Hamilton-Jacobi equation for general relativity with the inclusion of matter fields. The generating functional is expanded in a series of spatial gradients. Each term is manifestly invariant under reparametrizations of the spatial coordinates (``gauge invariant''). At each order we solve the Hamiltonian constraint using a conformal transformation of the three-metric as well as a line integral in superspace. This gives a recursion relation for the generating functional which then may be solved to arbitrary order simply by functionally differentiating previous orders. At fourth order in spatial gradients we demonstrate solutions for irrotational dust as well as for a scalar field. We explicitly evolve the three-metric to the same order. This method can be used to derive the Zel'dovich approximation for general relativity.

A second order discontinuous Galerkin fast sweeping method for Eikonal equations

NASA Astrophysics Data System (ADS)

Li, Fengyan; Shu, Chi-Wang; Zhang, Yong-Tao; Zhao, Hongkai

2008-09-01

In this paper, we construct a second order fast sweeping method with a discontinuous Galerkin (DG) local solver for computing viscosity solutions of a class of static Hamilton-Jacobi equations, namely the Eikonal equations. Our piecewise linear DG local solver is built on a DG method developed recently [Y. Cheng, C.-W. Shu, A discontinuous Galerkin finite element method for directly solving the Hamilton-Jacobi equations, Journal of Computational Physics 223 (2007) 398-415] for the time-dependent Hamilton-Jacobi equations. The causality property of Eikonal equations is incorporated into the design of this solver. The resulting local nonlinear system in the Gauss-Seidel iterations is a simple quadratic system and can be solved explicitly. The compactness of the DG method and the fast sweeping strategy lead to fast convergence of the new scheme for Eikonal equations. Extensive numerical examples verify efficiency, convergence and second order accuracy of the proposed method.

Two healing lengths in a two-band GL-model with quadratic terms: Numerical results

NASA Astrophysics Data System (ADS)

Macias-Medri, A. E.; Rodríguez-Núñez, J. J.

2018-05-01

A two-band and quartic interaction order Ginzburg-Landau model in the presence of a single vortex is studied in this work. Interactions of second (quadratic, with coupling parameter γ) and fourth (quartic, with coupling parameter γ˜) order between the two superconducting order parameters (fi with i = 1,2) are incorporated in a functional. Terms beyond quadratic gradient contributions are neglected in the corresponding minimized free energy. The solution of the system of coupled equations is solved by numerical methods to obtain the fi-profiles, where our starting point was the calculation of the superconducting critical temperature Tc. With this at hand, we evaluate fi and the magnetic field along the z-axis, B0, as function of γ, γ˜, the radial distance r/λ1(0) and the temperature T, for T ≈ Tc. The self-consistent equations allow us to compute λ (penetration depth) and the healing lengths of fi (Lhi with i = 1,2) as functions of T, γ and γ˜. At the end, relevant discussions about type-1.5 superconductivity in the compounds we have studied are presented.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

A new technique for solving the Parker-type wind equations

NASA Technical Reports Server (NTRS)

Melia, Fulvio

1988-01-01

Substitution of the novel function Phi for velocity, as one of the dependent variables in Parker-type solar wind equations, removes the critical point, and therefore the numerical difficulties encountered, from the set of coupled differential wind equations. The method has already been successfully used in a study of radiatively-driven mass loss from the surface of X-ray bursting neutron stars. The present technique for solving the equations of time-independent mass loss can be useful in similar applications.

Non-standard finite difference and Chebyshev collocation methods for solving fractional diffusion equation

NASA Astrophysics Data System (ADS)

Agarwal, P.; El-Sayed, A. A.

2018-06-01

In this paper, a new numerical technique for solving the fractional order diffusion equation is introduced. This technique basically depends on the Non-Standard finite difference method (NSFD) and Chebyshev collocation method, where the fractional derivatives are described in terms of the Caputo sense. The Chebyshev collocation method with the (NSFD) method is used to convert the problem into a system of algebraic equations. These equations solved numerically using Newton's iteration method. The applicability, reliability, and efficiency of the presented technique are demonstrated through some given numerical examples.

Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior

PubMed Central

Serang, Oliver

2012-01-01

Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a novel randomized method of solving LP problems by moving along the facets and within the interior of the polytope along rays randomly sampled from the polyhedral cones defined by the bounding constraints. This conic sampling method is then applied to randomly sampled LPs, and its runtime performance is shown to compare favorably to the simplex and primal affine-scaling algorithms, especially on polytopes with certain characteristics. The conic sampling method is then adapted and applied to solve a certain quadratic program, which compute a projection onto a polytope; the proposed method is shown to outperform the proprietary software Mathematica on large, sparse QP problems constructed from mass spectometry-based proteomics. PMID:22952741

Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis

NASA Technical Reports Server (NTRS)

Thompson, P. M.

1979-01-01

Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

Computing the Partial Fraction Decomposition of Rational Functions with Irreducible Quadratic Factors in the Denominators

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2012-01-01

In this note, a new method for computing the partial fraction decomposition of rational functions with irreducible quadratic factors in the denominators is presented. This method involves polynomial divisions and substitutions only, without having to solve for the complex roots of the irreducible quadratic polynomial or to solve a system of linear…

Algebraic approach to solve ttbar dilepton equations

NASA Astrophysics Data System (ADS)

Sonnenschein, Lars

2006-01-01

The set of non-linear equations describing the Standard Model kinematics of the top quark an- tiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most precise and robust solution is of major importance for measurements of top quark properties like the top quark mass and t t spin correlations. Simple algebraic operations allow to transform the non-linear equations into a system of two polynomial equations with two unknowns. These two polynomials of multidegree eight can in turn be an- alytically reduced to one polynomial with one unknown by means of resultants. The obtained univariate polynomial is of degree sixteen and the coefficients are free of any singularity. The number of its real solutions is determined analytically by means of Sturm’s theorem, which is as well used to isolate each real solution into a unique pairwise disjoint interval. The solutions are polished by seeking the sign change of the polynomial in a given interval through binary brack- eting. Further a new Ansatz - exploiting an accidental cancelation in the process of transforming the equations - is presented. It permits to transform the initial system of equations into two poly- nomial equations with two unknowns. These two polynomials of multidegree two can be reduced to one univariate polynomial of degree four by means of resultants. The obtained quartic equation can be solved analytically. The analytical solution has singularities which can be circumvented by the algebraic approach described above.

Solving ordinary differential equations by electrical analogy: a multidisciplinary teaching tool

NASA Astrophysics Data System (ADS)

Sanchez Perez, J. F.; Conesa, M.; Alhama, I.

2016-11-01

Ordinary differential equations are the mathematical formulation for a great variety of problems in science and engineering, and frequently, two different problems are equivalent from a mathematical point of view when they are formulated by the same equations. Students acquire the knowledge of how to solve these equations (at least some types of them) using protocols and strict algorithms of mathematical calculation without thinking about the meaning of the equation. The aim of this work is that students learn to design network models or circuits in this way; with simple knowledge of them, students can establish the association of electric circuits and differential equations and their equivalences, from a formal point of view, that allows them to associate knowledge of two disciplines and promote the use of this interdisciplinary approach to address complex problems. Therefore, they learn to use a multidisciplinary tool that allows them to solve these kinds of equations, even students of first course of engineering, whatever the order, grade or type of non-linearity. This methodology has been implemented in numerous final degree projects in engineering and science, e.g., chemical engineering, building engineering, industrial engineering, mechanical engineering, architecture, etc. Applications are presented to illustrate the subject of this manuscript.

Solving nonlinear evolution equation system using two different methods

NASA Astrophysics Data System (ADS)

Kaplan, Melike; Bekir, Ahmet; Ozer, Mehmet N.

2015-12-01

This paper deals with constructing more general exact solutions of the coupled Higgs equation by using the (G0/G, 1/G)-expansion and (1/G0)-expansion methods. The obtained solutions are expressed by three types of functions: hyperbolic, trigonometric and rational functions with free parameters. It has been shown that the suggested methods are productive and will be used to solve nonlinear partial differential equations in applied mathematics and engineering. Throughout the paper, all the calculations are made with the aid of the Maple software.

The change of the brain activation patterns as children learn algebra equation solving

NASA Astrophysics Data System (ADS)

Qin, Yulin; Carter, Cameron S.; Silk, Eli M.; Stenger, V. Andrew; Fissell, Kate; Goode, Adam; Anderson, John R.

2004-04-01

In a brain imaging study of children learning algebra, it is shown that the same regions are active in children solving equations as are active in experienced adults solving equations. As with adults, practice in symbol manipulation produces a reduced activation in prefrontal cortex area. However, unlike adults, practice seems also to produce a decrease in a parietal area that is holding an image of the equation. This finding suggests that adolescents' brain responses are more plastic and change more with practice. These results are integrated in a cognitive model that predicts both the behavioral and brain imaging results.

Measures of Potential Flexibility and Practical Flexibility in Equation Solving.

PubMed

Xu, Le; Liu, Ru-De; Star, Jon R; Wang, Jia; Liu, Ying; Zhen, Rui

2017-01-01

Researchers interested in mathematical proficiency have recently begun to explore the development of strategic flexibility, where flexibility is defined as knowledge of multiple strategies for solving a problem and the ability to implement an innovative strategy for a given problem solving circumstance. However, anecdotal findings from this literature indicate that students do not consistently use an innovative strategy for solving a given problem, even when these same students demonstrate knowledge of innovative strategies. This distinction, sometimes framed in the psychological literature as competence vs. performance-has not been previously studied for flexibility. In order to explore the competence/performance distinction in flexibility, this study developed and validated measures for potential flexibility (e.g., competence, or knowledge of multiple strategies) and practical flexibility (e.g., performance, use of innovative strategies) for solving equations. The measures were administrated to a sample of 158 Chinese middle school students through a Tri-Phase Flexibility Assessment, in which the students were asked to solve each equation, generate additional strategies, and evaluate own multiple strategies. Confirmatory factor analysis supported a two-factor model of potential and practical flexibility. Satisfactory internal consistency was found for the measures. Additional validity evidence included the significant association with flexibility measured with the previous method. Potential flexibility and practical flexibility were found to be distinct but related. The theoretical and practical implications of the concepts and their measures of potential flexibility and practical flexibility are discussed.

Measures of Potential Flexibility and Practical Flexibility in Equation Solving

PubMed Central

Xu, Le; Liu, Ru-De; Star, Jon R.; Wang, Jia; Liu, Ying; Zhen, Rui

2017-01-01

Researchers interested in mathematical proficiency have recently begun to explore the development of strategic flexibility, where flexibility is defined as knowledge of multiple strategies for solving a problem and the ability to implement an innovative strategy for a given problem solving circumstance. However, anecdotal findings from this literature indicate that students do not consistently use an innovative strategy for solving a given problem, even when these same students demonstrate knowledge of innovative strategies. This distinction, sometimes framed in the psychological literature as competence vs. performance—has not been previously studied for flexibility. In order to explore the competence/performance distinction in flexibility, this study developed and validated measures for potential flexibility (e.g., competence, or knowledge of multiple strategies) and practical flexibility (e.g., performance, use of innovative strategies) for solving equations. The measures were administrated to a sample of 158 Chinese middle school students through a Tri-Phase Flexibility Assessment, in which the students were asked to solve each equation, generate additional strategies, and evaluate own multiple strategies. Confirmatory factor analysis supported a two-factor model of potential and practical flexibility. Satisfactory internal consistency was found for the measures. Additional validity evidence included the significant association with flexibility measured with the previous method. Potential flexibility and practical flexibility were found to be distinct but related. The theoretical and practical implications of the concepts and their measures of potential flexibility and practical flexibility are discussed. PMID:28848481

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

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

Perceptual support promotes strategy generation: Evidence from equation solving.

PubMed

Alibali, Martha W; Crooks, Noelle M; McNeil, Nicole M

2017-08-30

Over time, children shift from using less optimal strategies for solving mathematics problems to using better ones. But why do children generate new strategies? We argue that they do so when they begin to encode problems more accurately; therefore, we hypothesized that perceptual support for correct encoding would foster strategy generation. Fourth-grade students solved mathematical equivalence problems (e.g., 3 + 4 + 5 = 3 + __) in a pre-test. They were then randomly assigned to one of three perceptual support conditions or to a Control condition. Participants in all conditions completed three mathematical equivalence problems with feedback about correctness. Participants in the experimental conditions received perceptual support (i.e., highlighting in red ink) for accurately encoding the equal sign, the right side of the equation, or the numbers that could be added to obtain the correct solution. Following this intervention, participants completed a problem-solving post-test. Among participants who solved the problems incorrectly at pre-test, those who received perceptual support for correctly encoding the equal sign were more likely to generate new, correct strategies for solving the problems than were those who received feedback only. Thus, perceptual support for accurate encoding of a key problem feature promoted generation of new, correct strategies. Statement of Contribution What is already known on this subject? With age and experience, children shift to using more effective strategies for solving math problems. Problem encoding also improves with age and experience. What the present study adds? Support for encoding the equal sign led children to generate correct strategies for solving equations. Improvements in problem encoding are one source of new strategies. © 2017 The British Psychological Society.

Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (4).

PubMed

Murase, Kenya

2016-01-01

Partial differential equations are often used in the field of medical physics. In this (final) issue, the methods for solving the partial differential equations were introduced, which include separation of variables, integral transform (Fourier and Fourier-sine transforms), Green's function, and series expansion methods. Some examples were also introduced, in which the integral transform and Green's function methods were applied to solving Pennes' bioheat transfer equation and the Fourier series expansion method was applied to Navier-Stokes equation for analyzing the wall shear stress in blood vessels.Finally, the author hopes that this series will be helpful for people who engage in medical physics.

Solving Partial Differential Equations on Overlapping Grids

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

Henshaw, W D

2008-09-22

We discuss the solution of partial differential equations (PDEs) on overlapping grids. This is a powerful technique for efficiently solving problems in complex, possibly moving, geometry. An overlapping grid consists of a set of structured grids that overlap and cover the computational domain. By allowing the grids to overlap, grids for complex geometries can be more easily constructed. The overlapping grid approach can also be used to remove coordinate singularities by, for example, covering a sphere with two or more patches. We describe the application of the overlapping grid approach to a variety of different problems. These include the solutionmore » of incompressible fluid flows with moving and deforming geometry, the solution of high-speed compressible reactive flow with rigid bodies using adaptive mesh refinement (AMR), and the solution of the time-domain Maxwell's equations of electromagnetism.« less

Newton's laws of motion in the form of a Riccati equation.

PubMed

Nowakowski, Marek; Rosu, Haret C

2002-04-01

We discuss two applications of a Riccati equation to Newton's laws of motion. The first one is the motion of a particle under the influence of a power law central potential V(r)=kr(epsilon). For zero total energy we show that the equation of motion can be cast in the Riccati form. We briefly show here an analogy to barotropic Friedmann-Robertson-Lemaitre cosmology where the expansion of the universe can be also shown to obey a Riccati equation. A second application in classical mechanics, where again the Riccati equation appears naturally, are problems involving quadratic friction. We use methods reminiscent to nonrelativistic supersymmetry to generalize and solve such problems.

All-optical computation system for solving differential equations based on optical intensity differentiator.

PubMed

Tan, Sisi; Wu, Zhao; Lei, Lei; Hu, Shoujin; Dong, Jianji; Zhang, Xinliang

2013-03-25

We propose and experimentally demonstrate an all-optical differentiator-based computation system used for solving constant-coefficient first-order linear ordinary differential equations. It consists of an all-optical intensity differentiator and a wavelength converter, both based on a semiconductor optical amplifier (SOA) and an optical filter (OF). The equation is solved for various values of the constant-coefficient and two considered input waveforms, namely, super-Gaussian and Gaussian signals. An excellent agreement between the numerical simulation and the experimental results is obtained.

Mathematics Literacy of Secondary Students in Solving Simultanenous Linear Equations

NASA Astrophysics Data System (ADS)

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.

A Factorization Approach to the Linear Regulator Quadratic Cost Problem

NASA Technical Reports Server (NTRS)

Milman, M. H.

1985-01-01

A factorization approach to the linear regulator quadratic cost problem is developed. This approach makes some new connections between optimal control, factorization, Riccati equations and certain Wiener-Hopf operator equations. Applications of the theory to systems describable by evolution equations in Hilbert space and differential delay equations in Euclidean space are presented.

Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations

NASA Astrophysics Data System (ADS)

Recchioni, Maria Cristina

2001-12-01

This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite-Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite-Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.

Determining the Optimal Solution for Quadratically Constrained Quadratic Programming (QCQP) on Energy-Saving Generation Dispatch Problem

NASA Astrophysics Data System (ADS)

Lesmana, E.; Chaerani, D.; Khansa, H. N.

2018-03-01

Energy-Saving Generation Dispatch (ESGD) is a scheme made by Chinese Government in attempt to minimize CO2 emission produced by power plant. This scheme is made related to global warming which is primarily caused by too much CO2 in earth’s atmosphere, and while the need of electricity is something absolute, the power plants producing it are mostly thermal-power plant which produced many CO2. Many approach to fulfill this scheme has been made, one of them came through Minimum Cost Flow in which resulted in a Quadratically Constrained Quadratic Programming (QCQP) form. In this paper, ESGD problem with Minimum Cost Flow in QCQP form will be solved using Lagrange’s Multiplier Method

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

NASA Astrophysics Data System (ADS)

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

2015-08-01

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

An efficient numerical method for solving the Boltzmann equation in multidimensions

NASA Astrophysics Data System (ADS)

Dimarco, Giacomo; Loubère, Raphaël; Narski, Jacek; Rey, Thomas

2018-01-01

In this paper we deal with the extension of the Fast Kinetic Scheme (FKS) (Dimarco and Loubère, 2013 [26]) originally constructed for solving the BGK equation, to the more challenging case of the Boltzmann equation. The scheme combines a robust and fast method for treating the transport part based on an innovative Lagrangian technique supplemented with conservative fast spectral schemes to treat the collisional operator by means of an operator splitting approach. This approach along with several implementation features related to the parallelization of the algorithm permits to construct an efficient simulation tool which is numerically tested against exact and reference solutions on classical problems arising in rarefied gas dynamic. We present results up to the 3 D × 3 D case for unsteady flows for the Variable Hard Sphere model which may serve as benchmark for future comparisons between different numerical methods for solving the multidimensional Boltzmann equation. For this reason, we also provide for each problem studied details on the computational cost and memory consumption as well as comparisons with the BGK model or the limit model of compressible Euler equations.

Quadratic adaptive algorithm for solving cardiac action potential models.

PubMed

Chen, Min-Hung; Chen, Po-Yuan; Luo, Ching-Hsing

2016-10-01

An adaptive integration method is proposed for computing cardiac action potential models accurately and efficiently. Time steps are adaptively chosen by solving a quadratic formula involving the first and second derivatives of the membrane action potential. To improve the numerical accuracy, we devise an extremum-locator (el) function to predict the local extremum when approaching the peak amplitude of the action potential. In addition, the time step restriction (tsr) technique is designed to limit the increase in time steps, and thus prevent the membrane potential from changing abruptly. The performance of the proposed method is tested using the Luo-Rudy phase 1 (LR1), dynamic (LR2), and human O'Hara-Rudy dynamic (ORd) ventricular action potential models, and the Courtemanche atrial model incorporating a Markov sodium channel model. Numerical experiments demonstrate that the action potential generated using the proposed method is more accurate than that using the traditional Hybrid method, especially near the peak region. The traditional Hybrid method may choose large time steps near to the peak region, and sometimes causes the action potential to become distorted. In contrast, the proposed new method chooses very fine time steps in the peak region, but large time steps in the smooth region, and the profiles are smoother and closer to the reference solution. In the test on the stiff Markov ionic channel model, the Hybrid blows up if the allowable time step is set to be greater than 0.1ms. In contrast, our method can adjust the time step size automatically, and is stable. Overall, the proposed method is more accurate than and as efficient as the traditional Hybrid method, especially for the human ORd model. The proposed method shows improvement for action potentials with a non-smooth morphology, and it needs further investigation to determine whether the method is helpful during propagation of the action potential. Copyright © 2016 Elsevier Ltd. All rights

A Python Program for Solving Schro¨dinger's Equation in Undergraduate Physical Chemistry

ERIC Educational Resources Information Center

Srnec, Matthew N.; Upadhyay, Shiv; Madura, Jeffry D.

2017-01-01

In undergraduate physical chemistry, Schrödinger's equation is solved for a variety of cases. In doing so, the energies and wave functions of the system can be interpreted to provide connections with the physical system being studied. Solving this equation by hand for a one-dimensional system is a manageable task, but it becomes time-consuming…

FAST TRACK COMMUNICATION Solving the ultradiscrete KdV equation

NASA Astrophysics Data System (ADS)

Willox, Ralph; Nakata, Yoichi; Satsuma, Junkichi; Ramani, Alfred; Grammaticos, Basile

2010-12-01

We show that a generalized cellular automaton, exhibiting solitonic interactions, can be explicitly solved by means of techniques first introduced in the context of the scattering problem for the KdV equation. We apply this method to calculate the phase-shifts caused by interactions between the solitonic and non-solitonic parts into which arbitrary initial states separate in time.

Numerical investigations of low-density nozzle flow by solving the Boltzmann equation

NASA Technical Reports Server (NTRS)

Deng, Zheng-Tao; Liaw, Goang-Shin; Chou, Lynn Chen

1995-01-01

A two-dimensional finite-difference code to solve the BGK-Boltzmann equation has been developed. The solution procedure consists of three steps: (1) transforming the BGK-Boltzmann equation into two simultaneous partial differential equations by taking moments of the distribution function with respect to the molecular velocity u(sub z), with weighting factors 1 and u(sub z)(sup 2); (2) solving the transformed equations in the physical space based on the time-marching technique and the four-stage Runge-Kutta time integration, for a given discrete-ordinate. The Roe's second-order upwind difference scheme is used to discretize the convective terms and the collision terms are treated as source terms; and (3) using the newly calculated distribution functions at each point in the physical space to calculate the macroscopic flow parameters by the modified Gaussian quadrature formula. Repeating steps 2 and 3, the time-marching procedure stops when the convergent criteria is reached. A low-density nozzle flow field has been calculated by this newly developed code. The BGK Boltzmann solution and experimental data show excellent agreement. It demonstrated that numerical solutions of the BGK-Boltzmann equation are ready to be experimentally validated.

CrasyDSE: A framework for solving Dyson-Schwinger equations

NASA Astrophysics Data System (ADS)

Huber, Markus Q.; Mitter, Mario

2012-11-01

Dyson-Schwinger equations are important tools for non-perturbative analyses of quantum field theories. For example, they are very useful for investigations in quantum chromodynamics and related theories. However, sometimes progress is impeded by the complexity of the equations. Thus automating parts of the calculations will certainly be helpful in future investigations. In this article we present a framework for such an automation based on a C++ code that can deal with a large number of Green functions. Since also the creation of the expressions for the integrals of the Dyson-Schwinger equations needs to be automated, we defer this task to a Mathematica notebook. We illustrate the complete workflow with an example from Yang-Mills theory coupled to a fundamental scalar field that has been investigated recently. As a second example we calculate the propagators of pure Yang-Mills theory. Our code can serve as a basis for many further investigations where the equations are too complicated to tackle by hand. It also can easily be combined with DoFun, a program for the derivation of Dyson-Schwinger equations.Solve (large) systems of Dyson-Schwinger equations numerically. Solution method: Create C++ functions in Mathematica to be used for the numeric code in C

Determination and evaluation of gas holdup time with the quadratic equation model and comparison with nonlinear equation models for isothermal gas chromatography

PubMed Central

Wu, Liejun; Chen, Maoxue; Chen, Yongli; Li, Qing X.

2013-01-01

Gas holdup time (tM) is a basic parameter in isothermal gas chromatography (GC). Determination and evaluation of tM and retention behaviors of n-alkanes under isothermal GC conditions have been extensively studied since the 1950s, but still remains unresolved. The difference equation (DE) model [J. Chromatogr. A 1260:215–223] reveals retention behaviors of n-alkanes excluding tM, while the quadratic equation (QE) model [J. Chromatogr. A 1260:224–231] including tM is suitable for applications. In the present study, tM values were calculated with the QE model, which is referred to as tMT, evaluated and compared with other three typical nonlinear models. The QE model gives an accurate estimation of tM in isothermal GC. The tMT values are highly accurate, stable, and easy to calculate and use. There is only one tMT value at each GC condition. The proper classification of tM values can clarify their disagreement and facilitate GC retention data standardization for which tMT values are promising reference tM values. PMID:23726077

The use of Galerkin finite-element methods to solve mass-transport equations

USGS Publications Warehouse

Grove, David B.

1977-01-01

The partial differential equation that describes the transport and reaction of chemical solutes in porous media was solved using the Galerkin finite-element technique. These finite elements were superimposed over finite-difference cells used to solve the flow equation. Both convection and flow due to hydraulic dispersion were considered. Linear and Hermite cubic approximations (basis functions) provided satisfactory results: however, the linear functions were computationally more efficient for two-dimensional problems. Successive over relaxation (SOR) and iteration techniques using Tchebyschef polynomials were used to solve the sparce matrices generated using the linear and Hermite cubic functions, respectively. Comparisons of the finite-element methods to the finite-difference methods, and to analytical results, indicated that a high degree of accuracy may be obtained using the method outlined. The technique was applied to a field problem involving an aquifer contaminated with chloride, tritium, and strontium-90. (Woodard-USGS)

Factors Affecting Differential Equation Problem Solving Ability of Students at Pre-University Level: A Conceptual Model

ERIC Educational Resources Information Center

Aisha, Bibi; Zamri, Sharifa NorulAkmar Syed; Abdallah, Nabeel; Abedalaziz, Mohammad; Ahmad, Mushtaq; Satti, Umbreen

2017-01-01

In this study, different factors affecting students' differential equations (DEs) solving abilities were explored at pre university level. To explore main factors affecting students' differential equations problem solving ability, articles for a 19-year period, from 1996 to 2015, were critically reviewed and analyzed. It was revealed that…

One-loop Parke-Taylor factors for quadratic propagators from massless scattering equations

NASA Astrophysics Data System (ADS)

Gomez, Humberto; Lopez-Arcos, Cristhiam; Talavera, Pedro

2017-10-01

In this paper we reconsider the Cachazo-He-Yuan construction (CHY) of the so called scattering amplitudes at one-loop, in order to obtain quadratic propagators. In theories with colour ordering the key ingredient is the redefinition of the Parke-Taylor factors. After classifying all the possible one-loop CHY-integrands we conjecture a new one-loop amplitude for the massless Bi-adjoint Φ3 theory. The prescription directly reproduces the quadratic propagators of the traditional Feynman approach.

An algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equations

NASA Astrophysics Data System (ADS)

Daud, Wan Suhana Wan; Ahmad, Nazihah; Malkawi, Ghassan

2017-11-01

Sylvester matrix equations played a prominent role in various areas including control theory. Considering to any un-certainty problems that can be occurred at any time, the Sylvester matrix equation has to be adapted to the fuzzy environment. Therefore, in this study, an algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equation is constructed. The construction of the algorithm is based on the max-min arithmetic multiplication operation. Besides that, an associated arbitrary matrix equation is modified in obtaining the final solution. Finally, some numerical examples are presented to illustrate the proposed algorithm.

Application of Central Upwind Scheme for Solving Special Relativistic Hydrodynamic Equations

PubMed Central

Yousaf, Muhammad; Ghaffar, Tayabia; Qamar, Shamsul

2015-01-01

The accurate modeling of various features in high energy astrophysical scenarios requires the solution of the Einstein equations together with those of special relativistic hydrodynamics (SRHD). Such models are more complicated than the non-relativistic ones due to the nonlinear relations between the conserved and state variables. A high-resolution shock-capturing central upwind scheme is implemented to solve the given set of equations. The proposed technique uses the precise information of local propagation speeds to avoid the excessive numerical diffusion. The second order accuracy of the scheme is obtained with the use of MUSCL-type initial reconstruction and Runge-Kutta time stepping method. After a discussion of the equations solved and of the techniques employed, a series of one and two-dimensional test problems are carried out. To validate the method and assess its accuracy, the staggered central and the kinetic flux-vector splitting schemes are also applied to the same model. The scheme is robust and efficient. Its results are comparable to those obtained from the sophisticated algorithms, even in the case of highly relativistic two-dimensional test problems. PMID:26070067

Hyers-Ulam stability of a generalized Apollonius type quadratic mapping

NASA Astrophysics Data System (ADS)

Park, Chun-Gil; Rassias, Themistocles M.

2006-10-01

Let X,Y be linear spaces. It is shown that if a mapping satisfies the following functional equation: then the mapping is quadratic. We moreover prove the Hyers-Ulam stability of the functional equation (0.1) in Banach spaces.

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

The Parker-Sochacki Method--A Powerful New Method for Solving Systems of Differential Equations

NASA Astrophysics Data System (ADS)

Rudmin, Joseph W.

2001-04-01

The Parker-Sochacki Method--A Powerful New Method for Solving Systems of Differential Equations Joseph W. Rudmin (Physics Dept, James Madison University) A new system of solving systems of differential equations will be presented, which has been developed by J. Edgar Parker and James Sochacki, of the James Madison University Mathematics Department. The method produces MacClaurin Series solutions to systems of differential equations, with the coefficients in either algebraic or numerical form. The method yields high-degree solutions: 20th degree is easily obtainable. It is conceptually simple, fast, and extremely general. It has been applied to over a hundred systems of differential equations, some of which were previously unsolved, and has yet to fail to solve any system for which the MacClaurin series converges. The method is non-recursive: each coefficient in the series is calculated just once, in closed form, and its accuracy is limited only by the digital accuracy of the computer. Although the original differential equations may include any mathematical functions, the computational method includes ONLY the operations of addition, subtraction, and multiplication. Furthermore, it is perfectly suited to parallel -processing computer languages. Those who learn this system will never use Runge-Kutta or predictor-corrector methods again. Examples will be presented, including the classical many-body problem.

Solving the Integral of Quadratic Forms of Covariance Matrices for Applications in Polarimetric Radar Imagery

NASA Astrophysics Data System (ADS)

Marino, Armando; Hajnsek, Irena

2015-04-01

In this work, the solution of quadratic forms with special application to polarimetric and interferometric covariance matrices is investigated. An analytical solution for the integral of a single quadratic form is derived. Additionally, the integral of the Pol-InSAR coherence (expressed as combination of quadratic forms) is investigated. An approximation for such integral is proposed and defined as Trace coherence. Such approximation is tested on real data to verify that the error is acceptable. The trace coherence can be used for tackle problems related to change detection. Moreover, the use of the Trace coherence in model inversion (as for the RVoG three stage inversion) will be investigated in the future.

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

ERIC Educational Resources Information Center

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

2016-01-01

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

The ATOMFT integrator - Using Taylor series to solve ordinary differential equations

NASA Technical Reports Server (NTRS)

Berryman, Kenneth W.; Stanford, Richard H.; Breckheimer, Peter J.

1988-01-01

This paper discusses the application of ATOMFT, an integration package based on Taylor series solution with a sophisticated user interface. ATOMFT has the capabilities to allow the implementation of user defined functions and the solution of stiff and algebraic equations. Detailed examples, including the solutions to several astrodynamics problems, are presented. Comparisons with its predecessor ATOMCC and other modern integrators indicate that ATOMFT is a fast, accurate, and easy method to use to solve many differential equation problems.

A Simple Derivation of Kepler's Laws without Solving Differential Equations

ERIC Educational Resources Information Center

Provost, J.-P.; Bracco, C.

2009-01-01

Proceeding like Newton with a discrete time approach of motion and a geometrical representation of velocity and acceleration, we obtain Kepler's laws without solving differential equations. The difficult part of Newton's work, when it calls for non-trivial properties of ellipses, is avoided by the introduction of polar coordinates. Then a simple…

CrasyDSE: A framework for solving Dyson-Schwinger equations.

PubMed

Huber, Markus Q; Mitter, Mario

2012-11-01

Dyson-Schwinger equations are important tools for non-perturbative analyses of quantum field theories. For example, they are very useful for investigations in quantum chromodynamics and related theories. However, sometimes progress is impeded by the complexity of the equations. Thus automating parts of the calculations will certainly be helpful in future investigations. In this article we present a framework for such an automation based on a C++ code that can deal with a large number of Green functions. Since also the creation of the expressions for the integrals of the Dyson-Schwinger equations needs to be automated, we defer this task to a Mathematica notebook. We illustrate the complete workflow with an example from Yang-Mills theory coupled to a fundamental scalar field that has been investigated recently. As a second example we calculate the propagators of pure Yang-Mills theory. Our code can serve as a basis for many further investigations where the equations are too complicated to tackle by hand. It also can easily be combined with DoFun , a program for the derivation of Dyson-Schwinger equations. Program title : CrasyDSE Catalogue identifier : AEMY _v1_0 Program summary URL : http://cpc.cs.qub.ac.uk/summaries/AEMY_v1_0.html Program obtainable from : CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions : Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc. : 49030 No. of bytes in distributed program, including test data, etc. : 303958 Distribution format : tar.gz Programming language : Mathematica 8 and higher, C++ . Computer : All on which Mathematica and C++ are available. Operating system : All on which Mathematica and C++ are available (Windows, Unix, Mac OS). Classification : 11.1, 11.4, 11.5, 11.6. Nature of problem : Solve (large) systems of Dyson-Schwinger equations numerically. Solution method : Create C++ functions in Mathematica to be used for

On Solving Systems of Equations by Successive Reduction Using 2×2 Matrices

ERIC Educational Resources Information Center

Carley, Holly

2014-01-01

Usually a student learns to solve a system of linear equations in two ways: "substitution" and "elimination." While the two methods will of course lead to the same answer they are considered different because the thinking process is different. In this paper the author solves a system in these two ways to demonstrate the…

The convergence study of the homotopy analysis method for solving nonlinear Volterra-Fredholm integrodifferential equations.

PubMed

Ghanbari, Behzad

2014-01-01

We aim to study the convergence of the homotopy analysis method (HAM in short) for solving special nonlinear Volterra-Fredholm integrodifferential equations. The sufficient condition for the convergence of the method is briefly addressed. Some illustrative examples are also presented to demonstrate the validity and applicability of the technique. Comparison of the obtained results HAM with exact solution shows that the method is reliable and capable of providing analytic treatment for solving such equations.

Equations of motion of test particles for solving the spin-dependent Boltzmann–Vlasov equation

DOE PAGES

Xia, Yin; Xu, Jun; Li, Bao-An; ...

2016-06-16

A consistent derivation of the equations of motion (EOMs) of test particles for solving the spin-dependent Boltzmann–Vlasov equation is presented. The resulting EOMs in phase space are similar to the canonical equations in Hamiltonian dynamics, and the EOM of spin is the same as that in the Heisenburg picture of quantum mechanics. Considering further the quantum nature of spin and choosing the direction of total angular momentum in heavy-ion reactions as a reference of measuring nucleon spin, the EOMs of spin-up and spin-down nucleons are given separately. The key elements affecting the spin dynamics in heavy-ion collisions are identified. Themore » resulting EOMs provide a solid foundation for using the test-particle approach in studying spin dynamics in heavy-ion collisions at intermediate energies. Future comparisons of model simulations with experimental data will help to constrain the poorly known in-medium nucleon spin–orbit coupling relevant for understanding properties of rare isotopes and their astrophysical impacts.« less

Insights into the School Mathematics Tradition from Solving Linear Equations

ERIC Educational Resources Information Center

Buchbinder, Orly; Chazan, Daniel; Fleming, Elizabeth

2015-01-01

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

Solving Nonlinear Fractional Differential Equation by Generalized Mittag-Leffler Function Method

NASA Astrophysics Data System (ADS)

Arafa, A. A. M.; Rida, S. Z.; Mohammadein, A. A.; Ali, H. M.

2013-06-01

In this paper, we use Mittag—Leffler function method for solving some nonlinear fractional differential equations. A new solution is constructed in power series. The fractional derivatives are described by Caputo's sense. To illustrate the reliability of the method, some examples are provided.

A pertinent approach to solve nonlinear fuzzy integro-differential equations.

PubMed

Narayanamoorthy, S; Sathiyapriya, S P

2016-01-01

Fuzzy integro-differential equations is one of the important parts of fuzzy analysis theory that holds theoretical as well as applicable values in analytical dynamics and so an appropriate computational algorithm to solve them is in essence. In this article, we use parametric forms of fuzzy numbers and suggest an applicable approach for solving nonlinear fuzzy integro-differential equations using homotopy perturbation method. A clear and detailed description of the proposed method is provided. Our main objective is to illustrate that the construction of appropriate convex homotopy in a proper way leads to highly accurate solutions with less computational work. The efficiency of the approximation technique is expressed via stability and convergence analysis so as to guarantee the efficiency and performance of the methodology. Numerical examples are demonstrated to verify the convergence and it reveals the validity of the presented numerical technique. Numerical results are tabulated and examined by comparing the obtained approximate solutions with the known exact solutions. Graphical representations of the exact and acquired approximate fuzzy solutions clarify the accuracy of the approach.

Efficient numerical method for solving Cauchy problem for the Gamma equation

NASA Astrophysics Data System (ADS)

Koleva, Miglena N.

2011-12-01

In this work we consider Cauchy problem for the so called Gamma equation, derived by transforming the fully nonlinear Black-Scholes equation for option price into a quasilinear parabolic equation for the second derivative (Greek) Γ = VSS of the option price V. We develop an efficient numerical method for solving the model problem concerning different volatility terms. Using suitable change of variables the problem is transformed on finite interval, keeping original behavior of the solution at the infinity. Then we construct Picard-Newton algorithm with adaptive mesh step in time, which can be applied also in the case of non-differentiable functions. Results of numerical simulations are given.

Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

PubMed

Chang, Weng-Long

2012-03-01

Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

Quadratic dissipation effect on the moonpool resonance

NASA Astrophysics Data System (ADS)

Liu, Heng-xu; Chen, Hai-long; Zhang, Liang; Zhang, Wan-chao; Liu, Ming

2017-12-01

This paper adopted a semi-analytical method based on eigenfunction matching to solve the problem of sharp resonance of cylindrical structures with a moonpool that has a restricted entrance. To eliminate the sharp resonance and to measure the viscous effect, a quadratic dissipation is introduced by assuming an additional dissipative disk at the moonpool entrance. The fluid domain is divided into five cylindrical subdomains, and the velocity potential in each subdomain is obtained by meeting the Laplace equation as well as the boundary conditions. The free-surface elevation at the center of the moonpool, along with the pressure and velocity at the restricted entrance for first-order wave are evaluated. By choosing appropriate dissipation coefficients, the free-surface elevation calculated at the center of the moonpool is in coincidence with the measurements in model tests both at the peak period and amplitude at resonance. It is shown that the sharp resonance in the potential flow theory can be eliminated and the viscous effect can be estimated with a simple method in some provided hydrodynamic models.

Transport through a network of capillaries from ultrametric diffusion equation with quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Oleschko, K.; Khrennikov, A.

2017-10-01

This paper is about a novel mathematical framework to model transport (of, e.g., fluid or gas) through networks of capillaries. This framework takes into account the tree structure of the networks of capillaries. (Roughly speaking, we use the tree-like system of coordinates.) As is well known, tree-geometry can be topologically described as the geometry of an ultrametric space, i.e., a metric space in which the metric satisfies the strong triangle inequality: in each triangle, the third side is less than or equal to the maximum of two other sides. Thus transport (e.g., of oil or emulsion of oil and water in porous media, or blood and air in biological organisms) through networks of capillaries can be mathematically modelled as ultrametric diffusion. Such modelling was performed in a series of recently published papers of the authors. However, the process of transport through capillaries can be only approximately described by the linear diffusion, because the concentration of, e.g., oil droplets, in a capillary can essentially modify the dynamics. Therefore nonlinear dynamical equations provide a more adequate model of transport in a network of capillaries. We consider a nonlinear ultrametric diffusion equation with quadratic nonlinearity - to model transport in such a network. Here, as in the linear case, we apply the theory of ultrametric wavelets. The paper also contains a simple introduction to theory of ultrametric spaces and analysis on them.

Extended Decentralized Linear-Quadratic-Gaussian Control

NASA Technical Reports Server (NTRS)

Carpenter, J. Russell

2000-01-01

A straightforward extension of a solution to the decentralized linear-Quadratic-Gaussian problem is proposed that allows its use for commonly encountered classes of problems that are currently solved with the extended Kalman filter. This extension allows the system to be partitioned in such a way as to exclude the nonlinearities from the essential algebraic relationships that allow the estimation and control to be optimally decentralized.

Solving Differential Equations Analytically. Elementary Differential Equations. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Unit 335.

ERIC Educational Resources Information Center

Goldston, J. W.

This unit introduces analytic solutions of ordinary differential equations. The objective is to enable the student to decide whether a given function solves a given differential equation. Examples of problems from biology and chemistry are covered. Problem sets, quizzes, and a model exam are included, and answers to all items are provided. The…

Solving Second-Order Ordinary Differential Equations without Using Complex Numbers

ERIC Educational Resources Information Center

Kougias, Ioannis E.

2009-01-01

Ordinary differential equations (ODEs) is a subject with a wide range of applications and the need of introducing it to students often arises in the last year of high school, as well as in the early stages of tertiary education. The usual methods of solving second-order ODEs with constant coefficients, among others, rely upon the use of complex…

Solving the hypersingular boundary integral equation in three-dimensional acoustics using a regularization relationship.

PubMed

Yan, Zai You; Hung, Kin Chew; Zheng, Hui

2003-05-01

Regularization of the hypersingular integral in the normal derivative of the conventional Helmholtz integral equation through a double surface integral method or regularization relationship has been studied. By introducing the new concept of discretized operator matrix, evaluation of the double surface integrals is reduced to calculate the product of two discretized operator matrices. Such a treatment greatly improves the computational efficiency. As the number of frequencies to be computed increases, the computational cost of solving the composite Helmholtz integral equation is comparable to that of solving the conventional Helmholtz integral equation. In this paper, the detailed formulation of the proposed regularization method is presented. The computational efficiency and accuracy of the regularization method are demonstrated for a general class of acoustic radiation and scattering problems. The radiation of a pulsating sphere, an oscillating sphere, and a rigid sphere insonified by a plane acoustic wave are solved using the new method with curvilinear quadrilateral isoparametric elements. It is found that the numerical results rapidly converge to the corresponding analytical solutions as finer meshes are applied.

The GUP and quantum Raychaudhuri equation

NASA Astrophysics Data System (ADS)

Vagenas, Elias C.; Alasfar, Lina; Alsaleh, Salwa M.; Ali, Ahmed Farag

2018-06-01

In this paper, we compare the quantum corrections to the Schwarzschild black hole temperature due to quadratic and linear-quadratic generalised uncertainty principle, with the corrections from the quantum Raychaudhuri equation. The reason for this comparison is to connect the deformation parameters β0 and α0 with η which is the parameter that characterises the quantum Raychaudhuri equation. The derived relation between the parameters appears to depend on the relative scale of the system (black hole), which could be read as a beta function equation for the quadratic deformation parameter β0. This study shows a correspondence between the two phenomenological approaches and indicates that quantum Raychaudhuri equation implies the existence of a crystal-like structure of spacetime.

New extended (G'/G)-expansion method to solve nonlinear evolution equation: the (3 + 1)-dimensional potential-YTSF equation.

PubMed

Roshid, Harun-Or-; Akbar, M Ali; Alam, Md Nur; Hoque, Md Fazlul; Rahman, Nizhum

2014-01-01

In this article, a new extended (G'/G) -expansion method has been proposed for constructing more general exact traveling wave solutions of nonlinear evolution equations with the aid of symbolic computation. In order to illustrate the validity and effectiveness of the method, we pick the (3 + 1)-dimensional potential-YTSF equation. As a result, abundant new and more general exact solutions have been achieved of this equation. It has been shown that the proposed method provides a powerful mathematical tool for solving nonlinear wave equations in applied mathematics, engineering and mathematical physics.

Higher order solution of the Euler equations on unstructured grids using quadratic reconstruction

NASA Technical Reports Server (NTRS)

Barth, Timothy J.; Frederickson, Paul O.

1990-01-01

High order accurate finite-volume schemes for solving the Euler equations of gasdynamics are developed. Central to the development of these methods are the construction of a k-exact reconstruction operator given cell-averaged quantities and the use of high order flux quadrature formulas. General polygonal control volumes (with curved boundary edges) are considered. The formulations presented make no explicit assumption as to complexity or convexity of control volumes. Numerical examples are presented for Ringleb flow to validate the methodology.

Robustness of Quadratic Hedging Strategies in Finance via Backward Stochastic Differential Equations with Jumps

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

Di Nunno, Giulia, E-mail: giulian@math.uio.no; Khedher, Asma, E-mail: asma.khedher@tum.de; Vanmaele, Michèle, E-mail: michele.vanmaele@ugent.be

We consider a backward stochastic differential equation with jumps (BSDEJ) which is driven by a Brownian motion and a Poisson random measure. We present two candidate-approximations to this BSDEJ and we prove that the solution of each candidate-approximation converges to the solution of the original BSDEJ in a space which we specify. We use this result to investigate in further detail the consequences of the choice of the model to (partial) hedging in incomplete markets in finance. As an application, we consider models in which the small variations in the price dynamics are modeled with a Poisson random measure withmore » infinite activity and models in which these small variations are modeled with a Brownian motion or are cut off. Using the convergence results on BSDEJs, we show that quadratic hedging strategies are robust towards the approximation of the market prices and we derive an estimation of the model risk.« less

Nonlinear Fourier algorithm applied to solving equations of gravitational gas dynamics

NASA Technical Reports Server (NTRS)

Kolosov, B. I.

1979-01-01

Two dimensional gas flow problems were reduced to an approximating system of common differential equations, which were solved by a standard procedure of the Runge-Kutta type. A theorem of the existence of stationary conical shock waves with the cone vertex in the gravitating center was proved.

A highly accurate finite-difference method with minimum dispersion error for solving the Helmholtz equation

NASA Astrophysics Data System (ADS)

Wu, Zedong; Alkhalifah, Tariq

2018-07-01

Numerical simulation of the acoustic wave equation in either isotropic or anisotropic media is crucial to seismic modeling, imaging and inversion. Actually, it represents the core computation cost of these highly advanced seismic processing methods. However, the conventional finite-difference method suffers from severe numerical dispersion errors and S-wave artifacts when solving the acoustic wave equation for anisotropic media. We propose a method to obtain the finite-difference coefficients by comparing its numerical dispersion with the exact form. We find the optimal finite difference coefficients that share the dispersion characteristics of the exact equation with minimal dispersion error. The method is extended to solve the acoustic wave equation in transversely isotropic (TI) media without S-wave artifacts. Numerical examples show that the method is highly accurate and efficient.

The pulsating orb: solving the wave equation outside a ball

PubMed Central

2016-01-01

Transient acoustic waves are generated by the oscillations of an object or are scattered by the object. This leads to initial-boundary value problems (IBVPs) for the wave equation. Basic properties of this equation are reviewed, with emphasis on characteristics, wavefronts and compatibility conditions. IBVPs are formulated and their properties reviewed, with emphasis on weak solutions and the constraints imposed by the underlying continuum mechanics. The use of the Laplace transform to treat the IBVPs is also reviewed, with emphasis on situations where the solution is discontinuous across wavefronts. All these notions are made explicit by solving simple IBVPs for a sphere in some detail. PMID:27279773

Modeling Blazar Spectra by Solving an Electron Transport Equation

NASA Astrophysics Data System (ADS)

Lewis, Tiffany; Finke, Justin; Becker, Peter A.

2018-01-01

Blazars are luminous active galaxies across the entire electromagnetic spectrum, but the spectral formation mechanisms, especially the particle acceleration, in these sources are not well understood. We develop a new theoretical model for simulating blazar spectra using a self-consistent electron number distribution. Specifically, we solve the particle transport equation considering shock acceleration, adiabatic expansion, stochastic acceleration due to MHD waves, Bohm diffusive particle escape, synchrotron radiation, and Compton radiation, where we implement the full Compton cross-section for seed photons from the accretion disk, the dust torus, and 26 individual broad lines. We used a modified Runge-Kutta method to solve the 2nd order equation, including development of a new mathematical method for normalizing stiff steady-state ordinary differential equations. We show that our self-consistent, transport-based blazar model can qualitatively fit the IR through Fermi g-ray data for 3C 279, with a single-zone, leptonic configuration. We use the solution for the electron distribution to calculate multi-wavelength SED spectra for 3C 279. We calculate the particle and magnetic field energy densities, which suggest that the emitting region is not always in equipartition (a common assumption), but sometimes matter dominated. The stratified broad line region (based on ratios in quasar reverberation mapping, and thus adding no free parameters) improves our estimate of the location of the emitting region, increasing it by ~5x. Our model provides a novel view into the physics at play in blazar jets, especially the relative strength of the shock and stochastic acceleration, where our model is well suited to distinguish between these processes, and we find that the latter tends to dominate.

A new iterative scheme for solving the discrete Smoluchowski equation

NASA Astrophysics Data System (ADS)

Smith, Alastair J.; Wells, Clive G.; Kraft, Markus

2018-01-01

This paper introduces a new iterative scheme for solving the discrete Smoluchowski equation and explores the numerical convergence properties of the method for a range of kernels admitting analytical solutions, in addition to some more physically realistic kernels typically used in kinetics applications. The solver is extended to spatially dependent problems with non-uniform velocities and its performance investigated in detail.

Solving modal equations of motion with initial conditions using MSC/NASTRAN DMAP. Part 1: Implementing exact mode superposition

NASA Technical Reports Server (NTRS)

Abdallah, Ayman A.; Barnett, Alan R.; Ibrahim, Omar M.; Manella, Richard T.

1993-01-01

Within the MSC/NASTRAN DMAP (Direct Matrix Abstraction Program) module TRD1, solving physical (coupled) or modal (uncoupled) transient equations of motion is performed using the Newmark-Beta or mode superposition algorithms, respectively. For equations of motion with initial conditions, only the Newmark-Beta integration routine has been available in MSC/NASTRAN solution sequences for solving physical systems and in custom DMAP sequences or alters for solving modal systems. In some cases, one difficulty with using the Newmark-Beta method is that the process of selecting suitable integration time steps for obtaining acceptable results is lengthy. In addition, when very small step sizes are required, a large amount of time can be spent integrating the equations of motion. For certain aerospace applications, a significant time savings can be realized when the equations of motion are solved using an exact integration routine instead of the Newmark-Beta numerical algorithm. In order to solve modal equations of motion with initial conditions and take advantage of efficiencies gained when using uncoupled solution algorithms (like that within TRD1), an exact mode superposition method using MSC/NASTRAN DMAP has been developed and successfully implemented as an enhancement to an existing coupled loads methodology at the NASA Lewis Research Center.

Some observations on a new numerical method for solving Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Kumar, A.

1981-01-01

An explicit-implicit technique for solving Navier-Stokes equations is described which, is much less complex than other implicit methods. It is used to solve a complex, two-dimensional, steady-state, supersonic-flow problem. The computational efficiency of the method and the quality of the solution obtained from it at high Courant-Friedrich-Lewy (CFL) numbers are discussed. Modifications are discussed and certain observations are made about the method which may be helpful in using it successfully.

Replicator equations, maximal cliques, and graph isomorphism.

PubMed

Pelillo, M

1999-11-15

We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feature of this formulation is that a clear one-to-one correspondence exists between the solutions of the quadratic program and those in the original, combinatorial problem. To solve the program we use the so-called replicator equations--a class of straightforward continuous- and discrete-time dynamical systems developed in various branches of theoretical biology. We show how, despite their inherent inability to escape from local solutions, they nevertheless provide experimental results that are competitive with those obtained using more elaborate mean-field annealing heuristics.

Using Linear and Quadratic Functions to Teach Number Patterns in Secondary School

ERIC Educational Resources Information Center

Kenan, Kok Xiao-Feng

2017-01-01

This paper outlines an approach to definitively find the general term in a number pattern, of either a linear or quadratic form, by using the general equation of a linear or quadratic function. This approach is governed by four principles: (1) identifying the position of the term (input) and the term itself (output); (2) recognising that each…

A new accurate quadratic equation model for isothermal gas chromatography and its comparison with the linear model

PubMed Central

Wu, Liejun; Chen, Maoxue; Chen, Yongli; Li, Qing X.

2013-01-01

The gas holdup time (tM) is a dominant parameter in gas chromatographic retention models. The difference equation (DE) model proposed by Wu et al. (J. Chromatogr. A 2012, http://dx.doi.org/10.1016/j.chroma.2012.07.077) excluded tM. In the present paper, we propose that the relationship between the adjusted retention time tRZ′ and carbon number z of n-alkanes follows a quadratic equation (QE) when an accurate tM is obtained. This QE model is the same as or better than the DE model for an accurate expression of the retention behavior of n-alkanes and model applications. The QE model covers a larger range of n-alkanes with better curve fittings than the linear model. The accuracy of the QE model was approximately 2–6 times better than the DE model and 18–540 times better than the LE model. Standard deviations of the QE model were approximately 2–3 times smaller than those of the DE model. PMID:22989489

Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution.

PubMed

Qu, Zhiyu; Qu, Fuxin; Hou, Changbo; Jing, Fulong

2018-05-19

In an inverse synthetic aperture radar (ISAR) imaging system for targets with complex motion, the azimuth echo signals of the target are always modeled as multicomponent quadratic frequency modulation (QFM) signals. The chirp rate (CR) and quadratic chirp rate (QCR) estimation of QFM signals is very important to solve the ISAR image defocus problem. For multicomponent QFM (multi-QFM) signals, the conventional QR and QCR estimation algorithms suffer from the cross-term and poor anti-noise ability. This paper proposes a novel estimation algorithm called a two-dimensional product modified parameterized chirp rate-quadratic chirp rate distribution (2D-PMPCRD) for QFM signals parameter estimation. The 2D-PMPCRD employs a multi-scale parametric symmetric self-correlation function and modified nonuniform fast Fourier transform-Fast Fourier transform to transform the signals into the chirp rate-quadratic chirp rate (CR-QCR) domains. It can greatly suppress the cross-terms while strengthening the auto-terms by multiplying different CR-QCR domains with different scale factors. Compared with high order ambiguity function-integrated cubic phase function and modified Lv's distribution, the simulation results verify that the 2D-PMPCRD acquires higher anti-noise performance and obtains better cross-terms suppression performance for multi-QFM signals with reasonable computation cost.

Solving nonlinear equilibrium equations of deformable systems by method of embedded polygons

NASA Astrophysics Data System (ADS)

Razdolsky, A. G.

2017-09-01

Solving of nonlinear algebraic equations is an obligatory stage of studying the equilibrium paths of nonlinear deformable systems. The iterative method for solving a system of nonlinear algebraic equations stated in an explicit or implicit form is developed in the present work. The method consists of constructing a sequence of polygons in Euclidean space that converge into a single point that displays the solution of the system. Polygon vertices are determined on the assumption that individual equations of the system are independent from each other and each of them is a function of only one variable. Initial positions of vertices for each subsequent polygon are specified at the midpoints of certain straight segments determined at the previous iteration. The present algorithm is applied for analytical investigation of the behavior of biaxially compressed nonlinear-elastic beam-column with an open thin-walled cross-section. Numerical examples are made for the I-beam-column on the assumption that its material follows a bilinear stress-strain diagram. A computer program based on the shooting method is developed for solving the problem. The method is reduced to numerical integration of a system of differential equations and to the solution of a system of nonlinear algebraic equations between the boundary values of displacements at the ends of the beam-column. A stress distribution at the beam-column cross-sections is determined by subdividing the cross-section area into many small cells. The equilibrium path for the twisting angle and the lateral displacements tend to the stationary point when the load is increased. Configuration of the path curves reveals that the ultimate load is reached shortly once the maximal normal stresses at the beam-column fall outside the limit of the elastic region. The beam-column has a unique equilibrium state for each value of the load, that is, there are no equilibrium states once the maximum load is reached.

A universal concept based on cellular neural networks for ultrafast and flexible solving of differential equations.

PubMed

Chedjou, Jean Chamberlain; Kyamakya, Kyandoghere

2015-04-01

This paper develops and validates a comprehensive and universally applicable computational concept for solving nonlinear differential equations (NDEs) through a neurocomputing concept based on cellular neural networks (CNNs). High-precision, stability, convergence, and lowest-possible memory requirements are ensured by the CNN processor architecture. A significant challenge solved in this paper is that all these cited computing features are ensured in all system-states (regular or chaotic ones) and in all bifurcation conditions that may be experienced by NDEs.One particular quintessence of this paper is to develop and demonstrate a solver concept that shows and ensures that CNN processors (realized either in hardware or in software) are universal solvers of NDE models. The solving logic or algorithm of given NDEs (possible examples are: Duffing, Mathieu, Van der Pol, Jerk, Chua, Rössler, Lorenz, Burgers, and the transport equations) through a CNN processor system is provided by a set of templates that are computed by our comprehensive templates calculation technique that we call nonlinear adaptive optimization. This paper is therefore a significant contribution and represents a cutting-edge real-time computational engineering approach, especially while considering the various scientific and engineering applications of this ultrafast, energy-and-memory-efficient, and high-precise NDE solver concept. For illustration purposes, three NDE models are demonstratively solved, and related CNN templates are derived and used: the periodically excited Duffing equation, the Mathieu equation, and the transport equation.

Hermite Functional Link Neural Network for Solving the Van der Pol-Duffing Oscillator Equation.

PubMed

Mall, Susmita; Chakraverty, S

2016-08-01

Hermite polynomial-based functional link artificial neural network (FLANN) is proposed here to solve the Van der Pol-Duffing oscillator equation. A single-layer hermite neural network (HeNN) model is used, where a hidden layer is replaced by expansion block of input pattern using Hermite orthogonal polynomials. A feedforward neural network model with the unsupervised error backpropagation principle is used for modifying the network parameters and minimizing the computed error function. The Van der Pol-Duffing and Duffing oscillator equations may not be solved exactly. Here, approximate solutions of these types of equations have been obtained by applying the HeNN model for the first time. Three mathematical example problems and two real-life application problems of Van der Pol-Duffing oscillator equation, extracting the features of early mechanical failure signal and weak signal detection problems, are solved using the proposed HeNN method. HeNN approximate solutions have been compared with results obtained by the well known Runge-Kutta method. Computed results are depicted in term of graphs. After training the HeNN model, we may use it as a black box to get numerical results at any arbitrary point in the domain. Thus, the proposed HeNN method is efficient. The results reveal that this method is reliable and can be applied to other nonlinear problems too.

Design of linear quadratic regulators with eigenvalue placement in a specified region

NASA Technical Reports Server (NTRS)

Shieh, Leang-San; Zhen, Liu; Coleman, Norman P.

1990-01-01

Two linear quadratic regulators are developed for placing the closed-loop poles of linear multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at +/- pi/2k (for a specified integer k not less than 1) from the negative real axis, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane, and simultaneously minimizing a quadratic performance index. The design procedure mainly involves the solution of either Liapunov equations or Riccati equations. The general expression for finding the lower bound of a constant gain gamma is also developed.

Guiding brine shrimp through mazes by solving reaction diffusion equations

NASA Astrophysics Data System (ADS)

Singal, Krishma; Fenton, Flavio

Excitable systems driven by reaction diffusion equations have been shown to not only find solutions to mazes but to also to find the shortest path between the beginning and the end of the maze. In this talk we describe how we can use the Fitzhugh-Nagumo model, a generic model for excitable media, to solve a maze by varying the basin of attraction of its two fixed points. We demonstrate how two dimensional mazes are solved numerically using a Java Applet and then accelerated to run in real time by using graphic processors (GPUs). An application of this work is shown by guiding phototactic brine shrimp through a maze solved by the algorithm. Once the path is obtained, an Arduino directs the shrimp through the maze using lights from LEDs placed at the floor of the Maze. This method running in real time could be eventually used for guiding robots and cars through traffic.

Numerics made easy: solving the Navier-Stokes equation for arbitrary channel cross-sections using Microsoft Excel.

PubMed

Richter, Christiane; Kotz, Frederik; Giselbrecht, Stefan; Helmer, Dorothea; Rapp, Bastian E

2016-06-01

The fluid mechanics of microfluidics is distinctively simpler than the fluid mechanics of macroscopic systems. In macroscopic systems effects such as non-laminar flow, convection, gravity etc. need to be accounted for all of which can usually be neglected in microfluidic systems. Still, there exists only a very limited selection of channel cross-sections for which the Navier-Stokes equation for pressure-driven Poiseuille flow can be solved analytically. From these equations, velocity profiles as well as flow rates can be calculated. However, whenever a cross-section is not highly symmetric (rectangular, elliptical or circular) the Navier-Stokes equation can usually not be solved analytically. In all of these cases, numerical methods are required. However, in many instances it is not necessary to turn to complex numerical solver packages for deriving, e.g., the velocity profile of a more complex microfluidic channel cross-section. In this paper, a simple spreadsheet analysis tool (here: Microsoft Excel) will be used to implement a simple numerical scheme which allows solving the Navier-Stokes equation for arbitrary channel cross-sections.

Exact solutions for an oscillator with anti-symmetric quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Beléndez, A.; Martínez, F. J.; Beléndez, T.; Pascual, C.; Alvarez, M. L.; Gimeno, E.; Arribas, E.

2018-04-01

Closed-form exact solutions for an oscillator with anti-symmetric quadratic nonlinearity are derived from the first integral of the nonlinear differential equation governing the behaviour of this oscillator. The mathematical model is an ordinary second order differential equation in which the sign of the quadratic nonlinear term changes. Two parameters characterize this oscillator: the coefficient of the linear term and the coefficient of the quadratic term. Not only the common case in which both coefficients are positive but also all possible combinations of positive and negative signs of these coefficients which provide periodic motions are considered, giving rise to four different cases. Three different periods and solutions are obtained, since the same result is valid in two of these cases. An interesting feature is that oscillatory motions whose equilibrium points are not at x = 0 are also considered. The periods are given in terms of an incomplete or complete elliptic integral of the first kind, and the exact solutions are expressed as functions including Jacobi elliptic cosine or sine functions.

Investigating High-School Students' Reasoning Strategies when They Solve Linear Equations

ERIC Educational Resources Information Center

Huntley, Mary Ann; Marcus, Robin; Kahan, Jeremy; Miller, Jane Lincoln

2007-01-01

A cross-curricular structured-probe task-based clinical interview study with 44 pairs of third-year high-school mathematics students, most of whom were high achieving, was conducted to investigate their approaches to a variety of algebra problems. This paper presents results from one problem that involved solving a set of three linear equations of…

On Directly Solving SCHRÖDINGER Equation for H+2 Ion by Genetic Algorithm

NASA Astrophysics Data System (ADS)

Saha, Rajendra; Bhattacharyya, S. P.

Schrödinger equation (SE) is sought to be solved directly for the ground state of H+2 ion by invoking genetic algorithm (GA). In one approach the internuclear distance (R) is kept fixed, the corresponding electronic SE for H+2 is solved by GA at each R and the full potential energy curve (PEC) is constructed. The minimum of the PEC is then located giving Ve and Re. Alternatively, Ve and Re are located in a single run by allowing R to vary simultaneously while solving the electronic SE by genetic algorithm. The performance patterns of the two strategies are compared.

Variational estimate method for solving autonomous ordinary differential equations

NASA Astrophysics Data System (ADS)

Mungkasi, Sudi

2018-04-01

In this paper, we propose a method for solving first-order autonomous ordinary differential equation problems using a variational estimate formulation. The variational estimate is constructed with a Lagrange multiplier which is chosen optimally, so that the formulation leads to an accurate solution to the problem. The variational estimate is an integral form, which can be computed using a computer software. As the variational estimate is an explicit formula, the solution is easy to compute. This is a great advantage of the variational estimate formulation.

Global stability and quadratic Hamiltonian structure in Lotka-Volterra and quasi-polynomial systems

NASA Astrophysics Data System (ADS)

Szederkényi, Gábor; Hangos, Katalin M.

2004-04-01

We show that the global stability of quasi-polynomial (QP) and Lotka-Volterra (LV) systems with the well-known logarithmic Lyapunov function is equivalent to the existence of a local generalized dissipative Hamiltonian description of the LV system with a diagonal quadratic form as a Hamiltonian function. The Hamiltonian function can be calculated and the quadratic dissipativity neighborhood of the origin can be estimated by solving linear matrix inequalities.

Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, M.; Dauda, M. K.; Mohamed, M. A. bin; Waziri, M. Y.; Mohamad, F. S.; Abdullah, H.

2018-03-01

Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F(x) = 0, x ∈ Rn , a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with {Q}k+1-1 to θkI. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e.72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

Modelling biochemical reaction systems by stochastic differential equations with reflection.

PubMed

Niu, Yuanling; Burrage, Kevin; Chen, Luonan

2016-05-07

In this paper, we gave a new framework for modelling and simulating biochemical reaction systems by stochastic differential equations with reflection not in a heuristic way but in a mathematical way. The model is computationally efficient compared with the discrete-state Markov chain approach, and it ensures that both analytic and numerical solutions remain in a biologically plausible region. Specifically, our model mathematically ensures that species numbers lie in the domain D, which is a physical constraint for biochemical reactions, in contrast to the previous models. The domain D is actually obtained according to the structure of the corresponding chemical Langevin equations, i.e., the boundary is inherent in the biochemical reaction system. A variant of projection method was employed to solve the reflected stochastic differential equation model, and it includes three simple steps, i.e., Euler-Maruyama method was applied to the equations first, and then check whether or not the point lies within the domain D, and if not perform an orthogonal projection. It is found that the projection onto the closure D¯ is the solution to a convex quadratic programming problem. Thus, existing methods for the convex quadratic programming problem can be employed for the orthogonal projection map. Numerical tests on several important problems in biological systems confirmed the efficiency and accuracy of this approach. Copyright © 2016 Elsevier Ltd. All rights reserved.

Solving Coupled Gross--Pitaevskii Equations on a Cluster of PlayStation 3 Computers

NASA Astrophysics Data System (ADS)

Edwards, Mark; Heward, Jeffrey; Clark, C. W.

2009-05-01

At Georgia Southern University we have constructed an 8+1--node cluster of Sony PlayStation 3 (PS3) computers with the intention of using this computing resource to solve problems related to the behavior of ultra--cold atoms in general with a particular emphasis on studying bose--bose and bose--fermi mixtures confined in optical lattices. As a first project that uses this computing resource, we have implemented a parallel solver of the coupled time--dependent, one--dimensional Gross--Pitaevskii (TDGP) equations. These equations govern the behavior of dual-- species bosonic mixtures. We chose the split--operator/FFT to solve the coupled 1D TDGP equations. The fast Fourier transform component of this solver can be readily parallelized on the PS3 cpu known as the Cell Broadband Engine (CellBE). Each CellBE chip contains a single 64--bit PowerPC Processor Element known as the PPE and eight ``Synergistic Processor Element'' identified as the SPE's. We report on this algorithm and compare its performance to a non--parallel solver as applied to modeling evaporative cooling in dual--species bosonic mixtures.

Application of discontinuous Galerkin method for solving a compressible five-equation two-phase flow model

NASA Astrophysics Data System (ADS)

Saleem, M. Rehan; Ali, Ishtiaq; Qamar, Shamsul

2018-03-01

In this article, a reduced five-equation two-phase flow model is numerically investigated. The formulation of the model is based on the conservation and energy exchange laws. The model is non-conservative and the governing equations contain two equations for the mass conservation, one for the over all momentum and one for the total energy. The fifth equation is the energy equation for one of the two phases that includes a source term on the right hand side for incorporating energy exchange between the two fluids in the form of mechanical and thermodynamical works. A Runge-Kutta discontinuous Galerkin finite element method is applied to solve the model equations. The main attractive features of the proposed method include its formal higher order accuracy, its nonlinear stability, its ability to handle complicated geometries, and its ability to capture sharp discontinuities or strong gradients in the solutions without producing spurious oscillations. The proposed method is robust and well suited for large-scale time-dependent computational problems. Several case studies of two-phase flows are presented. For validation and comparison of the results, the same model equations are also solved by using a staggered central scheme. It was found that discontinuous Galerkin scheme produces better results as compared to the staggered central scheme.

Alternative Representations for Algebraic Problem Solving: When Are Graphs Better than Equations?

ERIC Educational Resources Information Center

Mielicki, Marta K.; Wiley, Jennifer

2016-01-01

Successful algebraic problem solving entails adaptability of solution methods using different representations. Prior research has suggested that students are more likely to prefer symbolic solution methods (equations) over graphical ones, even when graphical methods should be more efficient. However, this research has not tested how representation…

Sequential design of discrete linear quadratic regulators via optimal root-locus techniques

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Yates, Robert E.; Ganesan, Sekar

1989-01-01

A sequential method employing classical root-locus techniques has been developed in order to determine the quadratic weighting matrices and discrete linear quadratic regulators of multivariable control systems. At each recursive step, an intermediate unity rank state-weighting matrix that contains some invariant eigenvectors of that open-loop matrix is assigned, and an intermediate characteristic equation of the closed-loop system containing the invariant eigenvalues is created.

Improving Teaching Quality and Problem Solving Ability through Contextual Teaching and Learning in Differential Equations: A Lesson Study Approach

ERIC Educational Resources Information Center

Khotimah, Rita Pramujiyanti; Masduki

2016-01-01

Differential equations is a branch of mathematics which is closely related to mathematical modeling that arises in real-world problems. Problem solving ability is an essential component to solve contextual problem of differential equations properly. The purposes of this study are to describe contextual teaching and learning (CTL) model in…

A new Euler scheme based on harmonic-polygon approach for solving first order ordinary differential equation

NASA Astrophysics Data System (ADS)

Yusop, Nurhafizah Moziyana Mohd; Hasan, Mohammad Khatim; Wook, Muslihah; Amran, Mohd Fahmi Mohamad; Ahmad, Siti Rohaidah

2017-10-01

There are many benefits to improve Euler scheme for solving the Ordinary Differential Equation Problems. Among the benefits are simple implementation and low-cost computational. However, the problem of accuracy in Euler scheme persuade scholar to use complex method. Therefore, the main purpose of this research are show the construction a new modified Euler scheme that improve accuracy of Polygon scheme in various step size. The implementing of new scheme are used Polygon scheme and Harmonic mean concept that called as Harmonic-Polygon scheme. This Harmonic-Polygon can provide new advantages that Euler scheme could offer by solving Ordinary Differential Equation problem. Four set of problems are solved via Harmonic-Polygon. Findings show that new scheme or Harmonic-Polygon scheme can produce much better accuracy result.

Effective quadrature formula in solving linear integro-differential equations of order two

NASA Astrophysics Data System (ADS)

Eshkuvatov, Z. K.; Kammuji, M.; Long, N. M. A. Nik; Yunus, Arif A. M.

2017-08-01

In this note, we solve general form of Fredholm-Volterra integro-differential equations (IDEs) of order 2 with boundary condition approximately and show that proposed method is effective and reliable. Initially, IDEs is reduced into integral equation of the third kind by using standard integration techniques and identity between multiple and single integrals then truncated Legendre series are used to estimate the unknown function. For the kernel integrals, we have applied Gauss-Legendre quadrature formula and collocation points are chosen as the roots of the Legendre polynomials. Finally, reduce the integral equations of the third kind into the system of algebraic equations and Gaussian elimination method is applied to get approximate solutions. Numerical examples and comparisons with other methods reveal that the proposed method is very effective and dominated others in many cases. General theory of existence of the solution is also discussed.

Tracking children's mental states while solving algebra equations.

PubMed

Anderson, John R; Betts, Shawn; Ferris, Jennifer L; Fincham, Jon M

2012-11-01

Behavioral and function magnetic resonance imagery (fMRI) data were combined to infer the mental states of students as they interacted with an intelligent tutoring system. Sixteen children interacted with a computer tutor for solving linear equations over a six-day period (days 0-5), with days 1 and 5 occurring in an fMRI scanner. Hidden Markov model algorithms combined a model of student behavior with multi-voxel imaging pattern data to predict the mental states of students. We separately assessed the algorithms' ability to predict which step in a problem-solving sequence was performed and whether the step was performed correctly. For day 1, the data patterns of other students were used to predict the mental states of a target student. These predictions were improved on day 5 by adding information about the target student's behavioral and imaging data from day 1. Successful tracking of mental states depended on using the combination of a behavioral model and multi-voxel pattern analysis, illustrating the effectiveness of an integrated approach to tracking the cognition of individuals in real time as they perform complex tasks. Copyright © 2011 Wiley Periodicals, Inc.

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

ERIC Educational Resources Information Center

Tahir, Salma; Cavanagh, Michael

2010-01-01

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

Method for the Direct Solve of the Many-Body Schrödinger Wave Equation

NASA Astrophysics Data System (ADS)

Jerke, Jonathan; Tymczak, C. J.; Poirier, Bill

We report on theoretical and computational developments towards a computationally efficient direct solve of the many-body Schrödinger wave equation for electronic systems. This methodology relies on two recent developments pioneered by the authors: 1) the development of a Cardinal Sine basis for electronic structure calculations; and 2) the development of a highly efficient and compact representation of multidimensional functions using the Canonical tensor rank representation developed by Belykin et. al. which we have adapted to electronic structure problems. We then show several relevant examples of the utility and accuracy of this methodology, scaling with system size, and relevant convergence issues of the methodology. Method for the Direct Solve of the Many-Body Schrödinger Wave Equation.

A Heuristic Fast Method to Solve the Nonlinear Schroedinger Equation in Fiber Bragg Gratings with Arbitrary Shape Input Pulse

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

Emami, F.; Hatami, M.; Keshavarz, A. R.

2009-08-13

Using a combination of Runge-Kutta and Jacobi iterative method, we could solve the nonlinear Schroedinger equation describing the pulse propagation in FBGs. By decomposing the electric field to forward and backward components in fiber Bragg grating and utilizing the Fourier series analysis technique, the boundary value problem of a set of coupled equations governing the pulse propagation in FBG changes to an initial condition coupled equations which can be solved by simple Runge-Kutta method.

DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers

NASA Astrophysics Data System (ADS)

Mokhtari, Aryan; Shi, Wei; Ling, Qing; Ribeiro, Alejandro

2016-10-01

This paper considers decentralized consensus optimization problems where nodes of a network have access to different summands of a global objective function. Nodes cooperate to minimize the global objective by exchanging information with neighbors only. A decentralized version of the alternating directions method of multipliers (DADMM) is a common method for solving this category of problems. DADMM exhibits linear convergence rate to the optimal objective but its implementation requires solving a convex optimization problem at each iteration. This can be computationally costly and may result in large overall convergence times. The decentralized quadratically approximated ADMM algorithm (DQM), which minimizes a quadratic approximation of the objective function that DADMM minimizes at each iteration, is proposed here. The consequent reduction in computational time is shown to have minimal effect on convergence properties. Convergence still proceeds at a linear rate with a guaranteed constant that is asymptotically equivalent to the DADMM linear convergence rate constant. Numerical results demonstrate advantages of DQM relative to DADMM and other alternatives in a logistic regression problem.

Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis. Final Report

NASA Technical Reports Server (NTRS)

Thompson, P. M.

1980-01-01

Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

Solving Ordinary Differential Equations

NASA Technical Reports Server (NTRS)

Krogh, F. T.

1987-01-01

Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Lorentz Atom Revisited by Solving the Abraham-Lorentz Equation of Motion

NASA Astrophysics Data System (ADS)

Bosse, Jürgen

2017-08-01

By solving the non-relativistic Abraham-Lorentz (AL) equation, I demonstrate that the AL equation of motion is not suited for treating the Lorentz atom, because a steady-state solution does not exist. The AL equation serves as a tool, however, for deducing the appropriate parameters Ω and Γ to be used with the equation of forced oscillations in modelling the Lorentz atom. The electric polarisability, which many authors "derived" from the AL equation in recent years, is shown to violate Kramers-Kronig relations rendering obsolete the extracted photon-absorption rate, for example. Fortunately, errors turn out to be small quantitatively, as long as the light frequency ω is neither too close to nor too far from the resonance frequency Ω. The polarisability and absorption cross section are derived for the Lorentz atom by purely classical reasoning and are shown to agree with the quantum mechanical calculations of the same quantities. In particular, oscillator parameters Ω and Γ deduced by treating the atom as a quantum oscillator are found to be equivalent to those derived from the classical AL equation. The instructive comparison provides a deep insight into understanding the great success of Lorentz's model that was suggested long before the advent of quantum theory.

Solving the Fluid Pressure Poisson Equation Using Multigrid-Evaluation and Improvements.

PubMed

Dick, Christian; Rogowsky, Marcus; Westermann, Rudiger

2016-11-01

In many numerical simulations of fluids governed by the incompressible Navier-Stokes equations, the pressure Poisson equation needs to be solved to enforce mass conservation. Multigrid solvers show excellent convergence in simple scenarios, yet they can converge slowly in domains where physically separated regions are combined at coarser scales. Moreover, existing multigrid solvers are tailored to specific discretizations of the pressure Poisson equation, and they cannot easily be adapted to other discretizations. In this paper we analyze the convergence properties of existing multigrid solvers for the pressure Poisson equation in different simulation domains, and we show how to further improve the multigrid convergence rate by using a graph-based extension to determine the coarse grid hierarchy. The proposed multigrid solver is generic in that it can be applied to different kinds of discretizations of the pressure Poisson equation, by using solely the specification of the simulation domain and pre-assembled computational stencils. We analyze the proposed solver in combination with finite difference and finite volume discretizations of the pressure Poisson equation. Our evaluations show that, despite the common assumption, multigrid schemes can exploit their potential even in the most complicated simulation scenarios, yet this behavior is obtained at the price of higher memory consumption.

A meshless method for solving two-dimensional variable-order time fractional advection-diffusion equation

NASA Astrophysics Data System (ADS)

Tayebi, A.; Shekari, Y.; Heydari, M. H.

2017-07-01

Several physical phenomena such as transformation of pollutants, energy, particles and many others can be described by the well-known convection-diffusion equation which is a combination of the diffusion and advection equations. In this paper, this equation is generalized with the concept of variable-order fractional derivatives. The generalized equation is called variable-order time fractional advection-diffusion equation (V-OTFA-DE). An accurate and robust meshless method based on the moving least squares (MLS) approximation and the finite difference scheme is proposed for its numerical solution on two-dimensional (2-D) arbitrary domains. In the time domain, the finite difference technique with a θ-weighted scheme and in the space domain, the MLS approximation are employed to obtain appropriate semi-discrete solutions. Since the newly developed method is a meshless approach, it does not require any background mesh structure to obtain semi-discrete solutions of the problem under consideration, and the numerical solutions are constructed entirely based on a set of scattered nodes. The proposed method is validated in solving three different examples including two benchmark problems and an applied problem of pollutant distribution in the atmosphere. In all such cases, the obtained results show that the proposed method is very accurate and robust. Moreover, a remarkable property so-called positive scheme for the proposed method is observed in solving concentration transport phenomena.

Application of multi-grid methods for solving the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Demuren, A. O.

1989-01-01

This paper presents the application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems. The methods consists of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line- or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to those of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.

Application of multi-grid methods for solving the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Demuren, A. O.

1989-01-01

The application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems is discussed. The methods consist of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line-, or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to that of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.

Solving Navier-Stokes' equation using Castillo-Grone's mimetic difference operators on GPUs

NASA Astrophysics Data System (ADS)

Abouali, Mohammad; Castillo, Jose

2012-11-01

This paper discusses the performance and the accuracy of Castillo-Grone's (CG) mimetic difference operator in solving the Navier-Stokes' equation in order to simulate oceanic and atmospheric flows. The implementation is further adapted to harness the power of the many computing cores available on the Graphics Processing Units (GPUs) and the speedup is discussed.

Solving regularly and singularly perturbed reaction-diffusion equations in three space dimensions

NASA Astrophysics Data System (ADS)

Moore, Peter K.

2007-06-01

In [P.K. Moore, Effects of basis selection and h-refinement on error estimator reliability and solution efficiency for higher-order methods in three space dimensions, Int. J. Numer. Anal. Mod. 3 (2006) 21-51] a fixed, high-order h-refinement finite element algorithm, Href, was introduced for solving reaction-diffusion equations in three space dimensions. In this paper Href is coupled with continuation creating an automatic method for solving regularly and singularly perturbed reaction-diffusion equations. The simple quasilinear Newton solver of Moore, (2006) is replaced by the nonlinear solver NITSOL [M. Pernice, H.F. Walker, NITSOL: a Newton iterative solver for nonlinear systems, SIAM J. Sci. Comput. 19 (1998) 302-318]. Good initial guesses for the nonlinear solver are obtained using continuation in the small parameter ɛ. Two strategies allow adaptive selection of ɛ. The first depends on the rate of convergence of the nonlinear solver and the second implements backtracking in ɛ. Finally a simple method is used to select the initial ɛ. Several examples illustrate the effectiveness of the algorithm.

An Exponential Finite Difference Technique for Solving Partial Differential Equations. M.S. Thesis - Toledo Univ., Ohio

NASA Technical Reports Server (NTRS)

Handschuh, Robert F.

1987-01-01

An exponential finite difference algorithm, as first presented by Bhattacharya for one-dimensianal steady-state, heat conduction in Cartesian coordinates, has been extended. The finite difference algorithm developed was used to solve the diffusion equation in one-dimensional cylindrical coordinates and applied to two- and three-dimensional problems in Cartesian coordinates. The method was also used to solve nonlinear partial differential equations in one (Burger's equation) and two (Boundary Layer equations) dimensional Cartesian coordinates. Predicted results were compared to exact solutions where available, or to results obtained by other numerical methods. It was found that the exponential finite difference method produced results that were more accurate than those obtained by other numerical methods, especially during the initial transient portion of the solution. Other applications made using the exponential finite difference technique included unsteady one-dimensional heat transfer with temperature varying thermal conductivity and the development of the temperature field in a laminar Couette flow.

A systematic linear space approach to solving partially described inverse eigenvalue problems

NASA Astrophysics Data System (ADS)

Hu, Sau-Lon James; Li, Haujun

2008-06-01

Most applications of the inverse eigenvalue problem (IEP), which concerns the reconstruction of a matrix from prescribed spectral data, are associated with special classes of structured matrices. Solving the IEP requires one to satisfy both the spectral constraint and the structural constraint. If the spectral constraint consists of only one or few prescribed eigenpairs, this kind of inverse problem has been referred to as the partially described inverse eigenvalue problem (PDIEP). This paper develops an efficient, general and systematic approach to solve the PDIEP. Basically, the approach, applicable to various structured matrices, converts the PDIEP into an ordinary inverse problem that is formulated as a set of simultaneous linear equations. While solving simultaneous linear equations for model parameters, the singular value decomposition method is applied. Because of the conversion to an ordinary inverse problem, other constraints associated with the model parameters can be easily incorporated into the solution procedure. The detailed derivation and numerical examples to implement the newly developed approach to symmetric Toeplitz and quadratic pencil (including mass, damping and stiffness matrices of a linear dynamic system) PDIEPs are presented. Excellent numerical results for both kinds of problem are achieved under the situations that have either unique or infinitely many solutions.

Solving the Vlasov equation in two spatial dimensions with the Schrödinger method

NASA Astrophysics Data System (ADS)

Kopp, Michael; Vattis, Kyriakos; Skordis, Constantinos

2017-12-01

We demonstrate that the Vlasov equation describing collisionless self-gravitating matter may be solved with the so-called Schrödinger method (ScM). With the ScM, one solves the Schrödinger-Poisson system of equations for a complex wave function in d dimensions, rather than the Vlasov equation for a 2 d -dimensional phase space density. The ScM also allows calculating the d -dimensional cumulants directly through quasilocal manipulations of the wave function, avoiding the complexity of 2 d -dimensional phase space. We perform for the first time a quantitative comparison of the ScM and a conventional Vlasov solver in d =2 dimensions. Our numerical tests were carried out using two types of cold cosmological initial conditions: the classic collapse of a sine wave and those of a Gaussian random field as commonly used in cosmological cold dark matter N-body simulations. We compare the first three cumulants, that is, the density, velocity and velocity dispersion, to those obtained by solving the Vlasov equation using the publicly available code ColDICE. We find excellent qualitative and quantitative agreement between these codes, demonstrating the feasibility and advantages of the ScM as an alternative to N-body simulations. We discuss, the emergence of effective vorticity in the ScM through the winding number around the points where the wave function vanishes. As an application we evaluate the background pressure induced by the non-linearity of large scale structure formation, thereby estimating the magnitude of cosmological backreaction. We find that it is negligibly small and has time dependence and magnitude compatible with expectations from the effective field theory of large scale structure.

Who Solved the Bernoulli Differential Equation and How Did They Do It?

ERIC Educational Resources Information Center

Parker, Adam E.

2013-01-01

The Bernoulli brothers, Jacob and Johann, and Leibniz: Any of these might have been first to solve what is called the Bernoulli differential equation. We explore their ideas and the chronology of their work, finding out, among other things, that variation of parameters was used in 1697, 78 years before 1775, when Lagrange introduced it in general.

AN EXACT PEAK CAPTURING AND OSCILLATION-FREE SCHEME TO SOLVE ADVECTION-DISPERSION TRANSPORT EQUATIONS

EPA Science Inventory

An exact peak capturing and essentially oscillation-free (EPCOF) algorithm, consisting of advection-dispersion decoupling, backward method of characteristics, forward node tracking, and adaptive local grid refinement, is developed to solve transport equations. This algorithm repr...

Novel Approach for Solving the Equation of Motion of a Simple Harmonic Oscillator. Classroom Notes

ERIC Educational Resources Information Center

Gauthier, N.

2004-01-01

An elementary method, based on the use of complex variables, is proposed for solving the equation of motion of a simple harmonic oscillator. The method is first applied to the equation of motion for an undamped oscillator and it is then extended to the more important case of a damped oscillator. It is finally shown that the method can readily be…

A linear quadratic regulator approach to the stabilization of uncertain linear systems

NASA Technical Reports Server (NTRS)

Shieh, L. S.; Sunkel, J. W.; Wang, Y. J.

1990-01-01

This paper presents a linear quadratic regulator approach to the stabilization of uncertain linear systems. The uncertain systems under consideration are described by state equations with the presence of time-varying unknown-but-bounded uncertainty matrices. The method is based on linear quadratic regulator (LQR) theory and Liapunov stability theory. The robust stabilizing control law for a given uncertain system can be easily constructed from the symmetric positive-definite solution of the associated augmented Riccati equation. The proposed approach can be applied to matched and/or mismatched systems with uncertainty matrices in which only their matrix norms are bounded by some prescribed values and/or their entries are bounded by some prescribed constraint sets. Several numerical examples are presented to illustrate the results.

Two-dimensional integrating matrices on rectangular grids. [solving differential equations associated with rotating structures

NASA Technical Reports Server (NTRS)

Lakin, W. D.

1981-01-01

The use of integrating matrices in solving differential equations associated with rotating beam configurations is examined. In vibration problems, by expressing the equations of motion of the beam in matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the spatial dependence is removed from the governing partial differential equations and the resulting ordinary differential equations can be cast into standard eigenvalue form. Integrating matrices are derived based on two dimensional rectangular grids with arbitrary grid spacings allowed in one direction. The derivation of higher dimensional integrating matrices is the initial step in the generalization of the integrating matrix methodology to vibration and stability problems involving plates and shells.

Solving delay differential equations in S-ADAPT by method of steps.

PubMed

Bauer, Robert J; Mo, Gary; Krzyzanski, Wojciech

2013-09-01

S-ADAPT is a version of the ADAPT program that contains additional simulation and optimization abilities such as parametric population analysis. S-ADAPT utilizes LSODA to solve ordinary differential equations (ODEs), an algorithm designed for large dimension non-stiff and stiff problems. However, S-ADAPT does not have a solver for delay differential equations (DDEs). Our objective was to implement in S-ADAPT a DDE solver using the methods of steps. The method of steps allows one to solve virtually any DDE system by transforming it to an ODE system. The solver was validated for scalar linear DDEs with one delay and bolus and infusion inputs for which explicit analytic solutions were derived. Solutions of nonlinear DDE problems coded in S-ADAPT were validated by comparing them with ones obtained by the MATLAB DDE solver dde23. The estimation of parameters was tested on the MATLB simulated population pharmacodynamics data. The comparison of S-ADAPT generated solutions for DDE problems with the explicit solutions as well as MATLAB produced solutions which agreed to at least 7 significant digits. The population parameter estimates from using importance sampling expectation-maximization in S-ADAPT agreed with ones used to generate the data. Published by Elsevier Ireland Ltd.

Bv and Bfv Formulation of a Gauge Theory of Quadratic Lie Algebras in 2d and a Construction of W3 Topological Gravity

NASA Astrophysics Data System (ADS)

Dayi, Ömer F.

The recently proposed generalized field method for solving the master equation of Batalin and Vilkovisky is applied to a gauge theory of quadratic Lie algebras in two dimensions. The charge corresponding to BRST symmetry derived from this solution in terms of the phase space variables by using the Noether procedure, and the one found due to the BFV-method are compared and found to coincide. W3-algebra, formulated in terms of a continuous variable is exploit in the mentioned gauge theory to construct a W3 topological gravity. Moreover, its gauge fixing is briefly discussed.

Flexibility in Problem Solving: The Case of Equation Solving

ERIC Educational Resources Information Center

Star, Jon R.; Rittle-Johnson, Bethany

2008-01-01

A key learning outcome in problem-solving domains is the development of flexible knowledge, where learners know multiple strategies and adaptively choose efficient strategies. Two interventions hypothesized to improve flexibility in problem solving were experimentally evaluated: prompts to discover multiple strategies and direct instruction on…

Solving differential equations for Feynman integrals by expansions near singular points

NASA Astrophysics Data System (ADS)

Lee, Roman N.; Smirnov, Alexander V.; Smirnov, Vladimir A.

2018-03-01

We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with two scales, i.e. non-trivially depending on one variable. The corresponding algorithm is oriented at situations where canonical form of the differential equations is impossible. We provide a computer code constructed with the help of our algorithm for a simple example of four-loop generalized sunset integrals with three equal non-zero masses and two zero masses. Our code gives values of the master integrals at any given point on the real axis with a required accuracy and a given order of expansion in the regularization parameter ɛ.

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

PubMed

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.

The use of solution adaptive grids in solving partial differential equations

NASA Technical Reports Server (NTRS)

Anderson, D. A.; Rai, M. M.

1982-01-01

The grid point distribution used in solving a partial differential equation using a numerical method has a substantial influence on the quality of the solution. An adaptive grid which adjusts as the solution changes provides the best results when the number of grid points available for use during the calculation is fixed. Basic concepts used in generating and applying adaptive grids are reviewed in this paper, and examples illustrating applications of these concepts are presented.

A Novel Approach to Solve Linearized Stellar Pulsation Equations

NASA Astrophysics Data System (ADS)

Bard, Christopher; Teitler, S.

2011-01-01

We present a new approach to modeling linearized, non-radial pulsations in differentially rotating, massive stars. As a first step in this direction, we consider adiabatic pulsations and adopt the Cowling approximation that perturbations of the gravitational potential and its radial derivative are negligible. The angular dependence of the pulsation modes is expressed as a series expansion of associated Legendre polynomials; the resulting coupled system of differential equations is then solved by finding the eigenfrequencies at which the determinant of a characteristic matrix vanishes. Our method improves on previous treatments by removing the requirement that an arbitrary normalization be applied to the eigenfunctions; this brings the benefit of improved numerical robustness.

New operational matrices for solving fractional differential equations on the half-line.

PubMed

Bhrawy, Ali H; Taha, Taha M; Alzahrani, Ebraheem O; Alzahrani, Ebrahim O; Baleanu, Dumitru; Alzahrani, Abdulrahim A

2015-01-01

In this paper, the fractional-order generalized Laguerre operational matrices (FGLOM) of fractional derivatives and fractional integration are derived. These operational matrices are used together with spectral tau method for solving linear fractional differential equations (FDEs) of order ν (0 < ν < 1) on the half line. An upper bound of the absolute errors is obtained for the approximate and exact solutions. Fractional-order generalized Laguerre pseudo-spectral approximation is investigated for solving nonlinear initial value problem of fractional order ν. The extension of the fractional-order generalized Laguerre pseudo-spectral method is given to solve systems of FDEs. We present the advantages of using the spectral schemes based on fractional-order generalized Laguerre functions and compare them with other methods. Several numerical examples are implemented for FDEs and systems of FDEs including linear and nonlinear terms. We demonstrate the high accuracy and the efficiency of the proposed techniques.

New Operational Matrices for Solving Fractional Differential Equations on the Half-Line

PubMed Central

2015-01-01

In this paper, the fractional-order generalized Laguerre operational matrices (FGLOM) of fractional derivatives and fractional integration are derived. These operational matrices are used together with spectral tau method for solving linear fractional differential equations (FDEs) of order ν (0 < ν < 1) on the half line. An upper bound of the absolute errors is obtained for the approximate and exact solutions. Fractional-order generalized Laguerre pseudo-spectral approximation is investigated for solving nonlinear initial value problem of fractional order ν. The extension of the fractional-order generalized Laguerre pseudo-spectral method is given to solve systems of FDEs. We present the advantages of using the spectral schemes based on fractional-order generalized Laguerre functions and compare them with other methods. Several numerical examples are implemented for FDEs and systems of FDEs including linear and nonlinear terms. We demonstrate the high accuracy and the efficiency of the proposed techniques. PMID:25996369

Interactive application of quadratic expansion of chi-square statistic to nonlinear curve fitting

NASA Technical Reports Server (NTRS)

Badavi, F. F.; Everhart, Joel L.

1987-01-01

This report contains a detailed theoretical description of an all-purpose, interactive curve-fitting routine that is based on P. R. Bevington's description of the quadratic expansion of the Chi-Square statistic. The method is implemented in the associated interactive, graphics-based computer program. Taylor's expansion of Chi-Square is first introduced, and justifications for retaining only the first term are presented. From the expansion, a set of n simultaneous linear equations is derived, then solved by matrix algebra. A brief description of the code is presented along with a limited number of changes that are required to customize the program of a particular task. To evaluate the performance of the method and the goodness of nonlinear curve fitting, two typical engineering problems are examined and the graphical and tabular output of each is discussed. A complete listing of the entire package is included as an appendix.

Neural network error correction for solving coupled ordinary differential equations

NASA Technical Reports Server (NTRS)

Shelton, R. O.; Darsey, J. A.; Sumpter, B. G.; Noid, D. W.

1992-01-01

A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

Solving a mixture of many random linear equations by tensor decomposition and alternating minimization.

DOT National Transportation Integrated Search

2016-09-01

We consider the problem of solving mixed random linear equations with k components. This is the noiseless setting of mixed linear regression. The goal is to estimate multiple linear models from mixed samples in the case where the labels (which sample...

A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TETRAHEDRAL DOMAINS

PubMed Central

Fu, Zhisong; Kirby, Robert M.; Whitaker, Ross T.

2014-01-01

Generating numerical solutions to the eikonal equation and its many variations has a broad range of applications in both the natural and computational sciences. Efficient solvers on cutting-edge, parallel architectures require new algorithms that may not be theoretically optimal, but that are designed to allow asynchronous solution updates and have limited memory access patterns. This paper presents a parallel algorithm for solving the eikonal equation on fully unstructured tetrahedral meshes. The method is appropriate for the type of fine-grained parallelism found on modern massively-SIMD architectures such as graphics processors and takes into account the particular constraints and capabilities of these computing platforms. This work builds on previous work for solving these equations on triangle meshes; in this paper we adapt and extend previous two-dimensional strategies to accommodate three-dimensional, unstructured, tetrahedralized domains. These new developments include a local update strategy with data compaction for tetrahedral meshes that provides solutions on both serial and parallel architectures, with a generalization to inhomogeneous, anisotropic speed functions. We also propose two new update schemes, specialized to mitigate the natural data increase observed when moving to three dimensions, and the data structures necessary for efficiently mapping data to parallel SIMD processors in a way that maintains computational density. Finally, we present descriptions of the implementations for a single CPU, as well as multicore CPUs with shared memory and SIMD architectures, with comparative results against state-of-the-art eikonal solvers. PMID:25221418

Solving the Sea-Level Equation in an Explicit Time Differencing Scheme

NASA Astrophysics Data System (ADS)

Klemann, V.; Hagedoorn, J. M.; Thomas, M.

2016-12-01

In preparation of coupling the solid-earth to an ice-sheet compartment in an earth-system model, the dependency of initial topography on the ice-sheet history and viscosity structure has to be analysed. In this study, we discuss this dependency and how it influences the reconstruction of former sea level during a glacial cycle. The modelling is based on the VILMA code in which the field equations are solved in the time domain applying an explicit time-differencing scheme. The sea-level equation is solved simultaneously in the same explicit scheme as the viscoleastic field equations (Hagedoorn et al., 2007). With the assumption of only small changes, we neglect the iterative solution at each time step as suggested by e.g. Kendall et al. (2005). Nevertheless, the prediction of the initial paleo topography in case of moving coastlines remains to be iterated by repeated integration of the whole load history. The sensitivity study sketched at the beginning is accordingly motivated by the question if the iteration of the paleo topography can be replaced by a predefined one. This study is part of the German paleoclimate modelling initiative PalMod. Lit:Hagedoorn JM, Wolf D, Martinec Z, 2007. An estimate of global mean sea-level rise inferred from tide-gauge measurements using glacial-isostatic models consistent with the relative sea-level record. Pure appl. Geophys. 164: 791-818, doi:10.1007/s00024-007-0186-7Kendall RA, Mitrovica JX, Milne GA, 2005. On post-glacial sea level - II. Numerical formulation and comparative reesults on spherically symmetric models. Geophys. J. Int., 161: 679-706, doi:10.1111/j.365-246.X.2005.02553.x

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

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

AESOP- INTERACTIVE DESIGN OF LINEAR QUADRATIC REGULATORS AND KALMAN FILTERS

NASA Technical Reports Server (NTRS)

Lehtinen, B.

1994-01-01

AESOP was developed to solve a number of problems associated with the design of controls and state estimators for linear time-invariant systems. The systems considered are modeled in state-variable form by a set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are the linear quadratic regulator (LQR) design problem and the steady-state Kalman filter design problem. AESOP is designed to be used in an interactive manner. The user can solve design problems and analyze the solutions in a single interactive session. Both numerical and graphical information are available to the user during the session. The AESOP program is structured around a list of predefined functions. Each function performs a single computation associated with control, estimation, or system response determination. AESOP contains over sixty functions and permits the easy inclusion of user defined functions. The user accesses these functions either by inputting a list of desired functions in the order they are to be performed, or by specifying a single function to be performed. The latter case is used when the choice of function and function order depends on the results of previous functions. The available AESOP functions are divided into several general areas including: 1) program control, 2) matrix input and revision, 3) matrix formation, 4) open-loop system analysis, 5) frequency response, 6) transient response, 7) transient function zeros, 8) LQR and Kalman filter design, 9) eigenvalues and eigenvectors, 10) covariances, and 11) user-defined functions. The most important functions are those that design linear quadratic regulators and Kalman filters. The user interacts with AESOP when using these functions by inputting design weighting parameters and by viewing displays of designed system response. Support functions obtain system transient and frequency responses, transfer functions, and covariance matrices. AESOP can also provide the user

A novel approach to solve nonlinear Fredholm integral equations of the second kind.

PubMed

Li, Hu; Huang, Jin

2016-01-01

In this paper, we present a novel approach to solve nonlinear Fredholm integral equations of the second kind. This algorithm is constructed by the integral mean value theorem and Newton iteration. Convergence and error analysis of the numerical solutions are given. Moreover, Numerical examples show the algorithm is very effective and simple.

Self-Replicating Quadratics

ERIC Educational Resources Information Center

Withers, Christopher S.; Nadarajah, Saralees

2012-01-01

We show that there are exactly four quadratic polynomials, Q(x) = x [superscript 2] + ax + b, such that (x[superscript 2] + ax + b) (x[superscript 2] - ax + b) = (x[superscript 4] + ax[superscript 2] + b). For n = 1, 2, ..., these quadratic polynomials can be written as the product of N = 2[superscript n] quadratic polynomials in x[superscript…

A Legendre tau-spectral method for solving time-fractional heat equation with nonlocal conditions.

PubMed

Bhrawy, A H; Alghamdi, M A

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem.

A Legendre tau-Spectral Method for Solving Time-Fractional Heat Equation with Nonlocal Conditions

PubMed Central

Bhrawy, A. H.; Alghamdi, M. A.

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem. PMID:25057507

Direct Solve of Electrically Large Integral Equations for Problem Sizes to 1M Unknowns

NASA Technical Reports Server (NTRS)

Shaeffer, John

2008-01-01

Matrix methods for solving integral equations via direct solve LU factorization are presently limited to weeks to months of very expensive supercomputer time for problems sizes of several hundred thousand unknowns. This report presents matrix LU factor solutions for electromagnetic scattering problems for problem sizes to one million unknowns with thousands of right hand sides that run in mere days on PC level hardware. This EM solution is accomplished by utilizing the numerical low rank nature of spatially blocked unknowns using the Adaptive Cross Approximation for compressing the rank deficient blocks of the system Z matrix, the L and U factors, the right hand side forcing function and the final current solution. This compressed matrix solution is applied to a frequency domain EM solution of Maxwell's equations using standard Method of Moments approach. Compressed matrix storage and operations count leads to orders of magnitude reduction in memory and run time.

A new modified conjugate gradient coefficient for solving system of linear equations

NASA Astrophysics Data System (ADS)

Hajar, N.; ‘Aini, N.; Shapiee, N.; Abidin, Z. Z.; Khadijah, W.; Rivaie, M.; Mamat, M.

2017-09-01

Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations

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

NASA Astrophysics Data System (ADS)

Alam Khan, Najeeb; Razzaq, Oyoon Abdul

2016-03-01

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

Solving the chemical master equation using sliding windows

PubMed Central

2010-01-01

Background The chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a "window" into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species. Results In order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy. Conclusions The sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori. PMID:20377904

An Artificial Neural Networks Method for Solving Partial Differential Equations

NASA Astrophysics Data System (ADS)

Alharbi, Abir

2010-09-01

While there already exists many analytical and numerical techniques for solving PDEs, this paper introduces an approach using artificial neural networks. The approach consists of a technique developed by combining the standard numerical method, finite-difference, with the Hopfield neural network. The method is denoted Hopfield-finite-difference (HFD). The architecture of the nets, energy function, updating equations, and algorithms are developed for the method. The HFD method has been used successfully to approximate the solution of classical PDEs, such as the Wave, Heat, Poisson and the Diffusion equations, and on a system of PDEs. The software Matlab is used to obtain the results in both tabular and graphical form. The results are similar in terms of accuracy to those obtained by standard numerical methods. In terms of speed, the parallel nature of the Hopfield nets methods makes them easier to implement on fast parallel computers while some numerical methods need extra effort for parallelization.

A fast semi-discrete Kansa method to solve the two-dimensional spatiotemporal fractional diffusion equation

NASA Astrophysics Data System (ADS)

Sun, HongGuang; Liu, Xiaoting; Zhang, Yong; Pang, Guofei; Garrard, Rhiannon

2017-09-01

Fractional-order diffusion equations (FDEs) extend classical diffusion equations by quantifying anomalous diffusion frequently observed in heterogeneous media. Real-world diffusion can be multi-dimensional, requiring efficient numerical solvers that can handle long-term memory embedded in mass transport. To address this challenge, a semi-discrete Kansa method is developed to approximate the two-dimensional spatiotemporal FDE, where the Kansa approach first discretizes the FDE, then the Gauss-Jacobi quadrature rule solves the corresponding matrix, and finally the Mittag-Leffler function provides an analytical solution for the resultant time-fractional ordinary differential equation. Numerical experiments are then conducted to check how the accuracy and convergence rate of the numerical solution are affected by the distribution mode and number of spatial discretization nodes. Applications further show that the numerical method can efficiently solve two-dimensional spatiotemporal FDE models with either a continuous or discrete mixing measure. Hence this study provides an efficient and fast computational method for modeling super-diffusive, sub-diffusive, and mixed diffusive processes in large, two-dimensional domains with irregular shapes.

Use of Picard and Newton iteration for solving nonlinear ground water flow equations

USGS Publications Warehouse

Mehl, S.

2006-01-01

This study examines the use of Picard and Newton iteration to solve the nonlinear, saturated ground water flow equation. Here, a simple three-node problem is used to demonstrate the convergence difficulties that can arise when solving the nonlinear, saturated ground water flow equation in both homogeneous and heterogeneous systems with and without nonlinear boundary conditions. For these cases, the characteristic types of convergence patterns are examined. Viewing these convergence patterns as orbits of an attractor in a dynamical system provides further insight. It is shown that the nonlinearity that arises from nonlinear head-dependent boundary conditions can cause more convergence difficulties than the nonlinearity that arises from flow in an unconfined aquifer. Furthermore, the effects of damping on both convergence and convergence rate are investigated. It is shown that no single strategy is effective for all problems and how understanding pitfalls and merits of several methods can be helpful in overcoming convergence difficulties. Results show that Picard iterations can be a simple and effective method for the solution of nonlinear, saturated ground water flow problems.

Solving Nonlinear Coupled Differential Equations

NASA Technical Reports Server (NTRS)

Mitchell, L.; David, J.

1986-01-01

Harmonic balance method developed to obtain approximate steady-state solutions for nonlinear coupled ordinary differential equations. Method usable with transfer matrices commonly used to analyze shaft systems. Solution to nonlinear equation, with periodic forcing function represented as sum of series similar to Fourier series but with form of terms suggested by equation itself.

Linear quadratic regulators with eigenvalue placement in a specified region

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Dib, Hani M.; Ganesan, Sekar

1988-01-01

A linear optimal quadratic regulator is developed for optimally placing the closed-loop poles of multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at + or - pi/2k (k = 2 or 3) from the negative real axis with a sector angle of pi/2 or less, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane. The design method is mainly based on the solution of a linear matrix Liapunov equation, and the resultant closed-loop system with its eigenvalues in the desired region is optimal with respect to a quadratic performance index.

Sequential Quadratic Programming Algorithms for Optimization

DTIC Science & Technology

1989-08-01

quadratic program- ma ng (SQ(2l ) aIiatain.seenis to be relgarded aIs tie( buest choice for the solution of smiall. dlense problema (see S tour L)toS...For the step along d, note that a < nOing + 3 szH + i3.ninA A a K f~Iz,;nd and from Id1 _< ,,, we must have that for some /3 , np , 11P11 < dn"p. 5.2...Nevertheless, many of these problems are considered hard to solve. Moreover, for some of these problems the assumptions made in Chapter 2 to establish the

Using 4th order Runge-Kutta method for solving a twisted Skyrme string equation

NASA Astrophysics Data System (ADS)

Hadi, Miftachul; Anderson, Malcolm; Husein, Andri

2016-03-01

We study numerical solution, especially using 4th order Runge-Kutta method, for solving a twisted Skyrme string equation. We find numerically that the value of minimum energy per unit length of vortex solution for a twisted Skyrmion string is 20.37 × 1060 eV/m.

Solving differential equations with unknown constitutive relations as recurrent neural networks

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

Hagge, Tobias J.; Stinis, Panagiotis; Yeung, Enoch H.

We solve a system of ordinary differential equations with an unknown functional form of a sink (reaction rate) term. We assume that the measurements (time series) of state variables are partially available, and use a recurrent neural network to “learn” the reaction rate from this data. This is achieved by including discretized ordinary differential equations as part of a recurrent neural network training problem. We extend TensorFlow’s recurrent neural network architecture to create a simple but scalable and effective solver for the unknown functions, and apply it to a fedbatch bioreactor simulation problem. Use of techniques from recent deep learningmore » literature enables training of functions with behavior manifesting over thousands of time steps. Our networks are structurally similar to recurrent neural networks, but differ in purpose, and require modified training strategies.« less

On some theoretical and practical aspects of multigrid methods. [to solve finite element systems from elliptic equations

NASA Technical Reports Server (NTRS)

Nicolaides, R. A.

1979-01-01

A description and explanation of a simple multigrid algorithm for solving finite element systems is given. Numerical results for an implementation are reported for a number of elliptic equations, including cases with singular coefficients and indefinite equations. The method shows the high efficiency, essentially independent of the grid spacing, predicted by the theory.

Modifying a numerical algorithm for solving the matrix equation X + AX T B = C

NASA Astrophysics Data System (ADS)

Vorontsov, Yu. O.

2013-06-01

Certain modifications are proposed for a numerical algorithm solving the matrix equation X + AX T B = C. By keeping the intermediate results in storage and repeatedly using them, it is possible to reduce the total complexity of the algorithm from O( n 4) to O( n 3) arithmetic operations.

GPELab, a Matlab toolbox to solve Gross-Pitaevskii equations II: Dynamics and stochastic simulations

NASA Astrophysics Data System (ADS)

Antoine, Xavier; Duboscq, Romain

2015-08-01

GPELab is a free Matlab toolbox for modeling and numerically solving large classes of systems of Gross-Pitaevskii equations that arise in the physics of Bose-Einstein condensates. The aim of this second paper, which follows (Antoine and Duboscq, 2014), is to first present the various pseudospectral schemes available in GPELab for computing the deterministic and stochastic nonlinear dynamics of Gross-Pitaevskii equations (Antoine, et al., 2013). Next, the corresponding GPELab functions are explained in detail. Finally, some numerical examples are provided to show how the code works for the complex dynamics of BEC problems.

Solving Navier-Stokes equations on a massively parallel processor; The 1 GFLOP performance

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

Saati, A.; Biringen, S.; Farhat, C.

This paper reports on experience in solving large-scale fluid dynamics problems on the Connection Machine model CM-2. The authors have implemented a parallel version of the MacCormack scheme for the solution of the Navier-Stokes equations. By using triad floating point operations and reducing the number of interprocessor communications, they have achieved a sustained performance rate of 1.42 GFLOPS.

Symmetry-breaking instability of quadratic soliton bound states

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

Delque, Michaeel; Departement d'Optique P.M. Duffieux, Institut FEMTO-ST, Universite de Franche-Comte, CNRS UMR 6174, F-25030 Besancon; Fanjoux, Gil

We study both numerically and experimentally two-dimensional soliton bound states in quadratic media and demonstrate their symmetry-breaking instability. The experiment is performed in a potassium titanyl phosphate crystal in a type-II configuration. The bound state is generated by the copropagation of the antisymmetric fundamental beam locked in phase with the symmetrical second harmonic one. Experimental results are in good agreement with numerical simulations of the nonlinear wave equations.

The wave function and minimum uncertainty function of the bound quadratic Hamiltonian system

NASA Technical Reports Server (NTRS)

Yeon, Kyu Hwang; Um, Chung IN; George, T. F.

1994-01-01

The bound quadratic Hamiltonian system is analyzed explicitly on the basis of quantum mechanics. We have derived the invariant quantity with an auxiliary equation as the classical equation of motion. With the use of this invariant it can be determined whether or not the system is bound. In bound system we have evaluated the exact eigenfunction and minimum uncertainty function through unitary transformation.

Introducing Algebraic Structures through Solving Equations: Vertical Content Knowledge for K-12 Mathematics Teachers

ERIC Educational Resources Information Center

Wasserman, Nicholas H.

2014-01-01

Algebraic structures are a necessary aspect of algebraic thinking for K-12 students and teachers. An approach for introducing the algebraic structure of groups and fields through the arithmetic properties required for solving simple equations is summarized; the collective (not individual) importance of these axioms as a foundation for algebraic…

Quadratic soliton self-reflection at a quadratically nonlinear interface

NASA Astrophysics Data System (ADS)

Jankovic, Ladislav; Kim, Hongki; Stegeman, George; Carrasco, Silvia; Torner, Lluis; Katz, Mordechai

2003-11-01

The reflection of bulk quadratic solutions incident onto a quadratically nonlinear interface in periodically poled potassium titanyl phosphate was observed. The interface consisted of the boundary between two quasi-phase-matched regions displaced from each other by a half-period. At high intensities and small angles of incidence the soliton is reflected.

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

PubMed

Benhammouda, Brahim

2016-01-01

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

A Fourier collocation time domain method for numerically solving Maxwell's equations

NASA Technical Reports Server (NTRS)

Shebalin, John V.

1991-01-01

A new method for solving Maxwell's equations in the time domain for arbitrary values of permittivity, conductivity, and permeability is presented. Spatial derivatives are found by a Fourier transform method and time integration is performed using a second order, semi-implicit procedure. Electric and magnetic fields are collocated on the same grid points, rather than on interleaved points, as in the Finite Difference Time Domain (FDTD) method. Numerical results are presented for the propagation of a 2-D Transverse Electromagnetic (TEM) mode out of a parallel plate waveguide and into a dielectric and conducting medium.

Modeling digital pulse waveforms by solving one-dimensional Navier-stokes equations.

PubMed

Fedotov, Aleksandr A; Akulova, Anna S; Akulov, Sergey A

2016-08-01

Mathematical modeling for composition distal arterial pulse wave in the blood vessels of the upper limbs was considered. Formation of distal arterial pulse wave is represented as a composition of forward and reflected pulse waves propagating along the arterial vessels. The formal analogy between pulse waves propagation along the human arterial system and the propagation of electrical oscillations in electrical transmission lines with distributed parameters was proposed. Dependencies of pulse wave propagation along the human arterial system were obtained by solving the one-dimensional Navier-Stokes equations for a few special cases.

A Comparison of Methods for Estimating Quadratic Effects in Nonlinear Structural Equation Models

ERIC Educational Resources Information Center

Harring, Jeffrey R.; Weiss, Brandi A.; Hsu, Jui-Chen

2012-01-01

Two Monte Carlo simulations were performed to compare methods for estimating and testing hypotheses of quadratic effects in latent variable regression models. The methods considered in the current study were (a) a 2-stage moderated regression approach using latent variable scores, (b) an unconstrained product indicator approach, (c) a latent…

Auxiliary variables for numerically solving nonlinear equations with softly broken symmetries.

PubMed

Olum, Ken D; Masoumi, Ali

2017-06-01

General methods for solving simultaneous nonlinear equations work by generating a sequence of approximate solutions that successively improve a measure of the total error. However, if the total error function has a narrow curved valley, the available techniques tend to find the solution after a very large number of steps, if ever. The solver first converges rapidly to the valley, but once there it converges extremely slowly to the solution. In this paper we show that in the specific physically important case where these valleys are the result of a softly broken symmetry, the solution can often be found much more quickly by adding the generators of the softly broken symmetry as auxiliary variables. This makes the number of variables more than the equations and hence there will be a family of solutions, any one of which would be acceptable. We present a procedure for finding solutions in this case and apply it to several simple examples and an important problem in the physics of false vacuum decay. We also provide a Mathematica package that implements Powell's hybrid method with the generalization to allow more variables than equations.

Will Learning to Solve One-Step Equations Pose a Challenge to 8th Grade Students?

ERIC Educational Resources Information Center

Ngu, Bing Hiong; Phan, Huy P.

2017-01-01

Assimilating multiple interactive elements simultaneously in working memory to allow understanding to occur, while solving an equation, would impose a high cognitive load. "Element interactivity" arises from the interaction between elements within and across operational and relational lines. Moreover, operating with special features…

A higher-order conservation element solution element method for solving hyperbolic differential equations on unstructured meshes

NASA Astrophysics Data System (ADS)

Bilyeu, David

This dissertation presents an extension of the Conservation Element Solution Element (CESE) method from second- to higher-order accuracy. The new method retains the favorable characteristics of the original second-order CESE scheme, including (i) the use of the space-time integral equation for conservation laws, (ii) a compact mesh stencil, (iii) the scheme will remain stable up to a CFL number of unity, (iv) a fully explicit, time-marching integration scheme, (v) true multidimensionality without using directional splitting, and (vi) the ability to handle two- and three-dimensional geometries by using unstructured meshes. This algorithm has been thoroughly tested in one, two and three spatial dimensions and has been shown to obtain the desired order of accuracy for solving both linear and non-linear hyperbolic partial differential equations. The scheme has also shown its ability to accurately resolve discontinuities in the solutions. Higher order unstructured methods such as the Discontinuous Galerkin (DG) method and the Spectral Volume (SV) methods have been developed for one-, two- and three-dimensional application. Although these schemes have seen extensive development and use, certain drawbacks of these methods have been well documented. For example, the explicit versions of these two methods have very stringent stability criteria. This stability criteria requires that the time step be reduced as the order of the solver increases, for a given simulation on a given mesh. The research presented in this dissertation builds upon the work of Chang, who developed a fourth-order CESE scheme to solve a scalar one-dimensional hyperbolic partial differential equation. The completed research has resulted in two key deliverables. The first is a detailed derivation of a high-order CESE methods on unstructured meshes for solving the conservation laws in two- and three-dimensional spaces. The second is the code implementation of these numerical methods in a computer code. For

Teacher-Designed Software for Interactive Linear Equations: Concepts, Interpretive Skills, Applications & Word-Problem Solving.

ERIC Educational Resources Information Center

Lawrence, Virginia

No longer just a user of commercial software, the 21st century teacher is a designer of interactive software based on theories of learning. This software, a comprehensive study of straightline equations, enhances conceptual understanding, sketching, graphic interpretive and word problem solving skills as well as making connections to real-life and…

Predicting Eight Grade Students' Equation Solving Performances via Concepts of Variable and Equality

ERIC Educational Resources Information Center

Ertekin, Erhan

2017-01-01

This study focused on how two algebraic concepts- equality and variable- predicted 8th grade students' equation solving performance. In this study, predictive design as a correlational research design was used. Randomly selected 407 eight-grade students who were from the central districts of a city in the central region of Turkey participated in…

Memetic computing through bio-inspired heuristics integration with sequential quadratic programming for nonlinear systems arising in different physical models.

PubMed

Raja, Muhammad Asif Zahoor; Kiani, Adiqa Kausar; Shehzad, Azam; Zameer, Aneela

2016-01-01

In this study, bio-inspired computing is exploited for solving system of nonlinear equations using variants of genetic algorithms (GAs) as a tool for global search method hybrid with sequential quadratic programming (SQP) for efficient local search. The fitness function is constructed by defining the error function for systems of nonlinear equations in mean square sense. The design parameters of mathematical models are trained by exploiting the competency of GAs and refinement are carried out by viable SQP algorithm. Twelve versions of the memetic approach GA-SQP are designed by taking a different set of reproduction routines in the optimization process. Performance of proposed variants is evaluated on six numerical problems comprising of system of nonlinear equations arising in the interval arithmetic benchmark model, kinematics, neurophysiology, combustion and chemical equilibrium. Comparative studies of the proposed results in terms of accuracy, convergence and complexity are performed with the help of statistical performance indices to establish the worth of the schemes. Accuracy and convergence of the memetic computing GA-SQP is found better in each case of the simulation study and effectiveness of the scheme is further established through results of statistics based on different performance indices for accuracy and complexity.

A boundary value approach for solving three-dimensional elliptic and hyperbolic partial differential equations.

PubMed

Biala, T A; Jator, S N

2015-01-01

In this article, the boundary value method is applied to solve three dimensional elliptic and hyperbolic partial differential equations. The partial derivatives with respect to two of the spatial variables (y, z) are discretized using finite difference approximations to obtain a large system of ordinary differential equations (ODEs) in the third spatial variable (x). Using interpolation and collocation techniques, a continuous scheme is developed and used to obtain discrete methods which are applied via the Block unification approach to obtain approximations to the resulting large system of ODEs. Several test problems are investigated to elucidate the solution process.

Killing vector fields in three dimensions: a method to solve massive gravity field equations

NASA Astrophysics Data System (ADS)

Gürses, Metin

2010-10-01

Killing vector fields in three dimensions play an important role in the construction of the related spacetime geometry. In this work we show that when a three-dimensional geometry admits a Killing vector field then the Ricci tensor of the geometry is determined in terms of the Killing vector field and its scalars. In this way we can generate all products and covariant derivatives at any order of the Ricci tensor. Using this property we give ways to solve the field equations of topologically massive gravity (TMG) and new massive gravity (NMG) introduced recently. In particular when the scalars of the Killing vector field (timelike, spacelike and null cases) are constants then all three-dimensional symmetric tensors of the geometry, the Ricci and Einstein tensors, their covariant derivatives at all orders, and their products of all orders are completely determined by the Killing vector field and the metric. Hence, the corresponding three-dimensional metrics are strong candidates for solving all higher derivative gravitational field equations in three dimensions.

Elegant Ince-Gaussian beams in a quadratic-index medium

NASA Astrophysics Data System (ADS)

Bai, Zhi-Yong; Deng, Dong-Mei; Guo, Qi

2011-09-01

Elegant Ince—Gaussian beams, which are the exact solutions of the paraxial wave equation in a quadratic-index medium, are derived in elliptical coordinates. These kinds of beams are the alternative form of standard Ince—Gaussian beams and they display better symmetry between the Ince-polynomials and the Gaussian function in mathematics. The transverse intensity distribution and the phase of the elegant Ince—Gaussian beams are discussed.

A general time-dependent stochastic method for solving Parker's transport equation in spherical coordinates

NASA Astrophysics Data System (ADS)

Pei, C.; Bieber, J. W.; Burger, R. A.; Clem, J.

2010-12-01

We present a detailed description of our newly developed stochastic approach for solving Parker's transport equation, which we believe is the first attempt to solve it with time dependence in 3-D, evolving from our 3-D steady state stochastic approach. Our formulation of this method is general and is valid for any type of heliospheric magnetic field, although we choose the standard Parker field as an example to illustrate the steps to calculate the transport of galactic cosmic rays. Our 3-D stochastic method is different from other stochastic approaches in the literature in several ways. For example, we employ spherical coordinates to integrate directly, which makes the code much more efficient by reducing coordinate transformations. What is more, the equivalence between our stochastic differential equations and Parker's transport equation is guaranteed by Ito's theorem in contrast to some other approaches. We generalize the technique for calculating particle flux based on the pseudoparticle trajectories for steady state solutions and for time-dependent solutions in 3-D. To validate our code, first we show that good agreement exists between solutions obtained by our steady state stochastic method and a traditional finite difference method. Then we show that good agreement also exists for our time-dependent method for an idealized and simplified heliosphere which has a Parker magnetic field and a simple initial condition for two different inner boundary conditions.

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

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

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

2008-05-15

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

A numerical spectral approach to solve the dislocation density transport equation

NASA Astrophysics Data System (ADS)

Djaka, K. S.; Taupin, V.; Berbenni, S.; Fressengeas, C.

2015-09-01

A numerical spectral approach is developed to solve in a fast, stable and accurate fashion, the quasi-linear hyperbolic transport equation governing the spatio-temporal evolution of the dislocation density tensor in the mechanics of dislocation fields. The approach relies on using the Fast Fourier Transform algorithm. Low-pass spectral filters are employed to control both the high frequency Gibbs oscillations inherent to the Fourier method and the fast-growing numerical instabilities resulting from the hyperbolic nature of the transport equation. The numerical scheme is validated by comparison with an exact solution in the 1D case corresponding to dislocation dipole annihilation. The expansion and annihilation of dislocation loops in 2D and 3D settings are also produced and compared with finite element approximations. The spectral solutions are shown to be stable, more accurate for low Courant numbers and much less computation time-consuming than the finite element technique based on an explicit Galerkin-least squares scheme.

The Parker-Sochacki Method of Solving Differential Equations: Applications and Limitations

NASA Astrophysics Data System (ADS)

Rudmin, Joseph W.

2006-11-01

The Parker-Sochacki method is a powerful but simple technique of solving systems of differential equations, giving either analytical or numerical results. It has been in use for about 10 years now since its discovery by G. Edgar Parker and James Sochacki of the James Madison University Dept. of Mathematics and Statistics. It is being presented here because it is still not widely known and can benefit the listeners. It is a method of rapidly generating the Maclauren series to high order, non-iteratively. It has been successfully applied to more than a hundred systems of equations, including the classical many-body problem. Its advantages include its speed of calculation, its simplicity, and the fact that it uses only addition, subtraction and multiplication. It is not just a polynomial approximation, because it yields the Maclaurin series, and therefore exhibits the advantages and disadvantages of that series. A few applications will be presented.

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

PubMed

Khader, M M

2013-10-01

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

The meshless local Petrov-Galerkin method based on moving Kriging interpolation for solving the time fractional Navier-Stokes equations.

PubMed

Thamareerat, N; Luadsong, A; Aschariyaphotha, N

2016-01-01

In this paper, we present a numerical scheme used to solve the nonlinear time fractional Navier-Stokes equations in two dimensions. We first employ the meshless local Petrov-Galerkin (MLPG) method based on a local weak formulation to form the system of discretized equations and then we will approximate the time fractional derivative interpreted in the sense of Caputo by a simple quadrature formula. The moving Kriging interpolation which possesses the Kronecker delta property is applied to construct shape functions. This research aims to extend and develop further the applicability of the truly MLPG method to the generalized incompressible Navier-Stokes equations. Two numerical examples are provided to illustrate the accuracy and efficiency of the proposed algorithm. Very good agreement between the numerically and analytically computed solutions can be observed in the verification. The present MLPG method has proved its efficiency and reliability for solving the two-dimensional time fractional Navier-Stokes equations arising in fluid dynamics as well as several other problems in science and engineering.

Comparing Balance and Inverse Methods on Learning Conceptual and Procedural Knowledge in Equation Solving: A Cognitive Load Perspective

ERIC Educational Resources Information Center

Ngu, Bing Hiong; Phan, Huy Phuong

2016-01-01

We examined the use of balance and inverse methods in equation solving. The main difference between the balance and inverse methods lies in the operational line (e.g. +2 on both sides vs -2 becomes +2). Differential element interactivity favours the inverse method because the interaction between elements occurs on both sides of the equation for…

Quadratic Finite Element Method for 1D Deterministic Transport

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

Tolar, Jr., D R; Ferguson, J M

2004-01-06

In the discrete ordinates, or SN, numerical solution of the transport equation, both the spatial ({und r}) and angular ({und {Omega}}) dependences on the angular flux {psi}{und r},{und {Omega}}are modeled discretely. While significant effort has been devoted toward improving the spatial discretization of the angular flux, we focus on improving the angular discretization of {psi}{und r},{und {Omega}}. Specifically, we employ a Petrov-Galerkin quadratic finite element approximation for the differencing of the angular variable ({mu}) in developing the one-dimensional (1D) spherical geometry S{sub N} equations. We develop an algorithm that shows faster convergence with angular resolution than conventional S{sub N} algorithms.

Approximation theory for LQG (Linear-Quadratic-Gaussian) optimal control of flexible structures

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Adamian, A.

1988-01-01

An approximation theory is presented for the LQG (Linear-Quadratic-Gaussian) optimal control problem for flexible structures whose distributed models have bounded input and output operators. The main purpose of the theory is to guide the design of finite dimensional compensators that approximate closely the optimal compensator. The optimal LQG problem separates into an optimal linear-quadratic regulator problem and an optimal state estimation problem. The solution of the former problem lies in the solution to an infinite dimensional Riccati operator equation. The approximation scheme approximates the infinite dimensional LQG problem with a sequence of finite dimensional LQG problems defined for a sequence of finite dimensional, usually finite element or modal, approximations of the distributed model of the structure. Two Riccati matrix equations determine the solution to each approximating problem. The finite dimensional equations for numerical approximation are developed, including formulas for converting matrix control and estimator gains to their functional representation to allow comparison of gains based on different orders of approximation. Convergence of the approximating control and estimator gains and of the corresponding finite dimensional compensators is studied. Also, convergence and stability of the closed-loop systems produced with the finite dimensional compensators are discussed. The convergence theory is based on the convergence of the solutions of the finite dimensional Riccati equations to the solutions of the infinite dimensional Riccati equations. A numerical example with a flexible beam, a rotating rigid body, and a lumped mass is given.

From stochastic processes to numerical methods: A new scheme for solving reaction subdiffusion fractional partial differential equations

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

Angstmann, C.N.; Donnelly, I.C.; Henry, B.I., E-mail: B.Henry@unsw.edu.au

We have introduced a new explicit numerical method, based on a discrete stochastic process, for solving a class of fractional partial differential equations that model reaction subdiffusion. The scheme is derived from the master equations for the evolution of the probability density of a sum of discrete time random walks. We show that the diffusion limit of the master equations recovers the fractional partial differential equation of interest. This limiting procedure guarantees the consistency of the numerical scheme. The positivity of the solution and stability results are simply obtained, provided that the underlying process is well posed. We also showmore » that the method can be applied to standard reaction–diffusion equations. This work highlights the broader applicability of using discrete stochastic processes to provide numerical schemes for partial differential equations, including fractional partial differential equations.« less

Observers for Systems with Nonlinearities Satisfying an Incremental Quadratic Inequality

NASA Technical Reports Server (NTRS)

Acikmese, Ahmet Behcet; Corless, Martin

2004-01-01

We consider the problem of state estimation for nonlinear time-varying systems whose nonlinearities satisfy an incremental quadratic inequality. These observer results unifies earlier results in the literature; and extend it to some additional classes of nonlinearities. Observers are presented which guarantee that the state estimation error exponentially converges to zero. Observer design involves solving linear matrix inequalities for the observer gain matrices. Results are illustrated by application to a simple model of an underwater.

A NUMERICAL SCHEME FOR SPECIAL RELATIVISTIC RADIATION MAGNETOHYDRODYNAMICS BASED ON SOLVING THE TIME-DEPENDENT RADIATIVE TRANSFER EQUATION

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

Ohsuga, Ken; Takahashi, Hiroyuki R.

2016-02-20

We develop a numerical scheme for solving the equations of fully special relativistic, radiation magnetohydrodynamics (MHDs), in which the frequency-integrated, time-dependent radiation transfer equation is solved to calculate the specific intensity. The radiation energy density, the radiation flux, and the radiation stress tensor are obtained by the angular quadrature of the intensity. In the present method, conservation of total mass, momentum, and energy of the radiation magnetofluids is guaranteed. We treat not only the isotropic scattering but also the Thomson scattering. The numerical method of MHDs is the same as that of our previous work. The advection terms are explicitlymore » solved, and the source terms, which describe the gas–radiation interaction, are implicitly integrated. Our code is suitable for massive parallel computing. We present that our code shows reasonable results in some numerical tests for propagating radiation and radiation hydrodynamics. Particularly, the correct solution is given even in the optically very thin or moderately thin regimes, and the special relativistic effects are nicely reproduced.« less

Importance of the cutoff value in the quadratic adaptive integrate-and-fire model.

PubMed

Touboul, Jonathan

2009-08-01

The quadratic adaptive integrate-and-fire model (Izhikevich, 2003 , 2007 ) is able to reproduce various firing patterns of cortical neurons and is widely used in large-scale simulations of neural networks. This model describes the dynamics of the membrane potential by a differential equation that is quadratic in the voltage, coupled to a second equation for adaptation. Integration is stopped during the rise phase of a spike at a voltage cutoff value V(c) or when it blows up. Subsequently the membrane potential is reset, and the adaptation variable is increased by a fixed amount. We show in this note that in the absence of a cutoff value, not only the voltage but also the adaptation variable diverges in finite time during spike generation in the quadratic model. The divergence of the adaptation variable makes the system very sensitive to the cutoff: changing V(c) can dramatically alter the spike patterns. Furthermore, from a computational viewpoint, the divergence of the adaptation variable implies that the time steps for numerical simulation need to be small and adaptive. However, divergence of the adaptation variable does not occur for the quartic model (Touboul, 2008 ) and the adaptive exponential integrate-and-fire model (Brette & Gerstner, 2005 ). Hence, these models are robust to changes in the cutoff value.

Algorithms and software for solving finite element equations on serial and parallel architectures

NASA Technical Reports Server (NTRS)

George, Alan

1989-01-01

Over the past 15 years numerous new techniques have been developed for solving systems of equations and eigenvalue problems arising in finite element computations. A package called SPARSPAK has been developed by the author and his co-workers which exploits these new methods. The broad objective of this research project is to incorporate some of this software in the Computational Structural Mechanics (CSM) testbed, and to extend the techniques for use on multiprocessor architectures.

Improved Quasi-Newton method via PSB update for solving systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, Mustafa; Dauda, M. K.; Waziri, M. Y.; Ahmad, Fadhilah; Mohamad, Fatma Susilawati

2016-10-01

The Newton method has some shortcomings which includes computation of the Jacobian matrix which may be difficult or even impossible to compute and solving the Newton system in every iteration. Also, the common setback with some quasi-Newton methods is that they need to compute and store an n × n matrix at each iteration, this is computationally costly for large scale problems. To overcome such drawbacks, an improved Method for solving systems of nonlinear equations via PSB (Powell-Symmetric-Broyden) update is proposed. In the proposed method, the approximate Jacobian inverse Hk of PSB is updated and its efficiency has improved thereby require low memory storage, hence the main aim of this paper. The preliminary numerical results show that the proposed method is practically efficient when applied on some benchmark problems.

Modelling Ocean Dissipation in Icy Satellites: A Comparison of Linear and Quadratic Friction

NASA Astrophysics Data System (ADS)

Hay, H.; Matsuyama, I.

2015-12-01

Although subsurface oceans are confirmed in Europa, Ganymede, Callisto, and strongly suspected in Enceladus and Titan, the exact mechanism required to heat and maintain these liquid reservoirs over Solar System history remains a mystery. Radiogenic heating can supply enough energy for large satellites whereas tidal dissipation provides the best explanation for the presence of oceans in small icy satellites. The amount of thermal energy actually contributed to the interiors of these icy satellites through oceanic tidal dissipation is largely unquantified. Presented here is a numerical model that builds upon previous work for quantifying tidally dissipated energy in the subsurface oceans of the icy satellites. Recent semi-analytical models (Tyler, 2008 and Matsuyama, 2014) have solved the Laplace Tidal Equations to estimate the time averaged energy flux over an orbital period in icy satellite oceans, neglecting the presence of a solid icy shell. These models are only able to consider linear Rayleigh friction. The numerical model presented here is compared to one of these semi-analytical models, finding excellent agreement between velocity and displacement solutions for all three terms to the tidal potential. Time averaged energy flux is within 2-6% of the analytical values. Quadratic (bottom) friction is then incorporated into the model, replacing linear friction. This approach is commonly applied to terrestrial ocean dissipation studies where dissipation scales nonlinearly with velocity. A suite of simulations are also run for the quadratic friction case which are then compared to and analysed against recent scaling laws developed by Chen and Nimmo (2013).

Dynamics of a new family of iterative processes for quadratic polynomials

NASA Astrophysics Data System (ADS)

Gutiérrez, J. M.; Hernández, M. A.; Romero, N.

2010-03-01

In this work we show the presence of the well-known Catalan numbers in the study of the convergence and the dynamical behavior of a family of iterative methods for solving nonlinear equations. In fact, we introduce a family of methods, depending on a parameter . These methods reach the order of convergence m+2 when they are applied to quadratic polynomials with different roots. Newton's and Chebyshev's methods appear as particular choices of the family appear for m=0 and m=1, respectively. We make both analytical and graphical studies of these methods, which give rise to rational functions defined in the extended complex plane. Firstly, we prove that the coefficients of the aforementioned family of iterative processes can be written in terms of the Catalan numbers. Secondly, we make an incursion into its dynamical behavior. In fact, we show that the rational maps related to these methods can be written in terms of the entries of the Catalan triangle. Next we analyze its general convergence, by including some computer plots showing the intricate structure of the Universal Julia sets associated with the methods.

A method for the automated construction of the joint system of equations to solve the problem of the flow distribution in hydraulic networks

NASA Astrophysics Data System (ADS)

Novikov, A. E.

1993-10-01

There are several methods of solving the problem of the flow distribution in hydraulic networks. But all these methods have no mathematical tools for forming joint systems of equations to solve this problem. This paper suggests a method of constructing joint systems of equations to calculate hydraulic circuits of the arbitrary form. The graph concept, according to Kirchhoff, has been introduced.

An efficient computational method for solving nonlinear stochastic Itô integral equations: Application for stochastic problems in physics

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

Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir; The Laboratory of Quantum Information Processing, Yazd University, Yazd; Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir

Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Errormore » analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.« less

Comment on "Classification of Lie point symmetries for quadratic Liénard type equation x ̈ + f ( x ) x ˙ 2 + g ( x ) = 0 " [J. Math. Phys. 54, 053506 (2013)] and its erratum [J. Math. Phys. 55, 059901 (2014)

NASA Astrophysics Data System (ADS)

Paliathanasis, A.; Leach, P. G. L.

2016-02-01

We demonstrate a simplification of some recent works on the classification of the Lie symmetries for a quadratic equation of Liénard type. We observe that the problem could have been resolved more simply.

Schrödinger equation solved for the hydrogen molecule with unprecedented accuracy

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

Pachucki, Krzysztof, E-mail: krp@fuw.edu.pl; Komasa, Jacek, E-mail: komasa@man.poznan.pl

2016-04-28

The hydrogen molecule can be used for determination of physical constants, including the proton charge radius, and for improved tests of the hypothetical long range force between hadrons, which require a sufficiently accurate knowledge of the molecular levels. In this work, we perform the first step toward a significant improvement in theoretical predictions of H{sub 2} and solve the nonrelativistic Schrödinger equation to the unprecedented accuracy of 10{sup −12}. We hope that it will inspire a parallel progress in the spectroscopy of the molecular hydrogen.

Second-order rogue wave breathers in the nonlinear Schrödinger equation with quadratic potential modulated by a spatially-varying diffraction coefficient.

PubMed

Zhong, Wei-Ping; Belić, Milivoj; Zhang, Yiqi

2015-02-09

Nonlinear Schrödinger equation with simple quadratic potential modulated by a spatially-varying diffraction coefficient is investigated theoretically. Second-order rogue wave breather solutions of the model are constructed by using the similarity transformation. A modal quantum number is introduced, useful for classifying and controlling the solutions. From the solutions obtained, the behavior of second order Kuznetsov-Ma breathers (KMBs), Akhmediev breathers (ABs), and Peregrine solitons is analyzed in particular, by selecting different modulation frequencies and quantum modal parameter. We show how to generate interesting second order breathers and related hybrid rogue waves. The emergence of true rogue waves - single giant waves that are generated in the interaction of KMBs, ABs, and Peregrine solitons - is explicitly displayed in our analytical solutions.

Solution of the 2-D steady-state radiative transfer equation in participating media with specular reflections using SUPG and DG finite elements

NASA Astrophysics Data System (ADS)

Le Hardy, D.; Favennec, Y.; Rousseau, B.

2016-08-01

The 2D radiative transfer equation coupled with specular reflection boundary conditions is solved using finite element schemes. Both Discontinuous Galerkin and Streamline-Upwind Petrov-Galerkin variational formulations are fully developed. These two schemes are validated step-by-step for all involved operators (transport, scattering, reflection) using analytical formulations. Numerical comparisons of the two schemes, in terms of convergence rate, reveal that the quadratic SUPG scheme proves efficient for solving such problems. This comparison constitutes the main issue of the paper. Moreover, the solution process is accelerated using block SOR-type iterative methods, for which the determination of the optimal parameter is found in a very cheap way.

Markovian Monte Carlo program EvolFMC v.2 for solving QCD evolution equations

NASA Astrophysics Data System (ADS)

Jadach, S.; Płaczek, W.; Skrzypek, M.; Stokłosa, P.

2010-02-01

We present the program EvolFMC v.2 that solves the evolution equations in QCD for the parton momentum distributions by means of the Monte Carlo technique based on the Markovian process. The program solves the DGLAP-type evolution as well as modified-DGLAP ones. In both cases the evolution can be performed in the LO or NLO approximation. The quarks are treated as massless. The overall technical precision of the code has been established at 5×10. This way, for the first time ever, we demonstrate that with the Monte Carlo method one can solve the evolution equations with precision comparable to the other numerical methods. New version program summaryProgram title: EvolFMC v.2 Catalogue identifier: AEFN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFN_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including binary test data, etc.: 66 456 (7407 lines of C++ code) No. of bytes in distributed program, including test data, etc.: 412 752 Distribution format: tar.gz Programming language: C++ Computer: PC, Mac Operating system: Linux, Mac OS X RAM: Less than 256 MB Classification: 11.5 External routines: ROOT ( http://root.cern.ch/drupal/) Nature of problem: Solution of the QCD evolution equations for the parton momentum distributions of the DGLAP- and modified-DGLAP-type in the LO and NLO approximations. Solution method: Monte Carlo simulation of the Markovian process of a multiple emission of partons. Restrictions:Limited to the case of massless partons. Implemented in the LO and NLO approximations only. Weighted events only. Unusual features: Modified-DGLAP evolutions included up to the NLO level. Additional comments: Technical precision established at 5×10. Running time: For the 10 6 events at 100 GeV: DGLAP NLO: 27s; C-type modified DGLAP NLO: 150s (MacBook Pro with Mac OS X v.10

On the equivalence of Gaussian elimination and Gauss-Jordan reduction in solving linear equations

NASA Technical Reports Server (NTRS)

Tsao, Nai-Kuan

1989-01-01

A novel general approach to round-off error analysis using the error complexity concepts is described. This is applied to the analysis of the Gaussian Elimination and Gauss-Jordan scheme for solving linear equations. The results show that the two algorithms are equivalent in terms of our error complexity measures. Thus the inherently parallel Gauss-Jordan scheme can be implemented with confidence if parallel computers are available.

Theory and practice of solving ordinary differential equations (ODEs). [Runge-Kutta method; lectures in Spanish

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

Shampine, L.F.

1978-04-01

Between January 23 and 27, 1978, several lectures were presented at the Instituto de Investigaciones en Matematicas Aplicadas y en Sistemas, National University of Mexico, Mexico City. The author concentrated on the Runge--Kutta method of solving differential equations because its details are simple and it is illustrative of classical perturbation and asymptotic methods.

Some practical observations on the predictor jump method for solving the Laplace equation

NASA Astrophysics Data System (ADS)

Duque-Carrillo, J. F.; Vega-Fernández, J. M.; Peña-Bernal, J. J.; Rossell-Bueno, M. A.

1986-01-01

The best conditions for the application of the predictor jump (PJ) method in the solution of the Laplace equation are discussed and some practical considerations for applying this new iterative technique are presented. The PJ method was remarked on in a previous article entitled ``A new way for solving Laplace's problem (the predictor jump method)'' [J. M. Vega-Fernández, J. F. Duque-Carrillo, and J. J. Peña-Bernal, J. Math. Phys. 26, 416 (1985)].

Computer program for solving laminar, transitional, or turbulent compressible boundary-layer equations for two-dimensional and axisymmetric flow

NASA Technical Reports Server (NTRS)

Harris, J. E.; Blanchard, D. K.

1982-01-01

A numerical algorithm and computer program are presented for solving the laminar, transitional, or turbulent two dimensional or axisymmetric compressible boundary-layer equations for perfect-gas flows. The governing equations are solved by an iterative three-point implicit finite-difference procedure. The software, program VGBLP, is a modification of the approach presented in NASA TR R-368 and NASA TM X-2458, respectively. The major modifications are: (1) replacement of the fourth-order Runge-Kutta integration technique with a finite-difference procedure for numerically solving the equations required to initiate the parabolic marching procedure; (2) introduction of the Blottner variable-grid scheme; (3) implementation of an iteration scheme allowing the coupled system of equations to be converged to a specified accuracy level; and (4) inclusion of an iteration scheme for variable-entropy calculations. These modifications to the approach presented in NASA TR R-368 and NASA TM X-2458 yield a software package with high computational efficiency and flexibility. Turbulence-closure options include either two-layer eddy-viscosity or mixing-length models. Eddy conductivity is modeled as a function of eddy viscosity through a static turbulent Prandtl number formulation. Several options are provided for specifying the static turbulent Prandtl number. The transitional boundary layer is treated through a streamwise intermittency function which modifies the turbulence-closure model. This model is based on the probability distribution of turbulent spots and ranges from zero to unity for laminar and turbulent flow, respectively. Several test cases are presented as guides for potential users of the software.

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

NASA Technical Reports Server (NTRS)

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

1986-01-01

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

Quadrat Data for Fermilab Prairie Plant Survey

Science.gov Websites

Quadrat Data 2012 Quadrat Data 2013 Quadrat Data None taken by volunteers in 2014 due to weather problems . 2015 Quadrat Data 2016 Quadrat Data None taken by volunteers in 2017 due to weather and other problems

Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

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

Moryakov, A. V., E-mail: sailor@orc.ru

2016-12-15

An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

Numerical Solution of the Electron Heat Transport Equation and Physics-Constrained Modeling of the Thermal Conductivity via Sequential Quadratic Programming Optimization in Nuclear Fusion Plasmas

NASA Astrophysics Data System (ADS)

Paloma, Cynthia S.

The plasma electron temperature (Te) plays a critical role in a tokamak nu- clear fusion reactor since temperatures on the order of 108K are required to achieve fusion conditions. Many plasma properties in a tokamak nuclear fusion reactor are modeled by partial differential equations (PDE's) because they depend not only on time but also on space. In particular, the dynamics of the electron temperature is governed by a PDE referred to as the Electron Heat Transport Equation (EHTE). In this work, a numerical method is developed to solve the EHTE based on a custom finite-difference technique. The solution of the EHTE is compared to temperature profiles obtained by using TRANSP, a sophisticated plasma transport code, for specific discharges from the DIII-D tokamak, located at the DIII-D National Fusion Facility in San Diego, CA. The thermal conductivity (also called thermal diffusivity) of the electrons (Xe) is a plasma parameter that plays a critical role in the EHTE since it indicates how the electron temperature diffusion varies across the minor effective radius of the tokamak. TRANSP approximates Xe through a curve-fitting technique to match experimentally measured electron temperature profiles. While complex physics-based model have been proposed for Xe, there is a lack of a simple mathematical model for the thermal diffusivity that could be used for control design. In this work, a model for Xe is proposed based on a scaling law involving key plasma variables such as the electron temperature (Te), the electron density (ne), and the safety factor (q). An optimization algorithm is developed based on the Sequential Quadratic Programming (SQP) technique to optimize the scaling factors appearing in the proposed model so that the predicted electron temperature and magnetic flux profiles match predefined target profiles in the best possible way. A simulation study summarizing the outcomes of the optimization procedure is presented to illustrate the potential of the

Chemical Equation Balancing.

ERIC Educational Resources Information Center

Blakley, G. R.

1982-01-01

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

Discrete-time Markovian-jump linear quadratic optimal control

NASA Technical Reports Server (NTRS)

Chizeck, H. J.; Willsky, A. S.; Castanon, D.

1986-01-01

This paper is concerned with the optimal control of discrete-time linear systems that possess randomly jumping parameters described by finite-state Markov processes. For problems having quadratic costs and perfect observations, the optimal control laws and expected costs-to-go can be precomputed from a set of coupled Riccati-like matrix difference equations. Necessary and sufficient conditions are derived for the existence of optimal constant control laws which stabilize the controlled system as the time horizon becomes infinite, with finite optimal expected cost.

Chandrasekhar equations for infinite dimensional systems

NASA Technical Reports Server (NTRS)

Ito, K.; Powers, R.

1985-01-01

The existence of Chandrasekhar equations for linear time-invariant systems defined on Hilbert spaces is investigated. An important consequence is that the solution to the evolutional Riccati equation is strongly differentiable in time, and that a strong solution of the Riccati differential equation can be defined. A discussion of the linear-quadratic optimal-control problem for hereditary differential systems is also included.

Neural network based online simultaneous policy update algorithm for solving the HJI equation in nonlinear H∞ control.

PubMed

Wu, Huai-Ning; Luo, Biao

2012-12-01

It is well known that the nonlinear H∞ state feedback control problem relies on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which is a nonlinear partial differential equation that has proven to be impossible to solve analytically. In this paper, a neural network (NN)-based online simultaneous policy update algorithm (SPUA) is developed to solve the HJI equation, in which knowledge of internal system dynamics is not required. First, we propose an online SPUA which can be viewed as a reinforcement learning technique for two players to learn their optimal actions in an unknown environment. The proposed online SPUA updates control and disturbance policies simultaneously; thus, only one iterative loop is needed. Second, the convergence of the online SPUA is established by proving that it is mathematically equivalent to Newton's method for finding a fixed point in a Banach space. Third, we develop an actor-critic structure for the implementation of the online SPUA, in which only one critic NN is needed for approximating the cost function, and a least-square method is given for estimating the NN weight parameters. Finally, simulation studies are provided to demonstrate the effectiveness of the proposed algorithm.

Diagrams benefit symbolic problem-solving.

PubMed

Chu, Junyi; Rittle-Johnson, Bethany; Fyfe, Emily R

2017-06-01

The format of a mathematics problem often influences students' problem-solving performance. For example, providing diagrams in conjunction with story problems can benefit students' understanding, choice of strategy, and accuracy on story problems. However, it remains unclear whether providing diagrams in conjunction with symbolic equations can benefit problem-solving performance as well. We tested the impact of diagram presence on students' performance on algebra equation problems to determine whether diagrams increase problem-solving success. We also examined the influence of item- and student-level factors to test the robustness of the diagram effect. We worked with 61 seventh-grade students who had received 2 months of pre-algebra instruction. Students participated in an experimenter-led classroom session. Using a within-subjects design, students solved algebra problems in two matched formats (equation and equation-with-diagram). The presence of diagrams increased equation-solving accuracy and the use of informal strategies. This diagram benefit was independent of student ability and item complexity. The benefits of diagrams found previously for story problems generalized to symbolic problems. The findings are consistent with cognitive models of problem-solving and suggest that diagrams may be a useful additional representation of symbolic problems. © 2017 The British Psychological Society.

Solving a System of Nonlinear Algebraic Equations You Only Get Error Messages--What to Do Next?

ERIC Educational Resources Information Center

Shacham, Mordechai; Brauner, Neima

2017-01-01

Chemical engineering problems often involve the solution of systems of nonlinear algebraic equations (NLE). There are several software packages that can be used for solving NLE systems, but they may occasionally fail, especially in cases where the mathematical model contains discontinuities and/or regions where some of the functions are undefined.…

Chandrasekhar equations for infinite dimensional systems

NASA Technical Reports Server (NTRS)

Ito, K.; Powers, R. K.

1985-01-01

Chandrasekhar equations are derived for linear time invariant systems defined on Hilbert spaces using a functional analytic technique. An important consequence of this is that the solution to the evolutional Riccati equation is strongly differentiable in time and one can define a strong solution of the Riccati differential equation. A detailed discussion on the linear quadratic optimal control problem for hereditary differential systems is also included.

Three ways to solve critical ϕ4 theory on 4 ‑ 𝜖 dimensional real projective space: Perturbation, bootstrap, and Schwinger-Dyson equation

NASA Astrophysics Data System (ADS)

Hasegawa, Chika; Nakayama, Yu

2018-03-01

In this paper, we solve the two-point function of the lowest dimensional scalar operator in the critical ϕ4 theory on 4 ‑ 𝜖 dimensional real projective space in three different methods. The first is to use the conventional perturbation theory, and the second is to impose the cross-cap bootstrap equation, and the third is to solve the Schwinger-Dyson equation under the assumption of conformal invariance. We find that the three methods lead to mutually consistent results but each has its own advantage.

Stochastic resonance in a fractional oscillator driven by multiplicative quadratic noise

NASA Astrophysics Data System (ADS)

Ren, Ruibin; Luo, Maokang; Deng, Ke

2017-02-01

Stochastic resonance of a fractional oscillator subject to an external periodic field as well as to multiplicative and additive noise is investigated. The fluctuations of the eigenfrequency are modeled as the quadratic function of the trichotomous noise. Applying the moment equation method and Shapiro-Loginov formula, we obtain the exact expression of the complex susceptibility and related stability criteria. Theoretical analysis and numerical simulations indicate that the spectral amplification (SPA) depends non-monotonicly both on the external driving frequency and the parameters of the quadratic noise. In addition, the investigations into fractional stochastic systems have suggested that both the noise parameters and the memory effect can induce the phenomenon of stochastic multi-resonance (SMR), which is previously reported and believed to be absent in the case of the multiplicative noise with only a linear term.

General method of solving the Schroedinger equation of atoms and molecules

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

Nakatsuji, Hiroshi

2005-12-15

We propose a general method of solving the Schroedinger equation of atoms and molecules. We first construct the wave function having the exact structure, using the ICI (iterative configuration or complement interaction) method and then optimize the variables involved by the variational principle. Based on the scaled Schroedinger equation and related principles, we can avoid the singularity problem of atoms and molecules and formulate a general method of calculating the exact wave functions in an analytical expansion form. We choose initial function {psi}{sub 0} and scaling g function, and then the ICI method automatically generates the wave function that hasmore » the exact structure by using the Hamiltonian of the system. The Hamiltonian contains all the information of the system. The free ICI method provides a flexible and variationally favorable procedure of constructing the exact wave function. We explain the computational procedure of the analytical ICI method routinely performed in our laboratory. Simple examples are given using hydrogen atom for the nuclear singularity case, the Hooke's atom for the electron singularity case, and the helium atom for both cases.« less

A Flexible and Efficient Method for Solving Ill-Posed Linear Integral Equations of the First Kind for Noisy Data

NASA Astrophysics Data System (ADS)

Antokhin, I. I.

2017-06-01

We propose an efficient and flexible method for solving Fredholm and Abel integral equations of the first kind, frequently appearing in astrophysics. These equations present an ill-posed problem. Our method is based on solving them on a so-called compact set of functions and/or using Tikhonov's regularization. Both approaches are non-parametric and do not require any theoretic model, apart from some very loose a priori constraints on the unknown function. The two approaches can be used independently or in a combination. The advantage of the method, apart from its flexibility, is that it gives uniform convergence of the approximate solution to the exact one, as the errors of input data tend to zero. Simulated and astrophysical examples are presented.

Laser radiation in active amplifying media treated as a transport problem - Transfer equation derived and exactly solved

NASA Astrophysics Data System (ADS)

Gupta, S. R. D.; Gupta, Santanu D.

1991-10-01

The flow of laser radiation in a plane-parallel cylindrical slab of active amplifying medium with axial symmetry is treated as a problem in radiative transfer. The appropriate one-dimensional transfer equation describing the transfer of laser radiation has been derived by an appeal to Einstein's A, B coefficients (describing the processes of stimulated line absorption, spontaneous line emission, and stimulated line emission sustained by population inversion in the medium) and considering the 'rate equations' to completely establish the rational of the transfer equation obtained. The equation is then exactly solved and the angular distribution of the emergent laser beam intensity is obtained; its numerically computed values are given in tables and plotted in graphs showing the nature of peaks of the emerging laser beam intensity about the axis of the laser cylinder.

The reduced space Sequential Quadratic Programming (SQP) method for calculating the worst resonance response of nonlinear systems

NASA Astrophysics Data System (ADS)

Liao, Haitao; Wu, Wenwang; Fang, Daining

2018-07-01

A coupled approach combining the reduced space Sequential Quadratic Programming (SQP) method with the harmonic balance condensation technique for finding the worst resonance response is developed. The nonlinear equality constraints of the optimization problem are imposed on the condensed harmonic balance equations. Making use of the null space decomposition technique, the original optimization formulation in the full space is mathematically simplified, and solved in the reduced space by means of the reduced SQP method. The transformation matrix that maps the full space to the null space of the constrained optimization problem is constructed via the coordinate basis scheme. The removal of the nonlinear equality constraints is accomplished, resulting in a simple optimization problem subject to bound constraints. Moreover, second order correction technique is introduced to overcome Maratos effect. The combination application of the reduced SQP method and condensation technique permits a large reduction of the computational cost. Finally, the effectiveness and applicability of the proposed methodology is demonstrated by two numerical examples.

Mathematics of the total alkalinity-pH equation - pathway to robust and universal solution algorithms: the SolveSAPHE package v1.0.1

NASA Astrophysics Data System (ADS)

Munhoven, G.

2013-08-01

The total alkalinity-pH equation, which relates total alkalinity and pH for a given set of total concentrations of the acid-base systems that contribute to total alkalinity in a given water sample, is reviewed and its mathematical properties established. We prove that the equation function is strictly monotone and always has exactly one positive root. Different commonly used approximations are discussed and compared. An original method to derive appropriate initial values for the iterative solution of the cubic polynomial equation based upon carbonate-borate-alkalinity is presented. We then review different methods that have been used to solve the total alkalinity-pH equation, with a main focus on biogeochemical models. The shortcomings and limitations of these methods are made out and discussed. We then present two variants of a new, robust and universally convergent algorithm to solve the total alkalinity-pH equation. This algorithm does not require any a priori knowledge of the solution. SolveSAPHE (Solver Suite for Alkalinity-PH Equations) provides reference implementations of several variants of the new algorithm in Fortran 90, together with new implementations of other, previously published solvers. The new iterative procedure is shown to converge from any starting value to the physical solution. The extra computational cost for the convergence security is only 10-15% compared to the fastest algorithm in our test series.

NUMERICAL TECHNIQUES TO SOLVE CONDENSATIONAL AND DISSOLUTIONAL GROWTH EQUATIONS WHEN GROWTH IS COUPLED TO REVERSIBLE REACTIONS (R823186)

EPA Science Inventory

Noniterative, unconditionally stable numerical techniques for solving condensational and
dissolutional growth equations are given. Growth solutions are compared to Gear-code solutions for
three cases when growth is coupled to reversible equilibrium chemistry. In all cases, ...

On a numerical method for solving integro-differential equations with variable coefficients with applications in finance

NASA Astrophysics Data System (ADS)

Kudryavtsev, O.; Rodochenko, V.

2018-03-01

We propose a new general numerical method aimed to solve integro-differential equations with variable coefficients. The problem under consideration arises in finance where in the context of pricing barrier options in a wide class of stochastic volatility models with jumps. To handle the effect of the correlation between the price and the variance, we use a suitable substitution for processes. Then we construct a Markov-chain approximation for the variation process on small time intervals and apply a maturity randomization technique. The result is a system of boundary problems for integro-differential equations with constant coefficients on the line in each vertex of the chain. We solve the arising problems using a numerical Wiener-Hopf factorization method. The approximate formulae for the factors are efficiently implemented by means of the Fast Fourier Transform. Finally, we use a recurrent procedure that moves backwards in time on the variance tree. We demonstrate the convergence of the method using Monte-Carlo simulations and compare our results with the results obtained by the Wiener-Hopf method with closed-form expressions of the factors.

Quantized Algebra I Texts

NASA Astrophysics Data System (ADS)

DeBuvitz, William

2014-03-01

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

Some insights on hard quadratic assignment problem instances

NASA Astrophysics Data System (ADS)

Hussin, Mohamed Saifullah

2017-11-01

Since the formal introduction of metaheuristics, a huge number Quadratic Assignment Problem (QAP) instances have been introduced. Those instances however are loosely-structured, and therefore made it difficult to perform any systematic analysis. The QAPLIB for example, is a library that contains a huge number of QAP benchmark instances that consists of instances with different size and structure, but with a very limited availability for every instance type. This prevents researchers from performing organized study on those instances, such as parameter tuning and testing. In this paper, we will discuss several hard instances that have been introduced over the years, and algorithms that have been used for solving them.

New algorithms for solving high even-order differential equations using third and fourth Chebyshev-Galerkin methods

NASA Astrophysics Data System (ADS)

Doha, E. H.; Abd-Elhameed, W. M.; Bassuony, M. A.

2013-03-01

This paper is concerned with spectral Galerkin algorithms for solving high even-order two point boundary value problems in one dimension subject to homogeneous and nonhomogeneous boundary conditions. The proposed algorithms are extended to solve two-dimensional high even-order differential equations. The key to the efficiency of these algorithms is to construct compact combinations of Chebyshev polynomials of the third and fourth kinds as basis functions. The algorithms lead to linear systems with specially structured matrices that can be efficiently inverted. Numerical examples are included to demonstrate the validity and applicability of the proposed algorithms, and some comparisons with some other methods are made.

A fast, parallel algorithm to solve the basic fluvial erosion/transport equations

NASA Astrophysics Data System (ADS)

Braun, J.

2012-04-01

Quantitative models of landform evolution are commonly based on the solution of a set of equations representing the processes of fluvial erosion, transport and deposition, which leads to predict the geometry of a river channel network and its evolution through time. The river network is often regarded as the backbone of any surface processes model (SPM) that might include other physical processes acting at a range of spatial and temporal scales along hill slopes. The basic laws of fluvial erosion requires the computation of local (slope) and non-local (drainage area) quantities at every point of a given landscape, a computationally expensive operation which limits the resolution of most SPMs. I present here an algorithm to compute the various components required in the parameterization of fluvial erosion (and transport) and thus solve the basic fluvial geomorphic equation, that is very efficient because it is O(n) (the number of required arithmetic operations is linearly proportional to the number of nodes defining the landscape), and is fully parallelizable (the computation cost decreases in a direct inverse proportion to the number of processors used to solve the problem). The algorithm is ideally suited for use on latest multi-core processors. Using this new technique, geomorphic problems can be solved at an unprecedented resolution (typically of the order of 10,000 X 10,000 nodes) while keeping the computational cost reasonable (order 1 sec per time step). Furthermore, I will show that the algorithm is applicable to any regular or irregular representation of the landform, and is such that the temporal evolution of the landform can be discretized by a fully implicit time-marching algorithm, making it unconditionally stable. I will demonstrate that such an efficient algorithm is ideally suited to produce a fully predictive SPM that links observationally based parameterizations of small-scale processes to the evolution of large-scale features of the landscapes on

Quadratic formula for determining the drop size in pressure-atomized sprays with and without swirl

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

Lee, T.-W, E-mail: attwl@asu.edu; An, Keju

2016-06-15

We use a theoretical framework based on the integral form of the conservation equations, along with a heuristic model of the viscous dissipation, to find a closed-form solution to the liquid atomization problem. The energy balance for the spray renders to a quadratic formula for the drop size as a function, primarily of the liquid velocity. The Sauter mean diameter found using the quadratic formula shows good agreements and physical trends, when compared with experimental observations. This approach is shown to be applicable toward specifying initial drop size in computational fluid dynamics of spray flows.

Formalism for the solution of quadratic Hamiltonians with large cosine terms

NASA Astrophysics Data System (ADS)

Ganeshan, Sriram; Levin, Michael

2016-02-01

We consider quantum Hamiltonians of the form H =H0-U ∑jcos(Cj) , where H0 is a quadratic function of position and momentum variables {x1,p1,x2,p2,⋯} and the Cj's are linear in these variables. We allow H0 and Cj to be completely general with only two restrictions: we require that (1) the Cj's are linearly independent and (2) [Cj,Ck] is an integer multiple of 2 π i for all j ,k so that the different cosine terms commute with one another. Our main result is a recipe for solving these Hamiltonians and obtaining their exact low-energy spectrum in the limit U →∞ . This recipe involves constructing creation and annihilation operators and is similar in spirit to the procedure for diagonalizing quadratic Hamiltonians. In addition to our exact solution in the infinite U limit, we also discuss how to analyze these systems when U is large but finite. Our results are relevant to a number of different physical systems, but one of the most natural applications is to understanding the effects of electron scattering on quantum Hall edge modes. To demonstrate this application, we use our formalism to solve a toy model for a fractional quantum spin Hall edge with different types of impurities.

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

ERIC Educational Resources Information Center

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

2018-01-01

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

The Importance of Prior Knowledge when Comparing Examples: Influences on Conceptual and Procedural Knowledge of Equation Solving

ERIC Educational Resources Information Center

Rittle-Johnson, Bethany; Star, Jon R.; Durkin, Kelley

2009-01-01

Comparing multiple examples typically supports learning and transfer in laboratory studies and is considered a key feature of high-quality mathematics instruction. This experimental study investigated the importance of prior knowledge in learning from comparison. Seventh- and 8th-grade students (N = 236) learned to solve equations by comparing…

Robustness of linear quadratic state feedback designs in the presence of system uncertainty. [application to Augmentor Wing Jet STOL Research Aircraft flare control autopilot design

NASA Technical Reports Server (NTRS)

Patel, R. V.; Toda, M.; Sridhar, B.

1977-01-01

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

A sequential quadratic programming algorithm using an incomplete solution of the subproblem

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

Murray, W.; Prieto, F.J.

1993-05-01

We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimization problems that are more flexible in their definition than standard SQP methods. The type of flexibility introduced is motivated by the necessity to deviate from the standard approach when solving large problems. Specifically we no longer require a minimizer of the QP subproblem to be determined or particular Lagrange multiplier estimates to be used. Our main focus is on an SQP algorithm that uses a particular augmented Lagrangian merit function. New results are derived for this algorithm under weaker conditions than previously assumed; in particular, it is notmore » assumed that the iterates lie on a compact set.« less

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

NASA Technical Reports Server (NTRS)

Ito, Kazufumi; Teglas, Russell

1987-01-01

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

A harmonic polynomial cell (HPC) method for 3D Laplace equation with application in marine hydrodynamics

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

Shao, Yan-Lin, E-mail: yanlin.shao@dnvgl.com; Faltinsen, Odd M.

2014-10-01

We propose a new efficient and accurate numerical method based on harmonic polynomials to solve boundary value problems governed by 3D Laplace equation. The computational domain is discretized by overlapping cells. Within each cell, the velocity potential is represented by the linear superposition of a complete set of harmonic polynomials, which are the elementary solutions of Laplace equation. By its definition, the method is named as Harmonic Polynomial Cell (HPC) method. The characteristics of the accuracy and efficiency of the HPC method are demonstrated by studying analytical cases. Comparisons will be made with some other existing boundary element based methods,more » e.g. Quadratic Boundary Element Method (QBEM) and the Fast Multipole Accelerated QBEM (FMA-QBEM) and a fourth order Finite Difference Method (FDM). To demonstrate the applications of the method, it is applied to some studies relevant for marine hydrodynamics. Sloshing in 3D rectangular tanks, a fully-nonlinear numerical wave tank, fully-nonlinear wave focusing on a semi-circular shoal, and the nonlinear wave diffraction of a bottom-mounted cylinder in regular waves are studied. The comparisons with the experimental results and other numerical results are all in satisfactory agreement, indicating that the present HPC method is a promising method in solving potential-flow problems. The underlying procedure of the HPC method could also be useful in other fields than marine hydrodynamics involved with solving Laplace equation.« less

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

NASA Astrophysics Data System (ADS)

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.

Minimization of the root of a quadratic functional under a system of affine equality constraints with application to portfolio management

NASA Astrophysics Data System (ADS)

Landsman, Zinoviy

2008-10-01

We present an explicit closed form solution of the problem of minimizing the root of a quadratic functional subject to a system of affine constraints. The result generalizes Z. Landsman, Minimization of the root of a quadratic functional under an affine equality constraint, J. Comput. Appl. Math. 2007, to appear, see , articles in press, where the optimization problem was solved under only one linear constraint. This is of interest for solving significant problems pertaining to financial economics as well as some classes of feasibility and optimization problems which frequently occur in tomography and other fields. The results are illustrated in the problem of optimal portfolio selection and the particular case when the expected return of finance portfolio is certain is discussed.

Inverting x,y grid coordinates to obtain latitude and longitude in the vanderGrinten projection

NASA Technical Reports Server (NTRS)

Rubincam, D. P.

1980-01-01

The latitude and longitude of a point on the Earth's surface are found from its x,y grid coordinates in the vanderGrinten projection. The latitude is a solution of a cubic equation and the longitude a solution of a quadratic equation. Also, the x,y grid coordinates of a point on the Earth's surface can be found if its latitude and longitude are known by solving two simultaneous quadratic equations.

Preconditioned upwind methods to solve 3-D incompressible Navier-Stokes equations for viscous flows

NASA Technical Reports Server (NTRS)

Hsu, C.-H.; Chen, Y.-M.; Liu, C. H.

1990-01-01

A computational method for calculating low-speed viscous flowfields is developed. The method uses the implicit upwind-relaxation finite-difference algorithm with a nonsingular eigensystem to solve the preconditioned, three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. The technique of local time stepping is incorporated to accelerate the rate of convergence to a steady-state solution. An extensive study of optimizing the preconditioned system is carried out for two viscous flow problems. Computed results are compared with analytical solutions and experimental data.

Compared with What? The Effects of Different Comparisons on Conceptual Knowledge and Procedural Flexibility for Equation Solving

ERIC Educational Resources Information Center

Rittle-Johnson, Bethany; Star, Jon R.

2009-01-01

Researchers in both cognitive science and mathematics education emphasize the importance of comparison for learning and transfer. However, surprisingly little is known about the advantages and disadvantages of what types of things are being compared. In this experimental study, 162 seventh- and eighth-grade students learned to solve equations (a)…

Dressing method and quadratic bundles related to symmetric spaces. Vanishing boundary conditions

NASA Astrophysics Data System (ADS)

Valchev, T. I.

2016-02-01

We consider quadratic bundles related to Hermitian symmetric spaces of the type SU(m + n)/S(U(m) × U(n)). The simplest representative of the corresponding integrable hierarchy is given by a multi-component Kaup-Newell derivative nonlinear Schrödinger equation which serves as a motivational example for our general considerations. We extensively discuss how one can apply Zakharov-Shabat's dressing procedure to derive reflectionless potentials obeying zero boundary conditions. Those could be used for one to construct fast decaying solutions to any nonlinear equation belonging to the same hierarchy. One can distinguish between generic soliton type solutions and rational solutions.

Laplace-Gauss and Helmholtz-Gauss paraxial modes in media with quadratic refraction index.

PubMed

Kiselev, Aleksei P; Plachenov, Alexandr B

2016-04-01

The scalar theory of paraxial wave propagation in an axisymmetric medium where the refraction index quadratically depends on transverse variables is addressed. Exact solutions of the corresponding parabolic equation are presented, generalizing the Laplace-Gauss and Helmholtz-Gauss modes earlier known for homogeneous media. Also, a generalization of a zero-order asymmetric Bessel-Gauss beam is given.

An efficient hybrid pseudospectral/finite-difference scheme for solving the TTI pure P-wave equation

NASA Astrophysics Data System (ADS)

Zhan, Ge; Pestana, Reynam C.; Stoffa, Paul L.

2013-04-01

The pure P-wave equation for modelling and migration in tilted transversely isotropic (TTI) media has attracted more and more attention in imaging seismic data with anisotropy. The desirable feature is that it is absolutely free of shear-wave artefacts and the consequent alleviation of numerical instabilities generally suffered by some systems of coupled equations. However, due to several forward-backward Fourier transforms in wavefield updating at each time step, the computational cost is significant, and thereby hampers its prevalence. We propose to use a hybrid pseudospectral (PS) and finite-difference (FD) scheme to solve the pure P-wave equation. In the hybrid solution, most of the cost-consuming wavenumber terms in the equation are replaced by inexpensive FD operators, which in turn accelerates the computation and reduces the computational cost. To demonstrate the benefit in cost saving of the new scheme, 2D and 3D reverse-time migration (RTM) examples using the hybrid solution to the pure P-wave equation are carried out, and respective runtimes are listed and compared. Numerical results show that the hybrid strategy demands less computation time and is faster than using the PS method alone. Furthermore, this new TTI RTM algorithm with the hybrid method is computationally less expensive than that with the FD solution to conventional TTI coupled equations.

IFSM fractal image compression with entropy and sparsity constraints: A sequential quadratic programming approach

NASA Astrophysics Data System (ADS)

Kunze, Herb; La Torre, Davide; Lin, Jianyi

2017-01-01

We consider the inverse problem associated with IFSM: Given a target function f , find an IFSM, such that its fixed point f ¯ is sufficiently close to f in the Lp distance. Forte and Vrscay [1] showed how to reduce this problem to a quadratic optimization model. In this paper, we extend the collage-based method developed by Kunze, La Torre and Vrscay ([2][3][4]), by proposing the minimization of the 1-norm instead of the 0-norm. In fact, optimization problems involving the 0-norm are combinatorial in nature, and hence in general NP-hard. To overcome these difficulties, we introduce the 1-norm and propose a Sequential Quadratic Programming algorithm to solve the corresponding inverse problem. As in Kunze, La Torre and Vrscay [3] in our formulation, the minimization of collage error is treated as a multi-criteria problem that includes three different and conflicting criteria i.e., collage error, entropy and sparsity. This multi-criteria program is solved by means of a scalarization technique which reduces the model to a single-criterion program by combining all objective functions with different trade-off weights. The results of some numerical computations are presented.

A new Jacobi spectral collocation method for solving 1+1 fractional Schrödinger equations and fractional coupled Schrödinger systems

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Doha, E. H.; Ezz-Eldien, S. S.; Van Gorder, Robert A.

2014-12-01

The Jacobi spectral collocation method (JSCM) is constructed and used in combination with the operational matrix of fractional derivatives (described in the Caputo sense) for the numerical solution of the time-fractional Schrödinger equation (T-FSE) and the space-fractional Schrödinger equation (S-FSE). The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations, which greatly simplifies the solution process. In addition, the presented approach is also applied to solve the time-fractional coupled Schrödinger system (T-FCSS). In order to demonstrate the validity and accuracy of the numerical scheme proposed, several numerical examples with their approximate solutions are presented with comparisons between our numerical results and those obtained by other methods.

Convergence of Galerkin approximations for operator Riccati equations: A nonlinear evolution equation approach

NASA Technical Reports Server (NTRS)

Rosen, I. G.

1988-01-01

An approximation and convergence theory was developed for Galerkin approximations to infinite dimensional operator Riccati differential equations formulated in the space of Hilbert-Schmidt operators on a separable Hilbert space. The Riccati equation was treated as a nonlinear evolution equation with dynamics described by a nonlinear monotone perturbation of a strongly coercive linear operator. A generic approximation result was proven for quasi-autonomous nonlinear evolution system involving accretive operators which was then used to demonstrate the Hilbert-Schmidt norm convergence of Galerkin approximations to the solution of the Riccati equation. The application of the results was illustrated in the context of a linear quadratic optimal control problem for a one dimensional heat equation.

Nonlinear and parallel algorithms for finite element discretizations of the incompressible Navier-Stokes equations

NASA Astrophysics Data System (ADS)

Arteaga, Santiago Egido

1998-12-01

The steady-state Navier-Stokes equations are of considerable interest because they are used to model numerous common physical phenomena. The applications encountered in practice often involve small viscosities and complicated domain geometries, and they result in challenging problems in spite of the vast attention that has been dedicated to them. In this thesis we examine methods for computing the numerical solution of the primitive variable formulation of the incompressible equations on distributed memory parallel computers. We use the Galerkin method to discretize the differential equations, although most results are stated so that they apply also to stabilized methods. We also reformulate some classical results in a single framework and discuss some issues frequently dismissed in the literature, such as the implementation of pressure space basis and non- homogeneous boundary values. We consider three nonlinear methods: Newton's method, Oseen's (or Picard) iteration, and sequences of Stokes problems. All these iterative nonlinear methods require solving a linear system at every step. Newton's method has quadratic convergence while that of the others is only linear; however, we obtain theoretical bounds showing that Oseen's iteration is more robust, and we confirm it experimentally. In addition, although Oseen's iteration usually requires more iterations than Newton's method, the linear systems it generates tend to be simpler and its overall costs (in CPU time) are lower. The Stokes problems result in linear systems which are easier to solve, but its convergence is much slower, so that it is competitive only for large viscosities. Inexact versions of these methods are studied, and we explain why the best timings are obtained using relatively modest error tolerances in solving the corresponding linear systems. We also present a new damping optimization strategy based on the quadratic nature of the Navier-Stokes equations, which improves the robustness of all the

An adaptive multiblock high-order finite-volume method for solving the shallow-water equations on the sphere

DOE PAGES

McCorquodale, Peter; Ullrich, Paul; Johansen, Hans; ...

2015-09-04

We present a high-order finite-volume approach for solving the shallow-water equations on the sphere, using multiblock grids on the cubed-sphere. This approach combines a Runge--Kutta time discretization with a fourth-order accurate spatial discretization, and includes adaptive mesh refinement and refinement in time. Results of tests show fourth-order convergence for the shallow-water equations as well as for advection in a highly deformational flow. Hierarchical adaptive mesh refinement allows solution error to be achieved that is comparable to that obtained with uniform resolution of the most refined level of the hierarchy, but with many fewer operations.

A numerical method for solving a nonlinear 2-D optimal control problem with the classical diffusion equation

NASA Astrophysics Data System (ADS)

Mamehrashi, K.; Yousefi, S. A.

2017-02-01

This paper presents a numerical solution for solving a nonlinear 2-D optimal control problem (2DOP). The performance index of a nonlinear 2DOP is described with a state and a control function. Furthermore, dynamic constraint of the system is given by a classical diffusion equation. It is preferred to use the Ritz method for finding the numerical solution of the problem. The method is based upon the Legendre polynomial basis. By using this method, the given optimisation nonlinear 2DOP reduces to the problem of solving a system of algebraic equations. The benefit of the method is that it provides greater flexibility in which the given initial and boundary conditions of the problem are imposed. Moreover, compared with the eigenfunction method, the satisfactory results are obtained only in a small number of polynomials order. This numerical approach is applicable and effective for such a kind of nonlinear 2DOP. The convergence of the method is extensively discussed and finally two illustrative examples are included to observe the validity and applicability of the new technique developed in the current work.

Constrained multiple indicator kriging using sequential quadratic programming

NASA Astrophysics Data System (ADS)

Soltani-Mohammadi, Saeed; Erhan Tercan, A.

2012-11-01

Multiple indicator kriging (MIK) is a nonparametric method used to estimate conditional cumulative distribution functions (CCDF). Indicator estimates produced by MIK may not satisfy the order relations of a valid CCDF which is ordered and bounded between 0 and 1. In this paper a new method has been presented that guarantees the order relations of the cumulative distribution functions estimated by multiple indicator kriging. The method is based on minimizing the sum of kriging variances for each cutoff under unbiasedness and order relations constraints and solving constrained indicator kriging system by sequential quadratic programming. A computer code is written in the Matlab environment to implement the developed algorithm and the method is applied to the thickness data.

Calculus students' understanding of the vertex of the quadratic function in relation to the concept of derivative

NASA Astrophysics Data System (ADS)

Burns-Childers, Annie; Vidakovic, Draga

2018-07-01

The purpose of this study was to gain insight into 30, first year calculus students' understanding of the relationship between the concept of vertex of a quadratic function and the concept of the derivative. APOS (action-process-object-schema) theory was applied as a guiding framework of analysis on student written work, think-aloud and follow up group interviews. Students' personal meanings of the vertex, including misconceptions, were explored, along with students' understanding to solve problems pertaining to the derivative of a quadratic function. Results give evidence of students' weak schema of the vertex, lack of connection between different problem types and the importance of linguistics in relation to levels of APOS theory. A preliminary genetic decomposition was developed based on the results. Future research is suggested as a continuation to improve student understanding of the relationship between the vertex of quadratic functions and the derivative.

Entanglement in a model for Hawking radiation: An application of quadratic algebras

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

Bambah, Bindu A., E-mail: bbsp@uohyd.ernet.in; Mukku, C., E-mail: mukku@iiit.ac.in; Shreecharan, T., E-mail: shreecharan@gmail.com

2013-03-15

Quadratic polynomially deformed su(1,1) and su(2) algebras are utilized in model Hamiltonians to show how the gravitational system consisting of a black hole, infalling radiation and outgoing (Hawking) radiation can be solved exactly. The models allow us to study the long-time behaviour of the black hole and its outgoing modes. In particular, we calculate the bipartite entanglement entropies of subsystems consisting of (a) infalling plus outgoing modes and (b) black hole modes plus the infalling modes, using the Janus-faced nature of the model. The long-time behaviour also gives us glimpses of modifications in the character of Hawking radiation. Finally, wemore » study the phenomenon of superradiance in our model in analogy with atomic Dicke superradiance. - Highlights: Black-Right-Pointing-Pointer We examine a toy model for Hawking radiation with quantized black hole modes. Black-Right-Pointing-Pointer We use quadratic polynomially deformed su(1,1) algebras to study its entanglement properties. Black-Right-Pointing-Pointer We study the 'Dicke Superradiance' in black hole radiation using quadratically deformed su(2) algebras. Black-Right-Pointing-Pointer We study the modification of the thermal character of Hawking radiation due to quantized black hole modes.« less

Modified homotopy perturbation method for solving hypersingular integral equations of the first kind.

PubMed

Eshkuvatov, Z K; Zulkarnain, F S; Nik Long, N M A; Muminov, Z

2016-01-01

Modified homotopy perturbation method (HPM) was used to solve the hypersingular integral equations (HSIEs) of the first kind on the interval [-1,1] with the assumption that the kernel of the hypersingular integral is constant on the diagonal of the domain. Existence of inverse of hypersingular integral operator leads to the convergence of HPM in certain cases. Modified HPM and its norm convergence are obtained in Hilbert space. Comparisons between modified HPM, standard HPM, Bernstein polynomials approach Mandal and Bhattacharya (Appl Math Comput 190:1707-1716, 2007), Chebyshev expansion method Mahiub et al. (Int J Pure Appl Math 69(3):265-274, 2011) and reproducing kernel Chen and Zhou (Appl Math Lett 24:636-641, 2011) are made by solving five examples. Theoretical and practical examples revealed that the modified HPM dominates the standard HPM and others. Finally, it is found that the modified HPM is exact, if the solution of the problem is a product of weights and polynomial functions. For rational solution the absolute error decreases very fast by increasing the number of collocation points.

Modified Taylor series method for solving nonlinear differential equations with mixed boundary conditions defined on finite intervals.

PubMed

Vazquez-Leal, Hector; Benhammouda, Brahim; Filobello-Nino, Uriel Antonio; Sarmiento-Reyes, Arturo; Jimenez-Fernandez, Victor Manuel; Marin-Hernandez, Antonio; Herrera-May, Agustin Leobardo; Diaz-Sanchez, Alejandro; Huerta-Chua, Jesus

2014-01-01

In this article, we propose the application of a modified Taylor series method (MTSM) for the approximation of nonlinear problems described on finite intervals. The issue of Taylor series method with mixed boundary conditions is circumvented using shooting constants and extra derivatives of the problem. In order to show the benefits of this proposal, three different kinds of problems are solved: three-point boundary valued problem (BVP) of third-order with a hyperbolic sine nonlinearity, two-point BVP for a second-order nonlinear differential equation with an exponential nonlinearity, and a two-point BVP for a third-order nonlinear differential equation with a radical nonlinearity. The result shows that the MTSM method is capable to generate easily computable and highly accurate approximations for nonlinear equations. 34L30.

Laser Radiation in Active Amplifying Media Treated as a Transport Problem - Transfer Equation Derived and Exactly Solved

NASA Astrophysics Data System (ADS)

Das Gupta, Santanu; Das Gupta, S. R.

1991-10-01

The flow of laser radiation in a plane-parallel cylindrical slab of active amplifying medium with axial symmetry is treated as a problem in radiative transfer. The appropriate one-dimensional transfer equation describing the transfer of laser radiation has been derived by an appeal to Einstein'sA, B coefficients (describing the processes of stimulated line absorption, spontaneous line emission, and stimulated line emission sustained by population inversion in the medium) and considering the ‘rate equations’ to completely establish the rational of the transfer equation obtained. The equation is then exactly solved and the angular distribution of the emergent laser beam intensity is obtained; its numerically computed values are given in tables and plotted in graphs showing the nature of peaks of the emerging laser beam intensity about the axis of the laser cylinder.

POSTPROCESSING MIXED FINITE ELEMENT METHODS FOR SOLVING CAHN-HILLIARD EQUATION: METHODS AND ERROR ANALYSIS

PubMed Central

Wang, Wansheng; Chen, Long; Zhou, Jie

2015-01-01

A postprocessing technique for mixed finite element methods for the Cahn-Hilliard equation is developed and analyzed. Once the mixed finite element approximations have been computed at a fixed time on the coarser mesh, the approximations are postprocessed by solving two decoupled Poisson equations in an enriched finite element space (either on a finer grid or a higher-order space) for which many fast Poisson solvers can be applied. The nonlinear iteration is only applied to a much smaller size problem and the computational cost using Newton and direct solvers is negligible compared with the cost of the linear problem. The analysis presented here shows that this technique remains the optimal rate of convergence for both the concentration and the chemical potential approximations. The corresponding error estimate obtained in our paper, especially the negative norm error estimates, are non-trivial and different with the existing results in the literatures. PMID:27110063

Solving Differential Equations in R

EPA Science Inventory

Although R is still predominantly applied for statistical analysis and graphical representation, it is rapidly becoming more suitable for mathematical computing. One of the fields where considerable progress has been made recently is the solution of differential equations. Here w...

Solving the MHD equations by the space time conservation element and solution element method

NASA Astrophysics Data System (ADS)

Zhang, Moujin; John Yu, S.-T.; Henry Lin, S.-C.; Chang, Sin-Chung; Blankson, Isaiah

2006-05-01

We apply the space-time conservation element and solution element (CESE) method to solve the ideal MHD equations with special emphasis on satisfying the divergence free constraint of magnetic field, i.e., ∇ · B = 0. In the setting of the CESE method, four approaches are employed: (i) the original CESE method without any additional treatment, (ii) a simple corrector procedure to update the spatial derivatives of magnetic field B after each time marching step to enforce ∇ · B = 0 at all mesh nodes, (iii) a constraint-transport method by using a special staggered mesh to calculate magnetic field B, and (iv) the projection method by solving a Poisson solver after each time marching step. To demonstrate the capabilities of these methods, two benchmark MHD flows are calculated: (i) a rotated one-dimensional MHD shock tube problem and (ii) a MHD vortex problem. The results show no differences between different approaches and all results compare favorably with previously reported data.

Computational methods for optimal linear-quadratic compensators for infinite dimensional discrete-time systems

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1986-01-01

An abstract approximation theory and computational methods are developed for the determination of optimal linear-quadratic feedback control, observers and compensators for infinite dimensional discrete-time systems. Particular attention is paid to systems whose open-loop dynamics are described by semigroups of operators on Hilbert spaces. The approach taken is based on the finite dimensional approximation of the infinite dimensional operator Riccati equations which characterize the optimal feedback control and observer gains. Theoretical convergence results are presented and discussed. Numerical results for an example involving a heat equation with boundary control are presented and used to demonstrate the feasibility of the method.

Local multiplicative Schwarz algorithms for convection-diffusion equations

NASA Technical Reports Server (NTRS)

Cai, Xiao-Chuan; Sarkis, Marcus

1995-01-01

We develop a new class of overlapping Schwarz type algorithms for solving scalar convection-diffusion equations discretized by finite element or finite difference methods. The preconditioners consist of two components, namely, the usual two-level additive Schwarz preconditioner and the sum of some quadratic terms constructed by using products of ordered neighboring subdomain preconditioners. The ordering of the subdomain preconditioners is determined by considering the direction of the flow. We prove that the algorithms are optimal in the sense that the convergence rates are independent of the mesh size, as well as the number of subdomains. We show by numerical examples that the new algorithms are less sensitive to the direction of the flow than either the classical multiplicative Schwarz algorithms, and converge faster than the additive Schwarz algorithms. Thus, the new algorithms are more suitable for fluid flow applications than the classical additive or multiplicative Schwarz algorithms.

Algorithms for solving large sparse systems of simultaneous linear equations on vector processors

NASA Technical Reports Server (NTRS)

David, R. E.

1984-01-01

Very efficient algorithms for solving large sparse systems of simultaneous linear equations have been developed for serial processing computers. These involve a reordering of matrix rows and columns in order to obtain a near triangular pattern of nonzero elements. Then an LU factorization is developed to represent the matrix inverse in terms of a sequence of elementary Gaussian eliminations, or pivots. In this paper it is shown how these algorithms are adapted for efficient implementation on vector processors. Results obtained on the CYBER 200 Model 205 are presented for a series of large test problems which show the comparative advantages of the triangularization and vector processing algorithms.

Spectral iterative method and convergence analysis for solving nonlinear fractional differential equation

NASA Astrophysics Data System (ADS)

Yarmohammadi, M.; Javadi, S.; Babolian, E.

2018-04-01

In this study a new spectral iterative method (SIM) based on fractional interpolation is presented for solving nonlinear fractional differential equations (FDEs) involving Caputo derivative. This method is equipped with a pre-algorithm to find the singularity index of solution of the problem. This pre-algorithm gives us a real parameter as the index of the fractional interpolation basis, for which the SIM achieves the highest order of convergence. In comparison with some recent results about the error estimates for fractional approximations, a more accurate convergence rate has been attained. We have also proposed the order of convergence for fractional interpolation error under the L2-norm. Finally, general error analysis of SIM has been considered. The numerical results clearly demonstrate the capability of the proposed method.

Frontogenesis driven by horizontally quadratic distributions of density

NASA Technical Reports Server (NTRS)

Jacqmin, David

1991-01-01

Attention is given to the quadratic density distribution in a channel, which has been established by Simpson and Linden to be the simplest case of the horizontally nonlinear distribution of fluid density required for the production of frontogenesis. The porous-media and Boussinesq flow models are examined, and their evolution equations are reduced to one-dimensional systems. While both the porous-media and the inviscid/nondiffusive Boussinesq systems exhibit classic frontogenesis behavior, the viscous Boussinesq system exhibits a more complex behavior: boundary-layer effects force frontogenesis away from the lower boundary, and at late times the steepest density gradients are close to mid-channel.

On the comparison of perturbation-iteration algorithm and residual power series method to solve fractional Zakharov-Kuznetsov equation

NASA Astrophysics Data System (ADS)

Şenol, Mehmet; Alquran, Marwan; Kasmaei, Hamed Daei

2018-06-01

In this paper, we present analytic-approximate solution of time-fractional Zakharov-Kuznetsov equation. This model demonstrates the behavior of weakly nonlinear ion acoustic waves in a plasma bearing cold ions and hot isothermal electrons in the presence of a uniform magnetic field. Basic definitions of fractional derivatives are described in the Caputo sense. Perturbation-iteration algorithm (PIA) and residual power series method (RPSM) are applied to solve this equation with success. The convergence analysis is also presented for both methods. Numerical results are given and then they are compared with the exact solutions. Comparison of the results reveal that both methods are competitive, powerful, reliable, simple to use and ready to apply to wide range of fractional partial differential equations.

Implicitly solving phase appearance and disappearance problems using two-fluid six-equation model

DOE PAGES

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-01-25

Phase appearance and disappearance issue presents serious numerical challenges in two-phase flow simulations using the two-fluid six-equation model. Numerical challenges arise from the singular equation system when one phase is absent, as well as from the discontinuity in the solution space when one phase appears or disappears. In this work, a high-resolution spatial discretization scheme on staggered grids and fully implicit methods were applied for the simulation of two-phase flow problems using the two-fluid six-equation model. A Jacobian-free Newton-Krylov (JFNK) method was used to solve the discretized nonlinear problem. An improved numerical treatment was proposed and proved to be effectivemore » to handle the numerical challenges. The treatment scheme is conceptually simple, easy to implement, and does not require explicit truncations on solutions, which is essential to conserve mass and energy. Various types of phase appearance and disappearance problems relevant to thermal-hydraulics analysis have been investigated, including a sedimentation problem, an oscillating manometer problem, a non-condensable gas injection problem, a single-phase flow with heat addition problem and a subcooled flow boiling problem. Successful simulations of these problems demonstrate the capability and robustness of the proposed numerical methods and numerical treatments. As a result, volume fraction of the absent phase can be calculated effectively as zero.« less

An energy-stable method for solving the incompressible Navier-Stokes equations with non-slip boundary condition

NASA Astrophysics Data System (ADS)

Lee, Byungjoon; Min, Chohong

2018-05-01

We introduce a stable method for solving the incompressible Navier-Stokes equations with variable density and viscosity. Our method is stable in the sense that it does not increase the total energy of dynamics that is the sum of kinetic energy and potential energy. Instead of velocity, a new state variable is taken so that the kinetic energy is formulated by the L2 norm of the new variable. Navier-Stokes equations are rephrased with respect to the new variable, and a stable time discretization for the rephrased equations is presented. Taking into consideration the incompressibility in the Marker-And-Cell (MAC) grid, we present a modified Lax-Friedrich method that is L2 stable. Utilizing the discrete integration-by-parts in MAC grid and the modified Lax-Friedrich method, the time discretization is fully discretized. An explicit CFL condition for the stability of the full discretization is given and mathematically proved.

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

NASA Technical Reports Server (NTRS)

Ito, K.; Teglas, R.

1984-01-01

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Tensor-GMRES method for large sparse systems of nonlinear equations

NASA Technical Reports Server (NTRS)

Feng, Dan; Pulliam, Thomas H.

1994-01-01

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

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

Zhao Yunbin, E-mail: zhaoyy@maths.bham.ac.u

2010-12-15

While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the Legendre-Fenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms convex, and what is the Legendre-Fenchel transform for it? First, we show that the convexity of the product is determined intrinsically by the condition number of so-called 'scaled matrices' associated with quadratic forms involved. The main result claims that if the conditionmore » number of these scaled matrices are bounded above by an explicit constant (which depends only on the number of quadratic forms involved), then the product function is convex. Second, we prove that the Legendre-Fenchel transform for the product of positive definite quadratic forms can be expressed, and the computation of the transform amounts to finding the solution to a system of equations (or equally, finding a Brouwer's fixed point of a mapping) with a special structure. Thus, a broader question than the open 'Question 11' in Hiriart-Urruty (SIAM Rev. 49, 225-273, 2007) is addressed in this paper.« less

On the prediction of free turbulent jets with swirl using a quadratic pressure-strain model

NASA Technical Reports Server (NTRS)

Younis, Bassam A.; Gatski, Thomas B.; Speziale, Charles G.

1994-01-01

Data from free turbulent jets both with and without swirl are used to assess the performance of the pressure-strain model of Speziale, Sarkar and Gatski which is quadratic in the Reynolds stresses. Comparative predictions are also obtained with the two versions of the Launder, Reece and Rodi model which are linear in the same terms. All models are used as part of a complete second-order closure based on the solution of differential transport equations for each non-zero component of the Reynolds stress tensor together with an equation for the scalar energy dissipation rate. For non-swirling jets, the quadratic model underestimates the measured spreading rate of the plane jet but yields a better prediction for the axisymmetric case without resolving the plane jet/round jet anomaly. For the swirling axisymmetric jet, the same model accurately reproduces the effects of swirl on both the mean flow and the turbulence structure in sharp contrast with the linear models which yield results that are in serious error. The reasons for these differences are discussed.

PRECONDITIONED CONJUGATE-GRADIENT 2 (PCG2), a computer program for solving ground-water flow equations

USGS Publications Warehouse

Hill, Mary C.

1990-01-01

This report documents PCG2 : a numerical code to be used with the U.S. Geological Survey modular three-dimensional, finite-difference, ground-water flow model . PCG2 uses the preconditioned conjugate-gradient method to solve the equations produced by the model for hydraulic head. Linear or nonlinear flow conditions may be simulated. PCG2 includes two reconditioning options : modified incomplete Cholesky preconditioning, which is efficient on scalar computers; and polynomial preconditioning, which requires less computer storage and, with modifications that depend on the computer used, is most efficient on vector computers . Convergence of the solver is determined using both head-change and residual criteria. Nonlinear problems are solved using Picard iterations. This documentation provides a description of the preconditioned conjugate gradient method and the two preconditioners, detailed instructions for linking PCG2 to the modular model, sample data inputs, a brief description of PCG2, and a FORTRAN listing.

Symmetry breaking in two interacting populations of quadratic integrate-and-fire neurons.

PubMed

Ratas, Irmantas; Pyragas, Kestutis

2017-10-01

We analyze the dynamics of two coupled identical populations of quadratic integrate-and-fire neurons, which represent the canonical model for class I neurons near the spiking threshold. The populations are heterogeneous; they include both inherently spiking and excitable neurons. The coupling within and between the populations is global via synapses that take into account the finite width of synaptic pulses. Using a recently developed reduction method based on the Lorentzian ansatz, we derive a closed system of equations for the neuron's firing rates and the mean membrane potentials in both populations. The reduced equations are exact in the infinite-size limit. The bifurcation analysis of the equations reveals a rich variety of nonsymmetric patterns, including a splay state, antiphase periodic oscillations, chimera-like states, and chaotic oscillations as well as bistabilities between various states. The validity of the reduced equations is confirmed by direct numerical simulations of the finite-size networks.

Symmetry breaking in two interacting populations of quadratic integrate-and-fire neurons

NASA Astrophysics Data System (ADS)

Ratas, Irmantas; Pyragas, Kestutis

2017-10-01

We analyze the dynamics of two coupled identical populations of quadratic integrate-and-fire neurons, which represent the canonical model for class I neurons near the spiking threshold. The populations are heterogeneous; they include both inherently spiking and excitable neurons. The coupling within and between the populations is global via synapses that take into account the finite width of synaptic pulses. Using a recently developed reduction method based on the Lorentzian ansatz, we derive a closed system of equations for the neuron's firing rates and the mean membrane potentials in both populations. The reduced equations are exact in the infinite-size limit. The bifurcation analysis of the equations reveals a rich variety of nonsymmetric patterns, including a splay state, antiphase periodic oscillations, chimera-like states, and chaotic oscillations as well as bistabilities between various states. The validity of the reduced equations is confirmed by direct numerical simulations of the finite-size networks.

Accelerated procedure to solve kinetic equation for neutral atoms in a hot plasma

NASA Astrophysics Data System (ADS)

Tokar, Mikhail Z.

2017-12-01

The recombination of plasma charged components, electrons and ions of hydrogen isotopes, on the wall of a fusion reactor is a source of neutral molecules and atoms, recycling back into the plasma volume. Here neutral species participate, in particular, in charge-exchange (c-x) collisions with the plasma ions and, as a result, atoms of high energies with chaotically directed velocities are generated. Some fraction of these hot atoms hit the wall. Statistical Monte Carlo methods normally used to model c-x atoms are too time consuming for reasonably small level of accident errors and extensive parameter studies are problematic. By applying pass method to evaluate integrals from functions, including the ion velocity distribution, an iteration approach to solve one-dimensional kinetic equation [1], being alternative to Monte Carlo procedure, has been tremendously accelerated, at least by a factor of 30-50 [2]. Here this approach is developed further to solve the 2-D kinetic equation, applied to model the transport of c-x atoms in the vicinity of an opening in the wall, e.g., the entrance of the duct guiding to a diagnostic installation. This is necessary to determine firmly the energy spectrum of c-x atoms penetrating into the duct and to assess the erosion of the installation there. The results of kinetic modeling are compared with those obtained with the diffusion description for c-x atoms, being strictly relevant under plasma conditions of low temperature and high density, where the mean free path length between c-x collisions is much smaller than that till the atom ionization by electrons. It is demonstrated that the previous calculations [3], done with the diffusion approximation for c-x atoms, overestimate the erosion rate of Mo mirrors in a reactor by a factor of 3 compared to the result of the present kinetic study.

Design of reinforced areas of concrete column using quadratic polynomials

NASA Astrophysics Data System (ADS)

Arif Gunadi, Tjiang; Parung, Herman; Rachman Djamaluddin, Abd; Arwin Amiruddin, A.

2017-11-01

Designing of reinforced concrete columns mostly carried out by a simple planning method which uses column interaction diagram. However, the application of this method is limited because it valids only for certain compressive strenght of the concrete and yield strength of the reinforcement. Thus, a more applicable method is still in need. Another method is the use of quadratic polynomials as a basis for the approach in designing reinforced concrete columns, where the ratio of neutral lines to the effective height of a cross section (ξ) if associated with ξ in the same cross-section with different reinforcement ratios is assumed to form a quadratic polynomial. This is identical to the basic principle used in the Simpson rule for numerical integral using quadratic polynomials and had a sufficiently accurate level of accuracy. The basis of this approach to be used both the normal force equilibrium and the moment equilibrium. The abscissa of the intersection of the two curves is the ratio that had been mentioned, since it fulfill both of the equilibrium. The application of this method is relatively more complicated than the existing method but provided with tables and graphs (N vs ξN ) and (M vs ξM ) so that its used could be simplified. The uniqueness of these tables are only distinguished based on the compresssive strength of the concrete, so in application it could be combined with various yield strenght of the reinforcement available in the market. This method could be solved by using programming languages such as Fortran.

Stabilised finite-element methods for solving the level set equation with mass conservation

NASA Astrophysics Data System (ADS)

Kabirou Touré, Mamadou; Fahsi, Adil; Soulaïmani, Azzeddine

2016-01-01

Finite-element methods are studied for solving moving interface flow problems using the level set approach and a stabilised variational formulation proposed in Touré and Soulaïmani (2012; Touré and Soulaïmani To appear in 2016), coupled with a level set correction method. The level set correction is intended to enhance the mass conservation satisfaction property. The stabilised variational formulation (Touré and Soulaïmani 2012; Touré and Soulaïmani, To appear in 2016) constrains the level set function to remain close to the signed distance function, while the mass conservation is a correction step which enforces the mass balance. The eXtended finite-element method (XFEM) is used to take into account the discontinuities of the properties within an element. XFEM is applied to solve the Navier-Stokes equations for two-phase flows. The numerical methods are numerically evaluated on several test cases such as time-reversed vortex flow, a rigid-body rotation of Zalesak's disc, sloshing flow in a tank, a dam-break over a bed, and a rising bubble subjected to buoyancy. The numerical results show the importance of satisfying global mass conservation to accurately capture the interface position.

Solving Differential Equations Using Modified Picard Iteration

ERIC Educational Resources Information Center

Robin, W. A.

2010-01-01

Many classes of differential equations are shown to be open to solution through a method involving a combination of a direct integration approach with suitably modified Picard iterative procedures. The classes of differential equations considered include typical initial value, boundary value and eigenvalue problems arising in physics and…

Variable-mesh method of solving differential equations

NASA Technical Reports Server (NTRS)

Van Wyk, R.

1969-01-01

Multistep predictor-corrector method for numerical solution of ordinary differential equations retains high local accuracy and convergence properties. In addition, the method was developed in a form conducive to the generation of effective criteria for the selection of subsequent step sizes in step-by-step solution of differential equations.

Convergence Acceleration of Runge-Kutta Schemes for Solving the Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Swanson, Roy C., Jr.; Turkel, Eli; Rossow, C.-C.

2007-01-01

The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 can be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. This RK/implicit scheme is used as a smoother for multigrid. Fourier analysis is applied to determine damping properties. Numerical dissipation operators based on the Roe scheme, a matrix dissipation, and the CUSP scheme are considered in evaluating the RK/implicit scheme. In addition, the effect of the number of RK stages is examined. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. Turbulent flows over an airfoil and wing at subsonic and transonic conditions are computed. The effects of the cell aspect ratio on convergence are investigated for Reynolds numbers between 5:7 x 10(exp 6) and 100 x 10(exp 6). It is demonstrated that the implicit preconditioner can reduce the computational time of a well-tuned standard RK scheme by a factor between four and ten.

AQMAN; linear and quadratic programming matrix generator using two-dimensional ground-water flow simulation for aquifer management modeling

USGS Publications Warehouse

Lefkoff, L.J.; Gorelick, S.M.

1987-01-01

A FORTRAN-77 computer program code that helps solve a variety of aquifer management problems involving the control of groundwater hydraulics. It is intended for use with any standard mathematical programming package that uses Mathematical Programming System input format. The computer program creates the input files to be used by the optimization program. These files contain all the hydrologic information and management objectives needed to solve the management problem. Used in conjunction with a mathematical programming code, the computer program identifies the pumping or recharge strategy that achieves a user 's management objective while maintaining groundwater hydraulic conditions within desired limits. The objective may be linear or quadratic, and may involve the minimization of pumping and recharge rates or of variable pumping costs. The problem may contain constraints on groundwater heads, gradients, and velocities for a complex, transient hydrologic system. Linear superposition of solutions to the transient, two-dimensional groundwater flow equation is used by the computer program in conjunction with the response matrix optimization method. A unit stress is applied at each decision well and transient responses at all control locations are computed using a modified version of the U.S. Geological Survey two dimensional aquifer simulation model. The program also computes discounted cost coefficients for the objective function and accounts for transient aquifer conditions. (Author 's abstract)

A linear quadratic tracker for Control Moment Gyro based attitude control of the Space Station

NASA Technical Reports Server (NTRS)

Kaidy, J. T.

1986-01-01

The paper discusses a design for an attitude control system for the Space Station which produces fast response, with minimal overshoot and cross-coupling with the use of Control Moment Gyros (CMG). The rigid body equations of motion are linearized and discretized and a Linear Quadratic Regulator (LQR) design and analysis study is performed. The resulting design is then modified such that integral and differential terms are added to the state equations to enhance response characteristics. Methods for reduction of computation time through channelization are discussed as well as the reduction of initial torque requirements.

Orthogonality preserving infinite dimensional quadratic stochastic operators

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

Akın, Hasan; Mukhamedov, Farrukh

In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators.

Computers and Mathematics

DTIC Science & Technology

1989-01-01

Signs of Algebraic Numbers T. Sakkalis, New Mexico State University, Las Cruces ................................. 130 Efficient Reduction of Quadratic...equations. These equations are solved for dl,.. , d. and el ’.. e,, and a basis of minimal non-zero simultaneous solutions in which if d1 # 0, then ei = 0 and...and < el ,..,- emm d, dm > need to be considered because of the symmetric nature of the diophantine equations. These equations can be solved using

PSsolver: A Maple implementation to solve first order ordinary differential equations with Liouvillian solutions

NASA Astrophysics Data System (ADS)

Avellar, J.; Duarte, L. G. S.; da Mota, L. A. C. P.

2012-10-01

We present a set of software routines in Maple 14 for solving first order ordinary differential equations (FOODEs). The package implements the Prelle-Singer method in its original form together with its extension to include integrating factors in terms of elementary functions. The package also presents a theoretical extension to deal with all FOODEs presenting Liouvillian solutions. Applications to ODEs taken from standard references show that it solves ODEs which remain unsolved using Maple's standard ODE solution routines. New version program summary Program title: PSsolver Catalogue identifier: ADPR_v2_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADPR_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 2302 No. of bytes in distributed program, including test data, etc.: 31962 Distribution format: tar.gz Programming language: Maple 14 (also tested using Maple 15 and 16). Computer: Intel Pentium Processor P6000, 1.86 GHz. Operating system: Windows 7. RAM: 4 GB DDR3 Memory Classification: 4.3. Catalogue identifier of previous version: ADPR_v1_0 Journal reference of previous version: Comput. Phys. Comm. 144 (2002) 46 Does the new version supersede the previous version?: Yes Nature of problem: Symbolic solution of first order differential equations via the Prelle-Singer method. Solution method: The method of solution is based on the standard Prelle-Singer method, with extensions for the cases when the FOODE contains elementary functions. Additionally, an extension of our own which solves FOODEs with Liouvillian solutions is included. Reasons for new version: The program was not running anymore due to changes in the latest versions of Maple. Additionally, we corrected/changed some bugs/details that were hampering the smoother functioning of the routines. Summary

Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

NASA Astrophysics Data System (ADS)

Gelß, Patrick; Matera, Sebastian; Schütte, Christof

2016-06-01

In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO2(110) surface. We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.

A two-qubit photonic quantum processor and its application to solving systems of linear equations

PubMed Central

Barz, Stefanie; Kassal, Ivan; Ringbauer, Martin; Lipp, Yannick Ole; Dakić, Borivoje; Aspuru-Guzik, Alán; Walther, Philip

2014-01-01

Large-scale quantum computers will require the ability to apply long sequences of entangling gates to many qubits. In a photonic architecture, where single-qubit gates can be performed easily and precisely, the application of consecutive two-qubit entangling gates has been a significant obstacle. Here, we demonstrate a two-qubit photonic quantum processor that implements two consecutive CNOT gates on the same pair of polarisation-encoded qubits. To demonstrate the flexibility of our system, we implement various instances of the quantum algorithm for solving of systems of linear equations. PMID:25135432

Some operational tools for solving fractional and higher integer order differential equations: A survey on their mutual relations

NASA Astrophysics Data System (ADS)

Kiryakova, Virginia S.

2012-11-01

The Laplace Transform (LT) serves as a basis of the Operational Calculus (OC), widely explored by engineers and applied scientists in solving mathematical models for their practical needs. This transform is closely related to the exponential and trigonometric functions (exp, cos, sin) and to the classical differentiation and integration operators, reducing them to simple algebraic operations. Thus, the classical LT and the OC give useful tool to handle differential equations and systems with constant coefficients. Several generalizations of the LT have been introduced to allow solving, in a similar way, of differential equations with variable coefficients and of higher integer orders, as well as of fractional (arbitrary non-integer) orders. Note that fractional order mathematical models are recently widely used to describe better various systems and phenomena of the real world. This paper surveys briefly some of our results on classes of such integral transforms, that can be obtained from the LT by means of "transmutations" which are operators of the generalized fractional calculus (GFC). On the list of these Laplace-type integral transforms, we consider the Borel-Dzrbashjan, Meijer, Krätzel, Obrechkoff, generalized Obrechkoff (multi-index Borel-Dzrbashjan) transforms, etc. All of them are G- and H-integral transforms of convolutional type, having as kernels Meijer's G- or Fox's H-functions. Besides, some special functions (also being G- and H-functions), among them - the generalized Bessel-type and Mittag-Leffler (M-L) type functions, are generating Gel'fond-Leontiev (G-L) operators of generalized differentiation and integration, which happen to be also operators of GFC. Our integral transforms have operational properties analogous to those of the LT - they do algebrize the G-L generalized integrations and differentiations, and thus can serve for solving wide classes of differential equations with variable coefficients of arbitrary, including non-integer order

Second order Method for Solving 3D Elasticity Equations with Complex Interfaces

PubMed Central

Wang, Bao; Xia, Kelin; Wei, Guo-Wei

2015-01-01

Elastic materials are ubiquitous in nature and indispensable components in man-made devices and equipments. When a device or equipment involves composite or multiple elastic materials, elasticity interface problems come into play. The solution of three dimensional (3D) elasticity interface problems is significantly more difficult than that of elliptic counterparts due to the coupled vector components and cross derivatives in the governing elasticity equation. This work introduces the matched interface and boundary (MIB) method for solving 3D elasticity interface problems. The proposed MIB elasticity interface scheme utilizes fictitious values on irregular grid points near the material interface to replace function values in the discretization so that the elasticity equation can be discretized using the standard finite difference schemes as if there were no material interface. The interface jump conditions are rigorously enforced on the intersecting points between the interface and the mesh lines. Such an enforcement determines the fictitious values. A number of new techniques has been developed to construct efficient MIB elasticity interface schemes for dealing with cross derivative in coupled governing equations. The proposed method is extensively validated over both weak and strong discontinuity of the solution, both piecewise constant and position-dependent material parameters, both smooth and nonsmooth interface geometries, and both small and large contrasts in the Poisson’s ratio and shear modulus across the interface. Numerical experiments indicate that the present MIB method is of second order convergence in both L∞ and L2 error norms for handling arbitrarily complex interfaces, including biomolecular surfaces. To our best knowledge, this is the first elasticity interface method that is able to deliver the second convergence for the molecular surfaces of proteins.. PMID:25914422

Equations as Guides to Thinking and Problem Solving

ERIC Educational Resources Information Center

Hewitt, Paul G.

2011-01-01

Science is the study of nature's rules. The most basic of these are the laws of physics, most of which are expressed in equation form. Physics equations show how concepts connect to one another. But does a study of these equations enhance student understanding? Not always, for too often in an introductory course students are tempted (or even…

On quasi-periodic solutions for generalized Boussinesq equation with quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Shi, Yanling; Xu, Junxiang; Xu, Xindong

2015-02-01

In this paper, one-dimensional generalized Boussinesq equation: utt - uxx + (u2 + uxx)xx = 0 with boundary conditions ux(0, t) = ux(π, t) = uxxx(0, t) = uxxx(π, t) = 0 is considered. It is proved that the equation admits a Whitney smooth family of small-amplitude quasi-periodic solutions with 2-dimensional Diophantine frequencies. The proof is based on an infinite dimensional Kolmogorov-Arnold-Moser theorem and Birkhoff normal form.

Parametric optimal control of uncertain systems under an optimistic value criterion

NASA Astrophysics Data System (ADS)

Li, Bo; Zhu, Yuanguo

2018-01-01

It is well known that the optimal control of a linear quadratic model is characterized by the solution of a Riccati differential equation. In many cases, the corresponding Riccati differential equation cannot be solved exactly such that the optimal feedback control may be a complex time-oriented function. In this article, a parametric optimal control problem of an uncertain linear quadratic model under an optimistic value criterion is considered for simplifying the expression of optimal control. Based on the equation of optimality for the uncertain optimal control problem, an approximation method is presented to solve it. As an application, a two-spool turbofan engine optimal control problem is given to show the utility of the proposed model and the efficiency of the presented approximation method.

A Pseudo-Temporal Multi-Grid Relaxation Scheme for Solving the Parabolized Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

White, J. A.; Morrison, J. H.

1999-01-01

A multi-grid, flux-difference-split, finite-volume code, VULCAN, is presented for solving the elliptic and parabolized form of the equations governing three-dimensional, turbulent, calorically perfect and non-equilibrium chemically reacting flows. The space marching algorithms developed to improve convergence rate and or reduce computational cost are emphasized. The algorithms presented are extensions to the class of implicit pseudo-time iterative, upwind space-marching schemes. A full approximate storage, full multi-grid scheme is also described which is used to accelerate the convergence of a Gauss-Seidel relaxation method. The multi-grid algorithm is shown to significantly improve convergence on high aspect ratio grids.

Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

NASA Astrophysics Data System (ADS)

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.

Equations with Parameters: A Locus Approach

ERIC Educational Resources Information Center

Abramovich, Sergei; Norton, Anderson

2006-01-01

This paper introduces technology-based teaching ideas that facilitate the development of qualitative reasoning techniques in the context of quadratic equations with parameters. It reflects on activities designed for and used with prospective secondary mathematics teachers in accord with standards for teaching and recommendations for teachers in…

A Computer Program for Solving a Set of Conditional Maximum Likelihood Equations Arising in the Rasch Model for Questionnaires.

ERIC Educational Resources Information Center

Andersen, Erling B.

A computer program for solving the conditional likelihood equations arising in the Rasch model for questionnaires is described. The estimation method and the computational problems involved are described in a previous research report by Andersen, but a summary of those results are given in two sections of this paper. A working example is also…

An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Korte, John J.

1991-01-01

An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required

pK(A) in proteins solving the Poisson-Boltzmann equation with finite elements.

PubMed

Sakalli, Ilkay; Knapp, Ernst-Walter

2015-11-05

Knowledge on pK(A) values is an eminent factor to understand the function of proteins in living systems. We present a novel approach demonstrating that the finite element (FE) method of solving the linearized Poisson-Boltzmann equation (lPBE) can successfully be used to compute pK(A) values in proteins with high accuracy as a possible replacement to finite difference (FD) method. For this purpose, we implemented the software molecular Finite Element Solver (mFES) in the framework of the Karlsberg+ program to compute pK(A) values. This work focuses on a comparison between pK(A) computations obtained with the well-established FD method and with the new developed FE method mFES, solving the lPBE using protein crystal structures without conformational changes. Accurate and coarse model systems are set up with mFES using a similar number of unknowns compared with the FD method. Our FE method delivers results for computations of pK(A) values and interaction energies of titratable groups, which are comparable in accuracy. We introduce different thermodynamic cycles to evaluate pK(A) values and we show for the FE method how different parameters influence the accuracy of computed pK(A) values. © 2015 Wiley Periodicals, Inc.

Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

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

Gelß, Patrick, E-mail: p.gelss@fu-berlin.de; Matera, Sebastian, E-mail: matera@math.fu-berlin.de; Schütte, Christof, E-mail: schuette@mi.fu-berlin.de

2016-06-01

In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO{sub 2}(110) surface.more » We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.« less

A Parallel Numerical Algorithm To Solve Linear Systems Of Equations Emerging From 3D Radiative Transfer

NASA Astrophysics Data System (ADS)

Wichert, Viktoria; Arkenberg, Mario; Hauschildt, Peter H.

2016-10-01

Highly resolved state-of-the-art 3D atmosphere simulations will remain computationally extremely expensive for years to come. In addition to the need for more computing power, rethinking coding practices is necessary. We take a dual approach by introducing especially adapted, parallel numerical methods and correspondingly parallelizing critical code passages. In the following, we present our respective work on PHOENIX/3D. With new parallel numerical algorithms, there is a big opportunity for improvement when iteratively solving the system of equations emerging from the operator splitting of the radiative transfer equation J = ΛS. The narrow-banded approximate Λ-operator Λ* , which is used in PHOENIX/3D, occurs in each iteration step. By implementing a numerical algorithm which takes advantage of its characteristic traits, the parallel code's efficiency is further increased and a speed-up in computational time can be achieved.

A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces

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

Levajković, Tijana, E-mail: tijana.levajkovic@uibk.ac.at, E-mail: t.levajkovic@sf.bg.ac.rs; Mena, Hermann, E-mail: hermann.mena@uibk.ac.at; Tuffaha, Amjad, E-mail: atufaha@aus.edu

We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solutionmore » of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.« less

Optical solitons to the resonance nonlinear Schrödinger equation by Sine-Gordon equation method

NASA Astrophysics Data System (ADS)

Inc, Mustafa; Aliyu, Aliyu Isa; Yusuf, Abdullahi; Baleanu, Dumitru

2018-01-01

In this paper, we examined the optical solitons to the resonant nonlinear Schrödinger equation (R-NLSE) which describes the propagation of solitons through optical fibers. Three types of nonlinear media fibers are studied. They are; quadratic-cubic law, Kerr law and parabolic law. Dark, bright, dark-bright or combined optical and singular soliton solutions are derived using the sine-Gordon equation method (SGEM). The constraint conditions that naturally fall out of the solution structure which guarantee the existence of these solitons are also reported.

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

NASA Astrophysics Data System (ADS)

Parand, K.; Nikarya, M.

2017-11-01

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

The NURBS curves in modelling the shape of the boundary in the parametric integral equations systems for solving the Laplace equation

NASA Astrophysics Data System (ADS)

Zieniuk, Eugeniusz; Kapturczak, Marta; Sawicki, Dominik

2016-06-01

In solving of boundary value problems the shapes of the boundary can be modelled by the curves widely used in computer graphics. In parametric integral equations system (PIES) such curves are directly included into the mathematical formalism. Its simplify the way of definition and modification of the shape of the boundary. Until now in PIES the B-spline, Bézier and Hermite curves were used. Recent developments in the computer graphics paid our attention, therefore we implemented in PIES possibility of defining the shape of boundary using the NURBS curves. The curves will allow us to modeling different shapes more precisely. In this paper we will compare PIES solutions (with applied NURBS) with the solutions existing in the literature.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Solving Modal Equations of Motion with Initial Conditions Using MSC/NASTRAN DMAP. Part 2; Coupled Versus Uncoupled Integration

NASA Technical Reports Server (NTRS)

Barnett, Alan R.; Ibrahim, Omar M.; Abdallah, Ayman A.; Sullivan, Timothy L.

1993-01-01

By utilizing MSC/NASTRAN DMAP (Direct Matrix Abstraction Program) in an existing NASA Lewis Research Center coupled loads methodology, solving modal equations of motion with initial conditions is possible using either coupled (Newmark-Beta) or uncoupled (exact mode superposition) integration available within module TRD1. Both the coupled and newly developed exact mode superposition methods have been used to perform transient analyses of various space systems. However, experience has shown that in most cases, significant time savings are realized when the equations of motion are integrated using the uncoupled solver instead of the coupled solver. Through the results of a real-world engineering analysis, advantages of using the exact mode superposition methodology are illustrated.

Algebraic methods for the solution of some linear matrix equations

NASA Technical Reports Server (NTRS)

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

1979-01-01

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

Orientation of doubly rotated quartz plates.

PubMed

Sherman, J R

1989-01-01

A derivation from classical spherical trigonometry of equations to compute the orientation of doubly-rotated quartz blanks from Bragg X-ray data is discussed. These are usually derived by compact and efficient vector methods, which are reviewed briefly. They are solved by generating a quadratic equation with numerical coefficients. Two methods exist for performing the computation from measurements against two planes: a direct solution by a quadratic equation and a process of convergent iteration. Both have a spurious solution. Measurement against three lattice planes yields a set of three linear equations the solution of which is an unambiguous result.

Optimization of cascade blade mistuning. I - Equations of motion and basic inherent properties

NASA Technical Reports Server (NTRS)

Nissim, E.

1985-01-01

Attention is given to the derivation of the equations of motion of mistuned compressor blades, interpolating aerodynamic coefficients by means of quadratic expressions in the reduced frequency. If the coefficients of the quadratic expressions are permitted to assume complex values, excellent accuracy is obtained and Pade rational expressions are obviated. On the basis of the resulting equations, it is shown analytically that the sum of all the real parts of the eigenvalues is independent of the mistuning introduced into the system. Blade mistuning is further treated through the aerodynamic energy approach, and the limiting vibration modes associated with alternative mistunings are identified.

A new method for solving the quantum hydrodynamic equations of motion: application to two-dimensional reactive scattering.

PubMed

Pauler, Denise K; Kendrick, Brian K

2004-01-08

The de Broglie-Bohm hydrodynamic equations of motion are solved using a meshless method based on a moving least squares approach and an arbitrary Lagrangian-Eulerian frame of reference. A regridding algorithm adds and deletes computational points as needed in order to maintain a uniform interparticle spacing, and unitary time evolution is obtained by propagating the wave packet using averaged fields. The numerical instabilities associated with the formation of nodes in the reflected portion of the wave packet are avoided by adding artificial viscosity to the equations of motion. The methodology is applied to a two-dimensional model collinear reaction with an activation barrier. Reaction probabilities are computed as a function of both time and energy, and are in excellent agreement with those based on the quantum trajectory method. (c) 2004 American Institute of Physics

Coupled Riccati equations for complex plane constraint

NASA Technical Reports Server (NTRS)

Strong, Kristin M.; Sesak, John R.

1991-01-01

A new Linear Quadratic Gaussian design method is presented which provides prescribed imaginary axis pole placement for optimal control and estimation systems. This procedure contributes another degree of design freedom to flexible spacecraft control. Current design methods which interject modal damping into the system tend to have little affect on modal frequencies, i.e., they predictably shift open plant poles horizontally in the complex plane to form the closed loop controller or estimator pole constellation, but make little provision for vertical (imaginary axis) pole shifts. Imaginary axis shifts which reduce the closed loop model frequencies (the bandwidths) are desirable since they reduce the sensitivity of the system to noise disturbances. The new method drives the closed loop modal frequencies to predictable (specified) levels, frequencies as low as zero rad/sec (real axis pole placement) can be achieved. The design procedure works through rotational and translational destabilizations of the plant, and a coupling of two independently solved algebraic Riccati equations through a structured state weighting matrix. Two new concepts, gain transference and Q equivalency, are introduced and their use shown.

An Alternative Method to the Classical Partial Fraction Decomposition

ERIC Educational Resources Information Center

Cherif, Chokri

2007-01-01

PreCalculus students can use the Completing the Square Method to solve quadratic equations without the need to memorize the quadratic formula since this method naturally leads them to that formula. Calculus students, when studying integration, use various standard methods to compute integrals depending on the type of function to be integrated.…

Lump solutions with interaction phenomena in the (2+1)-dimensional Ito equation

NASA Astrophysics Data System (ADS)

Zou, Li; Yu, Zong-Bing; Tian, Shou-Fu; Feng, Lian-Li; Li, Jin

2018-03-01

In this paper, we consider the (2+1)-dimensional Ito equation, which was introduced by Ito. By considering the Hirota’s bilinear method, and using the positive quadratic function, we obtain some lump solutions of the Ito equation. In order to ensure rational localization and analyticity of these lump solutions, some sufficient and necessary conditions are provided on the parameters that appeared in the solutions. Furthermore, the interaction solutions between lump solutions and the stripe solitons are discussed by combining positive quadratic function with exponential function. Finally, the dynamic properties of these solutions are shown via the way of graphical analysis by selecting appropriate values of the parameters.

Nonlinear Schroedinger Approximations for Partial Differential Equations with Quadratic and Quasilinear Terms

NASA Astrophysics Data System (ADS)

Cummings, Patrick

We consider the approximation of solutions of two complicated, physical systems via the nonlinear Schrodinger equation (NLS). In particular, we discuss the evolution of wave packets and long waves in two physical models. Due to the complicated nature of the equations governing many physical systems and the in-depth knowledge we have for solutions of the nonlinear Schrodinger equation, it is advantageous to use approximation results of this kind to model these physical systems. The approximations are simple enough that we can use them to understand the qualitative and quantitative behavior of the solutions, and by justifying them we can show that the behavior of the approximation captures the behavior of solutions to the original equation, at least for long, but finite time. We first consider a model of the water wave equations which can be approximated by wave packets using the NLS equation. We discuss a new proof that both simplifies and strengthens previous justification results of Schneider and Wayne. Rather than using analytic norms, as was done by Schneider and Wayne, we construct a modified energy functional so that the approximation holds for the full interval of existence of the approximate NLS solution as opposed to a subinterval (as is seen in the analytic case). Furthermore, the proof avoids problems associated with inverting the normal form transform by working with a modified energy functional motivated by Craig and Hunter et al. We then consider the Klein-Gordon-Zakharov system and prove a long wave approximation result. In this case there is a non-trivial resonance that cannot be eliminated via a normal form transform. By combining the normal form transform for small Fourier modes and using analytic norms elsewhere, we can get a justification result on the order 1 over epsilon squared time scale.

Global Dynamics of Certain Homogeneous Second-Order Quadratic Fractional Difference Equation

PubMed Central

Garić-Demirović, M.; Kulenović, M. R. S.; Nurkanović, M.

2013-01-01

We investigate the basins of attraction of equilibrium points and minimal period-two solutions of the difference equation of the form x n+1 = x n−1 2/(ax n 2 + bx n x n−1 + cx n−1 2), n = 0,1, 2,…, where the parameters a,  b, and  c are positive numbers and the initial conditions x −1 and x 0 are arbitrary nonnegative numbers. The unique feature of this equation is the coexistence of an equilibrium solution and the minimal period-two solution both of which are locally asymptotically stable. PMID:24369451

Closed-form solutions for a class of optimal quadratic regulator problems with terminal constraints

NASA Technical Reports Server (NTRS)

Juang, J.-N.; Turner, J. D.; Chun, H. M.

1984-01-01

Closed-form solutions are derived for coupled Riccati-like matrix differential equations describing the solution of a class of optimal finite time quadratic regulator problems with terminal constraints. Analytical solutions are obtained for the feedback gains and the closed-loop response trajectory. A computational procedure is presented which introduces new variables for efficient computation of the terminal control law. Two examples are given to illustrate the validity and usefulness of the theory.

Possibilities of the free-complement methodology for solving the Schrödinger equation of atoms and molecules

NASA Astrophysics Data System (ADS)

Nakatsuji, Hiroshi

Chemistry is a science of complex subjects that occupy this universe and biological world and that are composed of atoms and molecules. Its essence is diversity. However, surprisingly, whole of this science is governed by simple quantum principles like the Schrödinger and the Dirac equations. Therefore, if we can find a useful general method of solving these quantum principles under the fermionic and/or bosonic constraints accurately in a reasonable speed, we can replace somewhat empirical methodologies of this science with purely quantum theoretical and computational logics. This is the purpose of our series of studies - called ``exact theory'' in our laboratory. Some of our documents are cited below. The key idea was expressed as the free complement (FC) theory (originally called ICI theory) that was introduced to solve the Schrödinger and Dirac equations analytically. For extending this methodology to larger systems, order N methodologies are essential, but actually the antisymmetry constraints for electronic wave functions become big constraints. Recently, we have shown that the antisymmetry rule or `dogma' can be very much relaxed when our subjects are large molecular systems. In this talk, I want to present our recent progress in our FC methodology. The purpose is to construct ``predictive quantum chemistry'' that is useful in chemical and physical researches and developments in institutes and industries

Exshall: A Turkel-Zwas explicit large time-step FORTRAN program for solving the shallow-water equations in spherical coordinates

NASA Astrophysics Data System (ADS)

Navon, I. M.; Yu, Jian

A FORTRAN computer program is presented and documented applying the Turkel-Zwas explicit large time-step scheme to a hemispheric barotropic model with constraint restoration of integral invariants of the shallow-water equations. We then proceed to detail the algorithms embodied in the code EXSHALL in this paper, particularly algorithms related to the efficiency and stability of T-Z scheme and the quadratic constraint restoration method which is based on a variational approach. In particular we provide details about the high-latitude filtering, Shapiro filtering, and Robert filtering algorithms used in the code. We explain in detail the various subroutines in the EXSHALL code with emphasis on algorithms implemented in the code and present the flowcharts of some major subroutines. Finally, we provide a visual example illustrating a 4-day run using real initial data, along with a sample printout and graphic isoline contours of the height field and velocity fields.

On Reductions of the Hirota-Miwa Equation

NASA Astrophysics Data System (ADS)

Hone, Andrew N. W.; Kouloukas, Theodoros E.; Ward, Chloe

2017-07-01

The Hirota-Miwa equation (also known as the discrete KP equation, or the octahedron recurrence) is a bilinear partial difference equation in three independent variables. It is integrable in the sense that it arises as the compatibility condition of a linear system (Lax pair). The Hirota-Miwa equation has infinitely many reductions of plane wave type (including a quadratic exponential gauge transformation), defined by a triple of integers or half-integers, which produce bilinear ordinary difference equations of Somos/Gale-Robinson type. Here it is explained how to obtain Lax pairs and presymplectic structures for these reductions, in order to demonstrate Liouville integrability of some associated maps, certain of which are related to reductions of discrete Toda and discrete KdV equations.

Solving Reynolds Equation in the Head-Disk Interface of Hard Disk Drives by Using a Meshless Method

NASA Astrophysics Data System (ADS)

Bao-Jun, Shi; Ting-Yi, Yang; Jian, Zhang; Yun-Dong, Du

2010-05-01

With the decrease of the flying height of the magnetic head/slider in hard disk drives (HDDs), Reynolds equation, which is used to describe the pressure distribution of the air bearing film in HDDs, must be modified to account for the rarefaction effect. Meshless local Petrov-Galerkin (MLPG) method has been successfully used in some fields of solid mechanics and fluid mechanics and was proven to be an efficacious method. No meshes are needed in MLPG method either for the interpolation of the trial and test functions, or for the integration of the weak form of the related differential equation. We solve Reynolds equation in the head-disk interface (HDI) of HDDs by using MLPG method. The pressure distribution of the air baring film by using MLPG method is obtained and compared with the exact solution and that obtained by using a least square finite difference (LSFD) method. We also investigate effects of the bearing number on the pressure value and the center of pressure based on this meshless method for different film-thickness ratios.

Population density equations for stochastic processes with memory kernels

NASA Astrophysics Data System (ADS)

Lai, Yi Ming; de Kamps, Marc

2017-06-01

We present a method for solving population density equations (PDEs)-a mean-field technique describing homogeneous populations of uncoupled neurons—where the populations can be subject to non-Markov noise for arbitrary distributions of jump sizes. The method combines recent developments in two different disciplines that traditionally have had limited interaction: computational neuroscience and the theory of random networks. The method uses a geometric binning scheme, based on the method of characteristics, to capture the deterministic neurodynamics of the population, separating the deterministic and stochastic process cleanly. We can independently vary the choice of the deterministic model and the model for the stochastic process, leading to a highly modular numerical solution strategy. We demonstrate this by replacing the master equation implicit in many formulations of the PDE formalism by a generalization called the generalized Montroll-Weiss equation—a recent result from random network theory—describing a random walker subject to transitions realized by a non-Markovian process. We demonstrate the method for leaky- and quadratic-integrate and fire neurons subject to spike trains with Poisson and gamma-distributed interspike intervals. We are able to model jump responses for both models accurately to both excitatory and inhibitory input under the assumption that all inputs are generated by one renewal process.

THE EFFECTIVENESS OF QUADRATS FOR MEASURING VASCULAR PLANT DIVERSITY

EPA Science Inventory

Quadrats are widely used for measuring characteristics of vascular plant communities. It is well recognized that quadrat size affects measurements of frequency and cover. The ability of quadrats of varying sizes to adequately measure diversity has not been established. An exha...

Algebraic Riccati equations in zero-sum differential games

NASA Technical Reports Server (NTRS)

Johnson, T. L.; Chao, A.

1974-01-01

The procedure for finding the closed-loop Nash equilibrium solution of two-player zero-sum linear time-invariant differential games with quadratic performance criteria and classical information pattern may be reduced in most cases to the solution of an algebraic Riccati equation. Based on the results obtained by Willems, necessary and sufficient conditions for existence of solutions to these equations are derived, and explicit conditions for a scalar example are given.

NBOD2- PROGRAM TO DERIVE AND SOLVE EQUATIONS OF MOTION FOR COUPLED N-BODY SYSTEMS

NASA Technical Reports Server (NTRS)

Frisch, H. P.

1994-01-01

The analysis of the dynamic characteristics of a complex system, such as a spacecraft or a robot, is usually best accomplished through the study of a simulation model. The simulation model must have the same dynamic characteristics as the complex system, while lending itself to mathematical quantification. The NBOD2 computer program was developed to aid in the analysis of spacecraft attitude dynamics. NBOD2 is a very general program that may be applied to a large class of problems involving coupled N-body systems. NBOD2 provides the dynamics analyst with the capability to automatically derive and numerically solve the equations of motion for any system that can be modeled as a topological tree of coupled rigid bodies, flexible bodies, point masses, and symmetrical momentum wheels. NBOD2 uses a topological tree model of the dynamic system to derive the vector-dyadic equations of motion for the system. The user builds this topological tree model by using rigid and flexible bodies, point masses, and symmetrical momentum wheels with appropriate connections. To insure that the relative motion between contiguous bodies is kinematically constrained, NBOD2 assumes that contiguous rigid and flexible bodies are connected by physically reliable 0, 1, 2, and 3-degrees-of-freedom gimbals. These gimbals prohibit relative translational motion, while permitting up to 3 degrees of relative rotational freedom at hinge points. Point masses may have 0, 1, 2, or 3-degrees of relative translational freedom, and symmetric momentum wheels may have a single degree of rotational freedom relative to the body in which they are imbedded. Flexible bodies may possess several degrees of vibrational freedom in addition to the degrees of freedom associated with the connection gimbals. Data concerning the natural modes and vibrations of the flexible bodies must be supplied by the user. NBOD2 combines the best features of the discrete-body approach and the nested body approach to reduce the

Extending fields in a level set method by solving a biharmonic equation

NASA Astrophysics Data System (ADS)

Moroney, Timothy J.; Lusmore, Dylan R.; McCue, Scott W.; McElwain, D. L. Sean

2017-08-01

We present an approach for computing extensions of velocities or other fields in level set methods by solving a biharmonic equation. The approach differs from other commonly used approaches to velocity extension because it deals with the interface fully implicitly through the level set function. No explicit properties of the interface, such as its location or the velocity on the interface, are required in computing the extension. These features lead to a particularly simple implementation using either a sparse direct solver or a matrix-free conjugate gradient solver. Furthermore, we propose a fast Poisson preconditioner that can be used to accelerate the convergence of the latter. We demonstrate the biharmonic extension on a number of test problems that serve to illustrate its effectiveness at producing smooth and accurate extensions near interfaces. A further feature of the method is the natural way in which it deals with symmetry and periodicity, ensuring through its construction that the extension field also respects these symmetries.

Solving lattice QCD systems of equations using mixed precision solvers on GPUs

NASA Astrophysics Data System (ADS)

Clark, M. A.; Babich, R.; Barros, K.; Brower, R. C.; Rebbi, C.

2010-09-01

Modern graphics hardware is designed for highly parallel numerical tasks and promises significant cost and performance benefits for many scientific applications. One such application is lattice quantum chromodynamics (lattice QCD), where the main computational challenge is to efficiently solve the discretized Dirac equation in the presence of an SU(3) gauge field. Using NVIDIA's CUDA platform we have implemented a Wilson-Dirac sparse matrix-vector product that performs at up to 40, 135 and 212 Gflops for double, single and half precision respectively on NVIDIA's GeForce GTX 280 GPU. We have developed a new mixed precision approach for Krylov solvers using reliable updates which allows for full double precision accuracy while using only single or half precision arithmetic for the bulk of the computation. The resulting BiCGstab and CG solvers run in excess of 100 Gflops and, in terms of iterations until convergence, perform better than the usual defect-correction approach for mixed precision.

A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

NASA Technical Reports Server (NTRS)

Banks, H. T.; Ito, K.

1991-01-01

A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.

On current contribution to Fronsdal equations

NASA Astrophysics Data System (ADS)

Misuna, N. G.

2018-03-01

We explore a local form of second-order Vasiliev equations proposed in [arxiv:arXiv:1706.03718] and obtain an explicit expression for quadratic corrections to bosonic Fronsdal equations, generated by gauge-invariant higher-spin currents. Our analysis is performed for general phase factor, and for the case of parity-invariant theory we find the agreement with expressions for cubic vertices available in the literature. This provides an additional indication that local frame proposed in [arxiv:arXiv:1706.03718] is the proper one.

A Bayesian Model for the Estimation of Latent Interaction and Quadratic Effects When Latent Variables Are Non-Normally Distributed

ERIC Educational Resources Information Center

Kelava, Augustin; Nagengast, Benjamin

2012-01-01

Structural equation models with interaction and quadratic effects have become a standard tool for testing nonlinear hypotheses in the social sciences. Most of the current approaches assume normally distributed latent predictor variables. In this article, we present a Bayesian model for the estimation of latent nonlinear effects when the latent…

A dynamical regularization algorithm for solving inverse source problems of elliptic partial differential equations

NASA Astrophysics Data System (ADS)

Zhang, Ye; Gong, Rongfang; Cheng, Xiaoliang; Gulliksson, Mårten

2018-06-01

This study considers the inverse source problem for elliptic partial differential equations with both Dirichlet and Neumann boundary data. The unknown source term is to be determined by additional boundary conditions. Unlike the existing methods found in the literature, which usually employ the first-order in time gradient-like system (such as the steepest descent methods) for numerically solving the regularized optimization problem with a fixed regularization parameter, we propose a novel method with a second-order in time dissipative gradient-like system and a dynamical selected regularization parameter. A damped symplectic scheme is proposed for the numerical solution. Theoretical analysis is given for both the continuous model and the numerical algorithm. Several numerical examples are provided to show the robustness of the proposed algorithm.

A Chess-Like Game for Teaching Engineering Students to Solve Large System of Simultaneous Linear Equations

NASA Technical Reports Server (NTRS)

Nguyen, Duc T.; Mohammed, Ahmed Ali; Kadiam, Subhash

2010-01-01

Solving large (and sparse) system of simultaneous linear equations has been (and continues to be) a major challenging problem for many real-world engineering/science applications [1-2]. For many practical/large-scale problems, the sparse, Symmetrical and Positive Definite (SPD) system of linear equations can be conveniently represented in matrix notation as [A] {x} = {b} , where the square coefficient matrix [A] and the Right-Hand-Side (RHS) vector {b} are known. The unknown solution vector {x} can be efficiently solved by the following step-by-step procedures [1-2]: Reordering phase, Matrix Factorization phase, Forward solution phase, and Backward solution phase. In this research work, a Game-Based Learning (GBL) approach has been developed to help engineering students to understand crucial details about matrix reordering and factorization phases. A "chess-like" game has been developed and can be played by either a single player, or two players. Through this "chess-like" open-ended game, the players/learners will not only understand the key concepts involved in reordering algorithms (based on existing algorithms), but also have the opportunities to "discover new algorithms" which are better than existing algorithms. Implementing the proposed "chess-like" game for matrix reordering and factorization phases can be enhanced by FLASH [3] computer environments, where computer simulation with animated human voice, sound effects, visual/graphical/colorful displays of matrix tables, score (or monetary) awards for the best game players, etc. can all be exploited. Preliminary demonstrations of the developed GBL approach can be viewed by anyone who has access to the internet web-site [4]!

Interaction phenomenon to dimensionally reduced p-gBKP equation

NASA Astrophysics Data System (ADS)

Zhang, Runfa; Bilige, Sudao; Bai, Yuexing; Lü, Jianqing; Gao, Xiaoqing

2018-02-01

Based on searching the combining of quadratic function and exponential (or hyperbolic cosine) function from the Hirota bilinear form of the dimensionally reduced p-gBKP equation, eight class of interaction solutions are derived via symbolic computation with Mathematica. The submergence phenomenon, presented to illustrate the dynamical features concerning these obtained solutions, is observed by three-dimensional plots and density plots with particular choices of the involved parameters between the exponential (or hyperbolic cosine) function and the quadratic function. It is proved that the interference between the two solitary waves is inelastic.

Quadratic correlation filters for optical correlators

NASA Astrophysics Data System (ADS)

Mahalanobis, Abhijit; Muise, Robert R.; Vijaya Kumar, Bhagavatula V. K.

2003-08-01

Linear correlation filters have been implemented in optical correlators and successfully used for a variety of applications. The output of an optical correlator is usually sensed using a square law device (such as a CCD array) which forces the output to be the squared magnitude of the desired correlation. It is however not a traditional practice to factor the effect of the square-law detector in the design of the linear correlation filters. In fact, the input-output relationship of an optical correlator is more accurately modeled as a quadratic operation than a linear operation. Quadratic correlation filters (QCFs) operate directly on the image data without the need for feature extraction or segmentation. In this sense, the QCFs retain the main advantages of conventional linear correlation filters while offering significant improvements in other respects. Not only is more processing required to detect peaks in the outputs of multiple linear filters, but choosing a winner among them is an error prone task. In contrast, all channels in a QCF work together to optimize the same performance metric and produce a combined output that leads to considerable simplification of the post-processing. In this paper, we propose a novel approach to the design of quadratic correlation based on the Fukunaga Koontz transform. Although quadratic filters are known to be optimum when the data is Gaussian, it is expected that they will perform as well as or better than linear filters in general. Preliminary performance results are provided that show that quadratic correlation filters perform better than their linear counterparts.

Exp-function method for solving fractional partial differential equations.

PubMed

Zheng, Bin

2013-01-01

We extend the Exp-function method to fractional partial differential equations in the sense of modified Riemann-Liouville derivative based on nonlinear fractional complex transformation. For illustrating the validity of this method, we apply it to the space-time fractional Fokas equation and the nonlinear fractional Sharma-Tasso-Olver (STO) equation. As a result, some new exact solutions for them are successfully established.

An unconditionally stable method for numerically solving solar sail spacecraft equations of motion

NASA Astrophysics Data System (ADS)

Karwas, Alex

Solar sails use the endless supply of the Sun's radiation to propel spacecraft through space. The sails use the momentum transfer from the impinging solar radiation to provide thrust to the spacecraft while expending zero fuel. Recently, the first solar sail spacecraft, or sailcraft, named IKAROS completed a successful mission to Venus and proved the concept of solar sail propulsion. Sailcraft experimental data is difficult to gather due to the large expenses of space travel, therefore, a reliable and accurate computational method is needed to make the process more efficient. Presented in this document is a new approach to simulating solar sail spacecraft trajectories. The new method provides unconditionally stable numerical solutions for trajectory propagation and includes an improved physical description over other methods. The unconditional stability of the new method means that a unique numerical solution is always determined. The improved physical description of the trajectory provides a numerical solution and time derivatives that are continuous throughout the entire trajectory. The error of the continuous numerical solution is also known for the entire trajectory. Optimal control for maximizing thrust is also provided within the framework of the new method. Verification of the new approach is presented through a mathematical description and through numerical simulations. The mathematical description provides details of the sailcraft equations of motion, the numerical method used to solve the equations, and the formulation for implementing the equations of motion into the numerical solver. Previous work in the field is summarized to show that the new approach can act as a replacement to previous trajectory propagation methods. A code was developed to perform the simulations and it is also described in this document. Results of the simulations are compared to the flight data from the IKAROS mission. Comparison of the two sets of data show that the new approach

The method of space-time and conservation element and solution element: A new approach for solving the Navier-Stokes and Euler equations

NASA Technical Reports Server (NTRS)

Chang, Sin-Chung

1995-01-01

A new numerical framework for solving conservation laws is being developed. This new framework differs substantially in both concept and methodology from the well-established methods, i.e., finite difference, finite volume, finite element, and spectral methods. It is conceptually simple and designed to overcome several key limitations of the above traditional methods. A two-level scheme for solving the convection-diffusion equation is constructed and used to illuminate the major differences between the present method and those previously mentioned. This explicit scheme, referred to as the a-mu scheme, has two independent marching variables.

Robust linear quadratic designs with respect to parameter uncertainty

NASA Technical Reports Server (NTRS)

Douglas, Joel; Athans, Michael

1992-01-01

The authors derive a linear quadratic regulator (LQR) which is robust to parametric uncertainty by using the overbounding method of I. R. Petersen and C. V. Hollot (1986). The resulting controller is determined from the solution of a single modified Riccati equation. It is shown that, when applied to a structural system, the controller gains add robustness by minimizing the potential energy of uncertain stiffness elements, and minimizing the rate of dissipation of energy through uncertain damping elements. A worst-case disturbance in the direction of the uncertainty is also considered. It is proved that performance robustness has been increased with the robust LQR when compared to a mismatched LQR design where the controller is designed on the nominal system, but applied to the actual uncertain system.

A nonclassical Radau collocation method for solving the Lane-Emden equations of the polytropic index 4.75 ≤ α < 5

NASA Astrophysics Data System (ADS)

Tirani, M. D.; Maleki, M.; Kajani, M. T.

2014-11-01

A numerical method for solving the Lane-Emden equations of the polytropic index α when 4.75 ≤ α ≤ 5 is introduced. The method is based upon nonclassical Gauss-Radau collocation points and Freud type weights. Nonclassical orthogonal polynomials, nonclassical Radau points and weighted interpolation are introduced and are utilized in the interval [0,1]. A smooth, strictly monotonic transformation is used to map the infinite domain x ∈ [0,∞) onto a half-open interval t ∈ [0,1). The resulting problem on the finite interval is then transcribed to a system of nonlinear algebraic equations using collocation. The method is easy to implement and yields very accurate results.

On the time-weighted quadratic sum of linear discrete systems

NASA Technical Reports Server (NTRS)

Jury, E. I.; Gutman, S.

1975-01-01

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

Chandrasekhar equations for infinite dimensional systems. Part 2: Unbounded input and output case

NASA Technical Reports Server (NTRS)

Ito, Kazufumi; Powers, Robert K.

1987-01-01

A set of equations known as Chandrasekhar equations arising in the linear quadratic optimal control problem is considered. In this paper, we consider the linear time-invariant system defined in Hilbert spaces involving unbounded input and output operators. For a general class of such systems, the Chandrasekhar equations are derived and the existence, uniqueness, and regularity of the results of their solutions established.

A computational method for solving stochastic Itô–Volterra integral equations based on stochastic operational matrix for generalized hat basis functions

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

Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir; The Laboratory of Quantum Information Processing, Yazd University, Yazd; Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir

2014-08-01

In this paper, a new computational method based on the generalized hat basis functions is proposed for solving stochastic Itô–Volterra integral equations. In this way, a new stochastic operational matrix for generalized hat functions on the finite interval [0,T] is obtained. By using these basis functions and their stochastic operational matrix, such problems can be transformed into linear lower triangular systems of algebraic equations which can be directly solved by forward substitution. Also, the rate of convergence of the proposed method is considered and it has been shown that it is O(1/(n{sup 2}) ). Further, in order to show themore » accuracy and reliability of the proposed method, the new approach is compared with the block pulse functions method by some examples. The obtained results reveal that the proposed method is more accurate and efficient in comparison with the block pule functions method.« less

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

NASA Astrophysics Data System (ADS)

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.

Half-quadratic variational regularization methods for speckle-suppression and edge-enhancement in SAR complex image

NASA Astrophysics Data System (ADS)

Zhao, Xia; Wang, Guang-xin

2008-12-01

Synthetic aperture radar (SAR) is an active remote sensing sensor. It is a coherent imaging system, the speckle is its inherent default, which affects badly the interpretation and recognition of the SAR targets. Conventional methods of removing the speckle is studied usually in real SAR image, which reduce the edges of the images at the same time as depressing the speckle. Morever, Conventional methods lost the information about images phase. Removing the speckle and enhancing the target and edge simultaneously are still a puzzle. To suppress the spckle and enhance the targets and the edges simultaneously, a half-quadratic variational regularization method in complex SAR image is presented, which is based on the prior knowledge of the targets and the edge. Due to the non-quadratic and non- convex quality and the complexity of the cost function, a half-quadratic variational regularization variation is used to construct a new cost function,which is solved by alternate optimization. In the proposed scheme, the construction of the model, the solution of the model and the selection of the model peremeters are studied carefully. In the end, we validate the method using the real SAR data.Theoretic analysis and the experimental results illustrate the the feasibility of the proposed method. Further more, the proposed method can preserve the information about images phase.

A BiCGStab2 variant of the IDR(s) method for solving linear equations

NASA Astrophysics Data System (ADS)

Abe, Kuniyoshi; Sleijpen, Gerard L. G.

2012-09-01