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

Science.gov (United States)

Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

2018-02-01

In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

Operational matrices with respect to Hermite polynomials and their applications in solving linear dierential equations with variable coecients

Directory of Open Access Journals (Sweden)

A. Aminataei

2014-05-01

Full Text Available In this paper, a new and ecient approach is applied for numerical approximation of the linear dierential equations with variable coecients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansioncoecients for the moments of derivatives of any dierentiable function in terms of the original expansion coecients of the function itself are given in the matrix form. The mainimportance of this scheme is that using this approach reduces solving the linear dierentialequations to solve a system of linear algebraic equations, thus greatly simplifying the problem. In addition, two experiments are given to demonstrate the validity and applicability of the method

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

OpenAIRE

Nair, C. Radhakrishnan

2004-01-01

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

A Discrete-Time Recurrent Neural Network for Solving Rank-Deficient Matrix Equations With an Application to Output Regulation of Linear Systems.

Science.gov (United States)

Liu, Tao; Huang, Jie

2017-04-17

This paper presents a discrete-time recurrent neural network approach to solving systems of linear equations with two features. First, the system of linear equations may not have a unique solution. Second, the system matrix is not known precisely, but a sequence of matrices that converges to the unknown system matrix exponentially is known. The problem is motivated from solving the output regulation problem for linear systems. Thus, an application of our main result leads to an online solution to the output regulation problem for linear systems.

Development and adjustment of programs for solving systems of linear equations

International Nuclear Information System (INIS)

Fujimura, Toichiro

1978-03-01

Programs for solving the systems of linear equations have been adjusted and developed in expanding the scientific subroutine library SSL. The principal programs adjusted are based on the congruent method, method of product form of the inverse, orthogonal method, Crout's method for sparse system, and acceleration of iterative methods. The programs developed are based on the escalator method, direct parallel residue method and block tridiagonal method for band system. Described are usage of the programs developed and their future improvement. FORTRAN lists with simple examples in tests of the programs are also given. (auth.)

A parallel algorithm for solving linear equations arising from one-dimensional network problems

International Nuclear Information System (INIS)

Mesina, G.L.

1991-01-01

One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs

Ten-Year-Old Students Solving Linear Equations

Science.gov (United States)

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…

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

International Nuclear Information System (INIS)

Huber, Alfred

2007-01-01

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

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

Science.gov (United States)

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

On the Evaluation of Computational Results Obtained from Solving System of linear Equations With matlab The Dual affine Scalling interior Point

International Nuclear Information System (INIS)

Murfi, Hendri; Basaruddin, T.

2001-01-01

The interior point method for linear programming has gained extraordinary interest as an alternative to simplex method since Karmarkar presented a polynomial-time algorithm for linear programming based on interior point method. In implementation of the algorithm of this method, there are two important things that have impact heavily to performance of the algorithm; they are data structure and used method to solve linear equation system in the algorithm. This paper describes about solving linear equation system in variants of the algorithm called dual-affine scaling algorithm. Next, we evaluate experimentally results of some used methods, either direct method or iterative method. The experimental evaluation used Matlab

High-order quantum algorithm for solving linear differential equations

International Nuclear Information System (INIS)

Berry, Dominic W

2014-01-01

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

Transport equation solving methods

International Nuclear Information System (INIS)

Granjean, P.M.

1984-06-01

This work is mainly devoted to Csub(N) and Fsub(N) methods. CN method: starting from a lemma stated by Placzek, an equivalence is established between two problems: the first one is defined in a finite medium bounded by a surface S, the second one is defined in the whole space. In the first problem the angular flux on the surface S is shown to be the solution of an integral equation. This equation is solved by Galerkin's method. The Csub(N) method is applied here to one-velocity problems: in plane geometry, slab albedo and transmission with Rayleigh scattering, calculation of the extrapolation length; in cylindrical geometry, albedo and extrapolation length calculation with linear scattering. Fsub(N) method: the basic integral transport equation of the Csub(N) method is integrated on Case's elementary distributions; another integral transport equation is obtained: this equation is solved by a collocation method. The plane problems solved by the Csub(N) method are also solved by the Fsub(N) method. The Fsub(N) method is extended to any polynomial scattering law. Some simple spherical problems are also studied. Chandrasekhar's method, collision probability method, Case's method are presented for comparison with Csub(N) and Fsub(N) methods. This comparison shows the respective advantages of the two methods: a) fast convergence and possible extension to various geometries for Csub(N) method; b) easy calculations and easy extension to polynomial scattering for Fsub(N) method [fr

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

Indian Academy of Sciences (India)

Known example problems are solved to illustrate the efficacy and ... The concept of fuzzy set and fuzzy number were first introduced by Zadeh .... (iii) Fully fuzzy linear systems can be solved by linear programming approach, Gauss elim-.

Numerical Solution of Heun Equation Via Linear Stochastic Differential Equation

Directory of Open Access Journals (Sweden)

Hamidreza Rezazadeh

2014-05-01

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

A convex optimization approach for solving large scale linear systems

Directory of Open Access Journals (Sweden)

Debora Cores

2017-01-01

Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.

Convergence of hybrid methods for solving non-linear partial ...

African Journals Online (AJOL)

This paper is concerned with the numerical solution and convergence analysis of non-linear partial differential equations using a hybrid method. The solution technique involves discretizing the non-linear system of PDE to obtain a corresponding non-linear system of algebraic difference equations to be solved at each time ...

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

Directory of Open Access Journals (Sweden)

Ai-Min Yang

2014-01-01

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

Performance prediction of gas turbines by solving a system of non-linear equations

Energy Technology Data Exchange (ETDEWEB)

Kaikko, J

1998-09-01

This study presents a novel method for implementing the performance prediction of gas turbines from the component models. It is based on solving the non-linear set of equations that corresponds to the process equations, and the mass and energy balances for the engine. General models have been presented for determining the steady state operation of single components. Single and multiple shad arrangements have been examined with consideration also being given to heat regeneration and intercooling. Emphasis has been placed upon axial gas turbines of an industrial scale. Applying the models requires no information of the structural dimensions of the gas turbines. On comparison with the commonly applied component matching procedures, this method incorporates several advantages. The application of the models for providing results is facilitated as less attention needs to be paid to calculation sequences and routines. Solving the set of equations is based on zeroing co-ordinate functions that are directly derived from the modelling equations. Therefore, controlling the accuracy of the results is easy. This method gives more freedom for the selection of the modelling parameters since, unlike for the matching procedures, exchanging these criteria does not itself affect the algorithms. Implicit relationships between the variables are of no significance, thus increasing the freedom for the modelling equations as well. The mathematical models developed in this thesis will provide facilities to optimise the operation of any major gas turbine configuration with respect to the desired process parameters. The computational methods used in this study may also be adapted to any other modelling problems arising in industry. (orig.) 36 refs.

Analytical exact solution of the non-linear Schroedinger equation

International Nuclear Information System (INIS)

Martins, Alisson Xavier; Rocha Filho, Tarcisio Marciano da

2011-01-01

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

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

Science.gov (United States)

Agus, Fahrul; Haviluddin

2017-02-01

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

Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

Science.gov (United States)

Hasnain, Shahid; Saqib, Muhammad; Mashat, Daoud Suleiman

2017-07-01

This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit) to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

Directory of Open Access Journals (Sweden)

Shahid Hasnain

2017-07-01

Full Text Available This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

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

Science.gov (United States)

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

1972-01-01

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

Schwarz maps of algebraic linear ordinary differential equations

Science.gov (United States)

Sanabria Malagón, Camilo

2017-12-01

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

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

Science.gov (United States)

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…

A Photon Free Method to Solve Radiation Transport Equations

International Nuclear Information System (INIS)

Chang, B

2006-01-01

The multi-group discrete-ordinate equations of radiation transfer is solved for the first time by Newton's method. It is a photon free method because the photon variables are eliminated from the radiation equations to yield a N group XN direction smaller but equivalent system of equations. The smaller set of equations can be solved more efficiently than the original set of equations. Newton's method is more stable than the Semi-implicit Linear method currently used by conventional radiation codes

Variational iteration method for solving coupled-KdV equations

International Nuclear Information System (INIS)

Assas, Laila M.B.

2008-01-01

In this paper, the He's variational iteration method is applied to solve the non-linear coupled-KdV equations. This method is based on the use of Lagrange multipliers for identification of optimal value of a parameter in a functional. This technique provides a sequence of functions which converge to the exact solution of the coupled-KdV equations. This procedure is a powerful tool for solving coupled-KdV equations

New approach to solve symmetric fully fuzzy linear systems

Indian Academy of Sciences (India)

concepts of fuzzy set theory and then define a fully fuzzy linear system of equations. .... To represent the above problem as fully fuzzy linear system, we represent x .... Fully fuzzy linear systems can be solved by Linear programming approach, ...

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

Science.gov (United States)

El-Gebeily, M.; Yushau, B.

2008-01-01

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

Computing with linear equations and matrices

International Nuclear Information System (INIS)

Churchhouse, R.F.

1983-01-01

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

Fibonacci collocation method with a residual error Function to solve linear Volterra integro differential equations

Directory of Open Access Journals (Sweden)

Salih Yalcinbas

2016-01-01

Full Text Available In this paper, a new collocation method based on the Fibonacci polynomials is introduced to solve the high-order linear Volterra integro-differential equations under the conditions. Numerical examples are included to demonstrate the applicability and validity of the proposed method and comparisons are made with the existing results. In addition, an error estimation based on the residual functions is presented for this method. The approximate solutions are improved by using this error estimation.

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

Energy Technology Data Exchange (ETDEWEB)

Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)

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.

Solving Differential Equations in R: Package deSolve

Science.gov (United States)

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

Solving Differential Equations in R: Package deSolve

NARCIS (Netherlands)

Soetaert, K.E.R.; Petzoldt, T.; Setzer, R.W.

2010-01-01

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 approach. The

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

NARCIS (Netherlands)

Dorren, H.J.S.

1998-01-01

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

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

Science.gov (United States)

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

2002-11-01

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

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

International Nuclear Information System (INIS)

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

2015-01-01

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

Chosen interval methods for solving linear interval systems with special type of matrix

Science.gov (United States)

Szyszka, Barbara

2013-10-01

The paper is devoted to chosen direct interval methods for solving linear interval systems with special type of matrix. This kind of matrix: band matrix with a parameter, from finite difference problem is obtained. Such linear systems occur while solving one dimensional wave equation (Partial Differential Equations of hyperbolic type) by using the central difference interval method of the second order. Interval methods are constructed so as the errors of method are enclosed in obtained results, therefore presented linear interval systems contain elements that determining the errors of difference method. The chosen direct algorithms have been applied for solving linear systems because they have no errors of method. All calculations were performed in floating-point interval arithmetic.

Simplified Linear Equation Solvers users manual

Energy Technology Data Exchange (ETDEWEB)

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

1993-02-01

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

Systems of Inhomogeneous Linear Equations

Science.gov (United States)

Scherer, Philipp O. J.

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

Solving Linear Differential Equations

NARCIS (Netherlands)

Nguyen, K.A.; Put, M. van der

2010-01-01

The theme of this paper is to 'solve' an absolutely irreducible differential module explicitly in terms of modules of lower dimension and finite extensions of the differential field K. Representations of semi-simple Lie algebras and differential Galo is theory are the main tools. The results extend

Darboux transformations and linear parabolic partial differential equations

International Nuclear Information System (INIS)

Arrigo, Daniel J.; Hickling, Fred

2002-01-01

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

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

Science.gov (United States)

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.

Sensitivity theory for general non-linear algebraic equations with constraints

International Nuclear Information System (INIS)

Oblow, E.M.

1977-04-01

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

A method for solving neutron transport equation

International Nuclear Information System (INIS)

Dimitrijevic, Z.

1993-01-01

The procedure for solving the transport equation by directly integrating for case one-dimensional uniform multigroup medium is shown. The solution is expressed in terms of linear combination of function H n (x,μ), and the coefficient is determined from given conditions. The solution is applied for homogeneous slab of critical thickness. (author)

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

Directory of Open Access Journals (Sweden)

Lu Jun-Feng

2013-01-01

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

Linearized pseudo-Einstein equations on the Heisenberg group

Science.gov (United States)

Barletta, Elisabetta; Dragomir, Sorin; Jacobowitz, Howard

2017-02-01

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

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

International Nuclear Information System (INIS)

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

2009-01-01

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

A Chess-Like Game for Teaching Engineering Students to Solve Large System of Simultaneous Linear Equations

Science.gov (United States)

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]!

Using the Multiplicative Schwarz Alternating Algorithm (MSAA) for Solving the Large Linear System of Equations Related to Global Gravity Field Recovery up to Degree and Order 120

Science.gov (United States)

Safari, A.; Sharifi, M. A.; Amjadiparvar, B.

2010-05-01

The GRACE mission has substantiated the low-low satellite-to-satellite tracking (LL-SST) concept. The LL-SST configuration can be combined with the previously realized high-low SST concept in the CHAMP mission to provide a much higher accuracy. The line of sight (LOS) acceleration difference between the GRACE satellite pair is the mostly used observable for mapping the global gravity field of the Earth in terms of spherical harmonic coefficients. In this paper, mathematical formulae for LOS acceleration difference observations have been derived and the corresponding linear system of equations has been set up for spherical harmonic up to degree and order 120. The total number of unknowns is 14641. Such a linear equation system can be solved with iterative solvers or direct solvers. However, the runtime of direct methods or that of iterative solvers without a suitable preconditioner increases tremendously. This is the reason why we need a more sophisticated method to solve the linear system of problems with a large number of unknowns. Multiplicative variant of the Schwarz alternating algorithm is a domain decomposition method, which allows it to split the normal matrix of the system into several smaller overlaped submatrices. In each iteration step the multiplicative variant of the Schwarz alternating algorithm solves linear systems with the matrices obtained from the splitting successively. It reduces both runtime and memory requirements drastically. In this paper we propose the Multiplicative Schwarz Alternating Algorithm (MSAA) for solving the large linear system of gravity field recovery. The proposed algorithm has been tested on the International Association of Geodesy (IAG)-simulated data of the GRACE mission. The achieved results indicate the validity and efficiency of the proposed algorithm in solving the linear system of equations from accuracy and runtime points of view. Keywords: Gravity field recovery, Multiplicative Schwarz Alternating Algorithm, Low

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

Directory of Open Access Journals (Sweden)

Sankar Prasad Mondal

2016-06-01

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

A New Approach and Solution Technique to Solve Time Fractional Nonlinear Reaction-Diffusion Equations

Directory of Open Access Journals (Sweden)

Inci Cilingir Sungu

2015-01-01

Full Text Available A new application of the hybrid generalized differential transform and finite difference method is proposed by solving time fractional nonlinear reaction-diffusion equations. This method is a combination of the multi-time-stepping temporal generalized differential transform and the spatial finite difference methods. The procedure first converts the time-evolutionary equations into Poisson equations which are then solved using the central difference method. The temporal differential transform method as used in the paper takes care of stability and the finite difference method on the resulting equation results in a system of diagonally dominant linear algebraic equations. The Gauss-Seidel iterative procedure then used to solve the linear system thus has assured convergence. To have optimized convergence rate, numerical experiments were done by using a combination of factors involving multi-time-stepping, spatial step size, and degree of the polynomial fit in time. It is shown that the hybrid technique is reliable, accurate, and easy to apply.

Solvable linear potentials in the Dirac equation

International Nuclear Information System (INIS)

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

1990-01-01

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

New approach to solve symmetric fully fuzzy linear systems

Indian Academy of Sciences (India)

In this paper, we present a method to solve fully fuzzy linear systems with symmetric coefficient matrix. The symmetric coefficient matrix is decomposed into two systems of equations by using Cholesky method and then a solution can be obtained. Numerical examples are given to illustrate our method.

An implicit iterative scheme for solving large systems of linear equations

International Nuclear Information System (INIS)

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

1986-12-01

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

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

Science.gov (United States)

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.

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

CERN Document Server

Rosinger, Elemer E

1990-01-01

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

Solving Differential Equations in R: Package deSolve

Directory of Open Access Journals (Sweden)

Karline Soetaert

2010-02-01

Full Text Available 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 approach. The differential equations can be represented in R code or as compiled code. In the latter case, R is used as a tool to trigger the integration and post-process the results, which facilitates model development and application, whilst the compiled code significantly increases simulation speed. The methods implemented are efficient, robust, and well documented public-domain Fortran routines. They include four integrators from the ODEPACK package (LSODE, LSODES, LSODA, LSODAR, DVODE and DASPK2.0. In addition, a suite of Runge-Kutta integrators and special-purpose solvers to efficiently integrate 1-, 2- and 3-dimensional partial differential equations are available. The routines solve both stiff and non-stiff systems, and include many options, e.g., to deal in an efficient way with the sparsity of the Jacobian matrix, or finding the root of equations. In this article, our objectives are threefold: (1 to demonstrate the potential of using R for dynamic modeling, (2 to highlight typical uses of the different methods implemented and (3 to compare the performance of models specified in R code and in compiled code for a number of test cases. These comparisons demonstrate that, if the use of loops is avoided, R code can efficiently integrate problems comprising several thousands of state variables. Nevertheless, the same problem may be solved from 2 to more than 50 times faster by using compiled code compared to an implementation using only R code. Still, amongst the benefits of R are a more flexible and interactive implementation, better readability of the code, and access to R’s high-level procedures. deSolve is the successor of package odesolve which will be deprecated in

Quantum osp-invariant non-linear Schroedinger equation

International Nuclear Information System (INIS)

Kulish, P.P.

1985-04-01

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

A control volume based finite difference method for solving the equilibrium equations in terms of displacements

DEFF Research Database (Denmark)

Hattel, Jesper; Hansen, Preben

1995-01-01

This paper presents a novel control volume based FD method for solving the equilibrium equations in terms of displacements, i.e. the generalized Navier equations. The method is based on the widely used cv-FDM solution of heat conduction and fluid flow problems involving a staggered grid formulati....... The resulting linear algebraic equations are solved by line-Gauss-Seidel....

Finite element method with quadratic quadrilateral unit for solving two dimensional incompressible N-S equation

International Nuclear Information System (INIS)

Tao Ganqiang; Yu Qing; Xiao Xiao

2011-01-01

Viscous and incompressible fluid flow is important for numerous engineering mechanics problems. Because of high non linear and incompressibility for Navier-Stokes equation, it is very difficult to solve Navier-Stokes equation by numerical method. According to its characters of Navier-Stokes equation, quartic derivation controlling equation of the two dimensional incompressible Navier-Stokes equation is set up firstly. The method solves the problem for dealing with vorticity boundary and automatically meets incompressibility condition. Then Finite Element equation for Navier-Stokes equation is proposed by using quadratic quadrilateral unit with 8 nodes in which the unit function is quadratic and non linear.-Based on it, the Finite Element program of quadratic quadrilateral unit with 8 nodes is developed. Lastly, numerical experiment proves the accuracy and dependability of the method and also shows the method has good application prospect in computational fluid mechanics. (authors)

A fast iterative scheme for the linearized Boltzmann equation

Science.gov (United States)

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

2017-06-01

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

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

International Nuclear Information System (INIS)

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

1988-01-01

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

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

Directory of Open Access Journals (Sweden)

Petr Hasil

2016-08-01

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

Solution methods for large systems of linear equations in BACCHUS

International Nuclear Information System (INIS)

Homann, C.; Dorr, B.

1993-05-01

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

A neuro approach to solve fuzzy Riccati differential equations

Energy Technology Data Exchange (ETDEWEB)

Shahrir, Mohammad Shazri, E-mail: mshazri@gmail.com [InstitutSainsMatematik, Universiti Malaya 50603 Kuala Lumpur, Wilayah Persekutuan Kuala Lumpur (Malaysia); Telekom Malaysia, R& D TM Innovation Centre, LingkaranTeknokrat Timur, 63000 Cyberjaya, Selangor (Malaysia); Kumaresan, N., E-mail: drnk2008@gmail.com; Kamali, M. Z. M.; Ratnavelu, Kurunathan [InstitutSainsMatematik, Universiti Malaya 50603 Kuala Lumpur, Wilayah Persekutuan Kuala Lumpur (Malaysia)

2015-10-22

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.

Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

KAUST Repository

Southern, J.A.

2009-10-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 while 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 counterintuitive 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.

Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

KAUST Repository

Southern, J.A.; Plank, G.; Vigmond, E.J.; Whiteley, J.P.

2009-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 while 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 counterintuitive 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.

Novel algorithm of large-scale simultaneous linear equations

International Nuclear Information System (INIS)

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

2010-01-01

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

Solving Kepler's equation using implicit functions

Science.gov (United States)

Mortari, Daniele; Elipe, Antonio

2014-01-01

A new approach to solve Kepler's equation based on the use of implicit functions is proposed here. First, new upper and lower bounds are derived for two ranges of mean anomaly. These upper and lower bounds initialize a two-step procedure involving the solution of two implicit functions. These two implicit functions, which are non-rational (polynomial) Bézier functions, can be linear or quadratic, depending on the derivatives of the initial bound values. These are new initial bounds that have been compared and proven more accurate than Serafin's bounds. The procedure reaches machine error accuracy with no more that one quadratic and one linear iterations, experienced in the "tough range", where the eccentricity is close to one and the mean anomaly to zero. The proposed method is particularly suitable for space-based applications with limited computational capability.

A Model for Solving the Maxwell Quasi Stationary Equations in a 3-Phase Electric Reduction Furnace

Directory of Open Access Journals (Sweden)

S. Ekrann

1982-10-01

Full Text Available A computer code has been developed for the approximate computation of electric and magnetic fields within an electric reduction furnace. The paper describes the numerical methods used to solve Maxwell's quasi-stationary equations, which are the governing equations for this problem. The equations are discretized by a staggered grid finite difference technique. The resulting algebraic equations are solved by iterating between computations of electric and magnetic quantities. This 'outer' iteration converges only when the skin depth is larger or of about the same magnitude as the linear dimensions of the computational domain. In solving for electric quantities with magnetic quantities being regarded as known, and vice versa, the central computational task is the solution of a Poisson equation for a scalar potential. These equations are solved by line successive overrelaxation combined with a rebalancing technique.

Solution of linear transport equation using Chebyshev polynomials and Laplace transform

International Nuclear Information System (INIS)

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

1994-01-01

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

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

Science.gov (United States)

Stone, H. S.

1971-01-01

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

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

Directory of Open Access Journals (Sweden)

Thomas Gomez

2018-04-01

Full Text Available 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 numerical 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. 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.

A Meshfree Quasi-Interpolation Method for Solving Burgers’ Equation

Directory of Open Access Journals (Sweden)

Mingzhu Li

2014-01-01

Full Text Available The main aim of this work is to consider a meshfree algorithm for solving Burgers’ equation with the quartic B-spline quasi-interpolation. Quasi-interpolation is very useful in the study of approximation theory and its applications, since it can yield solutions directly without the need to solve any linear system of equations and overcome the ill-conditioning problem resulting from using the B-spline as a global interpolant. The numerical scheme is presented, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the time derivative of the dependent variable. Compared to other numerical methods, the main advantages of our scheme are higher accuracy and lower computational complexity. Meanwhile, the algorithm is very simple and easy to implement and the numerical experiments show that it is feasible and valid.

Adomian decomposition method for solving the telegraph equation in charged particle transport

International Nuclear Information System (INIS)

Abdou, M.A.

2005-01-01

In this paper, the analysis for the telegraph equation in case of isotropic small angle scattering from the Boltzmann transport equation for charged particle is presented. The Adomian decomposition is used to solve the telegraph equation. By means of MAPLE the Adomian polynomials of obtained series (ADM) solution have been calculated. The behaviour of the distribution function are shown graphically. The results reported in this article provide further evidence of the usefulness of Adomain decomposition for obtaining solution of linear and nonlinear problems

Non-linear effects in the Boltzmann equation

International Nuclear Information System (INIS)

Barrachina, R.O.

1985-01-01

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

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

International Nuclear Information System (INIS)

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

1983-01-01

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

An inherently parallel method for solving discretized diffusion equations

International Nuclear Information System (INIS)

Eccleston, B.R.; Palmer, T.S.

1999-01-01

A Monte Carlo approach to solving linear systems of equations is being investigated in the context of the solution of discretized diffusion equations. While the technique was originally devised decades ago, changes in computer architectures (namely, massively parallel machines) have driven the authors to revisit this technique. There are a number of potential advantages to this approach: (1) Analog Monte Carlo techniques are inherently parallel; this is not necessarily true to today's more advanced linear equation solvers (multigrid, conjugate gradient, etc.); (2) Some forms of this technique are adaptive in that they allow the user to specify locations in the problem where resolution is of particular importance and to concentrate the work at those locations; and (3) These techniques permit the solution of very large systems of equations in that matrix elements need not be stored. The user could trade calculational speed for storage if elements of the matrix are calculated on the fly. The goal of this study is to compare the parallel performance of Monte Carlo linear solvers to that of a more traditional parallelized linear solver. The authors observe the linear speedup that they expect from the Monte Carlo algorithm, given that there is no domain decomposition to cause significant communication overhead. Overall, PETSc outperforms the Monte Carlo solver for the test problem. The PETSc parallel performance improves with larger numbers of unknowns for a given number of processors. Parallel performance of the Monte Carlo technique is independent of the size of the matrix and the number of processes. They are investigating modifications to the scheme to accommodate matrix problems with positive off-diagonal elements. They are also currently coding an on-the-fly version of the algorithm to investigate the solution of very large linear systems

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

International Nuclear Information System (INIS)

LaChapelle, J.

2004-01-01

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

Solving linear inequalities in a least squares sense

Energy Technology Data Exchange (ETDEWEB)

Bramley, R.; Winnicka, B. [Indiana Univ., Bloomington, IN (United States)

1994-12-31

Let A {element_of} {Re}{sup mxn} be an arbitrary real matrix, and let b {element_of} {Re}{sup m} a given vector. A familiar problem in computational linear algebra is to solve the system Ax = b in a least squares sense; that is, to find an x* minimizing {parallel}Ax {minus} b{parallel}, where {parallel} {center_dot} {parallel} refers to the vector two-norm. Such an x* solves the normal equations A{sup T}(Ax {minus} b) = 0, and the optimal residual r* = b {minus} Ax* is unique (although x* need not be). The least squares problem is usually interpreted as corresponding to multiple observations, represented by the rows of A and b, on a vector of data x. The observations may be inconsistent, and in this case a solution is sought that minimizes the norm of the residuals. A less familiar problem to numerical linear algebraists is the solution of systems of linear inequalities Ax {le} b in a least squares sense, but the motivation is similar: if a set of observations places upper or lower bounds on linear combinations of variables, the authors want to find x* minimizing {parallel} (Ax {minus} b){sub +} {parallel}, where the i{sup th} component of the vector v{sub +} is the maximum of zero and the i{sup th} component of v.

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

Directory of Open Access Journals (Sweden)

Sari Saraswati

2016-01-01

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

A toolbox to solve coupled systems of differential and difference equations

International Nuclear Information System (INIS)

Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Freitas, Abilio de

2016-01-01

We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do not request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter ε (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t. ε and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package SolveCoupledSystem which is based on the packages Sigma, HarmonicSums and OreSys. In all applications the representation in x-space is obtained as an iterated integral representation over general alphabets, generalizing Poincare iterated integrals.

A toolbox to solve coupled systems of differential and difference equations

Energy Technology Data Exchange (ETDEWEB)

Ablinger, Jakob; Schneider, Carsten [Linz Univ. (Austria). Research Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Freitas, Abilio de [DESY Zeuthen (Germany)

2016-01-15

We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do not request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter ε (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t. ε and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package SolveCoupledSystem which is based on the packages Sigma, HarmonicSums and OreSys. In all applications the representation in x-space is obtained as an iterated integral representation over general alphabets, generalizing Poincare iterated integrals.

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

KAUST Repository

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

2014-01-01

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

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

International Nuclear Information System (INIS)

Fujii, Akira; Kluemper, Andreas

1999-01-01

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

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

International Nuclear Information System (INIS)

Schmidt, H.J.

1985-01-01

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

He's homotopy perturbation method for solving systems of Volterra integral equations of the second kind

International Nuclear Information System (INIS)

Biazar, J.; Ghazvini, H.

2009-01-01

In this paper, the He's homotopy perturbation method is applied to solve systems of Volterra integral equations of the second kind. Some examples are presented to illustrate the ability of the method for linear and non-linear such systems. The results reveal that the method is very effective and simple.

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

Directory of Open Access Journals (Sweden)

Sari Saraswati

2016-01-01

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

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

Science.gov (United States)

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.

Linear integral equations and soliton systems

International Nuclear Information System (INIS)

Quispel, G.R.W.

1983-01-01

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

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

Science.gov (United States)

Tripathi, Rajnee; Mishra, Hradyesh Kumar

2016-01-01

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

A two-dimensional linear elasticity problem for anisotropic materials, solved with a parallelization code

Directory of Open Access Journals (Sweden)

Mihai-Victor PRICOP

2010-09-01

Full Text Available The present paper introduces a numerical approach of static linear elasticity equations for anisotropic materials. The domain and boundary conditions are simple, to enhance an easy implementation of the finite difference scheme. SOR and gradient are used to solve the resulting linear system. The simplicity of the geometry is also useful for MPI parallelization of the code.

Quantum linear Boltzmann equation

International Nuclear Information System (INIS)

Vacchini, Bassano; Hornberger, Klaus

2009-01-01

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

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

Directory of Open Access Journals (Sweden)

Dana Rıhová

2014-12-01

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

Chemical Equation Balancing.

Science.gov (United States)

Blakley, G. R.

1982-01-01

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

Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

International Nuclear Information System (INIS)

Bonnet, M.; Meurant, G.

1978-01-01

The object of this study is to compare different methods of solving linear and nonlinear algebraic systems and to apply them to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems the conventional methods of alternating direction type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method of nonlinear conjugate gradient is studied together with Newton's method and some of its variants. It should be noted, however, that Newton's method is found to be more efficient when coupled with a good method for solving the linear system. As a conclusion, these methods are used to solve a nonlinear diffusion problem and the numerical results obtained are compared [fr

Cognitive Load in Algebra: Element Interactivity in Solving Equations

Science.gov (United States)

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…

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

Science.gov (United States)

Gnoffo, Peter A.

2015-01-01

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

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

International Nuclear Information System (INIS)

Valat, J.

1960-12-01

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

Applying homotopy analysis method for solving differential-difference equation

International Nuclear Information System (INIS)

Wang Zhen; Zou Li; Zhang Hongqing

2007-01-01

In this Letter, we apply the homotopy analysis method to solving the differential-difference equations. A simple but typical example is applied to illustrate the validity and the great potential of the generalized homotopy analysis method in solving differential-difference equation. Comparisons are made between the results of the proposed method and exact solutions. The results show that the homotopy analysis method is an attractive method in solving the differential-difference equations

Linear superposition solutions to nonlinear wave equations

International Nuclear Information System (INIS)

Liu Yu

2012-01-01

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

Linear and quasi-linear equations of parabolic type

CERN Document Server

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

1968-01-01

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

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

Science.gov (United States)

Camporesi, Roberto

2011-01-01

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

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

International Nuclear Information System (INIS)

Berge, L.; Pesme, D.

1992-01-01

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

Computer programs for the solution of systems of linear algebraic equations

Science.gov (United States)

Sequi, W. T.

1973-01-01

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

New method for solving three-dimensional Schroedinger equation

International Nuclear Information System (INIS)

Melezhik, V.S.

1992-01-01

A new method is developed for solving the multidimensional Schroedinger equation without the variable separation. To solve the Schroedinger equation in a multidimensional coordinate space X, a difference grid Ω i (i=1,2,...,N) for some of variables, Ω, from X={R,Ω} is introduced and the initial partial-differential equation is reduced to a system of N differential-difference equations in terms of one of the variables R. The arising multi-channel scattering (or eigenvalue) problem is solved by the algorithm based on a continuous analog of the Newton method. The approach has been successfully tested for several two-dimensional problems (scattering on a nonspherical potential well and 'dipole' scatterer, a hydrogen atom in a homogenous magnetic field) and for a three-dimensional problem of the helium-atom bound states. (author)

Parallel Algorithm Solves Coupled Differential Equations

Science.gov (United States)

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 Regularized Approach for Solving Magnetic Differential Equations and a Revised Iterative Equilibrium Algorithm

International Nuclear Information System (INIS)

Hudson, S.R.

2010-01-01

A method for approximately solving magnetic differential equations is described. The approach is to include a small diffusion term to the equation, which regularizes the linear operator to be inverted. The extra term allows a 'source-correction' term to be defined, which is generally required in order to satisfy the solvability conditions. The approach is described in the context of computing the pressure and parallel currents in the iterative approach for computing magnetohydrodynamic equilibria.

Solving Some Special Cases of Monomial Ratio Equations Appearing Frequently in Physical and Engineering Problems

Directory of Open Access Journals (Sweden)

Enrique Castillo

2016-01-01

Full Text Available We first show that monomial ratio equations are not only very common in Physics and Engineering, but the natural type of equations in many practical problems. More precisely, in the case of models involving scale variables if the used formulas are not of this type they are not physically valid. The consequence is that when estimating the model parameters we are faced with systems of monomial ratio equations that are nonlinear and difficult to solve. In this paper, we provide an original algorithm to obtain the unique solutions of systems of equations made of linear combinations of monomial ratios whose coefficient matrix has a proper null space with low dimension that permits solving the problem in a simple way. Finally, we illustrate the proposed methods by their application to two practical problems from the hydraulic and structural fields.

An approach for solving linear fractional programming problems ...

African Journals Online (AJOL)

The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...

T-Stability of the Heun Method and Balanced Method for Solving Stochastic Differential Delay Equations

Directory of Open Access Journals (Sweden)

Xiaolin Zhu

2014-01-01

Full Text Available This paper studies the T-stability of the Heun method and balanced method for solving stochastic differential delay equations (SDDEs. Two T-stable conditions of the Heun method are obtained for two kinds of linear SDDEs. Moreover, two conditions under which the balanced method is T-stable are obtained for two kinds of linear SDDEs. Some numerical examples verify the theoretical results proposed.

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

CERN Document Server

Camporesi, Roberto

2016-01-01

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

Solving Absolute Value Equations Algebraically and Geometrically

Science.gov (United States)

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.

Linear determining equations for differential constraints

International Nuclear Information System (INIS)

Kaptsov, O V

1998-01-01

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

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

Science.gov (United States)

Hasegawa, Chihiro; Duffull, Stephen B

2018-02-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2016-07-05

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

The spectral transform as a tool for solving nonlinear discrete evolution equations

International Nuclear Information System (INIS)

Levi, D.

1979-01-01

In this contribution we study nonlinear differential difference equations which became important to the description of an increasing number of problems in natural science. Difference equations arise for instance in the study of electrical networks, in statistical problems, in queueing problems, in ecological problems, as computer models for differential equations and as models for wave excitation in plasma or vibrations of particles in an anharmonic lattice. We shall first review the passages necessary to solve linear discrete evolution equations by the discrete Fourier transfrom, then, starting from the Zakharov-Shabat discretized eigenvalue, problem, we shall introduce the spectral transform. In the following part we obtain the correlation between the evolution of the potentials and scattering data through the Wronskian technique, giving at the same time many other properties as, for example, the Baecklund transformations. Finally we recover some of the important equations belonging to this class of nonlinear discrete evolution equations and extend the method to equations with n-dependent coefficients. (HJ)

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

Science.gov (United States)

Camporesi, Roberto

2016-01-01

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

Derivation of the physical equations solved in the inertial confinement stability code DOC. Informal report

International Nuclear Information System (INIS)

Scannapieco, A.J.; Cranfill, C.W.

1978-11-01

There now exists an inertial confinement stability code called DOC, which runs as a postprocessor. DOC (a code that has evolved from a previous code, PANSY) is a spherical harmonic linear stability code that integrates, in time, a set of Lagrangian perturbation equations. Effects due to real equations of state, asymmetric energy deposition, thermal conduction, shock propagation, and a time-dependent zeroth-order state are handled in the code. We present here a detailed derivation of the physical equations that are solved in the code

Derivation of the physical equations solved in the inertial confinement stability code DOC. Informal report

Energy Technology Data Exchange (ETDEWEB)

Scannapieco, A.J.; Cranfill, C.W.

1978-11-01

There now exists an inertial confinement stability code called DOC, which runs as a postprocessor. DOC (a code that has evolved from a previous code, PANSY) is a spherical harmonic linear stability code that integrates, in time, a set of Lagrangian perturbation equations. Effects due to real equations of state, asymmetric energy deposition, thermal conduction, shock propagation, and a time-dependent zeroth-order state are handled in the code. We present here a detailed derivation of the physical equations that are solved in the code.

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

Directory of Open Access Journals (Sweden)

Jan Awrejcewicz

2004-01-01

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

On Solving Linear Recurrences

Science.gov (United States)

Dobbs, David E.

2013-01-01

A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.

Parallel computation for solving the tridiagonal linear system of equations

International Nuclear Information System (INIS)

Ishiguro, Misako; Harada, Hiroo; Fujii, Minoru; Fujimura, Toichiro; Nakamura, Yasuhiro; Nanba, Katsumi.

1981-09-01

Recently, applications of parallel computation for scientific calculations have increased from the need of the high speed calculation of large scale programs. At the JAERI computing center, an array processor FACOM 230-75 APU has installed to study the applicability of parallel computation for nuclear codes. We made some numerical experiments by using the APU on the methods of solution of tridiagonal linear equation which is an important problem in scientific calculations. Referring to the recent papers with parallel methods, we investigate eight ones. These are Gauss elimination method, Parallel Gauss method, Accelerated parallel Gauss method, Jacobi method, Recursive doubling method, Cyclic reduction method, Chebyshev iteration method, and Conjugate gradient method. The computing time and accuracy were compared among the methods on the basis of the numerical experiments. As the result, it is found that the Cyclic reduction method is best both in computing time and accuracy and the Gauss elimination method is the second one. (author)

An Approach for Solving Linear Fractional Programming Problems

OpenAIRE

Andrew Oyakhobo Odior

2012-01-01

Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...

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

International Nuclear Information System (INIS)

Zhou, B.

1997-01-01

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

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

International Nuclear Information System (INIS)

Drouffe, J.M.; Flyvbjerg, H.

1989-08-01

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

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

Science.gov (United States)

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.

A mixed Fourier–Galerkin–finite-volume method to solve the fluid dynamics equations in cylindrical geometries

International Nuclear Information System (INIS)

Núñez, Jóse; Ramos, Eduardo; Lopez, Juan M

2012-01-01

We describe a hybrid method based on the combined use of the Fourier Galerkin and finite-volume techniques to solve the fluid dynamics equations in cylindrical geometries. A Fourier expansion is used in the angular direction, partially translating the problem to the Fourier space and then solving the resulting equations using a finite-volume technique. We also describe an algorithm required to solve the coupled mass and momentum conservation equations similar to a pressure-correction SIMPLE method that is adapted for the present formulation. Using the Fourier–Galerkin method for the azimuthal direction has two advantages. Firstly, it has a high-order approximation of the partial derivatives in the angular direction, and secondly, it naturally satisfies the azimuthal periodic boundary conditions. Also, using the finite-volume method in the r and z directions allows one to handle boundary conditions with discontinuities in those directions. It is important to remark that with this method, the resulting linear system of equations are band-diagonal, leading to fast and efficient solvers. The benefits of the mixed method are illustrated with example problems. (paper)

A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate

Directory of Open Access Journals (Sweden)

Min Sun

2014-01-01

Full Text Available A matrix-free method for constrained equations is proposed, which is a combination of the well-known PRP (Polak-Ribière-Polyak conjugate gradient method and the famous hyperplane projection method. The new method is not only derivative-free, but also completely matrix-free, and consequently, it can be applied to solve large-scale constrained equations. We obtain global convergence of the new method without any differentiability requirement on the constrained equations. Compared with the existing gradient methods for solving such problem, the new method possesses linear convergence rate under standard conditions, and a relax factor γ is attached in the update step to accelerate convergence. Preliminary numerical results show that it is promising in practice.

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

Directory of Open Access Journals (Sweden)

Matt Challacombe

2014-03-01

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

A Fibonacci collocation method for solving a class of Fredholm–Volterra integral equations in two-dimensional spaces

Directory of Open Access Journals (Sweden)

Farshid Mirzaee

2014-06-01

Full Text Available In this paper, we present a numerical method for solving two-dimensional Fredholm–Volterra integral equations (F-VIE. The method reduces the solution of these integral equations to the solution of a linear system of algebraic equations. The existence and uniqueness of the solution and error analysis of proposed method are discussed. The method is computationally very simple and attractive. Finally, numerical examples illustrate the efficiency and accuracy of the method.

Compact tunable silicon photonic differential-equation solver for general linear time-invariant systems.

Science.gov (United States)

Wu, Jiayang; Cao, Pan; Hu, Xiaofeng; Jiang, Xinhong; Pan, Ting; Yang, Yuxing; Qiu, Ciyuan; Tremblay, Christine; Su, Yikai

2014-10-20

We propose and experimentally demonstrate an all-optical temporal differential-equation solver that can be used to solve ordinary differential equations (ODEs) characterizing general linear time-invariant (LTI) systems. The photonic device implemented by an add-drop microring resonator (MRR) with two tunable interferometric couplers is monolithically integrated on a silicon-on-insulator (SOI) wafer with a compact footprint of ~60 μm × 120 μm. By thermally tuning the phase shifts along the bus arms of the two interferometric couplers, the proposed device is capable of solving first-order ODEs with two variable coefficients. The operation principle is theoretically analyzed, and system testing of solving ODE with tunable coefficients is carried out for 10-Gb/s optical Gaussian-like pulses. The experimental results verify the effectiveness of the fabricated device as a tunable photonic ODE solver.

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

Science.gov (United States)

Pérez-Jordá, José M

2016-02-01

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

Combining the CORS and BiCORSTAB Iterative Methods with MLFMA and SAI Preconditioning for Solving Large Linear Systems in Electromagnetics

NARCIS (Netherlands)

Carpentieri, Bruno; Jing, Yan-Fei; Huang, Ting-Zhu; Pi, Wei-Chao; Sheng, Xin-Qing

We report on experiments with a novel family of Krylov subspace methods for solving dense, complex, non-Hermitian systems of linear equations arising from the Galerkin discretization of surface integral equation models in Electromagnetics. By some experiments on realistic radar-cross-section

Interior Point Method for Solving Fuzzy Number Linear Programming Problems Using Linear Ranking Function

Directory of Open Access Journals (Sweden)

Yi-hua Zhong

2013-01-01

Full Text Available Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems.

Exp-function method for solving Fisher's equation

Energy Technology Data Exchange (ETDEWEB)

Zhou, X-W [Department of Mathematics, Kunming Teacher' s College, Kunming, Yunnan 650031 (China)], E-mail: km_xwzhou@163.com

2008-02-15

There are many methods to solve Fisher's equation, but each method can only lead to a special solution. In this paper, a new method, namely the exp-function method, is employed to solve the Fisher's equation. The obtained result includes all solutions in open literature as special cases, and the generalized solution with some free parameters might imply some fascinating meanings hidden in the Fisher's equation.

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

International Nuclear Information System (INIS)

Momani, Shaher; Odibat, Zaid

2006-01-01

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

Isomorphism of Intransitive Linear Lie Equations

Directory of Open Access Journals (Sweden)

Jose Miguel Martins Veloso

2009-11-01

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

COMPARISON OF IMPLICIT SCHEMES TO SOLVE EQUATIONS OF RADIATION HYDRODYNAMICS WITH A FLUX-LIMITED DIFFUSION APPROXIMATION: NEWTON–RAPHSON, OPERATOR SPLITTING, AND LINEARIZATION

Energy Technology Data Exchange (ETDEWEB)

Tetsu, Hiroyuki; Nakamoto, Taishi, E-mail: h.tetsu@geo.titech.ac.jp [Earth and Planetary Sciences, Tokyo Institute of Technology, Tokyo 152-8551 (Japan)

2016-03-15

Radiation is an important process of energy transport, a force, and a basis for synthetic observations, so radiation hydrodynamics (RHD) calculations have occupied an important place in astrophysics. However, although the progress in computational technology is remarkable, their high numerical cost is still a persistent problem. In this work, we compare the following schemes used to solve the nonlinear simultaneous equations of an RHD algorithm with the flux-limited diffusion approximation: the Newton–Raphson (NR) method, operator splitting, and linearization (LIN), from the perspective of the computational cost involved. For operator splitting, in addition to the traditional simple operator splitting (SOS) scheme, we examined the scheme developed by Douglas and Rachford (DROS). We solve three test problems (the thermal relaxation mode, the relaxation and the propagation of linear waves, and radiating shock) using these schemes and then compare their dependence on the time step size. As a result, we find the conditions of the time step size necessary for adopting each scheme. The LIN scheme is superior to other schemes if the ratio of radiation pressure to gas pressure is sufficiently low. On the other hand, DROS can be the most efficient scheme if the ratio is high. Although the NR scheme can be adopted independently of the regime, especially in a problem that involves optically thin regions, the convergence tends to be worse. In all cases, SOS is not practical.

Solving Variable Coefficient Fourth-Order Parabolic Equation by ...

African Journals Online (AJOL)

Solving Variable Coefficient Fourth-Order Parabolic Equation by Modified initial guess Variational ... variable coefficient fourth order parabolic partial differential equations. The new method shows rapid convergence to the exact solution.

Solving large sets of coupled equations iteratively by vector processing on the CYBER 205 computer

International Nuclear Information System (INIS)

Tolsma, L.D.

1985-01-01

The set of coupled linear second-order differential equations which has to be solved for the quantum-mechanical description of inelastic scattering of atomic and nuclear particles can be rewritten as an equivalent set of coupled integral equations. When some type of functions is used as piecewise analytic reference solutions, the integrals that arise in this set can be evaluated analytically. The set of integral equations can be solved iteratively. For the results mentioned an inward-outward iteration scheme has been applied. A concept of vectorization of coupled-channel Fortran programs, based on this integral method, is presented for the use on the Cyber 205 computer. It turns out that, for two heavy ion nuclear scattering test cases, this vector algorithm gives an overall speed-up of about a factor of 2 to 3 compared to a highly optimized scalar algorithm for a one vector pipeline computer

On the solution of a class of fuzzy system of linear equations

Indian Academy of Sciences (India)

J. Mathematics and Comput. Sci. 1: 1–5. Salkuyeh D K 2011 On the solution of the fuzzy Sylvester matrix equation. Soft Computing 15: 953–961. Senthilkumar P and Rajendran G 2011 New approach to solve symmetric fully fuzzy linear systems. S¯adhan¯a 36: 933–940. Wang K and Zheng B 2007 Block iterative methods ...

Sinc-collocation method for solving the Blasius equation

International Nuclear Information System (INIS)

Parand, K.; Dehghan, Mehdi; Pirkhedri, A.

2009-01-01

Sinc-collocation method is applied for solving Blasius equation which comes from boundary layer equations. It is well known that sinc procedure converges to the solution at an exponential rate. Comparison with Howarth and Asaithambi's numerical solutions reveals that the proposed method is of high accuracy and reduces the solution of Blasius' equation to the solution of a system of algebraic equations.

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

Science.gov (United States)

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

Correct Linearization of Einstein's Equations

Directory of Open Access Journals (Sweden)

Rabounski D.

2006-06-01

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

Diffusive limits for linear transport equations

International Nuclear Information System (INIS)

Pomraning, G.C.

1992-01-01

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

Spectral theories for linear differential equations

International Nuclear Information System (INIS)

Sell, G.R.

1976-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2005-07-01

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

Numerical method for solving the three-dimensional time-dependent neutron diffusion equation

International Nuclear Information System (INIS)

Khaled, S.M.; Szatmary, Z.

2005-01-01

A numerical time-implicit method has been developed for solving the coupled three-dimensional time-dependent multi-group neutron diffusion and delayed neutron precursor equations. The numerical stability of the implicit computation scheme and the convergence of the iterative associated processes have been evaluated. The computational scheme requires the solution of large linear systems at each time step. For this purpose, the point over-relaxation Gauss-Seidel method was chosen. A new scheme was introduced instead of the usual source iteration scheme. (author)

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

International Nuclear Information System (INIS)

Garbow, B.

1984-01-01

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

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

Science.gov (United States)

Szabo, Thomas L.

2003-10-01

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

The structure of solutions of the matrix linear unilateral polynomial equation with two variables

Directory of Open Access Journals (Sweden)

N. S. Dzhaliuk

2017-07-01

Full Text Available We investigate the structure of solutions of the matrix linear polynomial equation $A(\\lambdaX(\\lambda+B(\\lambdaY(\\lambda=C(\\lambda,$ in particular, possible degrees of the solutions. The solving of this equation is reduced to the solving of the equivalent matrix polynomial equation with matrix coefficients in triangular forms with invariant factors on the main diagonals, to which the matrices $A (\\lambda, B(\\lambda$ \\ and \\ $C(\\lambda$ are reduced by means of semiscalar equivalent transformations. On the basis of it, we have pointed out the bounds of the degrees of the matrix polynomial equation solutions. Necessary and sufficient conditions for the uniqueness of a solution with a minimal degree are established. An effective method for constructing minimal degree solutions of the equations is suggested. In this article, unlike well-known results about the estimations of the degrees of the solutions of the matrix polynomial equations in which both matrix coefficients are regular or at least one of them is regular, we have considered the case when the matrix polynomial equation has arbitrary matrix coefficients $A(\\lambda$ and $B(\\lambda.$ 

A block Krylov subspace time-exact solution method for linear ordinary differential equation systems

NARCIS (Netherlands)

Bochev, Mikhail A.

2013-01-01

We propose a time-exact Krylov-subspace-based method for solving linear ordinary differential equation systems of the form $y'=-Ay+g(t)$ and $y"=-Ay+g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of

Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations

Directory of Open Access Journals (Sweden)

Ichitaro Yamazaki

2015-01-01

of their low-rank properties. To compute a low-rank approximation of a dense matrix, in this paper, we study the performance of QR factorization with column pivoting or with restricted pivoting on multicore CPUs with a GPU. We first propose several techniques to reduce the postprocessing time, which is required for restricted pivoting, on a modern CPU. We then examine the potential of using a GPU to accelerate the factorization process with both column and restricted pivoting. Our performance results on two eight-core Intel Sandy Bridge CPUs with one NVIDIA Kepler GPU demonstrate that using the GPU, the factorization time can be reduced by a factor of more than two. In addition, to study the performance of our implementations in practice, we integrate them into a recently developed software StruMF which algebraically exploits such low-rank structures for solving a general sparse linear system of equations. Our performance results for solving Poisson's equations demonstrate that the proposed techniques can significantly reduce the preconditioner construction time of StruMF on the CPUs, and the construction time can be further reduced by 10%–50% using the GPU.

Solving the Einstein constraint equations on multi-block triangulations using finite element methods

Energy Technology Data Exchange (ETDEWEB)

Korobkin, Oleg; Pazos, Enrique [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, LA 70803 (United States); Aksoylu, Burak [Center for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803 (United States); Holst, Michael [Department of Mathematics, University of California at San Diego 9500 Gilman Drive La Jolla, CA 92093-0112 (United States); Tiglio, Manuel [Department of Physics, University of Maryland, College Park, MD 20742 (United States)

2009-07-21

In order to generate initial data for nonlinear relativistic simulations, one needs to solve the Einstein constraints, which can be cast into a coupled set of nonlinear elliptic equations. Here we present an approach for solving these equations on three-dimensional multi-block domains using finite element methods. We illustrate our approach on a simple example of Brill wave initial data, with the constraints reducing to a single linear elliptic equation for the conformal factor psi. We use quadratic Lagrange elements on semi-structured simplicial meshes, obtained by triangulation of multi-block grids. In the case of uniform refinement the scheme is superconvergent at most mesh vertices, due to local symmetry of the finite element basis with respect to local spatial inversions. We show that in the superconvergent case subsequent unstructured mesh refinements do not improve the quality of our initial data. As proof of concept that this approach is feasible for generating multi-block initial data in three dimensions, after constructing the initial data we evolve them in time using a high-order finite-differencing multi-block approach and extract the gravitational waves from the numerical solution.

Solving the Einstein constraint equations on multi-block triangulations using finite element methods

International Nuclear Information System (INIS)

Korobkin, Oleg; Pazos, Enrique; Aksoylu, Burak; Holst, Michael; Tiglio, Manuel

2009-01-01

In order to generate initial data for nonlinear relativistic simulations, one needs to solve the Einstein constraints, which can be cast into a coupled set of nonlinear elliptic equations. Here we present an approach for solving these equations on three-dimensional multi-block domains using finite element methods. We illustrate our approach on a simple example of Brill wave initial data, with the constraints reducing to a single linear elliptic equation for the conformal factor ψ. We use quadratic Lagrange elements on semi-structured simplicial meshes, obtained by triangulation of multi-block grids. In the case of uniform refinement the scheme is superconvergent at most mesh vertices, due to local symmetry of the finite element basis with respect to local spatial inversions. We show that in the superconvergent case subsequent unstructured mesh refinements do not improve the quality of our initial data. As proof of concept that this approach is feasible for generating multi-block initial data in three dimensions, after constructing the initial data we evolve them in time using a high-order finite-differencing multi-block approach and extract the gravitational waves from the numerical solution.

Lie algebras and linear differential equations.

Science.gov (United States)

Brockett, R. W.; Rahimi, A.

1972-01-01

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

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

Science.gov (United States)

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.

More on Generalizations and Modifications of Iterative Methods for Solving Large Sparse Indefinite Linear Systems

Directory of Open Access Journals (Sweden)

Jen-Yuan Chen

2014-01-01

Full Text Available Continuing from the works of Li et al. (2014, Li (2007, and Kincaid et al. (2000, we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations. We discuss a variety of iterative methods such as GMRES, MGMRES, MINRES, LQ-MINRES, QR MINRES, MMINRES, MGRES, and others.

Linear q-nonuniform difference equations

International Nuclear Information System (INIS)

Bangerezako, Gaspard

2010-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2005-07-01

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

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

International Nuclear Information System (INIS)

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

1979-09-01

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

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

Science.gov (United States)

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

2018-03-01

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

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

CERN Document Server

Tran, Hung

2017-01-01

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

Camporesi, Roberto

2016-01-01

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

Solving the Schroedinger equation using Smolyak interpolants

International Nuclear Information System (INIS)

Avila, Gustavo; Carrington, Tucker Jr.

2013-01-01

In this paper, we present a new collocation method for solving the Schroedinger equation. Collocation has the advantage that it obviates integrals. All previous collocation methods have, however, the crucial disadvantage that they require solving a generalized eigenvalue problem. By combining Lagrange-like functions with a Smolyak interpolant, we device a collocation method that does not require solving a generalized eigenvalue problem. We exploit the structure of the grid to develop an efficient algorithm for evaluating the matrix-vector products required to compute energy levels and wavefunctions. Energies systematically converge as the number of points and basis functions are increased

Basic linear partial differential equations

CERN Document Server

Treves, Francois

1975-01-01

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

Non-local quasi-linear parabolic equations

International Nuclear Information System (INIS)

Amann, H

2005-01-01

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

Differential Equation over Banach Algebra

OpenAIRE

Kleyn, Aleks

2018-01-01

In the book, I considered differential equations of order $1$ over Banach $D$-algebra: differential equation solved with respect to the derivative; exact differential equation; linear homogeneous equation. In noncommutative Banach algebra, initial value problem for linear homogeneous equation has infinitely many solutions.

Newton's method for solving a quadratic matrix equation with special coefficient matrices

International Nuclear Information System (INIS)

Seo, Sang-Hyup; Seo, Jong Hyun; Kim, Hyun-Min

2014-01-01

We consider the iterative method for solving a quadratic matrix equation with special coefficient matrices which arises in the quasi-birth-death problem. In this paper, we show that the elementwise minimal positive solvents to quadratic matrix equations can be obtained using Newton's method. We also prove that the convergence rate of the Newton iteration is quadratic if the Fréchet derivative at the elementwise minimal positive solvent is nonsingular. However, if the Fréchet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.(This is summarized a paper which is to appear in Honam Mathematical Journal.)

A New Fractional Projective Riccati Equation Method for Solving Fractional Partial Differential Equations

International Nuclear Information System (INIS)

Feng Qing-Hua

2014-01-01

In this paper, a new fractional projective Riccati equation method is proposed to establish exact solutions for fractional partial differential equations in the sense of modified Riemann—Liouville derivative. This method can be seen as the fractional version of the known projective Riccati equation method. For illustrating the validity of this method, we apply this method to solve the space-time fractional Whitham—Broer—Kaup (WBK) equations and the nonlinear fractional Sharma—Tasso—Olever (STO) equation, and as a result, some new exact solutions for them are obtained. (general)

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

Science.gov (United States)

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.

TENSOLVE: A software package for solving systems of nonlinear equations and nonlinear least squares problems using tensor methods

Energy Technology Data Exchange (ETDEWEB)

Bouaricha, A. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.; Schnabel, R.B. [Colorado Univ., Boulder, CO (United States). Dept. of Computer Science

1996-12-31

This paper describes a modular software package for solving systems of nonlinear equations and nonlinear least squares problems, using a new class of methods called tensor methods. It is intended for small to medium-sized problems, say with up to 100 equations and unknowns, in cases where it is reasonable to calculate the Jacobian matrix or approximate it by finite differences at each iteration. The software allows the user to select between a tensor method and a standard method based upon a linear model. The tensor method models F({ital x}) by a quadratic model, where the second-order term is chosen so that the model is hardly more expensive to form, store, or solve than the standard linear model. Moreover, the software provides two different global strategies, a line search and a two- dimensional trust region approach. Test results indicate that, in general, tensor methods are significantly more efficient and robust than standard methods on small and medium-sized problems in iterations and function evaluations.

The Cauchy problem for non-linear Klein-Gordon equations

International Nuclear Information System (INIS)

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

1993-01-01

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

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

Science.gov (United States)

Rosenblatt, Marcus; Timmer, Jens; Kaschek, Daniel

2016-01-01

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

Hamiltonian structures of some non-linear evolution equations

International Nuclear Information System (INIS)

Tu, G.Z.

1983-06-01

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

Efficient solution of the non-linear Reynolds equation for compressible fluid using the finite element method

DEFF Research Database (Denmark)

Larsen, Jon Steffen; Santos, Ilmar

2015-01-01

An efficient finite element scheme for solving the non-linear Reynolds equation for compressible fluid coupled to compliant structures is presented. The method is general and fast and can be used in the analysis of airfoil bearings with simplified or complex foil structure models. To illustrate...

Nodal spectrum method for solving neutron diffusion equation

International Nuclear Information System (INIS)

Sanchez, D.; Garcia, C. R.; Barros, R. C. de; Milian, D.E.

1999-01-01

Presented here is a new numerical nodal method for solving static multidimensional neutron diffusion equation in rectangular geometry. Our method is based on a spectral analysis of the nodal diffusion equations. These equations are obtained by integrating the diffusion equation in X, Y directions and then considering flat approximations for the current. These flat approximations are the only approximations that are considered in this method, as a result the numerical solutions are completely free from truncation errors. We show numerical results to illustrate the methods accuracy for coarse mesh calculations

Solving the Schroedinger equation using the finite difference time domain method

International Nuclear Information System (INIS)

Sudiarta, I Wayan; Geldart, D J Wallace

2007-01-01

In this paper, we solve the Schroedinger equation using the finite difference time domain (FDTD) method to determine energies and eigenfunctions. In order to apply the FDTD method, the Schroedinger equation is first transformed into a diffusion equation by the imaginary time transformation. The resulting time-domain diffusion equation is then solved numerically by the FDTD method. The theory and an algorithm are provided for the procedure. Numerical results are given for illustrative examples in one, two and three dimensions. It is shown that the FDTD method accurately determines eigenfunctions and energies of these systems

Lagrange-Noether method for solving second-order differential equations

Institute of Scientific and Technical Information of China (English)

Wu Hui-Bin; Wu Run-Heng

2009-01-01

The purpose of this paper is to provide a new method called the Lagrange-Noether method for solving second-order differential equations. The method is,firstly,to write the second-order differential equations completely or partially in the form of Lagrange equations,and secondly,to obtain the integrals of the equations by using the Noether theory of the Lagrange system. An example is given to illustrate the application of the result.

Multiparameter extrapolation and deflation methods for solving equation systems

Directory of Open Access Journals (Sweden)

A. J. Hughes Hallett

1984-01-01

Full Text Available Most models in economics and the applied sciences are solved by first order iterative techniques, usually those based on the Gauss-Seidel algorithm. This paper examines the convergence of multiparameter extrapolations (accelerations of first order iterations, as an improved approximation to the Newton method for solving arbitrary nonlinear equation systems. It generalises my earlier results on single parameter extrapolations. Richardson's generalised method and the deflation method for detecting successive solutions in nonlinear equation systems are also presented as multiparameter extrapolations of first order iterations. New convergence results are obtained for those methods.

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

Science.gov (United States)

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.

Simplified neural networks for solving linear least squares and total least squares problems in real time.

Science.gov (United States)

Cichocki, A; Unbehauen, R

1994-01-01

In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known algorithms: the row-action projection-Kaczmarz algorithm and/or the LMS (Adaline) Widrow-Hoff algorithms. The algorithms can be applied to any problem which can be formulated as a linear regression problem. The correctness and high performance of the proposed neural networks are illustrated by extensive computer simulation results.

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

CERN Document Server

Unterkircher, A

2005-01-01

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

Application of Monte Carlo method to solving boundary value problem of differential equations

International Nuclear Information System (INIS)

Zuo Yinghong; Wang Jianguo

2012-01-01

This paper introduces the foundation of the Monte Carlo method and the way how to generate the random numbers. Based on the basic thought of the Monte Carlo method and finite differential method, the stochastic model for solving the boundary value problem of differential equations is built. To investigate the application of the Monte Carlo method to solving the boundary value problem of differential equations, the model is used to solve Laplace's equations with the first boundary condition and the unsteady heat transfer equation with initial values and boundary conditions. The results show that the boundary value problem of differential equations can be effectively solved with the Monte Carlo method, and the differential equations with initial condition can also be calculated by using a stochastic probability model which is based on the time-domain finite differential equations. Both the simulation results and theoretical analyses show that the errors of numerical results are lowered as the number of simulation particles is increased. (authors)

Linear measure functional differential equations with infinite delay

OpenAIRE

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

2014-01-01

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

Linear homotopy solution of nonlinear systems of equations in geodesy

Science.gov (United States)

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

2010-01-01

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

Saturation and linear transport equation

International Nuclear Information System (INIS)

Kutak, K.

2009-03-01

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

Convergence properties of iterative algorithms for solving the nodal diffusion equations

International Nuclear Information System (INIS)

Azmy, Y.Y.; Kirk, B.L.

1990-01-01

We drive the five point form of the nodal diffusion equations in two-dimensional Cartesian geometry and develop three iterative schemes to solve the discrete-variable equations: the unaccelerated, partial Successive Over Relaxation (SOR), and the full SOR methods. By decomposing the iteration error into its Fourier modes, we determine the spectral radius of each method for infinite medium, uniform model problems, and for the unaccelerated and partial SOR methods for finite medium, uniform model problems. Also for the two variants of the SOR method we determine the optimal relaxation factor that results in the smallest number of iterations required for convergence. Our results indicate that the number of iterations for the unaccelerated and partial SOR methods is second order in the number of nodes per dimension, while, for the full SOR this behavior is first order, resulting in much faster convergence for very large problems. We successfully verify the results of the spectral analysis against those of numerical experiments, and we show that for the full SOR method the linear dependence of the number of iterations on the number of nodes per dimension is relatively insensitive to the value of the relaxation parameter, and that it remains linear even for heterogenous problems. 14 refs., 1 fig

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

Science.gov (United States)

Scott, M

2012-08-01

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

Solving differential–algebraic equation systems by means of index reduction methodology

DEFF Research Database (Denmark)

Sørensen, Kim; Houbak, Niels; Condra, Thomas

2006-01-01

of a number of differential equations and algebraic equations — a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODEs and index 1 DAEs by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of ordinary differential equations — ODEs....

A numerical spectral approach to solve the dislocation density transport equation

International Nuclear Information System (INIS)

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

2015-01-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. (paper)

On an adaptive time stepping strategy for solving nonlinear diffusion equations

International Nuclear Information System (INIS)

Chen, K.; Baines, M.J.; Sweby, P.K.

1993-01-01

A new time step selection procedure is proposed for solving non- linear diffusion equations. It has been implemented in the ASWR finite element code of Lorenz and Svoboda [10] for 2D semiconductor process modelling diffusion equations. The strategy is based on equi-distributing the local truncation errors of the numerical scheme. The use of B-splines for interpolation (as well as for the trial space) results in a banded and diagonally dominant matrix. The approximate inverse of such a matrix can be provided to a high degree of accuracy by another banded matrix, which in turn can be used to work out the approximate finite difference scheme corresponding to the ASWR finite element method, and further to calculate estimates of the local truncation errors of the numerical scheme. Numerical experiments on six full simulation problems arising in semiconductor process modelling have been carried out. Results show that our proposed strategy is more efficient and better conserves the total mass. 18 refs., 6 figs., 2 tabs

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

Science.gov (United States)

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.

Local Ray-Based Traveltime Computation Using the Linearized Eikonal Equation

KAUST Repository

Almubarak, Mohammed S.

2013-05-01

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

Solving the Helmholtz equation in conformal mapped ARROWstructures using homotopy perturbation method

DEFF Research Database (Denmark)

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

2011-01-01

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

New numerical approximation for solving fractional delay differential equations of variable order using artificial neural networks

Science.gov (United States)

Zúñiga-Aguilar, C. J.; Coronel-Escamilla, A.; Gómez-Aguilar, J. F.; Alvarado-Martínez, V. M.; Romero-Ugalde, H. M.

2018-02-01

In this paper, we approximate the solution of fractional differential equations with delay using a new approach based on artificial neural networks. We consider fractional differential equations of variable order with the Mittag-Leffler kernel in the Liouville-Caputo sense. With this new neural network approach, an approximate solution of the fractional delay differential equation is obtained. Synaptic weights are optimized using the Levenberg-Marquardt algorithm. The neural network effectiveness and applicability were validated by solving different types of fractional delay differential equations, linear systems with delay, nonlinear systems with delay and a system of differential equations, for instance, the Newton-Leipnik oscillator. The solution of the neural network was compared with the analytical solutions and the numerical simulations obtained through the Adams-Bashforth-Moulton method. To show the effectiveness of the proposed neural network, different performance indices were calculated.

Analytical solutions of linear diffusion and wave equations in semi-infinite domains by using a new integral transform

Directory of Open Access Journals (Sweden)

Gao Lin

2017-01-01

Full Text Available Recently, a new integral transform similar to Sumudu transform has been proposed by Yang [1]. Some of the properties of the integral transform are expanded in the present article. Meanwhile, new applications to the linear wave and diffusion equations in semi-infinite domains are discussed in detail. The proposed method provides an alternative approach to solve the partial differential equations in mathematical physics.

Optimal overlapping of waveform relaxation method for linear differential equations

International Nuclear Information System (INIS)

Yamada, Susumu; Ozawa, Kazufumi

2000-01-01

Waveform relaxation (WR) method is extremely suitable for solving large systems of ordinary differential equations (ODEs) on parallel computers, but the convergence of the method is generally slow. In order to accelerate the convergence, the methods which decouple the system into many subsystems with overlaps some of the components between the adjacent subsystems have been proposed. The methods, in general, converge much faster than the ones without overlapping, but the computational cost per iteration becomes larger due to the increase of the dimension of each subsystem. In this research, the convergence of the WR method for solving constant coefficients linear ODEs is investigated and the strategy to determine the number of overlapped components which minimizes the cost of the parallel computations is proposed. Numerical experiments on an SR2201 parallel computer show that the estimated number of the overlapped components by the proposed strategy is reasonable. (author)

Modified Chebyshev Collocation Method for Solving Differential Equations

Directory of Open Access Journals (Sweden)

M Ziaul Arif

2015-05-01

Full Text Available This paper presents derivation of alternative numerical scheme for solving differential equations, which is modified Chebyshev (Vieta-Lucas Polynomial collocation differentiation matrices. The Scheme of modified Chebyshev (Vieta-Lucas Polynomial collocation method is applied to both Ordinary Differential Equations (ODEs and Partial Differential Equations (PDEs cases. Finally, the performance of the proposed method is compared with finite difference method and the exact solution of the example. It is shown that modified Chebyshev collocation method more effective and accurate than FDM for some example given.

Solving (2 + 1)-dimensional sine-Poisson equation by a modified variable separated ordinary differential equation method

International Nuclear Information System (INIS)

Ka-Lin, Su; Yuan-Xi, Xie

2010-01-01

By introducing a more general auxiliary ordinary differential equation (ODE), a modified variable separated ordinary differential equation method is presented for solving the (2 + 1)-dimensional sine-Poisson equation. As a result, many explicit and exact solutions of the (2 + 1)-dimensional sine-Poisson equation are derived in a simple manner by this technique. (general)

Expansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind

Directory of Open Access Journals (Sweden)

Mahmoud Paripour

2014-08-01

Full Text Available In this paper, the Bernstein polynomials are used to approximatethe solutions of linear integral equations with multiple time lags (IEMTL through expansion methods (collocation method, partition method, Galerkin method. The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is carried out

Fibonacci-regularization method for solving Cauchy integral equations of the first kind

Directory of Open Access Journals (Sweden)

Mohammad Ali Fariborzi Araghi

2017-09-01

Full Text Available In this paper, a novel scheme is proposed to solve the first kind Cauchy integral equation over a finite interval. For this purpose, the regularization method is considered. Then, the collocation method with Fibonacci base function is applied to solve the obtained second kind singular integral equation. Also, the error estimate of the proposed scheme is discussed. Finally, some sample Cauchy integral equations stem from the theory of airfoils in fluid mechanics are presented and solved to illustrate the importance and applicability of the given algorithm. The tables in the examples show the efficiency of the method.

Solving differential-algebraic equation systems by means of index reduction methodology

DEFF Research Database (Denmark)

Sørensen, Kim; Houbak, Niels; Condra, Thomas Joseph

2006-01-01

of a number of differential equations and algebraic equations - a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODE’s and index 1 DAE’s by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of Ordinary- Differential-Equations - ODE’s....

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

Science.gov (United States)

Pipkins, Daniel Scott

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

Solving applied mathematical problems with Matlab

CERN Document Server

Xue, Dingyu

2008-01-01

Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.

Linear causal modeling with structural equations

CERN Document Server

Mulaik, Stanley A

2009-01-01

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

Solving the Richardson equations close to the critical points

Energy Technology Data Exchange (ETDEWEB)

DomInguez, F [Departamento de Matematicas, Universidad de Alcala, 28871 Alcala de Henares (Spain); Esebbag, C [Departamento de Matematicas, Universidad de Alcala, 28871 Alcala de Henares (Spain); Dukelsky, J [Instituto de Estructura de la Materia, CSIC, Serrano 123, 28006 Madrid (Spain)

2006-09-15

We study the Richardson equations close to the critical values of the pairing strength g{sub c}, where the occurrence of divergences precludes numerical solutions. We derive a set of equations for determining the critical g values and the non-collapsing pair energies. Studying the behaviour of the solutions close to the critical points, we develop a procedure to solve numerically the Richardson equations for arbitrary coupling strength.

students' preference of method of solving simultaneous equations

African Journals Online (AJOL)

Ugboduma,Samuel.O.

substitution method irrespective of their gender for solving simultaneous equations. A recommendation ... advantage given to one method over others. Students' interest .... from two (2) single girls' schools, two (2) single boys schools and ten.

Diffusion phenomenon for linear dissipative wave equations

KAUST Repository

Said-Houari, Belkacem

2012-01-01

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

A new linearized equation for servo valve in hydraulic control systems

International Nuclear Information System (INIS)

Kim, Tae Hyung; Lee, Ill Yeong

2002-01-01

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

Adams Predictor-Corrector Systems for Solving Fuzzy Differential Equations

Directory of Open Access Journals (Sweden)

Dequan Shang

2013-01-01

Full Text Available A predictor-corrector algorithm and an improved predictor-corrector (IPC algorithm based on Adams method are proposed to solve first-order differential equations with fuzzy initial condition. These algorithms are generated by updating the Adams predictor-corrector method and their convergence is also analyzed. Finally, the proposed methods are illustrated by solving an example.

Solving large mixed linear models using preconditioned conjugate gradient iteration.

Science.gov (United States)

Strandén, I; Lidauer, M

1999-12-01

Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

The Use of Transformations in Solving Equations

Science.gov (United States)

Libeskind, Shlomo

2010-01-01

Many workshops and meetings with the US high school mathematics teachers revealed a lack of familiarity with the use of transformations in solving equations and problems related to the roots of polynomials. This note describes two transformational approaches to the derivation of the quadratic formula as well as transformational approaches to…

Final report [on solving the multigroup diffusion equations

International Nuclear Information System (INIS)

Birkhoff, G.

1975-01-01

Progress achieved in the development of variational methods for solving the multigroup neutron diffusion equations is described. An appraisal is made of the extent to which improved variational methods could advantageously replace difference methods currently used

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

Science.gov (United States)

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.

Hypocoercivity for linear kinetic equations conserving mass

KAUST Repository

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

2015-01-01

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

Hypocoercivity for linear kinetic equations conserving mass

KAUST Repository

Dolbeault, Jean

2015-02-03

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

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

Science.gov (United States)

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.

Planning under uncertainty solving large-scale stochastic linear programs

Energy Technology Data Exchange (ETDEWEB)

Infanger, G. [Stanford Univ., CA (United States). Dept. of Operations Research]|[Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft

1992-12-01

For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.

Resummation of the 1/N-expansion of the non-linear σ-model by Dyson-Schwinger equations

International Nuclear Information System (INIS)

Drouffe, J.M.; Flyvbjerg, H.

1988-02-01

Dyson-Schwinger equations for the O(N)-symmetric non-linear σ-model are derived and expanded in 1/N. A closed set of equations is obtained by keeping only the leading term and the first correction term in this expansion. These equations are solved numerically in 2 dimensions on square lattices of sizes 50x50 and 100x100. Results for the magnetic susceptibility and the mass gap are compared with predictions of the ordinary 1/N-expansion and with Monte Carlo results. The results obtained with the Dyson-Schwinger equations show the same scaling behavior as found in the Monte Carlo results. This is not the behavior predicted by the perturbative renormalization group. (orig.)

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

Directory of Open Access Journals (Sweden)

Akane Hongyo

2017-01-01

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

Semiconductor device simulation by a new method of solving poisson, Laplace and Schrodinger equations

International Nuclear Information System (INIS)

Sharifi, M. J.; Adibi, A.

2000-01-01

In this paper, we have extended and completed our previous work, that was introducing a new method for finite differentiation. We show the applicability of the method for solving a wide variety of equations such as poisson, Laplace and Schrodinger. These equations are fundamental to the most semiconductor device simulators. In a section, we solve the Shordinger equation by this method in several cases including the problem of finding electron concentration profile in the channel of a HEMT. In another section, we solve the Poisson equation by this method, choosing the problem of SBD as an example. Finally we solve the Laplace equation in two dimensions and as an example, we focus on the VED. In this paper, we have shown that, the method can get stable and precise results in solving all of these problems. Also the programs which have been written based on this method become considerably faster, more clear, and more abstract

The shallow water equations in Lagrangian coordinates

International Nuclear Information System (INIS)

Mead, J.L.

2004-01-01

Recent advances in the collection of Lagrangian data from the ocean and results about the well-posedness of the primitive equations have led to a renewed interest in solving flow equations in Lagrangian coordinates. We do not take the view that solving in Lagrangian coordinates equates to solving on a moving grid that can become twisted or distorted. Rather, the grid in Lagrangian coordinates represents the initial position of particles, and it does not change with time. We apply numerical methods traditionally used to solve differential equations in Eulerian coordinates, to solve the shallow water equations in Lagrangian coordinates. The difficulty with solving in Lagrangian coordinates is that the transformation from Eulerian coordinates results in solving a highly nonlinear partial differential equation. The non-linearity is mainly due to the Jacobian of the coordinate transformation, which is a precise record of how the particles are rotated and stretched. The inverse Jacobian must be calculated, thus Lagrangian coordinates cannot be used in instances where the Jacobian vanishes. For linear (spatial) flows we give an explicit formula for the Jacobian and describe the two situations where the Lagrangian shallow water equations cannot be used because either the Jacobian vanishes or the shallow water assumption is violated. We also prove that linear (in space) steady state solutions of the Lagrangian shallow water equations have Jacobian equal to one. In the situations where the shallow water equations can be solved in Lagrangian coordinates, accurate numerical solutions are found with finite differences, the Chebyshev pseudospectral method, and the fourth order Runge-Kutta method. The numerical results shown here emphasize the need for high order temporal approximations for long time integrations

Algorithms to solve coupled systems of differential equations in terms of power series

International Nuclear Information System (INIS)

Ablinger, Jakob; Schneider, Carsten

2016-08-01

Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations, and that sufficiently many initial values of the integrals are given. Then there exist algorithms that decide constructively if the coefficients of their power series representations can be given within the class of nested sums over hypergeometric products. In this article we work out the calculation steps that solve this problem. First, we present a successful tactic that has been applied recently to challenging problems coming from massive 3-loop Feynman integrals. Here our main tool is to solve scalar linear recurrences within the class of nested sums over hypergeometric products. Second, we will present a new variation of this tactic which relies on more involved summation technologies but succeeds in reducing the problem to solve scalar recurrences with lower recurrence orders. The article works out the different challenges of this new tactic and demonstrates how they can be treated efficiently with our existing summation technologies.

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

OpenAIRE

Nakamura, Gen; Vashisth, Manmohan

2017-01-01

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

Integral transform method for solving time fractional systems and fractional heat equation

Directory of Open Access Journals (Sweden)

Arman Aghili

2014-01-01

Full Text Available In the present paper, time fractional partial differential equation is considered, where the fractional derivative is defined in the Caputo sense. Laplace transform method has been applied to obtain an exact solution. The authors solved certain homogeneous and nonhomogeneous time fractional heat equations using integral transform. Transform method is a powerful tool for solving fractional singular Integro - differential equations and PDEs. The result reveals that the transform method is very convenient and effective.

Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

International Nuclear Information System (INIS)

Bonnet, M.; Meurant, G.

1978-01-01

Different methods of solution of linear and nonlinear algebraic systems are applied to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems, methods in general use of alternating directions type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method on nonlinear conjugate gradient is studied as also Newton's method and some of its variants. It should be noted, however that Newton's method is found to be more efficient when coupled with a good method for solution of the linear system. To conclude, such methods are used to solve a nonlinear diffusion problem and the numerical results obtained are to be compared [fr

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

Science.gov (United States)

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 Linear 1D Thermoelasticity Equations with Pure Delay

Directory of Open Access Journals (Sweden)

Denys Ya. Khusainov

2015-01-01

Full Text Available We propose a system of partial differential equations with a single constant delay τ>0 describing the behavior of a one-dimensional thermoelastic solid occupying a bounded interval of R1. For an initial-boundary value problem associated with this system, we prove a well-posedness result in a certain topology under appropriate regularity conditions on the data. Further, we show the solution of our delayed model to converge to the solution of the classical equations of thermoelasticity as τ→0. Finally, we deduce an explicit solution representation for the delay problem.

Improved algorithm for solving nonlinear parabolized stability equations

International Nuclear Information System (INIS)

Zhao Lei; Zhang Cun-bo; Liu Jian-xin; Luo Ji-sheng

2016-01-01

Due to its high computational efficiency and ability to consider nonparallel and nonlinear effects, nonlinear parabolized stability equations (NPSE) approach has been widely used to study the stability and transition mechanisms. However, it often diverges in hypersonic boundary layers when the amplitude of disturbance reaches a certain level. In this study, an improved algorithm for solving NPSE is developed. In this algorithm, the mean flow distortion is included into the linear operator instead of into the nonlinear forcing terms in NPSE. An under-relaxation factor for computing the nonlinear terms is introduced during the iteration process to guarantee the robustness of the algorithm. Two case studies, the nonlinear development of stationary crossflow vortices and the fundamental resonance of the second mode disturbance in hypersonic boundary layers, are presented to validate the proposed algorithm for NPSE. Results from direct numerical simulation (DNS) are regarded as the baseline for comparison. Good agreement can be found between the proposed algorithm and DNS, which indicates the great potential of the proposed method on studying the crossflow and streamwise instability in hypersonic boundary layers. (paper)

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

International Nuclear Information System (INIS)

Niederle, J.

1984-01-01

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

Approximate analytical methods for solving ordinary differential equations

CERN Document Server

Radhika, TSL; Rani, T Raja

2015-01-01

Approximate Analytical Methods for Solving Ordinary Differential Equations (ODEs) is the first book to present all of the available approximate methods for solving ODEs, eliminating the need to wade through multiple books and articles. It covers both well-established techniques and recently developed procedures, including the classical series solution method, diverse perturbation methods, pioneering asymptotic methods, and the latest homotopy methods.The book is suitable not only for mathematicians and engineers but also for biologists, physicists, and economists. It gives a complete descripti

LOCFES-B: Solving the one-dimensional transport equation with user-selected spatial approximations

International Nuclear Information System (INIS)

Jarvis, R.D.; Nelson, P.

1993-01-01

Closed linear one-cell functional (CLOF) methods constitute an abstractly defined class of spatial approximations to the one-dimensional discrete ordinates equations of linear particle transport that encompass, as specific instances, the vast majority of the spatial approximations that have been either used or suggested in the computational solution of these equations. A specific instance of the class of CLOF methods is defined by a (typically small) number of functions of the cell width, total cross section, and direction cosine of particle motion. The LOCFES code takes advantage of the latter observation by permitting the use, within a more-or-less standard source iteration solution process, of an arbitrary CLOF method as defined by a user-supplied subroutine. The design objective of LOCFES was to provide automated determination of the order of accuracy (i.e., order of the discretization error) in the fine-mesh limit for an arbitrary user-selected CLOF method. This asymptotic order of accuracy is one widely used measure of the merit of a spatial approximation. This paper discusses LOCFES-B, which is a code that uses methods developed in LOCFES to solve one-dimensional linear particle transport problems with any user-selected CLOF method. LOCFES-B provides automatic solution of a given problem to within an accuracy specified by user input and provides comparison of the computational results against results from externally provided benchmark results

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

Science.gov (United States)

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.

Normal scheme for solving the transport equation independently of spatial discretization

International Nuclear Information System (INIS)

Zamonsky, O.M.

1993-01-01

To solve the discrete ordinates neutron transport equation, a general order nodal scheme is used, where nodes are allowed to have different orders of approximation and the whole system reaches a final order distribution. Independence in the election of system discretization and order of approximation is obtained without loss of accuracy. The final equations and the iterative method to reach a converged order solution were implemented in a two-dimensional computer code to solve monoenergetic, isotropic scattering, external source problems. Two benchmark problems were solved using different automatic selection order methods. Results show accurate solutions without spatial discretization, regardless of the initial selection of distribution order. (author)

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

Energy Technology Data Exchange (ETDEWEB)

Bailey, Teresa S. [Texas A and M University, Department of Nuclear Engineering, College Station, TX 77843-3133 (United States)], E-mail: baileyte@tamu.edu; Adams, Marvin L. [Texas A and M University, Department of Nuclear Engineering, College Station, TX 77843-3133 (United States)], E-mail: mladams@tamu.edu; Yang, Brian [Lawrence Livermore National Laboratory, Livermore, CA 94551 (United States); Zika, Michael R. [Lawrence Livermore National Laboratory, Livermore, CA 94551 (United States)], E-mail: zika@llnl.gov

2008-04-01

We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses recently introduced piecewise linear weight and basis functions in the finite element approximation and it can be applied on arbitrary polygonal (2D) or polyhedral (3D) grids. We first demonstrate some analytical properties of the PWL method and perform a simple mode analysis to compare the PWL method with Palmer's vertex-centered finite-volume method and with a bilinear continuous finite element method. We then show that this new PWL method gives solutions comparable to those from Palmer's. However, since the PWL method produces a symmetric positive-definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids.

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

International Nuclear Information System (INIS)

Bailey, Teresa S.; Adams, Marvin L.; Yang, Brian; Zika, Michael R.

2008-01-01

We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses recently introduced piecewise linear weight and basis functions in the finite element approximation and it can be applied on arbitrary polygonal (2D) or polyhedral (3D) grids. We first demonstrate some analytical properties of the PWL method and perform a simple mode analysis to compare the PWL method with Palmer's vertex-centered finite-volume method and with a bilinear continuous finite element method. We then show that this new PWL method gives solutions comparable to those from Palmer's. However, since the PWL method produces a symmetric positive-definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids

Invariant imbedding equations for linear scattering problems

International Nuclear Information System (INIS)

Apresyan, L.

1988-01-01

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

Sufficient Descent Conjugate Gradient Methods for Solving Convex Constrained Nonlinear Monotone Equations

Directory of Open Access Journals (Sweden)

San-Yang Liu

2014-01-01

Full Text Available Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.

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

Science.gov (United States)

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.

A predictor-corrector scheme for solving the Volterra integral equation

KAUST Repository

Al Jarro, Ahmed

2011-08-01

The occurrence of late time instabilities is a common problem of almost all time marching methods developed for solving time domain integral equations. Implicit marching algorithms are now considered stable with various efforts that have been developed for removing low and high frequency instabilities. On the other hand, literature on stabilizing explicit schemes, which might be considered more efficient since they do not require a matrix inversion at each time step, is practically non-existent. In this work, a stable but still explicit predictor-corrector scheme is proposed for solving the Volterra integral equation and its efficacy is verified numerically. © 2011 IEEE.

Linear Einstein equations and Kerr-Schild maps

International Nuclear Information System (INIS)

Gergely, Laszlo A

2002-01-01

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

Solving Fuzzy Fractional Differential Equations Using Zadeh's Extension Principle

Science.gov (United States)

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

A method of solving simple harmonic oscillator Schroedinger equation

Science.gov (United States)

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.

Non-linear wave equations:Mathematical techniques

International Nuclear Information System (INIS)

1978-01-01

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

Diffusion-accelerated solution of the 2-D x-y Sn equations with linear-bilinear nodal differencing

International Nuclear Information System (INIS)

Wareing, T.A.; Walters, W.F.; Morel, J.E.

1994-01-01

Recently a new diffusion-synthetic acceleration scheme was developed for solving the 2-D S n Equations in x-y geometry with bilinear-discontinuous finite element spatial discretization using a bilinear-discontinuous diffusion differencing scheme for the diffusion acceleration equations. This method differs from previous methods in that it is conditional efficient for problems with isotropic or nearly isotropic scattering. We have used the same bilinear-discontinuous diffusion scheme, and associated solution technique, to accelerate the x-y geometry S n equations with linear-bilinear nodal spatial differencing. We find that this leads to an unconditionally efficient solution method for problems with isotropic or nearly isotropic scattering. computational results are given which demonstrate this property

Solutions of First-Order Volterra Type Linear Integrodifferential Equations by Collocation Method

Directory of Open Access Journals (Sweden)

Olumuyiwa A. Agbolade

2017-01-01

Full Text Available The numerical solutions of linear integrodifferential equations of Volterra type have been considered. Power series is used as the basis polynomial to approximate the solution of the problem. Furthermore, standard and Chebyshev-Gauss-Lobatto collocation points were, respectively, chosen to collocate the approximate solution. Numerical experiments are performed on some sample problems already solved by homotopy analysis method and finite difference methods. Comparison of the absolute error is obtained from the present method and those from aforementioned methods. It is also observed that the absolute errors obtained are very low establishing convergence and computational efficiency.

Reproducing kernel method with Taylor expansion for linear Volterra integro-differential equations

Directory of Open Access Journals (Sweden)

Azizallah Alvandi

2017-06-01

Full Text Available This research aims of the present a new and single algorithm for linear integro-differential equations (LIDE. To apply the reproducing Hilbert kernel method, there is made an equivalent transformation by using Taylor series for solving LIDEs. Shown in series form is the analytical solution in the reproducing kernel space and the approximate solution $ u_{N} $ is constructed by truncating the series to $ N $ terms. It is easy to prove the convergence of $ u_{N} $ to the analytical solution. The numerical solutions from the proposed method indicate that this approach can be implemented easily which shows attractive features.

Solving PDEs in Python the FEniCS tutorial I

CERN Document Server

Langtangen, Hans Petter

2016-01-01

This book offers a concise and gentle introduction to finite element programming in Python based on the popular FEniCS software library. Using a series of examples, including the Poisson equation, the equations of linear elasticity, the incompressible Navier–Stokes equations, and systems of nonlinear advection–diffusion–reaction equations, it guides readers through the essential steps to quickly solving a PDE in FEniCS, such as how to define a finite variational problem, how to set boundary conditions, how to solve linear and nonlinear systems, and how to visualize solutions and structure finite element Python programs. This book is open access under a CC BY license.

Using Computer Symbolic Algebra to Solve Differential Equations.

Science.gov (United States)

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)

Linear and non-linear calculations of the hose instability in the ion-focused regime

International Nuclear Information System (INIS)

Buchanan, H.L.

1982-01-01

A simple model is adopted to study the hose instability of an intense relativistic electron beam in a partially neutralized, low density ion channel (ion focused regime). Equations of motion for the beam and the channel are derived and linearized to obtain an approximate dispersion relation. The non-linear equations of motion are then solved numerically and the results compared to linearized data

Nonlinear recurrent neural networks for finite-time solution of general time-varying linear matrix equations.

Science.gov (United States)

Xiao, Lin; Liao, Bolin; Li, Shuai; Chen, Ke

2018-02-01

In order to solve general time-varying linear matrix equations (LMEs) more efficiently, this paper proposes two nonlinear recurrent neural networks based on two nonlinear activation functions. According to Lyapunov theory, such two nonlinear recurrent neural networks are proved to be convergent within finite-time. Besides, by solving differential equation, the upper bounds of the finite convergence time are determined analytically. Compared with existing recurrent neural networks, the proposed two nonlinear recurrent neural networks have a better convergence property (i.e., the upper bound is lower), and thus the accurate solutions of general time-varying LMEs can be obtained with less time. At last, various different situations have been considered by setting different coefficient matrices of general time-varying LMEs and a great variety of computer simulations (including the application to robot manipulators) have been conducted to validate the better finite-time convergence of the proposed two nonlinear recurrent neural networks. Copyright © 2017 Elsevier Ltd. All rights reserved.

Dynamical symmetries of semi-linear Schrodinger and diffusion equations

International Nuclear Information System (INIS)

Stoimenov, Stoimen; Henkel, Malte

2005-01-01

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

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

Science.gov (United States)

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.

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

NARCIS (Netherlands)

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

2012-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

Introduction to linear systems of differential equations

CERN Document Server

Adrianova, L Ya

1995-01-01

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

Solving Eigenvalue response matrix equations with Jacobian-Free Newton-Krylov methods

International Nuclear Information System (INIS)

Roberts, Jeremy A.; Forget, Benoit

2011-01-01

The response matrix method for reactor eigenvalue problems is motivated as a technique for solving coarse mesh transport equations, and the classical approach of power iteration (PI) for solution is described. The method is then reformulated as a nonlinear system of equations, and the associated Jacobian is derived. A Jacobian-Free Newton-Krylov (JFNK) method is employed to solve the system, using an approximate Jacobian coupled with incomplete factorization as a preconditioner. The unpreconditioned JFNK slightly outperforms PI, and preconditioned JFNK outperforms both PI and Steffensen-accelerated PI significantly. (author)

Taylor's series method for solving the nonlinear point kinetics equations

International Nuclear Information System (INIS)

Nahla, Abdallah A.

2011-01-01

Highlights: → Taylor's series method for nonlinear point kinetics equations is applied. → The general order of derivatives are derived for this system. → Stability of Taylor's series method is studied. → Taylor's series method is A-stable for negative reactivity. → Taylor's series method is an accurate computational technique. - Abstract: Taylor's series method for solving the point reactor kinetics equations with multi-group of delayed neutrons in the presence of Newtonian temperature feedback reactivity is applied and programmed by FORTRAN. This system is the couples of the stiff nonlinear ordinary differential equations. This numerical method is based on the different order derivatives of the neutron density, the precursor concentrations of i-group of delayed neutrons and the reactivity. The r th order of derivatives are derived. The stability of Taylor's series method is discussed. Three sets of applications: step, ramp and temperature feedback reactivities are computed. Taylor's series method is an accurate computational technique and stable for negative step, negative ramp and temperature feedback reactivities. This method is useful than the traditional methods for solving the nonlinear point kinetics equations.

Galerkin projection methods for solving multiple related linear systems

Energy Technology Data Exchange (ETDEWEB)

Chan, T.F.; Ng, M.; Wan, W.L.

1996-12-31

We consider using Galerkin projection methods for solving multiple related linear systems A{sup (i)}x{sup (i)} = b{sup (i)} for 1 {le} i {le} s, where A{sup (i)} and b{sup (i)} are different in general. We start with the special case where A{sup (i)} = A and A is symmetric positive definite. The method generates a Krylov subspace from a set of direction vectors obtained by solving one of the systems, called the seed system, by the CG method and then projects the residuals of other systems orthogonally onto the generated Krylov subspace to get the approximate solutions. The whole process is repeated with another unsolved system as a seed until all the systems are solved. We observe in practice a super-convergence behaviour of the CG process of the seed system when compared with the usual CG process. We also observe that only a small number of restarts is required to solve all the systems if the right-hand sides are close to each other. These two features together make the method particularly effective. In this talk, we give theoretical proof to justify these observations. Furthermore, we combine the advantages of this method and the block CG method and propose a block extension of this single seed method. The above procedure can actually be modified for solving multiple linear systems A{sup (i)}x{sup (i)} = b{sup (i)}, where A{sup (i)} are now different. We can also extend the previous analytical results to this more general case. Applications of this method to multiple related linear systems arising from image restoration and recursive least squares computations are considered as examples.

GLOBAL LINEARIZATION OF DIFFERENTIAL EQUATIONS WITH SPECIAL STRUCTURES

Institute of Scientific and Technical Information of China (English)

无

2011-01-01

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

Geometric Insight into Scalar Combination of Linear Equations

Indian Academy of Sciences (India)

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

A logic circuit for solving linear function by digital method

International Nuclear Information System (INIS)

Ma Yonghe

1986-01-01

A mathematical method for determining the linear relation of physical quantity with rediation intensity is described. A logic circuit has been designed for solving linear function by digital method. Some applications and the circuit function are discussed

Multivariate Padé Approximation for Solving Nonlinear Partial Differential Equations of Fractional Order

Directory of Open Access Journals (Sweden)

Veyis Turut

2013-01-01

Full Text Available Two tecHniques were implemented, the Adomian decomposition method (ADM and multivariate Padé approximation (MPA, for solving nonlinear partial differential equations of fractional order. The fractional derivatives are described in Caputo sense. First, the fractional differential equation has been solved and converted to power series by Adomian decomposition method (ADM, then power series solution of fractional differential equation was put into multivariate Padé series. Finally, numerical results were compared and presented in tables and figures.

Improved algorithm for solving nonlinear parabolized stability equations

Science.gov (United States)

Zhao, Lei; Zhang, Cun-bo; Liu, Jian-xin; Luo, Ji-sheng

2016-08-01

Due to its high computational efficiency and ability to consider nonparallel and nonlinear effects, nonlinear parabolized stability equations (NPSE) approach has been widely used to study the stability and transition mechanisms. However, it often diverges in hypersonic boundary layers when the amplitude of disturbance reaches a certain level. In this study, an improved algorithm for solving NPSE is developed. In this algorithm, the mean flow distortion is included into the linear operator instead of into the nonlinear forcing terms in NPSE. An under-relaxation factor for computing the nonlinear terms is introduced during the iteration process to guarantee the robustness of the algorithm. Two case studies, the nonlinear development of stationary crossflow vortices and the fundamental resonance of the second mode disturbance in hypersonic boundary layers, are presented to validate the proposed algorithm for NPSE. Results from direct numerical simulation (DNS) are regarded as the baseline for comparison. Good agreement can be found between the proposed algorithm and DNS, which indicates the great potential of the proposed method on studying the crossflow and streamwise instability in hypersonic boundary layers. Project supported by the National Natural Science Foundation of China (Grant Nos. 11332007 and 11402167).

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

International Nuclear Information System (INIS)

Kovalyov, Mikhail

2010-01-01

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

Solving the discrete KdV equation with homotopy analysis method

International Nuclear Information System (INIS)

Zou, L.; Zong, Z.; Wang, Z.; He, L.

2007-01-01

In this Letter, we apply the homotopy analysis method to differential-difference equations. We take the discrete KdV equation as an example, and successfully obtain double periodic wave solutions and solitary wave solutions. It illustrates the validity and the great potential of the homotopy analysis method in solving discrete KdV equation. Comparisons are made between the results of the proposed method and exact solutions. The results reveal that the proposed method is very effective and convenient

Emmy Noether and Linear Evolution Equations

Directory of Open Access Journals (Sweden)

P. G. L. Leach

2013-01-01

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

Construction of a Roe linearization for the ideal MHD equations

International Nuclear Information System (INIS)

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

1996-01-01

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

Variational linear algebraic equations method

International Nuclear Information System (INIS)

Moiseiwitsch, B.L.

1982-01-01

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

Numerical solution of distributed order fractional differential equations

Science.gov (United States)

Katsikadelis, John T.

2014-02-01

In this paper a method for the numerical solution of distributed order FDEs (fractional differential equations) of a general form is presented. The method applies to both linear and nonlinear equations. The Caputo type fractional derivative is employed. The distributed order FDE is approximated with a multi-term FDE, which is then solved by adjusting appropriately the numerical method developed for multi-term FDEs by Katsikadelis. Several example equations are solved and the response of mechanical systems described by such equations is studied. The convergence and the accuracy of the method for linear and nonlinear equations are demonstrated through well corroborated numerical results.

Rational approximations to solutions of linear differential equations.

Science.gov (United States)

Chudnovsky, D V; Chudnovsky, G V

1983-08-01

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

Fast numerical method for solving the three-dimensional Stokes' equations in the presence of suspended particles

International Nuclear Information System (INIS)

Fogelson, A.L.; Peskin, C.S.

1988-01-01

A new fast numerical method for solving the three-dimensional Stokes' equations in the presence of suspended particles is presented. The fluid dynamics equations are solved on a lattice. A particle is represented by a set of points each of which moves at the local fluid velocity and is not constrained to lie on the lattice. These points are coupled by forces which resist deformation of the particle. These forces contribute to the force density in the Stokes' equations. As a result, a single set of fluid dynamics equations holds at all points of the domain and there are no internal boundaries. Particles size, shape, and deformability may be prescribed. Computational work increases only linearly with the number of particles, so large numbers (500--1000) of particles may be studied efficiently. The numerical method involves implicit calculation of the particle forces by minimizing an energy function and solution of a finite-difference approximation to the Stokes' equations using the Fourier--Toeplitz method. The numerical method has been implemented to run on all CRAY computers: the implementation exploits the CRAY's vectorized arithmetic, and on machines with insufficient central memory, it performs efficient disk I/O while storing most of the data on disk. Applications of the method to sedimentation of one-, two-, and many-particle systems are described. Trajectories and settling speeds for two-particle sedimentation, and settling speed for multiparticle sedimentation from initial distributions on a cubic lattice or at random give good quantitative agreement with existing theories. copyright 1988 Academic Press, Inc

Stabilized linear semi-implicit schemes for the nonlocal Cahn-Hilliard equation

Science.gov (United States)

Du, Qiang; Ju, Lili; Li, Xiao; Qiao, Zhonghua

2018-06-01

Comparing with the well-known classic Cahn-Hilliard equation, the nonlocal Cahn-Hilliard equation is equipped with a nonlocal diffusion operator and can describe more practical phenomena for modeling phase transitions of microstructures in materials. On the other hand, it evidently brings more computational costs in numerical simulations, thus efficient and accurate time integration schemes are highly desired. In this paper, we propose two energy-stable linear semi-implicit methods with first and second order temporal accuracies respectively for solving the nonlocal Cahn-Hilliard equation. The temporal discretization is done by using the stabilization technique with the nonlocal diffusion term treated implicitly, while the spatial discretization is carried out by the Fourier collocation method with FFT-based fast implementations. The energy stabilities are rigorously established for both methods in the fully discrete sense. Numerical experiments are conducted for a typical case involving Gaussian kernels. We test the temporal convergence rates of the proposed schemes and make a comparison of the nonlocal phase transition process with the corresponding local one. In addition, long-time simulations of the coarsening dynamics are also performed to predict the power law of the energy decay.

A linear programming manual

Science.gov (United States)

Tuey, R. C.

1972-01-01

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

Splitting Method for Solving the Coarse-Mesh Discretized Low-Order Quasi-Diffusion Equations

International Nuclear Information System (INIS)

Hiruta, Hikaru; Anistratov, Dmitriy Y.; Adams, Marvin L.

2005-01-01

In this paper, the development is presented of a splitting method that can efficiently solve coarse-mesh discretized low-order quasi-diffusion (LOQD) equations. The LOQD problem can reproduce exactly the transport scalar flux and current. To solve the LOQD equations efficiently, a splitting method is proposed. The presented method splits the LOQD problem into two parts: (a) the D problem that captures a significant part of the transport solution in the central parts of assemblies and can be reduced to a diffusion-type equation and (b) the Q problem that accounts for the complicated behavior of the transport solution near assembly boundaries. Independent coarse-mesh discretizations are applied: the D problem equations are approximated by means of a finite element method, whereas the Q problem equations are discretized using a finite volume method. Numerical results demonstrate the efficiency of the methodology presented. This methodology can be used to modify existing diffusion codes for full-core calculations (which already solve a version of the D problem) to account for transport effects

Hyperbolicity and constrained evolution in linearized gravity

International Nuclear Information System (INIS)

Matzner, Richard A.

2005-01-01

Solving the 4-d Einstein equations as evolution in time requires solving equations of two types: the four elliptic initial data (constraint) equations, followed by the six second order evolution equations. Analytically the constraint equations remain solved under the action of the evolution, and one approach is to simply monitor them (unconstrained evolution). Since computational solution of differential equations introduces almost inevitable errors, it is clearly 'more correct' to introduce a scheme which actively maintains the constraints by solution (constrained evolution). This has shown promise in computational settings, but the analysis of the resulting mixed elliptic hyperbolic method has not been completely carried out. We present such an analysis for one method of constrained evolution, applied to a simple vacuum system, linearized gravitational waves. We begin with a study of the hyperbolicity of the unconstrained Einstein equations. (Because the study of hyperbolicity deals only with the highest derivative order in the equations, linearization loses no essential details.) We then give explicit analytical construction of the effect of initial data setting and constrained evolution for linearized gravitational waves. While this is clearly a toy model with regard to constrained evolution, certain interesting features are found which have relevance to the full nonlinear Einstein equations

A highly accurate method to solve Fisher's equation

Indian Academy of Sciences (India)

The solution of the Helmholtz equation was approximated by a sixth-order compact finite difference. (CFD6) method in [29]. In [30], a CFD6 scheme has been presented to ... efficiency of the proposed method are reported in §3. Finally .... our discussion, one can apply the proposed method to solve the more general problem.

Analytical solutions of time-fractional models for homogeneous Gardner equation and non-homogeneous differential equations

Directory of Open Access Journals (Sweden)

Olaniyi Samuel Iyiola

2014-09-01

Full Text Available In this paper, we obtain analytical solutions of homogeneous time-fractional Gardner equation and non-homogeneous time-fractional models (including Buck-master equation using q-Homotopy Analysis Method (q-HAM. Our work displays the elegant nature of the application of q-HAM not only to solve homogeneous non-linear fractional differential equations but also to solve the non-homogeneous fractional differential equations. The presence of the auxiliary parameter h helps in an effective way to obtain better approximation comparable to exact solutions. The fraction-factor in this method gives it an edge over other existing analytical methods for non-linear differential equations. Comparisons are made upon the existence of exact solutions to these models. The analysis shows that our analytical solutions converge very rapidly to the exact solutions.

Asymptotic properties for half-linear difference equations

Czech Academy of Sciences Publication Activity Database

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

2006-01-01

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

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

Science.gov (United States)

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.

Polynomial approach method to solve the neutron point kinetics equations with use of the analytic continuation

Energy Technology Data Exchange (ETDEWEB)

Tumelero, Fernanda; Petersen, Claudio Zen; Goncalves, Glenio Aguiar [Universidade Federal de Pelotas, Capao do Leao, RS (Brazil). Programa de Pos Graduacao em Modelagem Matematica; Schramm, Marcelo [Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica

2016-12-15

In this work, we report a solution to solve the Neutron Point Kinetics Equations applying the Polynomial Approach Method. The main idea is to expand the neutron density and delayed neutron precursors as a power series considering the reactivity as an arbitrary function of the time in a relatively short time interval around an ordinary point. In the first interval one applies the initial conditions and the analytical continuation is used to determine the solutions of the next intervals. A genuine error control is developed based on an analogy with the Rest Theorem. For illustration, we also report simulations for different approaches types (linear, quadratic and cubic). The results obtained by numerical simulations for linear approximation are compared with results in the literature.

New method for solving three-dimensional Schroedinger equation

International Nuclear Information System (INIS)

Melezhik, V.S.

1990-01-01

The method derived recently for solving a multidimensional scattering problem is applied to a three-dimensional Schroedinger equation. As compared with direct three-dimensional calculations of finite elements and finite differences, this approach gives sufficiently accurate upper and lower approximations to the helium-atom binding energy, which demonstrates its efficiency. 15 refs.; 1 fig.; 2 tabs

Reproducing Kernel Method for Solving Nonlinear Differential-Difference Equations

Directory of Open Access Journals (Sweden)

Reza Mokhtari

2012-01-01

Full Text Available On the basis of reproducing kernel Hilbert spaces theory, an iterative algorithm for solving some nonlinear differential-difference equations (NDDEs is presented. The analytical solution is shown in a series form in a reproducing kernel space, and the approximate solution , is constructed by truncating the series to terms. The convergence of , to the analytical solution is also proved. Results obtained by the proposed method imply that it can be considered as a simple and accurate method for solving such differential-difference problems.

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

Science.gov (United States)

Chen, Haiwen; Holland, Paul

2010-01-01

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

Development of GPU Based Parallel Computing Module for Solving Pressure Equation in the CUPID Component Thermo-Fluid Analysis Code

International Nuclear Information System (INIS)

Lee, Jin Pyo; Joo, Han Gyu

2010-01-01

In the thermo-fluid analysis code named CUPID, the linear system of pressure equations must be solved in each iteration step. The time for repeatedly solving the linear system can be quite significant because large sparse matrices of Rank more than 50,000 are involved and the diagonal dominance of the system is hardly hold. Therefore parallelization of the linear system solver is essential to reduce the computing time. Meanwhile, Graphics Processing Units (GPU) have been developed as highly parallel, multi-core processors for the global demand of high quality 3D graphics. If a suitable interface is provided, parallelization using GPU can be available to engineering computing. NVIDIA provides a Software Development Kit(SDK) named CUDA(Compute Unified Device Architecture) to code developers so that they can manage GPUs for parallelization using the C language. In this research, we implement parallel routines for the linear system solver using CUDA, and examine the performance of the parallelization. In the next section, we will describe the method of CUDA parallelization for the CUPID code, and then the performance of the CUDA parallelization will be discussed

Isotope decay equations solved by means of a recursive method

International Nuclear Information System (INIS)

Grant, Carlos

2009-01-01

The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)

Periodic feedback stabilization for linear periodic evolution equations

CERN Document Server

Wang, Gengsheng

2016-01-01

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

Analyses of glass transition phenomena by solving differential equation with delay effect

International Nuclear Information System (INIS)

Takeuchi, A.; Inoue, A.

2007-01-01

A linear differential equation for the analyses of glass transition phenomena has been proposed by taking into account the delay effect due to the change in transportation of atoms near the glass transition temperature (T g ). Under the condition maintaining the order of the differential equation as the second, the non-linear differential equation proposed by Van Den Beukel and Sietsma is modified to obtain the analytic solution for a linear equation by introducing the following points: the delay effect which is described with a term of Mackey-Glass model, a concept of effective free volume (x fe eff ) and its concentration expression (C fe eff ) which correspond to the equilibrium, and an additional term associated with C fe eff . In analyzing the linear equation, Doyle's p-function was used for the integral of reaction rate with respect to temperature (T). It is found that the linear equation proposed in the present study can describe the changes in free volume (x) with increasing temperature in the dx/dT-T chart, the sharp increase in free volume at T g , and over shooting phenomena of free volume slightly above the T g , as experimentally in thermal analyses for metallic glasses. The linear solution obtained in the present study is of great importance for the analyses of the glass transition because the change in free volume with increasing temperature on heating is described with fundamental functions

Direct method of solving finite difference nonlinear equations for multicomponent diffusion in a gas centrifuge

International Nuclear Information System (INIS)

Potemki, Valeri G.; Borisevich, Valentine D.; Yupatov, Sergei V.

1996-01-01

This paper describes the the next evolution step in development of the direct method for solving systems of Nonlinear Algebraic Equations (SNAE). These equations arise from the finite difference approximation of original nonlinear partial differential equations (PDE). This method has been extended on the SNAE with three variables. The solving SNAE bases on Reiterating General Singular Value Decomposition of rectangular matrix pencils (RGSVD-algorithm). In contrast to the computer algebra algorithm in integer arithmetic based on the reduction to the Groebner's basis that algorithm is working in floating point arithmetic and realizes the reduction to the Kronecker's form. The possibilities of the method are illustrated on the example of solving the one-dimensional diffusion equation for 3-component model isotope mixture in a ga centrifuge. The implicit scheme for the finite difference equations without simplifying the nonlinear properties of the original equations is realized. The technique offered provides convergence to the solution for the single run. The Toolbox SNAE is developed in the framework of the high performance numeric computation and visualization software MATLAB. It includes more than 30 modules in MATLAB language for solving SNAE with two and three variables. (author)

Representation of Students in Solving Simultaneous Linear Equation Problems Based on Multiple Intelligence

Science.gov (United States)

Yanti, Y. R.; Amin, S. M.; Sulaiman, R.

2018-01-01

This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.

Solving Nonlinear Partial Differential Equations with Maple and Mathematica

CERN Document Server

Shingareva, Inna K

2011-01-01

The emphasis of the book is given in how to construct different types of solutions (exact, approximate analytical, numerical, graphical) of numerous nonlinear PDEs correctly, easily, and quickly. The reader can learn a wide variety of techniques and solve numerous nonlinear PDEs included and many other differential equations, simplifying and transforming the equations and solutions, arbitrary functions and parameters, presented in the book). Numerous comparisons and relationships between various types of solutions, different methods and approaches are provided, the results obtained in Maple an

Solving nonlinear evolution equation system using two different methods

Science.gov (United States)

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.

Effective methods of solving of model equations of certain class of thermal systems

International Nuclear Information System (INIS)

Lach, J.

1985-01-01

A number of topics connected with solving of model equations of certain class of thermal systems by the method of successive approximations is touched. A system of partial differential equations of the first degree, appearing most frequently in practical applications of heat and mass transfer theory is reduced to an equivalent system of Volterra integral equations of the second kind. Among a few sample applications the thermal processes appearing in the fuel channel of nuclear reactor are solved. The theoretical analysis is illustrated by the results of numerical calculations given in tables and diagrams. 111 refs., 17 figs., 16 tabs. (author)

The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.

Science.gov (United States)

Narayanamoorthy, S; Kalyani, S

2015-01-01

An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

PRECONDITIONED CONJUGATE-GRADIENT 2 (PCG2), a computer program for solving ground-water flow equations

Science.gov (United States)

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.

Infinite sets of conservation laws for linear and nonlinear field equations

International Nuclear Information System (INIS)

Mickelsson, J.

1984-01-01

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

Nonlinear evolution equations and solving algebraic systems: the importance of computer algebra

International Nuclear Information System (INIS)

Gerdt, V.P.; Kostov, N.A.

1989-01-01

In the present paper we study the application of computer algebra to solve the nonlinear polynomial systems which arise in investigation of nonlinear evolution equations. We consider several systems which are obtained in classification of integrable nonlinear evolution equations with uniform rank. Other polynomial systems are related with the finding of algebraic curves for finite-gap elliptic potentials of Lame type and generalizations. All systems under consideration are solved using the method based on construction of the Groebner basis for corresponding polynomial ideals. The computations have been carried out using computer algebra systems. 20 refs

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

Science.gov (United States)

Chen, Haiwen

2012-01-01

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

B-splines and Faddeev equations

International Nuclear Information System (INIS)

Huizing, A.J.

1990-01-01

Two numerical methods for solving the three-body equations describing relativistic pion deuteron scattering have been investigated. For separable two body interactions these equations form a set of coupled one-dimensional integral equations. They are plagued by singularities which occur in the kernel of the integral equations as well as in the solution. The methods to solve these equations differ in the way they treat the singularities. First the Fuda-Stuivenberg method is discussed. The basic idea of this method is an one time iteration of the set of integral equations to treat the logarithmic singularities. In the second method, the spline method, the unknown solution is approximated by splines. Cubic splines have been used with cubic B-splines as basis. If the solution is approximated by a linear combination of basis functions, an integral equation can be transformed into a set of linear equations for the expansion coefficients. This set of linear equations is solved by standard means. Splines are determined by points called knots. A proper choice of splines to approach the solution stands for a proper choice of the knots. The solution of the three-body scattering equations has a square root behaviour at a certain point. Hence it was investigated how the knots should be chosen to approximate the square root function by cubic B-splines in an optimal way. Before applying this method to solve numerically the three-body equations describing pion-deuteron scattering, an analytically solvable example has been constructed with a singularity structure of both kernel and solution comparable to those of the three-body equations. The accuracy of the numerical solution was determined to a large extent by the accuracy of the approximation of the square root part. The results for a pion laboratory energy of 47.4 MeV agree very well with those from literature. In a complete calculation for 47.7 MeV the spline method turned out to be a factor thousand faster than the Fuda

Dual exponential polynomials and linear differential equations

Science.gov (United States)

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

2018-01-01

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

Solving Partial Differential Equations Using a New Differential Evolution Algorithm

Directory of Open Access Journals (Sweden)

Natee Panagant

2014-01-01

Full Text Available This paper proposes an alternative meshless approach to solve partial differential equations (PDEs. With a global approximate function being defined, a partial differential equation problem is converted into an optimisation problem with equality constraints from PDE boundary conditions. An evolutionary algorithm (EA is employed to search for the optimum solution. For this approach, the most difficult task is the low convergence rate of EA which consequently results in poor PDE solution approximation. However, its attractiveness remains due to the nature of a soft computing technique in EA. The algorithm can be used to tackle almost any kind of optimisation problem with simple evolutionary operation, which means it is mathematically simpler to use. A new efficient differential evolution (DE is presented and used to solve a number of the partial differential equations. The results obtained are illustrated and compared with exact solutions. It is shown that the proposed method has a potential to be a future meshless tool provided that the search performance of EA is greatly enhanced.

Perceptual support promotes strategy generation: Evidence from equation solving.

Science.gov (United States)

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.

Development of a set of benchmark problems to verify numerical methods for solving burnup equations

International Nuclear Information System (INIS)

Lago, Daniel; Rahnema, Farzad

2017-01-01

Highlights: • Description transmutation chain benchmark problems. • Problems for validating numerical methods for solving burnup equations. • Analytical solutions for the burnup equations. • Numerical solutions for the burnup equations. - Abstract: A comprehensive set of transmutation chain benchmark problems for numerically validating methods for solving burnup equations was created. These benchmark problems were designed to challenge both traditional and modern numerical methods used to solve the complex set of ordinary differential equations used for tracking the change in nuclide concentrations over time due to nuclear phenomena. Given the development of most burnup solvers is done for the purpose of coupling with an established transport solution method, these problems provide a useful resource in testing and validating the burnup equation solver before coupling for use in a lattice or core depletion code. All the relevant parameters for each benchmark problem are described. Results are also provided in the form of reference solutions generated by the Mathematica tool, as well as additional numerical results from MATLAB.

Exact non-linear equations for cosmological perturbations

Energy Technology Data Exchange (ETDEWEB)

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

2017-10-01

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

The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem

Directory of Open Access Journals (Sweden)

S. Narayanamoorthy

2015-01-01

Full Text Available An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

Augmented Lagrangian methods to solve Navier-Stokes equations for a Bingham fluid flow

International Nuclear Information System (INIS)

Boscardin, Laetitia

1999-01-01

The objective of this research thesis is to develop one or more methods for the numerical resolution of equations of movement obtained for a Bingham fluid. The resolution of Navier-Stokes equations is processed by splitting elliptic and hyperbolic operators (Galerkin transport). In this purpose, the author first studied the Stokes problem, and then addressed issues of stability and consistency of the global scheme. The variational formulation of the Stokes problem can be expressed under the form of a minimisation problem under the constraint of non linear and non differentiable functions. Then, the author proposes a discretization of the Stokes problem based on a hybrid finite element method. Then he extends the demonstrations of stability and consistency of the Galerkin-transport scheme which have been established for a Newtonian fluid, to the case of a Bingham fluid. A relaxation algorithm and a Newton-GMRES algorithm are developed to solve the problem, and their convergence is studied. To ensure this convergence, some constraints must be verified. In order to do so, a specific speed element has been developed [fr

A predictor-corrector scheme for solving the Volterra integral equation

KAUST Repository

Al Jarro, Ahmed; Bagci, Hakan

2011-01-01

The occurrence of late time instabilities is a common problem of almost all time marching methods developed for solving time domain integral equations. Implicit marching algorithms are now considered stable with various efforts that have been

A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems

Directory of Open Access Journals (Sweden)

Tunjo Perić

2014-12-01

Full Text Available This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.

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

Science.gov (United States)

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.

Solving the KPI wave equation with a moving adaptive FEM grid

Directory of Open Access Journals (Sweden)

Granville Sewell

2013-04-01

Full Text Available The Kadomtsev-Petviashvili I (KPI equation is the difficult nonlinear wave equation $U_{xt} + 6U_x^2 + 6UU_{xx} + U_{xxxx} = 3U_{yy}.$ We solve this equation using PDE2D (www.pde2d.com with initial conditions consisting of two lump solitons, which collide and reseparate. Since the solution has steep, moving, peaks, an adaptive finite element grid is used with a grading which moves with the peaks.

An Accurate Approximate-Analytical Technique for Solving Time-Fractional Partial Differential Equations

Directory of Open Access Journals (Sweden)

M. Bishehniasar

2017-01-01

Full Text Available The demand of many scientific areas for the usage of fractional partial differential equations (FPDEs to explain their real-world systems has been broadly identified. The solutions may portray dynamical behaviors of various particles such as chemicals and cells. The desire of obtaining approximate solutions to treat these equations aims to overcome the mathematical complexity of modeling the relevant phenomena in nature. This research proposes a promising approximate-analytical scheme that is an accurate technique for solving a variety of noninteger partial differential equations (PDEs. The proposed strategy is based on approximating the derivative of fractional-order and reducing the problem to the corresponding partial differential equation (PDE. Afterwards, the approximating PDE is solved by using a separation-variables technique. The method can be simply applied to nonhomogeneous problems and is proficient to diminish the span of computational cost as well as achieving an approximate-analytical solution that is in excellent concurrence with the exact solution of the original problem. In addition and to demonstrate the efficiency of the method, it compares with two finite difference methods including a nonstandard finite difference (NSFD method and standard finite difference (SFD technique, which are popular in the literature for solving engineering problems.

On choosing a nonlinear initial iterate for solving the 2-D 3-T heat conduction equations

International Nuclear Information System (INIS)

An Hengbin; Mo Zeyao; Xu Xiaowen; Liu Xu

2009-01-01

The 2-D 3-T heat conduction equations can be used to approximately describe the energy broadcast in materials and the energy swapping between electron and photon or ion. To solve the equations, a fully implicit finite volume scheme is often used as the discretization method. Because the energy diffusion and swapping coefficients have a strongly nonlinear dependence on the temperature, and some physical parameters are discontinuous across the interfaces between the materials, it is a challenge to solve the discretized nonlinear algebraic equations. Particularly, as time advances, the temperature varies so greatly in the front of energy that it is difficult to choose an effective initial iterate when the nonlinear algebraic equations are solved by an iterative method. In this paper, a method of choosing a nonlinear initial iterate is proposed for iterative solving this kind of nonlinear algebraic equations. Numerical results show the proposed initial iterate can improve the computational efficiency, and also the convergence behavior of the nonlinear iteration.

A method for solving the KDV equation and some numerical experiments

International Nuclear Information System (INIS)

Chang Jinjiang.

1993-01-01

In this paper, by means of difference method for discretization of space partial derivatives of KDV equation, an initial value problem in ordinary differential equations of large dimensions is produced. By using this ordinary differential equations the existence and the uniqueness of the solution of the KDV equation and the conservation of scheme are proved. This ordinary differential equation can be solved by using implicit Runge-Kutta methods, so a new method for finding the numerical solution of the KDV equation is presented. Numerical experiments not only describe in detail the procedure of two solitons collision, soliton reflex and soliton produce, but also show that this method is very effective. (author). 7 refs, 3 figs

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

Alvarez-Estrada, R.F.

1979-01-01

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

An efficient numerical technique for solving navier-stokes equations for rotating flows

International Nuclear Information System (INIS)

Haroon, T.; Shah, T.M.

2000-01-01

This paper simulates an industrial problem by solving compressible Navier-Stokes equations. The time-consuming tri-angularization process of a large-banded matrix, performed by memory economical Frontal Technique. This scheme successfully reduces the time for I/O operations even for as large as (40, 000 x 40, 000) matrix. Previously, this industrial problem can solved by using modified Newton's method with Gaussian elimination technique for the large matrix. In the present paper, the proposed Frontal Technique is successfully used, together with Newton's method, to solve compressible Navier-Stokes equations for rotating cylinders. By using the Frontal Technique, the method gives the solution within reasonably acceptance computational time. Results are compared with the earlier works done, and found computationally very efficient. Some features of the solution are reported here for the rotating machines. (author)

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

Science.gov (United States)

Savenije, Hubert H. G.

2018-03-01

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

Solving Fokker-Planck Equations on Cantor Sets Using Local Fractional Decomposition Method

Directory of Open Access Journals (Sweden)

Shao-Hong Yan

2014-01-01

Full Text Available The local fractional decomposition method is applied to approximate the solutions for Fokker-Planck equations on Cantor sets with local fractional derivative. The obtained results give the present method that is very effective and simple for solving the differential equations on Cantor set.

MPFA algorithm for solving stokes-brinkman equations on quadrilateral grids

KAUST Repository

Iliev, Oleg; Kirsch, Ralf; Lakdawala, Zahra; Printsypar, Galina

2014-01-01

This work is concerned with the development of a robust and accurate numerical method for solving the Stokes-Brinkman system of equations, which describes a free fluid flow coupled with a flow in porous media. Quadrilateral boundary fitted grid

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

International Nuclear Information System (INIS)

Bonalumi, Riccardo A.

1998-01-01

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

Intuitive physics knowledge, physics problem solving and the role of mathematical equations

Directory of Open Access Journals (Sweden)

Laura Buteler

2012-09-01

Full Text Available The present work explores the role that mathematical equations play in modifying students’ physical intuition (diSessa, 1993. The work is carried out assuming that students achieve a great deal of the refinement in their physical intuitions during problem solving (Sherin, 2006. The study is guided by the question of how the use of mathematical equations contributes to this refinement. The authors aim at expanding on Sherin´s (2006 hypothesis, suggesting a more bounding relation between physical intuitions and mathematics. In this scenario, intuitions play a more compelling role in “deciding” which equations are acceptable and which are not. Our hypothesis is constructed on the basis of three cases: the first published by Sherin (2006 and two more from registries of our own. The three cases are compared and analyzed in relation to the role of mathematical equations in refining – or not – the intuitive knowledge students bring to play during problem solving.

A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

KAUST Repository

Bagci, Hakan; Pasciak, Joseph E.; Sirenko, Kostyantyn

2014-01-01

We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

KAUST Repository

Bagci, Hakan

2014-11-11

We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

Existence and uniqueness to the Cauchy problem for linear and semilinear parabolic equations with local conditions⋆

Directory of Open Access Journals (Sweden)

Rubio Gerardo

2011-03-01

Full Text Available We consider the Cauchy problem in ℝd for a class of semilinear parabolic partial differential equations that arises in some stochastic control problems. We assume that the coefficients are unbounded and locally Lipschitz, not necessarily differentiable, with continuous data and local uniform ellipticity. We construct a classical solution by approximation with linear parabolic equations. The linear equations involved can not be solved with the traditional results. Therefore, we construct a classical solution to the linear Cauchy problem under the same hypotheses on the coefficients for the semilinear equation. Our approach is using stochastic differential equations and parabolic differential equations in bounded domains. Finally, we apply the results to a stochastic optimal consumption problem. Nous considérons le problème de Cauchy dans ℝd pour une classe d’équations aux dérivées partielles paraboliques semi linéaires qui se pose dans certains problèmes de contrôle stochastique. Nous supposons que les coefficients ne sont pas bornés et sont localement Lipschitziennes, pas nécessairement différentiables, avec des données continues et ellipticité local uniforme. Nous construisons une solution classique par approximation avec les équations paraboliques linéaires. Les équations linéaires impliquées ne peuvent être résolues avec les résultats traditionnels. Par conséquent, nous construisons une solution classique au problème de Cauchy linéaire sous les mêmes hypothèses sur les coefficients pour l’équation semi-linéaire. Notre approche utilise les équations différentielles stochastiques et les équations différentielles paraboliques dans les domaines bornés. Enfin, nous appliquons les résultats à un problème stochastique de consommation optimale.

The solution of linear and nonlinear systems of Volterra functional equations using Adomian-Pade technique

International Nuclear Information System (INIS)

Dehghan, Mehdi; Shakourifar, Mohammad; Hamidi, Asgar

2009-01-01

The purpose of this study is to implement Adomian-Pade (Modified Adomian-Pade) technique, which is a combination of Adomian decomposition method (Modified Adomian decomposition method) and Pade approximation, for solving linear and nonlinear systems of Volterra functional equations. The results obtained by using Adomian-Pade (Modified Adomian-Pade) technique, are compared to those obtained by using Adomian decomposition method (Modified Adomian decomposition method) alone. The numerical results, demonstrate that ADM-PADE (MADM-PADE) technique, gives the approximate solution with faster convergence rate and higher accuracy than using the standard ADM (MADM).

Aspects on increase and decrease within a national economy as eigenvalue problem of linear homogeneous equations

International Nuclear Information System (INIS)

Mueller, E.

2007-01-01

The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)

Aspects on increase and decrease within a national economy as eigenvalue problem of linear homogeneous equations

Energy Technology Data Exchange (ETDEWEB)

Mueller, E.

2007-12-15

The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)

Various Newton-type iterative methods for solving nonlinear equations

Directory of Open Access Journals (Sweden)

Manoj Kumar

2013-10-01

Full Text Available The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.

An efficient numerical method for solving the Boltzmann equation in multidimensions

Science.gov (United States)

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.

Monte Carlo method for solving a parabolic problem

Directory of Open Access Journals (Sweden)

Tian Yi

2016-01-01

Full Text Available In this paper, we present a numerical method based on random sampling for a parabolic problem. This method combines use of the Crank-Nicolson method and Monte Carlo method. In the numerical algorithm, we first discretize governing equations by Crank-Nicolson method, and obtain a large sparse system of linear algebraic equations, then use Monte Carlo method to solve the linear algebraic equations. To illustrate the usefulness of this technique, we apply it to some test problems.

Linear matrix differential equations of higher-order and applications

Directory of Open Access Journals (Sweden)

Mustapha Rachidi

2008-07-01

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

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

International Nuclear Information System (INIS)

Kaniel, S.; Itin, Y.

2006-01-01

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

Stopping test of iterative methods for solving PDE

International Nuclear Information System (INIS)

Wang Bangrong

1991-01-01

In order to assure the accuracy of the numerical solution of the iterative method for solving PDE (partial differential equation), the stopping test is very important. If the coefficient matrix of the system of linear algebraic equations is strictly diagonal dominant or irreducible weakly diagonal dominant, the stopping test formulas of the iterative method for solving PDE is proposed. Several numerical examples are given to illustrate the applications of the stopping test formulas

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

Science.gov (United States)

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…

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

International Nuclear Information System (INIS)

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

2009-01-01

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

A General Linear Method for Equating with Small Samples

Science.gov (United States)

Albano, Anthony D.

2015-01-01

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

MPFA algorithm for solving stokes-brinkman equations on quadrilateral grids

KAUST Repository

Iliev, Oleg

2014-01-01

This work is concerned with the development of a robust and accurate numerical method for solving the Stokes-Brinkman system of equations, which describes a free fluid flow coupled with a flow in porous media. Quadrilateral boundary fitted grid with a sophisticated finite volume method, namely MPFA O-method, is used to discretize the system of equations. Numerical results for two examples are presented, namely, channel flow and flow in a ring with a rolled porous medium. © Springer International Publishing Switzerland 2014.

A matrix formalism to solve interface condition equations in a reactor system

Energy Technology Data Exchange (ETDEWEB)

Matausek, M V [Boris Kidric Institute of Nuclear Sciences Vinca, Beograd (Yugoslavia)

1970-05-15

When a nuclear reactor or a reactor lattice cell is treated by an approximate procedure to solve the neutron transport equation, as the last computational step often appears a problem of solving systems of algebraic equations stating the interface and boundary conditions for the neutron flux moments. These systems have usually the coefficient matrices of the block-bi diagonal type, containing thus a large number of zero elements. In the present report it is shown how such a system can be solved efficiently accounting for all the zero elements both in the coefficient matrix and in the free term vector. The procedure is presented here for the case of multigroup P{sub 3} calculation of neutron flux distribution in a cylindrical reactor lattice cell. Compared with the standard gaussian elimination method, this procedure is more advantageous both in respect to the number of operations needed to solve a given problem and in respect to the computer memory storage requirements. A similar formalism can also be applied for other approximate methods, for instance for multigroup diffusion treatment of a multi zone reactor. (author)

A local-global problem for linear differential equations

NARCIS (Netherlands)

Put, Marius van der; Reversat, Marc

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

A local-global problem for linear differential equations

NARCIS (Netherlands)

Put, Marius van der; Reversat, Marc

2008-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Gear, C. W.; Saad, Y.

1981-01-01

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

Runge-Kutta Methods for Linear Ordinary Differential Equations

Science.gov (United States)

Zingg, David W.; Chisholm, Todd T.

1997-01-01

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

Space-time spectral collocation algorithm for solving time-fractional Tricomi-type equations

Directory of Open Access Journals (Sweden)

Abdelkawy M.A.

2016-01-01

Full Text Available We introduce a new numerical algorithm for solving one-dimensional time-fractional Tricomi-type equations (T-FTTEs. We used the shifted Jacobi polynomials as basis functions and the derivatives of fractional is evaluated by the Caputo definition. The shifted Jacobi Gauss-Lobatt algorithm is used for the spatial discretization, while the shifted Jacobi Gauss-Radau algorithmis applied for temporal approximation. Substituting these approximations in the problem leads to a system of algebraic equations that greatly simplifies the problem. The proposed algorithm is successfully extended to solve the two-dimensional T-FTTEs. Extensive numerical tests illustrate the capability and high accuracy of the proposed methodologies.

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

Energy Technology Data Exchange (ETDEWEB)

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

1960-12-15

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

General solution of Bateman equations for nuclear transmutations

International Nuclear Information System (INIS)

Cetnar, Jerzy

2006-01-01

The paper concerns the linear chain method of solving Bateman equations for nuclear transmutation in derivation of the general solution for linear chain with repeated transitions and thus elimination of existing numerical problems. In addition, applications of derived equations for transmutation trajectory analysis method is presented

A New Numerical Technique for Solving Systems Of Nonlinear Fractional Partial Differential Equations

Directory of Open Access Journals (Sweden)

Mountassir Hamdi Cherif

2017-11-01

Full Text Available In this paper, we apply an efficient method called the Aboodh decomposition method to solve systems of nonlinear fractional partial differential equations. This method is a combined form of Aboodh transform with Adomian decomposition method. The theoretical analysis of this investigated for systems of nonlinear fractional partial differential equations is calculated in the explicit form of a power series with easily computable terms. Some examples are given to shows that this method is very efficient and accurate. This method can be applied to solve others nonlinear systems problems.

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

Science.gov (United States)

Brenier, Yann; Levy, Doron

2000-03-01

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

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

OpenAIRE

Leibov Roman

2017-01-01

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

On matrix fractional differential equations

Directory of Open Access Journals (Sweden)

Adem Kılıçman

2017-01-01

Full Text Available The aim of this article is to study the matrix fractional differential equations and to find the exact solution for system of matrix fractional differential equations in terms of Riemann–Liouville using Laplace transform method and convolution product to the Riemann–Liouville fractional of matrices. Also, we show the theorem of non-homogeneous matrix fractional partial differential equation with some illustrative examples to demonstrate the effectiveness of the new methodology. The main objective of this article is to discuss the Laplace transform method based on operational matrices of fractional derivatives for solving several kinds of linear fractional differential equations. Moreover, we present the operational matrices of fractional derivatives with Laplace transform in many applications of various engineering systems as control system. We present the analytical technique for solving fractional-order, multi-term fractional differential equation. In other words, we propose an efficient algorithm for solving fractional matrix equation.

Application of Trotter approximation for solving time dependent neutron transport equation

International Nuclear Information System (INIS)

Stancic, V.

1987-01-01

A method is proposed to solve multigroup time dependent neutron transport equation with arbitrary scattering anisotropy. The recurrence relation thus obtained is simple, numerically stable and especially suitable for treatment of complicated geometries. (author)

An Unconditionally Stable Method for Solving the Acoustic Wave Equation

Directory of Open Access Journals (Sweden)

Zhi-Kai Fu

2015-01-01

Full Text Available An unconditionally stable method for solving the time-domain acoustic wave equation using Associated Hermit orthogonal functions is proposed. The second-order time derivatives in acoustic wave equation are expanded by these orthogonal basis functions. By applying Galerkin temporal testing procedure, the time variable can be eliminated from the calculations. The restriction of Courant-Friedrichs-Levy (CFL condition in selecting time step for analyzing thin layer can be avoided. Numerical results show the accuracy and the efficiency of the proposed method.

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

Science.gov (United States)

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…

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

Science.gov (United States)

Wati, S.; Fitriana, L.; Mardiyana

2018-04-01

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

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

Science.gov (United States)

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

Science.gov (United States)

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

On some perturbation techniques for quasi-linear parabolic equations

Directory of Open Access Journals (Sweden)

Igor Malyshev

1990-01-01

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

Numerical treatment of linearized equations describing inhomogeneous collisionless plasmas

International Nuclear Information System (INIS)

Lewis, H.R.

1979-01-01

The equations governing the small-signal response of spatially inhomogeneous collisionless plasmas have practical significance in physics, for example in controlled thermonuclear fusion research. Although the solutions are very complicated and the equations are different to solve numerically, effective methods for them are being developed which are applicable when the equilibrium involves only one nonignorable coordinate. The general theoretical framework probably will provide a basis for progress when there are two or three nonignorable coordinates

Linearized gyro-kinetic equation

International Nuclear Information System (INIS)

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

1976-01-01

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

Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method

Directory of Open Access Journals (Sweden)

Reza Ezzati

2014-08-01

Full Text Available In this paper, we propose the least square method for computing the positive solution of a non-square fully fuzzy linear system. To this end, we use Kaffman' arithmetic operations on fuzzy numbers \\cite{17}. Here, considered existence of exact solution using pseudoinverse, if they are not satisfy in positive solution condition, we will compute fuzzy vector core and then we will obtain right and left spreads of positive fuzzy vector by introducing constrained least squares problem. Using our proposed method, non-square fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.

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

Science.gov (United States)

Lingala, N; Namachchivaya, N Sri

2016-06-01

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

Numerical Analysis of Partial Differential Equations

CERN Document Server

Lui, S H

2011-01-01

A balanced guide to the essential techniques for solving elliptic partial differential equations Numerical Analysis of Partial Differential Equations provides a comprehensive, self-contained treatment of the quantitative methods used to solve elliptic partial differential equations (PDEs), with a focus on the efficiency as well as the error of the presented methods. The author utilizes coverage of theoretical PDEs, along with the nu merical solution of linear systems and various examples and exercises, to supply readers with an introduction to the essential concepts in the numerical analysis

Linear versus non-linear supersymmetry, in general

Energy Technology Data Exchange (ETDEWEB)

Ferrara, Sergio [Theoretical Physics Department, CERN,CH-1211 Geneva 23 (Switzerland); INFN - Laboratori Nazionali di Frascati,Via Enrico Fermi 40, I-00044 Frascati (Italy); Department of Physics and Astronomy, UniversityC.L.A.,Los Angeles, CA 90095-1547 (United States); Kallosh, Renata [SITP and Department of Physics, Stanford University,Stanford, California 94305 (United States); Proeyen, Antoine Van [Institute for Theoretical Physics, Katholieke Universiteit Leuven,Celestijnenlaan 200D, B-3001 Leuven (Belgium); Wrase, Timm [Institute for Theoretical Physics, Technische Universität Wien,Wiedner Hauptstr. 8-10, A-1040 Vienna (Austria)

2016-04-12

We study superconformal and supergravity models with constrained superfields. The underlying version of such models with all unconstrained superfields and linearly realized supersymmetry is presented here, in addition to the physical multiplets there are Lagrange multiplier (LM) superfields. Once the equations of motion for the LM superfields are solved, some of the physical superfields become constrained. The linear supersymmetry of the original models becomes non-linearly realized, its exact form can be deduced from the original linear supersymmetry. Known examples of constrained superfields are shown to require the following LM’s: chiral superfields, linear superfields, general complex superfields, some of them are multiplets with a spin.

Linear versus non-linear supersymmetry, in general

International Nuclear Information System (INIS)

Ferrara, Sergio; Kallosh, Renata; Proeyen, Antoine Van; Wrase, Timm

2016-01-01

We study superconformal and supergravity models with constrained superfields. The underlying version of such models with all unconstrained superfields and linearly realized supersymmetry is presented here, in addition to the physical multiplets there are Lagrange multiplier (LM) superfields. Once the equations of motion for the LM superfields are solved, some of the physical superfields become constrained. The linear supersymmetry of the original models becomes non-linearly realized, its exact form can be deduced from the original linear supersymmetry. Known examples of constrained superfields are shown to require the following LM’s: chiral superfields, linear superfields, general complex superfields, some of them are multiplets with a spin.

The linearized pressure Poisson equation for global instability analysis of incompressible flows

Science.gov (United States)

Theofilis, Vassilis

2017-12-01

The linearized pressure Poisson equation (LPPE) is used in two and three spatial dimensions in the respective matrix-forming solution of the BiGlobal and TriGlobal eigenvalue problem in primitive variables on collocated grids. It provides a disturbance pressure boundary condition which is compatible with the recovery of perturbation velocity components that satisfy exactly the linearized continuity equation. The LPPE is employed to analyze instability in wall-bounded flows and in the prototype open Blasius boundary layer flow. In the closed flows, excellent agreement is shown between results of the LPPE and those of global linear instability analyses based on the time-stepping nektar++, Semtex and nek5000 codes, as well as with those obtained from the FreeFEM++ matrix-forming code. In the flat plate boundary layer, solutions extracted from the two-dimensional LPPE eigenvector at constant streamwise locations are found to be in very good agreement with profiles delivered by the NOLOT/PSE space marching code. Benchmark eigenvalue data are provided in all flows analyzed. The performance of the LPPE is seen to be superior to that of the commonly used pressure compatibility (PC) boundary condition: at any given resolution, the discrete part of the LPPE eigenspectrum contains converged and not converged, but physically correct, eigenvalues. By contrast, the PC boundary closure delivers some of the LPPE eigenvalues and, in addition, physically wrong eigenmodes. It is concluded that the LPPE should be used in place of the PC pressure boundary closure, when BiGlobal or TriGlobal eigenvalue problems are solved in primitive variables by the matrix-forming approach on collocated grids.

Local energy decay for linear wave equations with variable coefficients

Science.gov (United States)

Ikehata, Ryo

2005-06-01

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

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

Science.gov (United States)

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

2009-01-01

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

A homotopy method for solving Riccati equations on a shared memory parallel computer

International Nuclear Information System (INIS)

Zigic, D.; Watson, L.T.; Collins, E.G. Jr.; Davis, L.D.

1993-01-01

Although there are numerous algorithms for solving Riccati equations, there still remains a need for algorithms which can operate efficiently on large problems and on parallel machines. This paper gives a new homotopy-based algorithm for solving Riccati equations on a shared memory parallel computer. The central part of the algorithm is the computation of the kernel of the Jacobian matrix, which is essential for the corrector iterations along the homotopy zero curve. Using a Schur decomposition the tensor product structure of various matrices can be efficiently exploited. The algorithm allows for efficient parallelization on shared memory machines

Linear orbit parameters for the exact equations of motion

International Nuclear Information System (INIS)

Parzen, G.

1995-01-01

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

Application of He’s Variational Iteration Method to Nonlinear Helmholtz Equation and Fifth-Order KDV Equation

DEFF Research Database (Denmark)

Miansari, Mo; Miansari, Me; Barari, Amin

2009-01-01

In this article, He’s variational iteration method (VIM), is implemented to solve the linear Helmholtz partial differential equation and some nonlinear fifth-order Korteweg-de Vries (FKdV) partial differential equations with specified initial conditions. The initial approximations can be freely c...

The discontinuous finite element method for solving Eigenvalue problems of transport equations

International Nuclear Information System (INIS)

Yang, Shulin; Wang, Ruihong

2011-01-01

In this paper, the multigroup transport equations for solving the eigenvalues λ and K_e_f_f under two dimensional cylindrical coordinate are discussed. Aimed at the equations, the discretizing way combining discontinuous finite element method (DFE) with discrete ordinate method (SN) is developed, and the iterative algorithms and steps are studied. The numerical results show that the algorithms are efficient. (author)

A novel method to solve functional differential equations

International Nuclear Information System (INIS)

Tapia, V.

1990-01-01

A method to solve differential equations containing the variational operator as the derivation operation is presented. They are called variational differential equations (VDE). The solution to a VDE should be a function containing the derivatives, with respect to the base space coordinates, of the fields up to a generic order s: a s-th-order function. The variational operator doubles the order of the function on which it acts. Therefore, in order to make compatible the orders of the different terms appearing in a VDE, the solution should be a function containing the derivatives of the fields at all orders. But this takes us again back to the functional methods. In order to avoid this, one must restrict the considerations, in the case of second-order VDEs, to the space of s-th-order functions on which the variational operator acts transitively. These functions have been characterized for a one-dimensional base space for the first- and second-order cases. These functions turn out to be polynomial in the highest-order derivatives of the fields with functions of the lower-order derivatives as coefficients. Then VDEs reduce to a system of coupled partial differential equations for the coefficients above mentioned. The importance of the method lies on the fact that the solutions to VDEs are in a one-to-one correspondence with the solutions of functional differential equations. The previous method finds direct applications in quantum field theory, where the Schroedinger equation plays a central role. Since the Schroedinger equation is reduced to a system of coupled partial differential equations, this provides a nonperturbative scheme for quantum field theory. As an example, the massless scalar field is considered

Numerical solution of the potential problem by integral equations without Green's functions

International Nuclear Information System (INIS)

De Mey, G.

1977-01-01

An integral equation technique will be presented to solve Laplace's equation in a two-dimensional area S. The Green's function has been replaced by a particular solution of Laplace equation in order to establish the integral equation. It is shown that accurate results can be obtained provided the pivotal elimination method is used to solve the linear algebraic set

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

Science.gov (United States)

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

2018-03-01

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

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

Science.gov (United States)

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.

Numerical methods for solving the governing equations for a seriated continuum

International Nuclear Information System (INIS)

Narum, R.E.; Noble, C.; Mortensen, G.A.; McFadden, J.H.

1976-09-01

A desire to more accurately predict the behavior of transient two-phase flows has resulted in an investigation of the feasibility of computing unequal phase velocities and unequal phase temperatures. The finite difference forms of a set of equations governing a seriated continuum are presented along with two methods developed for solving the resulting systems of simultaneous nonlinear equations. Results from a one-dimensional computer code are presented to illustrate the capabilities of one of the solution methods

Application of the Generalized Differential Quadrature Method in Solving Burgers' Equations

International Nuclear Information System (INIS)

Mokhtari, R.; Toodar, A. Samadi; Chegini, N.G.

2011-01-01

The aim of this paper is to obtain numerical solutions of the one-dimensional, two-dimensional and coupled Burgers' equations through the generalized differential quadrature method (GDQM). The polynomial-based differential quadrature (PDQ) method is employed and the obtained system of ordinary differential equations is solved via the total variation diminishing Runge-Kutta (TVD-RK) method. The numerical solutions are satisfactorily coincident with the exact solutions. The method can compete against the methods applied in the literature. (general)

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

Science.gov (United States)

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

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

Science.gov (United States)

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…

An implicit spectral formula for generalized linear Schroedinger equations

International Nuclear Information System (INIS)

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

2009-01-01

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

CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM

Directory of Open Access Journals (Sweden)

S.H. Nasseri

2011-07-01

Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.

CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM

Directory of Open Access Journals (Sweden)

S.H. Nasseri

2009-10-01

Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.

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

Science.gov (United States)

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

2009-01-01

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

Transport methods: general. 7. Formulation of a Fourier-Boltzmann Transformation to Solve the Three-Dimensional Transport Equation

International Nuclear Information System (INIS)

Stancic, V.

2001-01-01

This paper presents some elements of a new approach to solve analytically the linearized three-dimensional (3-D) transport equation of neutral particles. Since this task is of such special importance, we present some results of a paper that is still in progress. The most important is that using this transformation, an integro-differential equation with an analytical solution is obtained. For this purpose, a simplest 3-D equation is being considered which describes the transport process in an infinite medium. Until now, this equation has been analytically considered either using the Laplace transform with respect to time parameter t or applying the Fourier transform over the space coordinate. Both of them reduce the number of differential terms in the equation; however, evaluation of the inverse transformation is complicated. In this paper, we introduce for the first time a Fourier transform induced by the Boltzmann operator. For this, we use a complete set of 3-D eigenfunctions of the Boltzmann transport operator defined in a similar way as those that have been already used in 3-D transport theory as a basic set to transform the transport equation. This set consists of a continuous part and a discrete one with spectral measure. The density distribution equation shows the known form asymptotic behavior. Several applications are to be performed using this equation and compared to the benchmark one. Such an analysis certainly would be out of the available space

An Evaluation of Five Linear Equating Methods for the NEAT Design

Science.gov (United States)

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

2009-01-01

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

Using packaged software for solving two differential equation problems that arise in plasma physics

International Nuclear Information System (INIS)

Gaffney, P.W.

1980-01-01

Experience in using packaged numerical software for solving two related problems that arise in Plasma physics is described. These problems are (i) the solution of the reduced resistive MHD equations and (ii) the solution of the Grad-Shafranov equation

Parallel algorithms for solving the diffusion equation by finite elements methods and by nodal methods

International Nuclear Information System (INIS)

Coulomb, F.

1989-06-01

The aim of this work is to study methods for solving the diffusion equation, based on a primal or mixed-dual finite elements discretization and well suited for use on multiprocessors computers; domain decomposition methods are the subject of the main part of this study, the linear systems being solved by the block-Jacobi method. The origin of the diffusion equation is explained in short, and various variational formulations are reminded. A survey of iterative methods is given. The elemination of the flux or current is treated in the case of a mixed method. Numerical tests are performed on two examples of reactors, in order to compare mixed elements and Lagrange elements. A theoretical study of domain decomposition is led in the case of Lagrange finite elements, and convergence conditions for the block-Jacobi method are derived; the dissection decomposition is previously the purpose of a particular numerical analysis. In the case of mixed-dual finite elements, a study is led on examples and is confirmed by numerical tests performed for the dissection decomposition; furthermore, after being justified, decompositions along axes of symmetry are numerically tested. In the case of a decomposition into two subdomains, the dissection decomposition and the decomposition with an integrated interface are compared. Alternative directions methods are defined; the convergence of those relative to Lagrange elements is shown; in the case of mixed elements, convergence conditions are found [fr

Time-Dependent Heat Conduction Problems Solved by an Integral-Equation Approach

International Nuclear Information System (INIS)

Oberaigner, E.R.; Leindl, M.; Antretter, T.

2010-01-01

Full text: A classical task of mathematical physics is the formulation and solution of a time dependent thermoelastic problem. In this work we develop an algorithm for solving the time-dependent heat conduction equation c p ρ∂ t T-kT, ii =0 in an analytical, exact fashion for a two-component domain. By the Green's function approach the formal solution of the problem is obtained. As an intermediate result an integral-equation for the temperature history at the domain interface is formulated which can be solved analytically. This method is applied to a classical engineering problem, i.e. to a special case of a Stefan-Problem. The Green's function approach in conjunction with the integral-equation method is very useful in cases were strong discontinuities or jumps occur. The initial conditions and the system parameters of the investigated problem give rise to two jumps in the temperature field. Purely numerical solutions are obtained by using the FEM (finite element method) and the FDM (finite difference method) and compared with the analytical approach. At the domain boundary the analytical solution and the FEM-solution are in good agreement, but the FDM results show a signicant smearing effect. (author)

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

Energy Technology Data Exchange (ETDEWEB)

Xia, Yin [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China); University of Chinese Academy of Science, Beijing 100049 (China); Xu, Jun, E-mail: xujun@sinap.ac.cn [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China); Li, Bao-An [Department of Physics and Astronomy, Texas A& M University-Commerce, Commerce, TX 75429-3011 (United States); Department of Applied Physics, Xi' an Jiao Tong University, Xi' an 710049 (China); Shen, Wen-Qing [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China)

2016-08-10

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

New numerical method for solving the solute transport equation

International Nuclear Information System (INIS)

Ross, B.; Koplik, C.M.

1978-01-01

The solute transport equation can be solved numerically by approximating the water flow field by a network of stream tubes and using a Green's function solution within each stream tube. Compared to previous methods, this approach permits greater computational efficiency and easier representation of small discontinuities, and the results are easier to interpret physically. The method has been used to study hypothetical sites for disposal of high-level radioactive waste

A Novel Approach for Solving Semidefinite Programs

Directory of Open Access Journals (Sweden)

Hong-Wei Jiao

2014-01-01

Full Text Available A novel linearizing alternating direction augmented Lagrangian approach is proposed for effectively solving semidefinite programs (SDP. For every iteration, by fixing the other variables, the proposed approach alternatively optimizes the dual variables and the dual slack variables; then the primal variables, that is, Lagrange multipliers, are updated. In addition, the proposed approach renews all the variables in closed forms without solving any system of linear equations. Global convergence of the proposed approach is proved under mild conditions, and two numerical problems are given to demonstrate the effectiveness of the presented approach.

Theory of Perturbed Equilibria for Solving the Grad-Shafranov Equation

International Nuclear Information System (INIS)

Pletzer, A.; Zakharov, L.E.

1999-01-01

The theory of perturbed magnetohydrodynamic equilibria is presented for different formulations of the tokamak equilibrium problem. For numerical codes, it gives an explicit Newton scheme for solving the Grad-Shafranov equation subject to different constraints. The problem of stability of axisymmetric modes is shown to be a particular case of the equilibrium perturbation theory

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