Solving Linear Differential Equations
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
Students’ difficulties in solving linear equation problems
Wati, S.; Fitriana, L.; Mardiyana
2018-03-01
A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...
Approximate Method for Solving the Linear Fuzzy Delay Differential Equations
Directory of Open Access Journals (Sweden)
S. Narayanamoorthy
2015-01-01
Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.
A Proposed Method for Solving Fuzzy System of Linear Equations
Directory of Open Access Journals (Sweden)
Reza Kargar
2014-01-01
Full Text Available This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m×n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.
Experimental quantum computing to solve systems of linear equations.
Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei
2013-06-07
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.
Insights into the School Mathematics Tradition from Solving Linear Equations
Buchbinder, Orly; Chazan, Daniel; Fleming, Elizabeth
2015-01-01
In this article, we explore how the solving of linear equations is represented in English-language algebra text books from the early nineteenth century when schooling was becoming institutionalized, and then survey contemporary teachers. In the text books, we identify the increasing presence of a prescribed order of steps (a canonical method) for…
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
kofi.mereku
Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.
Solving Fully Fuzzy Linear System of Equations in General Form
Directory of Open Access Journals (Sweden)
A. Yousefzadeh
2012-06-01
Full Text Available In this work, we propose an approach for computing the positive solution of a fully fuzzy linear system where the coefficient matrix is a fuzzy $nimes n$ matrix. To do this, we use arithmetic operations on fuzzy numbers that introduced by Kaffman in and convert the fully fuzzy linear system into two $nimes n$ and $2nimes 2n$ crisp linear systems. If the solutions of these linear systems don't satisfy in positive fuzzy solution condition, we introduce the constrained least squares problem to obtain optimal fuzzy vector solution by applying the ranking function in given fully fuzzy linear system. Using our proposed method, the fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.
Nahay, John Michael
2008-01-01
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order Abel differential equation with two nonlinear terms in order to demonstrate in as much detail as possible the computations necessary for a complete solution. We mention in our section on further developments that the basic transformation idea can be generali...
Mathematics Literacy of Secondary Students in Solving Simultanenous Linear Equations
Sitompul, R. S. I.; Budayasa, I. K.; Masriyah
2018-01-01
This study examines the profile of secondary students’ mathematical literacy in solving simultanenous linear equations problems in terms of cognitive style of visualizer and verbalizer. This research is a descriptive research with qualitative approach. The subjects in this research consist of one student with cognitive style of visualizer and one student with cognitive style of verbalizer. The main instrument in this research is the researcher herself and supporting instruments are cognitive style tests, mathematics skills tests, problem-solving tests and interview guidelines. Research was begun by determining the cognitive style test and mathematics skill test. The subjects chosen were given problem-solving test about simultaneous linear equations and continued with interview. To ensure the validity of the data, the researcher conducted data triangulation; the steps of data reduction, data presentation, data interpretation, and conclusion drawing. The results show that there is a similarity of visualizer and verbalizer-cognitive style in identifying and understanding the mathematical structure in the process of formulating. There are differences in how to represent problems in the process of implementing, there are differences in designing strategies and in the process of interpreting, and there are differences in explaining the logical reasons.
Ten-Year-Old Students Solving Linear Equations
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…
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)
ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations
Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil
2018-04-01
In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.
Parallel 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)
Numerical method for solving linear Fredholm fuzzy integral equations of the second kind
Energy Technology Data Exchange (ETDEWEB)
Abbasbandy, S. [Department of Mathematics, Imam Khomeini International University, P.O. Box 288, Ghazvin 34194 (Iran, Islamic Republic of)]. E-mail: saeid@abbasbandy.com; Babolian, E. [Faculty of Mathematical Sciences and Computer Engineering, Teacher Training University, Tehran 15618 (Iran, Islamic Republic of); Alavi, M. [Department of Mathematics, Arak Branch, Islamic Azad University, Arak 38135 (Iran, Islamic Republic of)
2007-01-15
In this paper we use parametric form of fuzzy number and convert a linear fuzzy Fredholm integral equation to two linear system of integral equation of the second kind in crisp case. We can use one of the numerical method such as Nystrom and find the approximation solution of the system and hence obtain an approximation for fuzzy solution of the linear fuzzy Fredholm integral equations of the second kind. The proposed method is illustrated by solving some numerical examples.
New approach to solve fully fuzzy system of linear equations using ...
Indian Academy of Sciences (India)
This paper proposes two new methods to solve fully fuzzy system of linear equations. The fuzzy system has been converted to a crisp system of linear equations by using single and double parametric form of fuzzy numbers to obtain the non-negative solution. Double parametric form of fuzzy numbers is defined and applied ...
Directory of Open Access Journals (Sweden)
Mohammad Almousa
2013-01-01
Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.
Jamali, R. M. Jalal Uddin; Hashem, M. M. A.; Hasan, M. Mahfuz; Rahman, Md. Bazlar
2013-01-01
Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is sparse. The rate of convergence of iteration method is increased by using Successive Relaxation (SR) technique. But SR technique is very much sensitive to relaxation factor, {\\omega}. Recently, hybridization of classical Gauss-Seidel based successive relaxation t...
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.
Matrix form of Legendre polynomials for solving linear integro-differential equations of high order
Kammuji, M.; Eshkuvatov, Z. K.; Yunus, Arif A. M.
2017-04-01
This paper presents an effective approximate solution of high order of Fredholm-Volterra integro-differential equations (FVIDEs) with boundary condition. Legendre truncated series is used as a basis functions to estimate the unknown function. Matrix operation of Legendre polynomials is used to transform FVIDEs with boundary conditions into matrix equation of Fredholm-Volterra type. Gauss Legendre quadrature formula and collocation method are applied to transfer the matrix equation into system of linear algebraic equations. The latter equation is solved by Gauss elimination method. The accuracy and validity of this method are discussed by solving two numerical examples and comparisons with wavelet and methods.
The H-N method for solving linear transport equation: theory and application
International Nuclear Information System (INIS)
Kaskas, A.; Gulecyuz, M.C.; Tezcan, C.
2002-01-01
The system of singular integral equation which is obtained from the integro-differential form of the linear transport equation as a result of Placzec lemma is solved. Application are given using the exit distributions and the infinite medium Green's function. The same theoretical results are also obtained with the use of the singular eigenfunction of the method of elementary solutions
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.
International Nuclear Information System (INIS)
Gene Golub; Kwok Ko
2009-01-01
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.
Linear differential equations to solve nonlinear mechanical problems: A novel approach
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...
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.
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.
Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables
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.
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-.
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
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.)
Scilab software as an alternative low-cost computing in solving the linear equations problem
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.
International Nuclear Information System (INIS)
Hernandez-Walls, R; Martín-Atienza, B; Salinas-Matus, M; Castillo, J
2017-01-01
When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations. (paper)
Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.
2017-11-01
When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.
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
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.
A new modified conjugate gradient coefficient for solving system of linear equations
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
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
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
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
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…
Effective quadrature formula in solving linear integro-differential equations of order two
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.
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.
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.
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.
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.
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.
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.
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
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]!
International Nuclear Information System (INIS)
Secher, Bernard; Belliard, Michel; Calvin, Christophe
2009-01-01
This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost
Energy Technology Data Exchange (ETDEWEB)
Secher, Bernard [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SFME/LGLS, Bat. 454, F-91191 Gif-sur-Yvette Cedex (France)], E-mail: bsecher@cea.fr; Belliard, Michel [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Cadarache DER/SSTH/LMDL, Bat. 238, F-13108 Saint-Paul-lez-Durance Cedex (France); Calvin, Christophe [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SERMA/LLPR, Bat. 470, F-91191 Gif-sur-Yvette Cedex (France)
2009-01-15
This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost.
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
Solving Ordinary Differential Equations
Krogh, F. T.
1987-01-01
Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.
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.
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)
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.
Systems of Inhomogeneous Linear Equations
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.
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.
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 Differential Equations in R: Package deSolve
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
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 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
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 ...
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.
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, ...
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
Solving Nonlinear Coupled Differential Equations
Mitchell, L.; David, J.
1986-01-01
Harmonic balance method developed to obtain approximate steady-state solutions for nonlinear coupled ordinary differential equations. Method usable with transfer matrices commonly used to analyze shaft systems. Solution to nonlinear equation, with periodic forcing function represented as sum of series similar to Fourier series but with form of terms suggested by equation itself.
Solving Kepler's equation using implicit functions
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.
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.)
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
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.
Solving equations by topological methods
Directory of Open Access Journals (Sweden)
Lech Górniewicz
2005-01-01
Full Text Available In this paper we survey most important results from topological fixed point theory which can be directly applied to differential equations. Some new formulations are presented. We believe that our article will be useful for analysts applying topological fixed point theory in nonlinear analysis and in differential equations.
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.
Solving Differential Equations in R
Although R is still predominantly applied for statistical analysis and graphical representation, it is rapidly becoming more suitable for mathematical computing. One of the fields where considerable progress has been made recently is the solution of differential equations. Here w...
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.)
Solving Absolute Value Equations Algebraically and Geometrically
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.
Parallel Algorithm Solves Coupled Differential Equations
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.
Schwarz maps of algebraic linear ordinary differential equations
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.
Basic linear partial differential equations
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
Green, David L.; Berry, Lee A.; Simpson, Adam B.; Younkin, Timothy R.
2018-04-01
We present the KINETIC-J code, a computational kernel for evaluating the linearized Vlasov equation with application to calculating the kinetic plasma response (current) to an applied time harmonic wave electric field. This code addresses the need for a configuration space evaluation of the plasma current to enable kinetic full-wave solvers for waves in hot plasmas to move beyond the limitations of the traditional Fourier spectral methods. We benchmark the kernel via comparison with the standard k →-space forms of the hot plasma conductivity tensor.
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)
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
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.
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
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 coefﬁcient matrix. The symmetric coefﬁcient 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.
The Use of Transformations in Solving Equations
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…
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
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
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.)
Linear System of Equations, Matrix Inversion, and Linear Programming Using MS Excel
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…
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.
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
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....
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)
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
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
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.
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.
Cognitive Load in Algebra: Element Interactivity in Solving Equations
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…
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)
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
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
Solving fault diagnosis problems linear synthesis techniques
Varga, Andreas
2017-01-01
This book addresses fault detection and isolation topics from a computational perspective. Unlike most existing literature, it bridges the gap between the existing well-developed theoretical results and the realm of reliable computational synthesis procedures. The model-based approach to fault detection and diagnosis has been the subject of ongoing research for the past few decades. While the theoretical aspects of fault diagnosis on the basis of linear models are well understood, most of the computational methods proposed for the synthesis of fault detection and isolation filters are not satisfactory from a numerical standpoint. Several features make this book unique in the fault detection literature: Solution of standard synthesis problems in the most general setting, for both continuous- and discrete-time systems, regardless of whether they are proper or not; consequently, the proposed synthesis procedures can solve a specific problem whenever a solution exists Emphasis on the best numerical algorithms to ...
Linear and quasi-linear equations of parabolic type
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.
Lie algebras and linear differential equations.
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.
Method of mechanical quadratures for solving singular integral equations of various types
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.
Solving the equation of neutron transport
International Nuclear Information System (INIS)
Nasfi, Rim
2009-01-01
This work is devoted to the study of some numerical methods of resolution of the problem of transport of the neutrons. We started by introducing the equation integro-differential transport of the neutrons. Then we applied the finite element method traditional for stationary and nonstationary linear problems in 2D. A great part is reserved for the presentation of the mixed numerical diagram and mixed hybrid with two types of uniform grids: triangular and rectangular. Thereafter we treated some numerical examples by implementations in Matlab in order to test the convergence of each method. To finish, we had results of simulation by the Monte Carlo method on a problem of two-dimensional transport with an aim of comparing them with the results resulting from the finite element method mixed hybrids. Some remarks and prospects conclude this work.
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
The numerical solution of linear multi-term fractional differential equations: systems of equations
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.
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)
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.
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
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.
Linear causal modeling with structural equations
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
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.
Diffusion phenomenon for linear dissipative wave equations
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.
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 ...
Dual exponential polynomials and linear differential equations
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.
Hypocoercivity for linear kinetic equations conserving mass
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
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
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
Solving Differential Equations Using Modified Picard Iteration
Robin, W. A.
2010-01-01
Many classes of differential equations are shown to be open to solution through a method involving a combination of a direct integration approach with suitably modified Picard iterative procedures. The classes of differential equations considered include typical initial value, boundary value and eigenvalue problems arising in physics and…
Auxiliary equation method for solving nonlinear partial differential equations
International Nuclear Information System (INIS)
Sirendaoreji,; Jiong, Sun
2003-01-01
By using the solutions of an auxiliary ordinary differential equation, a direct algebraic method is described to construct several kinds of exact travelling wave solutions for some nonlinear partial differential equations. By this method some physically important nonlinear equations are investigated and new exact travelling wave solutions are explicitly obtained with the aid of symbolic computation
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
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.
An Approach for Solving Linear Fractional Programming Problems
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...
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)
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
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)
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.
Constructing and solving equations - inverse operations
Czech Academy of Sciences Publication Activity Database
Neuman, František
2005-01-01
Roč. 70, č. 1 (2005), s. 77-87 ISSN 0001-9054 R&D Projects: GA AV ČR(CZ) IAA1163401 Institutional research plan: CEZ:AV0Z10190503 Keywords : functional and differential equations * representation of solution spaces * discretization of smooth relations Subject RIV: BA - General Mathematics
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.
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.
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.
Solving large mixed linear models using preconditioned conjugate gradient iteration.
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.
Fuzzy linear programming approach for solving transportation
Indian Academy of Sciences (India)
Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at ...
On index-2 linear implicit difference equations
Nguyen Huu Du, [No Value; Le Cong Loi, [No Value; Trinh Khanh Duy, [No Value; Vu Tien Viet, [No Value
2011-01-01
This paper deals with an index-2 notion for linear implicit difference equations (LIDEs) and with the solvability of initial value problems (IVPs) for index-2 LIDEs. Besides, the cocycle property as well as the multiplicative ergodic theorem of Oseledets type are also proved. (C) 2010 Elsevier Inc.
Singular Linear Differential Equations in Two Variables
Braaksma, B.L.J.; Put, M. van der
2008-01-01
The formal and analytic classification of integrable singular linear differential equations has been studied among others by R. Gerard and Y. Sibuya. We provide a simple proof of their main result, namely: For certain irregular systems in two variables there is no Stokes phenomenon, i.e. there is no
A fast iterative scheme for the linearized Boltzmann equation
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
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
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.
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.
Linearized pseudo-Einstein equations on the Heisenberg group
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 | → + ∞.
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.
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
Solving Fuzzy Fractional Differential Equations Using Zadeh's Extension Principle
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
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
Introduction to linear systems of differential equations
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...
Chosen interval methods for solving linear interval systems with special type of matrix
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.
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.
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)
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.
Nonoscillation of half-linear dynamic equations
Czech Academy of Sciences Publication Activity Database
Matucci, S.; Řehák, Pavel
2010-01-01
Roč. 60, č. 5 (2010), s. 1421-1429 ISSN 0898-1221 R&D Projects: GA AV ČR KJB100190701 Grant - others:GA ČR(CZ) GA201/07/0145 Institutional research plan: CEZ:AV0Z10190503 Keywords : half-linear dynamic equation * time scale * (non)oscillation * Riccati technique Subject RIV: BA - General Mathematics Impact factor: 1.472, year: 2010 http://www.sciencedirect.com/science/article/pii/S0898122110004384
On a representation of linear differential equations
Czech Academy of Sciences Publication Activity Database
Neuman, František
2010-01-01
Roč. 52, 1-2 (2010), s. 355-360 ISSN 0895-7177 Grant - others:GA ČR(CZ) GA201/08/0469 Institutional research plan: CEZ:AV0Z10190503 Keywords : Brandt and Ehresmann groupoinds * transformations * canonical forms * linear differential equations Subject RIV: BA - General Mathematics Impact factor: 1.066, year: 2010 http://www.sciencedirect.com/science/article/pii/S0895717710001184
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
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)
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
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.
Non-linear partial differential equations an algebraic view of generalized solutions
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
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.
Improved algorithm for solving nonlinear parabolized stability equations
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).
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)
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.
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.
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.
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.
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.
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.
A Simple Derivation of Kepler's Laws without Solving Differential Equations
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…
Using Computer Symbolic Algebra to Solve Differential Equations.
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)
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
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.
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)
Linear measure functional differential equations with infinite delay
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.
An uncoupling strategy for numerically solving the dynamic thermoelasticity equations
International Nuclear Information System (INIS)
Moura, C.A. de; Feijoo, R.A.
1981-01-01
The dynamic equations of coupled linear thermoelasticity are presented. A numerical algorithm which combines finite-element space approximation with a two-step time discretization in such a way as to reach significant computational savings is presented: It features a strategy for independently calculating the displacement and temperature fields through equations that nevertheless remain coupled. The scheme convergence was shown to be optimal and its machine performance, as ilustrated by some examples, fairly satisfactory. (Author) [pt
Approximate analytical methods for solving ordinary differential equations
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
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.
A method of solving simple harmonic oscillator Schroedinger equation
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.
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 nonlinear evolution equation system using two different methods
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.
Solving Nonlinear Partial Differential Equations with Maple and Mathematica
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
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 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.
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
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.
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.
New Efficient Fourth Order Method for Solving Nonlinear Equations
Directory of Open Access Journals (Sweden)
Farooq Ahmad
2013-12-01
Full Text Available In a paper [Appl. Math. Comput., 188 (2 (2007 1587--1591], authors have suggested and analyzed a method for solving nonlinear equations. In the present work, we modified this method by using the finite difference scheme, which has a quintic convergence. We have compared this modified Halley method with some other iterative of fifth-orders convergence methods, which shows that this new method having convergence of fourth order, is efficient.
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
Deterministic methods to solve the integral transport equation in neutronic
International Nuclear Information System (INIS)
Warin, X.
1993-11-01
We present a synthesis of the methods used to solve the integral transport equation in neutronic. This formulation is above all used to compute solutions in 2D in heterogeneous assemblies. Three kinds of methods are described: - the collision probability method; - the interface current method; - the current coupling collision probability method. These methods don't seem to be the most effective in 3D. (author). 9 figs
Domain decomposition method for solving the neutron diffusion equation
International Nuclear Information System (INIS)
Coulomb, F.
1989-03-01
The aim of this work is to study methods for solving the neutron diffusion equation; we are interested in methods based on a classical finite element discretization and well suited for use on parallel computers. Domain decomposition methods seem to answer this preoccupation. This study deals with a decomposition of the domain. A theoretical study is carried out for Lagrange finite elements and some examples are given; in the case of mixed dual finite elements, the study is based on examples [fr
Guiding brine shrimp through mazes by solving reaction diffusion equations
Singal, Krishma; Fenton, Flavio
Excitable systems driven by reaction diffusion equations have been shown to not only find solutions to mazes but to also to find the shortest path between the beginning and the end of the maze. In this talk we describe how we can use the Fitzhugh-Nagumo model, a generic model for excitable media, to solve a maze by varying the basin of attraction of its two fixed points. We demonstrate how two dimensional mazes are solved numerically using a Java Applet and then accelerated to run in real time by using graphic processors (GPUs). An application of this work is shown by guiding phototactic brine shrimp through a maze solved by the algorithm. Once the path is obtained, an Arduino directs the shrimp through the maze using lights from LEDs placed at the floor of the Maze. This method running in real time could be eventually used for guiding robots and cars through traffic.
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)
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.
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.
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…
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.
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.
Comments on new iterative methods for solving linear systems
Directory of Open Access Journals (Sweden)
Wang Ke
2017-06-01
Full Text Available Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster convergence. This note shows that their methods are suitable for more matrices than positive matrices which the authors suggested through further analysis and numerical examples.
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.
AZTEC: A parallel iterative package for the solving linear systems
Energy Technology Data Exchange (ETDEWEB)
Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S. [Sandia National Labs., Albuquerque, NM (United States)
1996-12-31
We describe a parallel linear system package, AZTEC. The package incorporates a number of parallel iterative methods (e.g. GMRES, biCGSTAB, CGS, TFQMR) and preconditioners (e.g. Jacobi, Gauss-Seidel, polynomial, domain decomposition with LU or ILU within subdomains). Additionally, AZTEC allows for the reuse of previous preconditioning factorizations within Newton schemes for nonlinear methods. Currently, a number of different users are using this package to solve a variety of PDE applications.
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)
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
Essential linear algebra with applications a problem-solving approach
Andreescu, Titu
2014-01-01
This textbook provides a rigorous introduction to linear algebra in addition to material suitable for a more advanced course while emphasizing the subject’s interactions with other topics in mathematics such as calculus and geometry. A problem-based approach is used to develop the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality. Key features include: • a thorough presentation of the main results in linear algebra along with numerous examples to illustrate the theory; • over 500 problems (half with complete solutions) carefully selected for their elegance and theoretical significance; • an interleaved discussion of geometry and linear algebra, giving readers a solid understanding of both topics and the relationship between them. Numerous exercises and well-chosen examples make this text suitable for advanced courses at the junior or senior levels. It can also serve as a source of supplementary problems for a sophomore-level course. ...
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.
Linear homotopy solution of nonlinear systems of equations in geodesy
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.
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.
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.
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
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
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)
Neural network error correction for solving coupled ordinary differential equations
Shelton, R. O.; Darsey, J. A.; Sumpter, B. G.; Noid, D. W.
1992-01-01
A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.
A rational function based scheme for solving advection equation
International Nuclear Information System (INIS)
Xiao, Feng; Yabe, Takashi.
1995-07-01
A numerical scheme for solving advection equations is presented. The scheme is derived from a rational interpolation function. Some properties of the scheme with respect to convex-concave preserving and monotone preserving are discussed. We find that the scheme is attractive in surpressinging overshoots and undershoots even in the vicinities of discontinuity. The scheme can also be easily swicthed as the CIP (Cubic interpolated Pseudo-Particle) method to get a third-order accuracy in smooth region. Numbers of numerical tests are carried out to show the non-oscillatory and less diffusive nature of the scheme. (author)
Solving the generalized Langevin equation with the algebraically correlated noise
International Nuclear Information System (INIS)
Srokowski, T.; Ploszajczak, M.
1997-01-01
The Langevin equation with the memory kernel is solved. The stochastic force possesses algebraic correlations, proportional to 1/t. The velocity autocorrelation function and related quantities characterizing transport properties are calculated at the assumption that the system is in the thermal equilibrium. Stochastic trajectories are simulated numerically, using the kangaroo process as a noise generator. Results of this simulation resemble Levy walks with divergent moments of the velocity distribution. The motion of a Brownian particle is considered both without any external potential and in the harmonic oscillator field, in particular the escape from a potential well. The results are compared with memory-free calculations for the Brownian particle. (author)
Gabor Wave Packet Method to Solve Plasma Wave Equations
International Nuclear Information System (INIS)
Pletzer, A.; Phillips, C.K.; Smithe, D.N.
2003-01-01
A numerical method for solving plasma wave equations arising in the context of mode conversion between the fast magnetosonic and the slow (e.g ion Bernstein) wave is presented. The numerical algorithm relies on the expansion of the solution in Gaussian wave packets known as Gabor functions, which have good resolution properties in both real and Fourier space. The wave packets are ideally suited to capture both the large and small wavelength features that characterize mode conversion problems. The accuracy of the scheme is compared with a standard finite element approach
A simple derivation of Kepler's laws without solving differential equations
International Nuclear Information System (INIS)
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 reconsideration of Newton's figure naturally leads to an explicit expression of the velocity and to the equation of the trajectory. This derivation, which can be fully apprehended by undergraduates or by secondary school teachers (who might use it with their pupils), can be considered as a first application of mechanical concepts to a physical problem of great historical and pedagogical interest
Stability of Linear Equations--Algebraic Approach
Cherif, Chokri; Goldstein, Avraham; Prado, Lucio M. G.
2012-01-01
This article could be of interest to teachers of applied mathematics as well as to people who are interested in applications of linear algebra. We give a comprehensive study of linear systems from an application point of view. Specifically, we give an overview of linear systems and problems that can occur with the computed solution when the…
Oscillation theory of linear differential equations
Czech Academy of Sciences Publication Activity Database
Došlý, Ondřej
2000-01-01
Roč. 36, č. 5 (2000), s. 329-343 ISSN 0044-8753 R&D Projects: GA ČR GA201/98/0677 Keywords : discrete oscillation theory %Sturm-Liouville equation%Riccati equation Subject RIV: BA - General Mathematics
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.
An efficient parallel algorithm for the solution of a tridiagonal linear system of equations
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.
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.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations
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.
Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations
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.
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.
Integrator Performance Analysis In Solving Stiff Differential Equation System
International Nuclear Information System (INIS)
B, Alhadi; Basaruddin, T.
2001-01-01
In this paper we discuss the four-stage index-2 singly diagonally implicit Runge-Kutta method, which is used to solve stiff ordinary differential equations (SODE). Stiff problems require a method where step size is not restricted by the method's stability. We desire SDIRK to be A-stable that has no stability restrictions when solving y'= λy with Reλ>0 and h>0, so by choosing suitable stability function we can determine appropriate constant g) to formulate SDIRK integrator to solve SODE. We select the second stage of the internal stage as embedded method to perform low order estimate for error predictor. The strategy for choosing the step size is adopted from the strategy proposed by Hall(1996:6). And the algorithm that is developed in this paper is implemented using MATLAB 5.3, which is running on Window's 95 environment. Our performance measurement's local truncation error accuracy, and efficiency were evaluated by statistical results of sum of steps, sum of calling functions, average of Newton iterations and elapsed times.As the results, our numerical experiment show that SDIRK is unconditionally stable. By using Hall's step size strategy, the method can be implemented efficiently, provided that suitable parameters are used
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
[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (2)].
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.
Modeling Blazar Spectra by Solving an Electron Transport Equation
Lewis, Tiffany; Finke, Justin; Becker, Peter A.
2018-01-01
Blazars are luminous active galaxies across the entire electromagnetic spectrum, but the spectral formation mechanisms, especially the particle acceleration, in these sources are not well understood. We develop a new theoretical model for simulating blazar spectra using a self-consistent electron number distribution. Specifically, we solve the particle transport equation considering shock acceleration, adiabatic expansion, stochastic acceleration due to MHD waves, Bohm diffusive particle escape, synchrotron radiation, and Compton radiation, where we implement the full Compton cross-section for seed photons from the accretion disk, the dust torus, and 26 individual broad lines. We used a modified Runge-Kutta method to solve the 2nd order equation, including development of a new mathematical method for normalizing stiff steady-state ordinary differential equations. We show that our self-consistent, transport-based blazar model can qualitatively fit the IR through Fermi g-ray data for 3C 279, with a single-zone, leptonic configuration. We use the solution for the electron distribution to calculate multi-wavelength SED spectra for 3C 279. We calculate the particle and magnetic field energy densities, which suggest that the emitting region is not always in equipartition (a common assumption), but sometimes matter dominated. The stratified broad line region (based on ratios in quasar reverberation mapping, and thus adding no free parameters) improves our estimate of the location of the emitting region, increasing it by ~5x. Our model provides a novel view into the physics at play in blazar jets, especially the relative strength of the shock and stochastic acceleration, where our model is well suited to distinguish between these processes, and we find that the latter tends to dominate.
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.
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
Solving ordinary differential equations by electrical analogy: a multidisciplinary teaching tool
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.
[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (1)].
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.
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
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.
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.
A General Linear Method for Equating with Small Samples
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…
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.
Solving the RPA eigenvalue equation in real-space
Muta, A; Hashimoto, Y; Yabana, K
2002-01-01
We present a computational method to solve the RPA eigenvalue equation employing a uniform grid representation in three-dimensional Cartesian coordinates. The conjugate gradient method is used for this purpose as an interactive method for a generalized eigenvalue problem. No construction of unoccupied orbitals is required in the procedure. We expect this method to be useful for systems lacking spatial symmetry to calculate accurate eigenvalues and transition matrix elements of a few low-lying excitations. Some applications are presented to demonstrate the feasibility of the method, considering the simplified mean-field model as an example of a nuclear physics system and the electronic excitations in molecules with time-dependent density functional theory as an example of an electronic system. (author)
Numerical method for solving integral equations of neutron transport. II
International Nuclear Information System (INIS)
Loyalka, S.K.; Tsai, R.W.
1975-01-01
In a recent paper it was pointed out that the weakly singular integral equations of neutron transport can be quite conveniently solved by a method based on subtraction of singularity. This previous paper was devoted entirely to the consideration of simple one-dimensional isotropic-scattering and one-group problems. The present paper constitutes interesting extensions of the previous work in that in addition to a typical two-group anisotropic-scattering albedo problem in the slab geometry, the method is also applied to an isotropic-scattering problem in the x-y geometry. These results are compared with discrete S/sub N/ (ANISN or TWOTRAN-II) results, and for the problems considered here, the proposed method is found to be quite effective. Thus, the method appears to hold considerable potential for future applications. (auth)
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.
Linear algebra a first course with applications to differential equations
Apostol, Tom M
2014-01-01
Developed from the author's successful two-volume Calculus text this book presents Linear Algebra without emphasis on abstraction or formalization. To accommodate a variety of backgrounds, the text begins with a review of prerequisites divided into precalculus and calculus prerequisites. It continues to cover vector algebra, analytic geometry, linear spaces, determinants, linear differential equations and more.
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
A block Krylov subspace time-exact solution method for linear ordinary differential equation systems
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
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 ...
Computer programs for the solution of systems of linear algebraic equations
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.
Resonance tongues in the linear Sitnikov equation
Misquero, Mauricio
2018-04-01
In this paper, we deal with a Hill's equation, depending on two parameters e\\in [0,1) and Λ >0, that has applications to some problems in Celestial Mechanics of the Sitnikov type. Due to the nonlinearity of the eccentricity parameter e and the coexistence problem, the stability diagram in the (e,Λ )-plane presents unusual resonance tongues emerging from points (0,(n/2)^2), n=1,2,\\ldots The tongues bounded by curves of eigenvalues corresponding to 2π -periodic solutions collapse into a single curve of coexistence (for which there exist two independent 2π -periodic eigenfunctions), whereas the remaining tongues have no pockets and are very thin. Unlike most of the literature related to resonance tongues and Sitnikov-type problems, the study of the tongues is made from a global point of view in the whole range of e\\in [0,1). Indeed, an interesting behavior of the tongues is found: almost all of them concentrate in a small Λ -interval [1, 9 / 8] as e→ 1^-. We apply the stability diagram of our equation to determine the regions for which the equilibrium of a Sitnikov (N+1)-body problem is stable in the sense of Lyapunov and the regions having symmetric periodic solutions with a given number of zeros. We also study the Lyapunov stability of the equilibrium in the center of mass of a curved Sitnikov problem.
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)
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)
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.
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.
Subroutine for series solutions of linear differential equations
International Nuclear Information System (INIS)
Tasso, H.; Steuerwald, J.
1976-02-01
A subroutine for Taylor series solutions of systems of ordinary linear differential equations is descriebed. It uses the old idea of Lie series but allows simple implementation and is time-saving for symbolic manipulations. (orig.) [de
On a class of fourth order linear recurrence equations
Directory of Open Access Journals (Sweden)
Sui-Sun Cheng
1984-01-01
Full Text Available This paper is concerned with sequences that satisfy a class of fourth order linear recurrence equations. Basic properties of such sequences are derived. In addition, we discuss the oscillatory and nonoscillatory behavior of such sequences.
Exact solution of some linear matrix equations using algebraic methods
Djaferis, T. E.; Mitter, S. K.
1977-01-01
A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.
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.
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
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.
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)
Local energy decay for linear wave equations with variable coefficients
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].
Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming
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.
Focal decompositions for linear differential equations of the second order
Directory of Open Access Journals (Sweden)
L. Birbrair
2003-01-01
two-points problems to itself such that the image of the focal decomposition associated to the first equation is a focal decomposition associated to the second one. In this paper, we present a complete classification for linear second-order equations with respect to this equivalence relation.
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
A Hamiltonian structure for the linearized Einstein vacuum field equations
International Nuclear Information System (INIS)
Torres del Castillo, G.F.
1991-01-01
By considering the Einstein vacuum field equations linearized about the Minkowski metric, the evolution equations for the gauge-invariant quantities characterizing the gravitational field are written in a Hamiltonian form. A Poisson bracket between functionals of the field, compatible with the constraints satisfied by the field variables, is obtained (Author)
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)
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.
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)
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
Visual construction of characteristic equations of linear electric circuits
Directory of Open Access Journals (Sweden)
V.V. Kostyukov
2013-12-01
Full Text Available A visual identification method with application of partial circuits is developed for characteristic equation coefficients of transients in linear electric circuits. The method is based on interrelationship between the roots of algebraic polynomial and its coefficients. The method is illustrated with an example of a third-order linear electric circuit.
A local-global problem for linear differential equations
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
A local-global problem for linear differential equations
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
Rational approximations to solutions of linear differential equations.
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.
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
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)
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
kofi.mereku
the modified Newman Error Hierarchical levels (NEAL), which comprise reading, comprehension, transformation, process skills and encoding errors. The results revealed that majority (60%) of the students attempted most of the questions with a few (2%) arriving at the correct answer which implies students have difficulties ...
Periodic feedback stabilization for linear periodic evolution equations
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.
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
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
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.
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
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…
Computer programs for solving systems of nonlinear equations
International Nuclear Information System (INIS)
Asaoka, Takumi
1978-03-01
Computer programs to find a solution, usually the one closest to some guess, of a system of simultaneous nonlinear equations are provided for real functions of the real arguments. These are based on quasi-Newton methods or projection methods, which are briefly reviewed in the present report. Benchmark tests were performed on these subroutines to grasp their characteristics. As the program not requiring analytical forms of the derivatives of the Jacobian matrix, we have dealt with NS01A of Powell, NS03A of Reid for a system with the sparse Jacobian and NONLIN of Brown. Of these three subroutines of quasi-Newton methods, NONLIN is shown to be the most useful because of its stable algorithm and short computation time. On the other hand, as the subroutine for which the derivatives of the Jacobian are to be supplied analytically, we have tested INTECH of a quasi-Newton method based on the Boggs' algorithm, PROJA of Georg and Keller based on the projection method and an option of NS03A. The results have shown that INTECH, treating variables which appear only linearly in the functions separately, takes the shortest computation time, on the whole, while the projection method requires further research to find an optimal algorithm. (auth.)
Backward stochastic differential equations from linear to fully nonlinear theory
Zhang, Jianfeng
2017-01-01
This book provides a systematic and accessible approach to stochastic differential equations, backward stochastic differential equations, and their connection with partial differential equations, as well as the recent development of the fully nonlinear theory, including nonlinear expectation, second order backward stochastic differential equations, and path dependent partial differential equations. Their main applications and numerical algorithms, as well as many exercises, are included. The book focuses on ideas and clarity, with most results having been solved from scratch and most theories being motivated from applications. It can be considered a starting point for junior researchers in the field, and can serve as a textbook for a two-semester graduate course in probability theory and stochastic analysis. It is also accessible for graduate students majoring in financial engineering.
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.)
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
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.
Solving the Vlasov equation in two spatial dimensions with the Schrödinger method
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.
HESS Opinions: Linking Darcy's equation to the linear reservoir
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.
A novel approach for solving fractional Fisher equation using
Indian Academy of Sciences (India)
Differential transform method; fractional Fisher equation. ... confirmed by applying this method on different forms of functional equations. Author Affiliations. MIRZAZADEH M1. Department of Engineering Sciences, Faculty of Technology and ...
Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (3).
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 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.
The modified simple equation method for solving some fractional ...
Indian Academy of Sciences (India)
... and processes in various areas of natural science. Thus, many effective and powerful methods have been established and improved. In this study, we establish exact solutions of the time fractional biological population model equation and nonlinearfractional Klein–Gordon equation by using the modified simple equation ...
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.
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.
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.
The Embedding Method for Linear Partial Differential Equations
Indian Academy of Sciences (India)
The recently suggested embedding method to solve linear boundary value problems is here extended to cover situations where the domain of interest is unbounded or multiply connected. The extensions involve the use of complete sets of exterior and interior eigenfunctions on canonical domains. Applications to typical ...
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
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)
A Hamiltonian functional for the linearized Einstein vacuum field equations
International Nuclear Information System (INIS)
Rosas-RodrIguez, R
2005-01-01
By considering the Einstein vacuum field equations linearized about the Minkowski metric, the evolution equations for the gauge-invariant quantities characterizing the gravitational field are written in a Hamiltonian form by using a conserved functional as Hamiltonian; this Hamiltonian is not the analog of the energy of the field. A Poisson bracket between functionals of the field, compatible with the constraints satisfied by the field variables, is obtained. The generator of spatial translations associated with such bracket is also obtained
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…
Exp-function method for solving fractional partial differential equations.
Zheng, Bin
2013-01-01
We extend the Exp-function method to fractional partial differential equations in the sense of modified Riemann-Liouville derivative based on nonlinear fractional complex transformation. For illustrating the validity of this method, we apply it to the space-time fractional Fokas equation and the nonlinear fractional Sharma-Tasso-Olver (STO) equation. As a result, some new exact solutions for them are successfully established.
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.
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.
A Python Program for Solving Schro¨dinger's Equation in Undergraduate Physical Chemistry
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…
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
New non-linear modified massless Klein-Gordon equation
Energy Technology Data Exchange (ETDEWEB)
Asenjo, Felipe A. [Universidad Adolfo Ibanez, UAI Physics Center, Santiago (Chile); Universidad Adolfo Ibanez, Facultad de Ingenieria y Ciencias, Santiago (Chile); Hojman, Sergio A. [Universidad Adolfo Ibanez, UAI Physics Center, Santiago (Chile); Universidad Adolfo Ibanez, Departamento de Ciencias, Facultad de Artes Liberales, Santiago (Chile); Universidad de Chile, Departamento de Fisica, Facultad de Ciencias, Santiago (Chile); Centro de Recursos Educativos Avanzados, CREA, Santiago (Chile)
2017-11-15
The massless Klein-Gordon equation on arbitrary curved backgrounds allows for solutions which develop ''tails'' inside the light cone and, therefore, do not strictly follow null geodesics as discovered by DeWitt and Brehme almost 60 years ago. A modification of the massless Klein-Gordon equation is presented, which always exhibits null geodesic propagation of waves on arbitrary curved spacetimes. This new equation is derived from a Lagrangian which exhibits current-current interaction. Its non-linearity is due to a self-coupling term which is related to the quantum mechanical Bohm potential. (orig.)
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 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.
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
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…
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
Variable-mesh method of solving differential equations
Van Wyk, R.
1969-01-01
Multistep predictor-corrector method for numerical solution of ordinary differential equations retains high local accuracy and convergence properties. In addition, the method was developed in a form conducive to the generation of effective criteria for the selection of subsequent step sizes in step-by-step solution of differential equations.
Programmable calculator programs to solve softwood volume and value equations.
Janet K. Ayer. Sachet
1982-01-01
This paper presents product value and product volume equations as programs for handheld calculators. These tree equations are for inland Douglas-fir, young-growth Douglas-fir, western white pine, ponderosa pine, and western larch. Operating instructions and an example are included.
Application of the trial equation method for solving some nonlinear ...
Indian Academy of Sciences (India)
Therefore, our aim is just to find the function F. Liu has obtained a number of exact solutions to many nonlinear differential equations when F(u) is a polynomial or a rational function. ... In this study, we apply the trial equation method to seek exact solutions of the ... twice and setting the integration constant to zero, we have.
On an improved method for solving evolution equations of higher ...
African Journals Online (AJOL)
In this paper we introduce a new algebraic procedure to compute new classes of solutions of (1+1)-nonlinear partial differential equations (nPDEs) both of physical and technical relevance. The basic assumption is that the unknown solution(s) of the nPDE under consideration satisfy an ordinary differential equation (ODE) of ...
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.
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
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…
Nonoscillation criteria for half-linear second order difference equations
Czech Academy of Sciences Publication Activity Database
Došlý, Ondřej; Řehák, Pavel
2001-01-01
Roč. 42, - (2001), s. 453-464 ISSN 0898-1221 R&D Projects: GA ČR GA201/98/0677; GA ČR GA201/99/0295 Keywords : half-linear difference equation%nonoscillation criteria%variational principle Subject RIV: BA - General Mathematics Impact factor: 0.383, year: 2001
Lie symmetries and differential galois groups of linear equations
Oudshoorn, W.R.; Put, M. van der
2002-01-01
For a linear ordinary differential equation the Lie algebra of its infinitesimal Lie symmetries is compared with its differential Galois group. For this purpose an algebraic formulation of Lie symmetries is developed. It turns out that there is no direct relation between the two above objects. In
Asymptotic formulae for solutions of half-linear differential equations
Czech Academy of Sciences Publication Activity Database
Řehák, Pavel
2017-01-01
Roč. 292, January (2017), s. 165-177 ISSN 0096-3003 Institutional support: RVO:67985840 Keywords : half-linear differential equation * nonoscillatory solution * regular variation Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.738, year: 2016 http://www.sciencedirect.com/science/article/pii/S0096300316304581
On oscillation of second-order linear ordinary differential equations
Czech Academy of Sciences Publication Activity Database
Lomtatidze, A.; Šremr, Jiří
2011-01-01
Roč. 54, - (2011), s. 69-81 ISSN 1512-0015 Institutional research plan: CEZ:AV0Z10190503 Keywords : linear second-order ordinary differential equation * Kamenev theorem * oscillation Subject RIV: BA - General Mathematics http://www.rmi.ge/jeomj/memoirs/vol54/abs54-4.htm
Exponential estimates for solutions of half-linear differential equations
Czech Academy of Sciences Publication Activity Database
Řehák, Pavel
2015-01-01
Roč. 147, č. 1 (2015), s. 158-171 ISSN 0236-5294 Institutional support: RVO:67985840 Keywords : half-linear differential equation * decreasing solution * increasing solution * asymptotic behavior Subject RIV: BA - General Mathematics Impact factor: 0.469, year: 2015 http://link.springer.com/article/10.1007%2Fs10474-015-0522-9
An inhomogeneous wave equation and non-linear Diophantine approximation
DEFF Research Database (Denmark)
Beresnevich, V.; Dodson, M. M.; Kristensen, S.
2008-01-01
A non-linear Diophantine condition involving perfect squares and arising from an inhomogeneous wave equation on the torus guarantees the existence of a smooth solution. The exceptional set associated with the failure of the Diophantine condition and hence of the existence of a smooth solution...
On nonnegative solutions of second order linear functional differential equations
Czech Academy of Sciences Publication Activity Database
Lomtatidze, Alexander; Vodstrčil, Petr
2004-01-01
Roč. 32, č. 1 (2004), s. 59-88 ISSN 1512-0015 Institutional research plan: CEZ:AV0Z1019905 Keywords : second order linear functional differential equations * nonnegative solution * two-point boundary value problem Subject RIV: BA - General Mathematics
Radial solutions to semilinear elliptic equations via linearized operators
Directory of Open Access Journals (Sweden)
Phuong Le
2017-04-01
Full Text Available Let $u$ be a classical solution of semilinear elliptic equations in a ball or an annulus in $\\mathbb{R}^N$ with zero Dirichlet boundary condition where the nonlinearity has a convex first derivative. In this note, we prove that if the $N$-th eigenvalue of the linearized operator at $u$ is positive, then $u$ must be radially symmetric.
Minimal solution of linear formed fuzzy matrix equations
Directory of Open Access Journals (Sweden)
Maryam Mosleh
2012-10-01
Full Text Available In this paper according to the structured element method, the $mimes n$ inconsistent fuzzy matrix equation $Ailde{X}=ilde{B},$ which are linear formed by fuzzy structured element, is investigated. The necessary and sufficient condition for the existence of a fuzzy solution is also discussed. some examples are presented to illustrate the proposed method.
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.
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.
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.
Asymptotic solutions and spectral theory of linear wave equations
International Nuclear Information System (INIS)
Adam, J.A.
1982-01-01
This review contains two closely related strands. Firstly the asymptotic solution of systems of linear partial differential equations is discussed, with particular reference to Lighthill's method for obtaining the asymptotic functional form of the solution of a scalar wave equation with constant coefficients. Many of the applications of this technique are highlighted. Secondly, the methods and applications of the theory of the reduced (one-dimensional) wave equation - particularly spectral theory - are discussed. While the breadth of application and power of the techniques is emphasised throughout, the opportunity is taken to present to a wider readership, developments of the methods which have occured in some aspects of astrophysical (particularly solar) and geophysical fluid dynamics. It is believed that the topics contained herein may be of relevance to the applied mathematician or theoretical physicist interest in problems of linear wave propagation in these areas. (orig./HSI)
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
Dark energy cosmology with generalized linear equation of state
International Nuclear Information System (INIS)
Babichev, E; Dokuchaev, V; Eroshenko, Yu
2005-01-01
Dark energy with the usually used equation of state p = wρ, where w const 0 ), where the constants α and ρ 0 are free parameters. This non-homogeneous linear equation of state provides the description of both hydrodynamically stable (α > 0) and unstable (α < 0) fluids. In particular, the considered cosmological model describes the hydrodynamically stable dark (and phantom) energy. The possible types of cosmological scenarios in this model are determined and classified in terms of attractors and unstable points by using phase trajectories analysis. For the dark energy case, some distinctive types of cosmological scenarios are possible: (i) the universe with the de Sitter attractor at late times, (ii) the bouncing universe, (iii) the universe with the big rip and with the anti-big rip. In the framework of a linear equation of state the universe filled with a phantom energy, w < -1, may have either the de Sitter attractor or the big rip
Approximate Controllability for Linear Stochastic Differential Equations in Infinite Dimensions
International Nuclear Information System (INIS)
Goreac, D.
2009-01-01
The objective of the paper is to investigate the approximate controllability property of a linear stochastic control system with values in a separable real Hilbert space. In a first step we prove the existence and uniqueness for the solution of the dual linear backward stochastic differential equation. This equation has the particularity that in addition to an unbounded operator acting on the Y-component of the solution there is still another one acting on the Z-component. With the help of this dual equation we then deduce the duality between approximate controllability and observability. Finally, under the assumption that the unbounded operator acting on the state process of the forward equation is an infinitesimal generator of an exponentially stable semigroup, we show that the generalized Hautus test provides a necessary condition for the approximate controllability. The paper generalizes former results by Buckdahn, Quincampoix and Tessitore (Stochastic Partial Differential Equations and Applications, Series of Lecture Notes in Pure and Appl. Math., vol. 245, pp. 253-260, Chapman and Hall, London, 2006) and Goreac (Applied Analysis and Differential Equations, pp. 153-164, World Scientific, Singapore, 2007) from the finite dimensional to the infinite dimensional case
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
Solving delay differential equations in S-ADAPT by method of steps.
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.
A novel approach for solving fractional Fisher equation using ...
Indian Academy of Sciences (India)
Department of Engineering Sciences, Faculty of Technology and Engineering, East of ... The reliability, simplicity and cost-effectiveness of the method are confirmed by applying this ... Differential transform method; fractional Fisher equation.
Weighted particle method for solving the Boltzmann equation
International Nuclear Information System (INIS)
Tohyama, M.; Suraud, E.
1990-01-01
We propose a new, deterministic, method of solution of the nuclear Boltzmann equation. In this Weighted Particle Method two-body collisions are treated by a Master equation for an occupation probability of each numerical particle. We apply the method to the quadrupole motion of 12 C. A comparison with usual stochastic methods is made. Advantages and disadvantages of the Weighted Particle Method are discussed
Stochastic modeling of mode interactions via linear parabolized stability equations
Ran, Wei; Zare, Armin; Hack, M. J. Philipp; Jovanovic, Mihailo
2017-11-01
Low-complexity approximations of the Navier-Stokes equations have been widely used in the analysis of wall-bounded shear flows. In particular, the parabolized stability equations (PSE) and Floquet theory have been employed to capture the evolution of primary and secondary instabilities in spatially-evolving flows. We augment linear PSE with Floquet analysis to formally treat modal interactions and the evolution of secondary instabilities in the transitional boundary layer via a linear progression. To this end, we leverage Floquet theory by incorporating the primary instability into the base flow and accounting for different harmonics in the flow state. A stochastic forcing is introduced into the resulting linear dynamics to model the effect of nonlinear interactions on the evolution of modes. We examine the H-type transition scenario to demonstrate how our approach can be used to model nonlinear effects and capture the growth of the fundamental and subharmonic modes observed in direct numerical simulations and experiments.
Goldston, J. W.
This unit introduces analytic solutions of ordinary differential equations. The objective is to enable the student to decide whether a given function solves a given differential equation. Examples of problems from biology and chemistry are covered. Problem sets, quizzes, and a model exam are included, and answers to all items are provided. The…
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...
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
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.$
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.
Linear fractional diffusion-wave equation for scientists and engineers
Povstenko, Yuriy
2015-01-01
This book systematically presents solutions to the linear time-fractional diffusion-wave equation. It introduces the integral transform technique and discusses the properties of the Mittag-Leffler, Wright, and Mainardi functions that appear in the solutions. The time-nonlocal dependence between the flux and the gradient of the transported quantity with the “long-tail” power kernel results in the time-fractional diffusion-wave equation with the Caputo fractional derivative. Time-nonlocal generalizations of classical Fourier’s, Fick’s and Darcy’s laws are considered and different kinds of boundary conditions for this equation are discussed (Dirichlet, Neumann, Robin, perfect contact). The book provides solutions to the fractional diffusion-wave equation with one, two and three space variables in Cartesian, cylindrical and spherical coordinates. The respective sections of the book can be used for university courses on fractional calculus, heat and mass transfer, transport processes in porous media and ...
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.
Methods for solving the stochastic point reactor kinetic equations
International Nuclear Information System (INIS)
Quabili, E.R.; Karasulu, M.
1979-01-01
Two new methods are presented for analysis of the statistical properties of nonlinear outputs of a point reactor to stochastic non-white reactivity inputs. They are Bourret's approximation and logarithmic linearization. The results have been compared with the exact results, previously obtained in the case of Gaussian white reactivity input. It was found that when the reactivity noise has short correlation time, Bourret's approximation should be recommended because it yields results superior to those yielded by logarithmic linearization. When the correlation time is long, Bourret's approximation is not valid, but in that case, if one can assume the reactivity noise to be Gaussian, one may use the logarithmic linearization. (author)
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
A program package for solving linear optimization problems
International Nuclear Information System (INIS)
Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki
1980-09-01
Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)
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.
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
New Numerical Treatment for Solving the KDV Equation
Directory of Open Access Journals (Sweden)
khalid ali
2017-01-01
Full Text Available In the present article, a numerical method is proposed for the numerical solution of the KdV equation by using collocation method with the modified exponential cubic B-spline. In this paper we convert the KdV equation to system of two equations. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms2L, ?L are computed. Three invariants of motion are predestined to determine the preservation properties of the problem, and the numerical scheme leads to careful and active results. Furthermore, interaction of two and three solitary waves is shown. These results show that the technique introduced here is easy to apply.
DEFF Research Database (Denmark)
Barari, Amin; Ganjavi, B.; Jeloudar, M. Ghanbari
2010-01-01
and fluid mechanics. Design/methodology/approach – Two new but powerful analytical methods, namely, He's VIM and HPM, are introduced to solve some boundary value problems in structural engineering and fluid mechanics. Findings – Analytical solutions often fit under classical perturbation methods. However......, as with other analytical techniques, certain limitations restrict the wide application of perturbation methods, most important of which is the dependence of these methods on the existence of a small parameter in the equation. Disappointingly, the majority of nonlinear problems have no small parameter at all......Purpose – In the last two decades with the rapid development of nonlinear science, there has appeared ever-increasing interest of scientists and engineers in the analytical techniques for nonlinear problems. This paper considers linear and nonlinear systems that are not only regarded as general...
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.
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.
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
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.)
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.)
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
Wavelet Methods for Solving Fractional Order Differential Equations
A. K. Gupta; S. Saha Ray
2014-01-01
Fractional calculus is a field of applied mathematics which deals with derivatives and integrals of arbitrary orders. The fractional calculus has gained considerable importance during the past decades mainly due to its application in diverse fields of science and engineering such as viscoelasticity, diffusion of biological population, signal processing, electromagnetism, fluid mechanics, electrochemistry, and many more. In this paper, we review different wavelet methods for solving both linea...
Solving Multi-variate Polynomial Equations in a Finite Field
2013-06-01
hardware to encrypt and decrypt messages. Many of the AES predecessors use this Feistel structure (i.e. DES, Lucifer , Blowfish). However, AES does not...However, then it is very effective . The interesting aspect about the agreeing algorithm is that it can gain momentum to solve the system once RHSs are...columns from Lh can now be removed. This can create a ‘cascade effect ’ on the system and the system quickly reduces its size and complexity. Agreeing
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.
Projection-iteration methods for solving nonlinear operator equations
International Nuclear Information System (INIS)
Nguyen Minh Chuong; Tran thi Lan Anh; Tran Quoc Binh
1989-09-01
In this paper, the authors investigate a nonlinear operator equation in uniformly convex Banach spaces as in metric spaces by using stationary and nonstationary generalized projection-iteration methods. Convergence theorems in the strong and weak sense were established. (author). 7 refs
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.
Oscillatory solutions of the Cauchy problem for linear differential equations
Directory of Open Access Journals (Sweden)
Gro Hovhannisyan
2015-06-01
Full Text Available We consider the Cauchy problem for second and third order linear differential equations with constant complex coefficients. We describe necessary and sufficient conditions on the data for the existence of oscillatory solutions. It is known that in the case of real coefficients the oscillatory behavior of solutions does not depend on initial values, but we show that this is no longer true in the complex case: hence in practice it is possible to control oscillatory behavior by varying the initial conditions. Our Proofs are based on asymptotic analysis of the zeros of solutions, represented as linear combinations of exponential functions.
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.
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
Krylov subspace methods for solving large unsymmetric linear systems
International Nuclear Information System (INIS)
Saad, Y.
1981-01-01
Some algorithms based upon a projection process onto the Krylov subspace K/sub m/ = Span(r 0 , Ar 0 ,...,A/sup m/-1r 0 ) are developed, generalizing the method of conjugate gradients to unsymmetric systems. These methods are extensions of Arnoldi's algorithm for solving eigenvalue problems. The convergence is analyzed in terms of the distance of the solution to the subspace K/sub m/ and some error bounds are established showing, in particular, a similarity with the conjugate gradient method (for symmetric matrices) when the eigenvalues are real. Several numerical experiments are described and discussed
The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.
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.
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.
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving
Bransen, Jeroen; van Binsbergen, L.Thomas; Claessen, Koen; Dijkstra, Atze
2015-01-01
Many computations over trees can be specified using attribute grammars. Compilers for attribute grammars need to find an evaluation order (or schedule) in order to generate efficient code. For the class of linearly ordered attribute grammars such a schedule can be found statically, but this problem
Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems
Czech Academy of Sciences Publication Activity Database
Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav
2014-01-01
Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014
Hybrid Method for Solving Inventory Problems with a Linear ...
African Journals Online (AJOL)
Osagiede and Omosigho (2004) proposed a direct search method for identifying the number of replenishment when the demand pattern is linearly increasing. The main computational task in this direct search method was associated with finding the optimal number of replenishments. To accelerate the use of this method, the ...
Numerical treatments for solving nonlinear mixed integral equation
Directory of Open Access Journals (Sweden)
M.A. Abdou
2016-12-01
Full Text Available We consider a mixed type of nonlinear integral equation (MNLIE of the second kind in the space C[0,T]×L2(Ω,T<1. The Volterra integral terms (VITs are considered in time with continuous kernels, while the Fredholm integral term (FIT is considered in position with singular general kernel. Using the quadratic method and separation of variables method, we obtain a nonlinear system of Fredholm integral equations (NLSFIEs with singular kernel. A Toeplitz matrix method, in each case, is then used to obtain a nonlinear algebraic system. Numerical results are calculated when the kernels take a logarithmic form or Carleman function. Moreover, the error estimates, in each case, are then computed.
Algorithm for solving polynomial algebraic Riccati equations and its application
Czech Academy of Sciences Publication Activity Database
Augusta, Petr; Augustová, Petra
2012-01-01
Roč. 1, č. 4 (2012), s. 237-242 ISSN 2223-7038 R&D Projects: GA ČR GPP103/12/P494 Institutional support: RVO:67985556 Keywords : Numerical algorithms * algebraic Riccati equation * spatially distributed systems * optimal control Subject RIV: BC - Control Systems Theory http://lib.physcon.ru/doc?id=8b4876d6a57d
Solving singular convolution equations using the inverse fast Fourier transform
Czech Academy of Sciences Publication Activity Database
Krajník, E.; Montesinos, V.; Zizler, P.; Zizler, Václav
2012-01-01
Roč. 57, č. 5 (2012), s. 543-550 ISSN 0862-7940 R&D Projects: GA AV ČR IAA100190901 Institutional research plan: CEZ:AV0Z10190503 Keywords : singular convolution equations * fast Fourier transform * tempered distribution Subject RIV: BA - General Mathematics Impact factor: 0.222, year: 2012 http://www.springerlink.com/content/m8437t3563214048/
HEXAN - a hexagonal nodal code for solving the diffusion equation
International Nuclear Information System (INIS)
Makai, M.
1982-07-01
This report describes the theory of and provides a user's manual for the HEXAN program, which is a nodal program for the solution of the few-group diffusion equation in hexagonal geometry. Based upon symmetry considerations, the theory provides an analytical solution in a homogeneous node. WWER and HTGR test problem solutions are presented. The equivalence of the finite-difference scheme and the response matrix method is proven. The properties of a symmetric node's response matrix are investigated. (author)
Refined Fuchs inequalities for systems of linear differential equations
International Nuclear Information System (INIS)
Gontsov, R R
2004-01-01
We refine the Fuchs inequalities obtained by Corel for systems of linear meromorphic differential equations given on the Riemann sphere. Fuchs inequalities enable one to estimate the sum of exponents of the system over all its singular points. We refine these well-known inequalities by considering the Jordan structure of the leading coefficient of the Laurent series for the matrix of the right-hand side of the system in the neighbourhood of a singular point
Inhomogeneous linear equation in Rota-Baxter algebra
Pietrzkowski, Gabriel
2014-01-01
We consider a complete filtered Rota-Baxter algebra of weight $\\lambda$ over a commutative ring. Finding the unique solution of a non-homogeneous linear algebraic equation in this algebra, we generalize Spitzer's identity in both commutative and non-commutative cases. As an application, considering the Rota-Baxter algebra of power series in one variable with q-integral as the Rota-Baxter operator, we show certain Eulerian identities.
A general method for enclosing solutions of interval linear equations
Czech Academy of Sciences Publication Activity Database
Rohn, Jiří
2012-01-01
Roč. 6, č. 4 (2012), s. 709-717 ISSN 1862-4472 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval linear equations * solution set * enclosure * absolute value inequality Subject RIV: BA - General Mathematics Impact factor: 1.654, year: 2012
Disformal invariance of continuous media with linear equation of state
Energy Technology Data Exchange (ETDEWEB)
Celoria, Marco [Gran Sasso Science Institute (INFN), Viale Francesco Crispi 7, L' Aquila, I-67100 Italy (Italy); Matarrese, Sabino [Dipartimento di Fisica e Astronomia ' G. Galilei' , Università degli Studi di Padova, via Marzolo 8, Padova, I-35131 Italy (Italy); Pilo, Luigi, E-mail: marco.celoria@gssi.infn.it, E-mail: sabino.matarrese@pd.infn.it, E-mail: luigi.pilo@aquila.infn.it [Dipartimento di Fisica, Università di L' Aquila, L' Aquila, I-67010 Italy (Italy)
2017-02-01
We show that the effective theory describing single component continuous media with a linear and constant equation of state of the form p = w ρ is invariant under a 1-parameter family of continuous disformal transformations. In the special case of w =1/3 (ultrarelativistic gas), such a family reduces to conformal transformations. As examples, perfect fluids, irrotational dust (mimetic matter) and homogeneous and isotropic solids are discussed.
Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (4).
Murase, Kenya
2016-01-01
Partial differential equations are often used in the field of medical physics. In this (final) issue, the methods for solving the partial differential equations were introduced, which include separation of variables, integral transform (Fourier and Fourier-sine transforms), Green's function, and series expansion methods. Some examples were also introduced, in which the integral transform and Green's function methods were applied to solving Pennes' bioheat transfer equation and the Fourier series expansion method was applied to Navier-Stokes equation for analyzing the wall shear stress in blood vessels.Finally, the author hopes that this series will be helpful for people who engage in medical physics.
Solving 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
Nonlinear and linear wave equations for propagation in media with frequency power law losses
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.
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)
A predictor-corrector scheme for solving the Volterra integral equation
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
MPFA algorithm for solving stokes-brinkman equations on quadrilateral grids
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
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 ...
Solving the interval type-2 fuzzy polynomial equation using the ranking method
Rahman, Nurhakimah Ab.; Abdullah, Lazim
2014-07-01
Polynomial equations with trapezoidal and triangular fuzzy numbers have attracted some interest among researchers in mathematics, engineering and social sciences. There are some methods that have been developed in order to solve these equations. In this study we are interested in introducing the interval type-2 fuzzy polynomial equation and solving it using the ranking method of fuzzy numbers. The ranking method concept was firstly proposed to find real roots of fuzzy polynomial equation. Therefore, the ranking method is applied to find real roots of the interval type-2 fuzzy polynomial equation. We transform the interval type-2 fuzzy polynomial equation to a system of crisp interval type-2 fuzzy polynomial equation. This transformation is performed using the ranking method of fuzzy numbers based on three parameters, namely value, ambiguity and fuzziness. Finally, we illustrate our approach by numerical example.
Solving 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....
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....
An Algorithm for Solving the Absolute Value Equation
Czech Academy of Sciences Publication Activity Database
Rohn, Jiří
2009-01-01
Roč. 18, - (2009), s. 589-599 E-ISSN 1081-3810 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : absolute value equation * algorithm * regularity * singularity * theorem of the alternatives Subject RIV: BA - General Mathematics Impact factor: 0.892, year: 2009 http://www.math.technion.ac.il/iic/ ela / ela -articles/articles/vol18_pp589-599.pdf
Runge-Kutta Methods for Linear Ordinary Differential Equations
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.
Directory of Open Access Journals (Sweden)
Behzad Ghanbari
2014-01-01
Full Text Available We aim to study the convergence of the homotopy analysis method (HAM in short for solving special nonlinear Volterra-Fredholm integrodifferential equations. The sufficient condition for the convergence of the method is briefly addressed. Some illustrative examples are also presented to demonstrate the validity and applicability of the technique. Comparison of the obtained results HAM with exact solution shows that the method is reliable and capable of providing analytic treatment for solving such equations.
From baking a cake to solving the diffusion equation
Olszewski, Edward A.
2006-06-01
We explain how modifying a cake recipe by changing either the dimensions of the cake or the amount of cake batter alters the baking time. We restrict our consideration to the génoise and obtain a semiempirical relation for the baking time as a function of oven temperature, initial temperature of the cake batter, and dimensions of the unbaked cake. The relation, which is based on the diffusion equation, has three parameters whose values are estimated from data obtained by baking cakes in cylindrical pans of various diameters. The relation takes into account the evaporation of moisture at the top surface of the cake, which is the dominant factor affecting the baking time of a cake.
A generalized trial solution method for solving the aerosol equation
International Nuclear Information System (INIS)
Simons, S.; Simpson, D.R.
1988-01-01
It is shown how the introduction of orthogonal functions together with a time-dependent scaling factor may be used to develop a generalized trial solution method for tackling the aerosol equation. The approach is worked out in detail for the case where the initial particle size spectrum follows a γ-distribution, and it is shown to be a viable technique as long as the initial volume fraction of particulate material is not too large. The method is applied to several situations of interest, and is shown to give more accurate results (with marginally shorter computing times) than are given by the three-parameter log-normal or γ distribution trial functions. (author)
Extensions of the auxiliary field method to solve Schroedinger equations
International Nuclear Information System (INIS)
Silvestre-Brac, Bernard; Semay, Claude; Buisseret, Fabien
2008-01-01
It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schroedinger equation. This technique can generate the spectrum associated with an arbitrary potential V(r) starting from the analytically known spectrum of a particular potential P(r). In the present work, general important properties of the auxiliary field method are proved, such as scaling laws and independence of the results on the choice of P(r). The method is extended in order to find accurate analytical energy formulae for radial potentials of the form aP(r) + V(r), and several explicit examples are studied. Connections existing between the perturbation theory and the auxiliary field method are also discussed
Extensions of the auxiliary field method to solve Schroedinger equations
Energy Technology Data Exchange (ETDEWEB)
Silvestre-Brac, Bernard [LPSC Universite Joseph Fourier, Grenoble 1, CNRS/IN2P3, Institut Polytechnique de Grenoble, Avenue des Martyrs 53, F-38026 Grenoble-Cedex (France); Semay, Claude; Buisseret, Fabien [Groupe de Physique Nucleaire Theorique, Universite de Mons-Hainaut, Academie universitaire Wallonie-Bruxelles, Place du Parc 20, B-7000 Mons (Belgium)], E-mail: silvestre@lpsc.in2p3.fr, E-mail: claude.semay@umh.ac.be, E-mail: fabien.buisseret@umh.ac.be
2008-10-24
It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schroedinger equation. This technique can generate the spectrum associated with an arbitrary potential V(r) starting from the analytically known spectrum of a particular potential P(r). In the present work, general important properties of the auxiliary field method are proved, such as scaling laws and independence of the results on the choice of P(r). The method is extended in order to find accurate analytical energy formulae for radial potentials of the form aP(r) + V(r), and several explicit examples are studied. Connections existing between the perturbation theory and the auxiliary field method are also discussed.
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
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-01-01
Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.
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.
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)
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
A simple method for solving the Bussian equation for electrical conduction in rocks
Directory of Open Access Journals (Sweden)
P. W. J. Glover
2010-09-01
Full Text Available One of the most general and effective models for calculating the complex electrical conductivity and relative dielectric permittivity of rocks saturated with pore fluids is that of Bussian. Unlike most models, it is non-linear and cannot be solved algebraically. Consequently, researchers use reiterating numerical routines to obtain a solution of the equation, and then only for the real part of the solution. Here we present a different approach to the solution that uses conformal mapping in the complex plane, and implements it within Maple^{TM}. The method is simple and elegant in that it requires, for example, only 3 lines of code in Maple^{TM} 11 and little programming experience. The approach has been shown to be as precise as using the classical reiterating bisection method for real data implemented in C++ on an ordinary desktop computer to within a probability over 1 in 10^{9}. However, the conformal mapping approach is 52 times as fast. We show once more that the Bussian equation breaks down for low fluid conductivities, but recommend it (with the modified Archie's law for use with rocks saturated with high salinity fluids when the matrix is conductive.
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 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 Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems
International Nuclear Information System (INIS)
Hykes, J. M.; Ferrer, R. M.
2013-01-01
The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is 98 Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)
Directory of Open Access Journals (Sweden)
Ai-Min Yang
2014-01-01
Full Text Available We use the local fractional series expansion method to solve the Klein-Gordon equations on Cantor sets within the local fractional derivatives. The analytical solutions within the nondifferential terms are discussed. The obtained results show the simplicity and efficiency of the present technique with application to the problems of the liner differential equations on Cantor sets.
Local Fractional Series Expansion Method for Solving Wave and Diffusion Equations on Cantor Sets
Directory of Open Access Journals (Sweden)
Ai-Min Yang
2013-01-01
Full Text Available We proposed a local fractional series expansion method to solve the wave and diffusion equations on Cantor sets. Some examples are given to illustrate the efficiency and accuracy of the proposed method to obtain analytical solutions to differential equations within the local fractional derivatives.
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.
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)
On the Efficiency of Algorithms for Solving Hartree–Fock and Kohn–Sham Response Equations
DEFF Research Database (Denmark)
Kauczor, Joanna; Jørgensen, Poul; Norman, Patrick
2011-01-01
The response equations as occurring in the Hartree–Fock, multiconfigurational self-consistent field, and Kohn–Sham density functional theory have identical matrix structures. The algorithms that are used for solving these equations are discussed, and new algorithms are proposed where trial vectors...
Didis, Makbule Gozde; Erbas, Ayhan Kursat
2015-01-01
This study attempts to investigate the performance of tenth-grade students in solving quadratic equations with one unknown, using symbolic equation and word-problem representations. The participants were 217 tenth-grade students, from three different public high schools. Data was collected through an open-ended questionnaire comprising eight…
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)
Solving eigenvalue response matrix equations with nonlinear techniques
International Nuclear Information System (INIS)
Roberts, Jeremy A.; Forget, Benoit
2014-01-01
Highlights: • High performance solvers were applied within ERMM for the first time. • Accelerated fixed-point methods were developed that reduce computational times by 2–3. • A nonlinear, Newton-based ERMM led to similar improvement and more robustness. • A 3-D, SN-based ERMM shows how ERMM can apply fine-mesh methods to full-core analysis. - Abstract: This paper presents new algorithms for use in the eigenvalue response matrix method (ERMM) for reactor eigenvalue problems. ERMM spatially decomposes a domain into independent nodes linked via boundary conditions approximated as truncated orthogonal expansions, the coefficients of which are response functions. In its simplest form, ERMM consists of a two-level eigenproblem: an outer Picard iteration updates the k-eigenvalue via balance, while the inner λ-eigenproblem imposes neutron balance between nodes. Efficient methods are developed for solving the inner λ-eigenvalue problem within the outer Picard iteration. Based on results from several diffusion and transport benchmark models, it was found that the Krylov–Schur method applied to the λ-eigenvalue problem reduces Picard solver times (excluding response generation) by a factor of 2–5. Furthermore, alternative methods, including Picard acceleration schemes, Steffensen’s method, and Newton’s method, are developed in this paper. These approaches often yield faster k-convergence and a need for fewer k-dependent response function evaluations, which is important because response generation is often the primary cost for problems using responses computed online (i.e., not from a precomputed database). Accelerated Picard iteration was found to reduce total computational times by 2–3 compared to the unaccelerated case for problems dominated by response generation. In addition, Newton’s method was found to provide nearly the same performance with improved robustness
Dielectric metasurfaces solve differential and integro-differential equations.
Abdollahramezani, Sajjad; Chizari, Ata; Dorche, Ali Eshaghian; Jamali, Mohammad Vahid; Salehi, Jawad A
2017-04-01
Leveraging subwavelength resonant nanostructures, plasmonic metasurfaces have recently attracted much attention as a breakthrough concept for engineering optical waves both spatially and spectrally. However, inherent ohmic losses concomitant with low coupling efficiencies pose fundamental impediments over their practical applications. Not only can all-dielectric metasurfaces tackle such substantial drawbacks, but also their CMOS-compatible configurations support both Mie resonances that are invariant to the incident angle. Here, we report on a transmittive metasurface comprising arrayed silicon nanodisks embedded in a homogeneous dielectric medium to manipulate phase and amplitude of incident light locally and almost independently. By taking advantage of the interplay between the electric/magnetic resonances and employing general concepts of spatial Fourier transformation, a highly efficient metadevice is proposed to perform mathematical operations including solution of ordinary differential and integro-differential equations with constant coefficients. Our findings further substantiate dielectric metasurfaces as promising candidates for miniaturized, two-dimensional, and planar optical analog computing systems that are much thinner than their conventional lens-based counterparts.
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...
Chaotic dynamics and diffusion in a piecewise linear equation
International Nuclear Information System (INIS)
Shahrear, Pabel; Glass, Leon; Edwards, Rod
2015-01-01
Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems
Chaotic dynamics and diffusion in a piecewise linear equation
Shahrear, Pabel; Glass, Leon; Edwards, Rod
2015-03-01
Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.
KAM for the non-linear Schroedinger equation
Eliasson, L H
2006-01-01
We consider the $d$-dimensional nonlinear Schr\\"o\\-dinger equation under periodic boundary conditions:-i\\dot u=\\Delta u+V(x)*u+\\ep|u|^2u;\\quad u=u(t,x),\\;x\\in\\T^dwhere $V(x)=\\sum \\hat V(a)e^{i\\sc{a,x}}$ is an analytic function with $\\hat V$ real. (This equation is a popular model for the `real' NLS equation, where instead of the convolution term $V*u$ we have the potential term $Vu$.) For $\\ep=0$ the equation is linear and has time--quasi-periodic solutions $u$,u(t,x)=\\sum_{s\\in \\AA}\\hat u_0(a)e^{i(|a|^2+\\hat V(a))t}e^{i\\sc{a,x}}, \\quad 0<|\\hat u_0(a)|\\le1,where $\\AA$ is any finite subset of $\\Z^d$. We shall treat $\\omega_a=|a|^2+\\hat V(a)$, $a\\in\\AA$, as free parameters in some domain $U\\subset\\R^{\\AA}$. This is a Hamiltonian system in infinite degrees of freedom, degenerate but with external parameters, and we shall describe a KAM-theory which, in particular, will have the following consequence: \\smallskip {\\it If $|\\ep|$ is sufficiently small, then there is a large subset $U'$ of $U$ such that for all $...
International Nuclear Information System (INIS)
Koleshko, S.B.
1989-01-01
A three-parametric set of difference schemes is suggested to solve Navier-Stokes equations with the use of the relaxation form of the continuity equation. The initial equations are stated for time increments. Use is made of splitting the operator into one-dimensional forms that reduce calculations to scalar factorizations. Calculated results for steady- and unsteady-state flows in a cavity are presented
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
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.
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)
Approximate solution to neutron transport equation with linear anisotropic scattering
International Nuclear Information System (INIS)
Coppa, G.; Ravetto, P.; Sumini, M.
1983-01-01
A method to obtain an approximate solution to the transport equation, when both sources and collisions show a linearly anisotropic behavior, is outlined and the possible implications for numerical calculations in applied neutronics as well as shielding evaluations are investigated. The form of the differential system of equations taken by the method is quite handy and looks simpler and more manageable than any other today available technique. To go deeper into the efficiency of the method, some typical calculations concerning critical dimension of multiplying systems are then performed and the results are compared with the ones coming from the classical Ssub(N) approximations. The outcome of such calculations leads us to think of interesting developments of the method which could be quite useful in alternative to other today widespread approximate procedures, for any geometry, but especially for curved ones. (author)
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.
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.
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.
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)
First order linear ordinary differential equations in associative algebras
Directory of Open Access Journals (Sweden)
Gordon Erlebacher
2004-01-01
Full Text Available In this paper, we study the linear differential equation $$ frac{dx}{dt}=sum_{i=1}^n a_i(t x b_i(t + f(t $$ in an associative but non-commutative algebra $mathcal{A}$, where the $b_i(t$ form a set of commuting $mathcal{A}$-valued functions expressed in a time-independent spectral basis consisting of mutually annihilating idempotents and nilpotents. Explicit new closed solutions are derived, and examples are presented to illustrate the theory.
A Solution to the Fundamental Linear Fractional Order Differential Equation
Hartley, Tom T.; Lorenzo, Carl F.
1998-01-01
This paper provides a solution to the fundamental linear fractional order differential equation, namely, (sub c)d(sup q, sub t) + ax(t) = bu(t). The impulse response solution is shown to be a series, named the F-function, which generalizes the normal exponential function. The F-function provides the basis for a qth order "fractional pole". Complex plane behavior is elucidated and a simple example, the inductor terminated semi- infinite lossy line, is used to demonstrate the theory.
Linear stochastic differential equations with anticipating initial conditions
DEFF Research Database (Denmark)
Khalifa, Narjess; Kuo, Hui-Hsiung; Ouerdiane, Habib
In this paper we use the new stochastic integral introduced by Ayed and Kuo (2008) and the results obtained by Kuo et al. (2012b) to find a solution to a drift-free linear stochastic differential equation with anticipating initial condition. Our solution is based on well-known results from...... classical Itô theory and anticipative Itô formula results from Kue et al. (2012b). We also show that the solution obtained by our method is consistent with the solution obtained by the methods of Malliavin calculus, e.g. Buckdahn and Nualart (1994)....
Oscillation of solutions of some higher order linear differential equations
Directory of Open Access Journals (Sweden)
Hong-Yan Xu
2009-11-01
Full Text Available In this paper, we deal with the order of growth and the hyper order of solutions of higher order linear differential equations $$f^{(k}+B_{k-1}f^{(k-1}+\\cdots+B_1f'+B_0f=F$$ where $B_j(z (j=0,1,\\ldots,k-1$ and $F$ are entire functions or polynomials. Some results are obtained which improve and extend previous results given by Z.-X. Chen, J. Wang, T.-B. Cao and C.-H. Li.
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
Fast solution of elliptic partial differential equations using linear combinations of plane waves.
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.
M. ZANGIABADI; H. R. MALEKI
2007-01-01
In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...
A new scheme for solving inhomogeneous Boltzmann equation for electrons in weakly ionised gases
International Nuclear Information System (INIS)
Mahmoud, M.O.M.; Yousfi, M.
1995-01-01
In the case of weakly ionized gases, the numerical treatment of non-hydrodynamic regime involving spatial variation of distribution function due to boundaries (walls, electrodes, electron source, etc hor-ellipsis) by using direct Boltzmann equation always constitute a challenge if the main collisional processes occurring in non thermal plasmas are to be considered (elastic, inelastic and super-elastic collisions, Penning ionisation, Coulomb interactions, etc hor-ellipsis). In the non-thermal discharge modelling, the inhomogeneous electron Boltzmann equation is needed in order to be coupled for example to a fluid model to take into account the electron non-hydrodynamic effects. This is for example the case of filamentary discharge, in which the space charge electric field due to streamer propagation has a very sharp spatial profile thus leading to important space non-hydrodynamic effects. It is also the case of the cathodic zone of glow discharge where electric field has a rapid spatial decrease until the negative glow. In the present work, a new numerical scheme is proposed to solve the inhomogeneous Boltzmann equation for electrons in the framework of two-term approximation (TTA) taking into account elastic and inelastic processes. Such a method has the usual drawbacks associated with the TTA i.e. not an accurate enough at high E/N values or in presence of high inelastic processes. But the accuracy of this method is considered sufficient because in a next step it is destinated to be coupled to fluid model for charged particles and a chemical kinetic model where the accuracy is of the same order of magnitude or worse. However there are numerous advantages of this method concerning time computing, treatment of non-linear collision processes (Coulomb, Penning, etc hor-ellipsis)
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
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.
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.
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).
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.
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.)
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.
A fast, parallel algorithm to solve the basic fluvial erosion/transport equations
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
Unsteady Solution of Non-Linear Differential Equations Using Walsh Function Series
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.
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
Will learning to solve one-step equations pose a challenge to 8th grade students?
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.
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)
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.
Solving non-linear Horn clauses using a linear Horn clause solver
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick; Ganty, Pierre
2016-01-01
In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn...... clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm...... dimension. We constructed a prototype implementation of this approach and performed some experiments on a set of verification problems, which shows some promise....
An algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equations
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.
Directory of Open Access Journals (Sweden)
N.M. Ghasem
2003-12-01
Full Text Available In this paper, the simulink block diagram is used to solve a model consists of a set of ordinary differential and algebraic equations to control the temperature inside a simple stirred tank heater. The flexibility of simulink block diagram gives students a better understanding of the control systems. The simulink also allows solution of mathematical models and easy visualization of the system variables. A polyethylene fluidized bed reactor is considered as an industrial example and the effect of the Proportional, Integral and Derivative control policy is presented for comparison.
Solving inverse problems for biological models using the collage method for differential equations.
Capasso, V; Kunze, H E; La Torre, D; Vrscay, E R
2013-07-01
In the first part of this paper we show how inverse problems for differential equations can be solved using the so-called collage method. Inverse problems can be solved by minimizing the collage distance in an appropriate metric space. We then provide several numerical examples in mathematical biology. We consider applications of this approach to the following areas: population dynamics, mRNA and protein concentration, bacteria and amoeba cells interaction, tumor growth.
Inverse Boundary Value Problem for Non-linear Hyperbolic Partial Differential Equations
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...
Benhammouda, Brahim
2016-01-01
Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems.
A Fortran program (RELAX3D) to solve the 3 dimensional Poisson (Laplace) equation
International Nuclear Information System (INIS)
Houtman, H.; Kost, C.J.
1983-09-01
RELAX3D is an efficient, user friendly, interactive FORTRAN program which solves the Poisson (Laplace) equation Λ 2 =p for a general 3 dimensional geometry consisting of Dirichlet and Neumann boundaries approximated to lie on a regular 3 dimensional mesh. The finite difference equations at these nodes are solved using a successive point-iterative over-relaxation method. A menu of commands, supplemented by HELP facility, controls the dynamic loading of the subroutine describing the problem case, the iterations to converge to a solution, and the contour plotting of any desired slices, etc
A predictor-corrector scheme for solving the Volterra integral equation
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.
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.
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)
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
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
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
Chedjou, Jean Chamberlain; Kyamakya, Kyandoghere
2015-04-01
This paper develops and validates a comprehensive and universally applicable computational concept for solving nonlinear differential equations (NDEs) through a neurocomputing concept based on cellular neural networks (CNNs). High-precision, stability, convergence, and lowest-possible memory requirements are ensured by the CNN processor architecture. A significant challenge solved in this paper is that all these cited computing features are ensured in all system-states (regular or chaotic ones) and in all bifurcation conditions that may be experienced by NDEs.One particular quintessence of this paper is to develop and demonstrate a solver concept that shows and ensures that CNN processors (realized either in hardware or in software) are universal solvers of NDE models. The solving logic or algorithm of given NDEs (possible examples are: Duffing, Mathieu, Van der Pol, Jerk, Chua, Rössler, Lorenz, Burgers, and the transport equations) through a CNN processor system is provided by a set of templates that are computed by our comprehensive templates calculation technique that we call nonlinear adaptive optimization. This paper is therefore a significant contribution and represents a cutting-edge real-time computational engineering approach, especially while considering the various scientific and engineering applications of this ultrafast, energy-and-memory-efficient, and high-precise NDE solver concept. For illustration purposes, three NDE models are demonstratively solved, and related CNN templates are derived and used: the periodically excited Duffing equation, the Mathieu equation, and the transport equation.
Wu, Zedong
2018-04-05
Numerical simulation of the acoustic wave equation in either isotropic or anisotropic media is crucial to seismic modeling, imaging and inversion. Actually, it represents the core computation cost of these highly advanced seismic processing methods. However, the conventional finite-difference method suffers from severe numerical dispersion errors and S-wave artifacts when solving the acoustic wave equation for anisotropic media. We propose a method to obtain the finite-difference coefficients by comparing its numerical dispersion with the exact form. We find the optimal finite difference coefficients that share the dispersion characteristics of the exact equation with minimal dispersion error. The method is extended to solve the acoustic wave equation in transversely isotropic (TI) media without S-wave artifacts. Numerical examples show that the method is is highly accurate and efficient.
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.
Half-trek criterion for generic identifiability of linear structural equation models
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
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
Explicit estimating equations for semiparametric generalized linear latent variable models
Ma, Yanyuan
2010-07-05
We study generalized linear latent variable models without requiring a distributional assumption of the latent variables. Using a geometric approach, we derive consistent semiparametric estimators. We demonstrate that these models have a property which is similar to that of a sufficient complete statistic, which enables us to simplify the estimating procedure and explicitly to formulate the semiparametric estimating equations. We further show that the explicit estimators have the usual root n consistency and asymptotic normality. We explain the computational implementation of our method and illustrate the numerical performance of the estimators in finite sample situations via extensive simulation studies. The advantage of our estimators over the existing likelihood approach is also shown via numerical comparison. We employ the method to analyse a real data example from economics. © 2010 Royal Statistical Society.
Predoi, Mihai Valentin
2014-09-01
The dispersion curves for hollow multilayered cylinders are prerequisites in any practical guided waves application on such structures. The equations for homogeneous isotropic materials have been established more than 120 years ago. The difficulties in finding numerical solutions to analytic expressions remain considerable, especially if the materials are orthotropic visco-elastic as in the composites used for pipes in the last decades. Among other numerical techniques, the semi-analytical finite elements method has proven its capability of solving this problem. Two possibilities exist to model a finite elements eigenvalue problem: a two-dimensional cross-section model of the pipe or a radial segment model, intersecting the layers between the inner and the outer radius of the pipe. The last possibility is here adopted and distinct differential problems are deduced for longitudinal L(0,n), torsional T(0,n) and flexural F(m,n) modes. Eigenvalue problems are deduced for the three modes classes, offering explicit forms of each coefficient for the matrices used in an available general purpose finite elements code. Comparisons with existing solutions for pipes filled with non-linear viscoelastic fluid or visco-elastic coatings as well as for a fully orthotropic hollow cylinder are all proving the reliability and ease of use of this method. Copyright © 2014 Elsevier B.V. All rights reserved.
Brehm, Christoph; Barad, Michael F.; Kiris, Cetin C.
2016-01-01
An immersed boundary method for the compressible Navier-Stokes equation and the additional infrastructure that is needed to solve moving boundary problems and fully coupled fluid-structure interaction is described. All the methods described in this paper were implemented in NASA's LAVA solver framework. The underlying immersed boundary method is based on the locally stabilized immersed boundary method that was previously introduced by the authors. In the present paper this method is extended to account for all aspects that are involved for fluid structure interaction simulations, such as fast geometry queries and stencil computations, the treatment of freshly cleared cells, and the coupling of the computational fluid dynamics solver with a linear structural finite element method. The current approach is validated for moving boundary problems with prescribed body motion and fully coupled fluid structure interaction problems in 2D and 3D. As part of the validation procedure, results from the second AIAA aeroelastic prediction workshop are also presented. The current paper is regarded as a proof of concept study, while more advanced methods for fluid structure interaction are currently being investigated, such as geometric and material nonlinearities, and advanced coupling approaches.
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
On a numereeical method for solving the Faddv integral equation without deformation of contour
International Nuclear Information System (INIS)
Belyaev, V.O.; Moller, K.
1976-01-01
A numerical method is proposed for solving the Faddeev equation for separable potentials at positive total energy. The method is based on the fact that after applying a simple interpolation procedure the logarithmic singularities in the kernel of the integral equation can be extracted in the same way as usually the pole singularity is extracted. The method has been applied to calculate the eigenvalues of the Faddeev kernel
The ATOMFT integrator - Using Taylor series to solve ordinary differential equations
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.
Cortes, Adriano Mauricio; Vignal, Philippe; Sarmiento, Adel; Garcí a, Daniel O.; Collier, Nathan; Dalcin, Lisandro; Calo, Victor M.
2014-01-01
In this paper we present PetIGA, a high-performance implementation of Isogeometric Analysis built on top of PETSc. We show its use in solving nonlinear and time-dependent problems, such as phase-field models, by taking advantage of the high-continuity of the basis functions granted by the isogeometric framework. In this work, we focus on the Cahn-Hilliard equation and the phase-field crystal equation.
Waleed K. Ahmed
2013-01-01
The present paper demonstrates the route used for solving differential equations for the engineering applications at UAEU. Usually students at the Engineering Requirements Unit (ERU) stage of the Faculty of Engineering at the UAEU must enroll in a course of Differential Equations and Engineering Applications (MATH 2210) as a prerequisite for the subsequent stages of their study. Mainly, one of the objectives of this course is that the students practice MATLAB software package during the cours...
New Approaches for Solving Fokker Planck Equation on Cantor Sets within Local Fractional Operators
Directory of Open Access Journals (Sweden)
Hassan Kamil Jassim
2015-01-01
Full Text Available We discuss new approaches to handling Fokker Planck equation on Cantor sets within local fractional operators by using the local fractional Laplace decomposition and Laplace variational iteration methods based on the local fractional calculus. The new approaches maintain the efficiency and accuracy of the analytical methods for solving local fractional differential equations. Illustrative examples are given to show the accuracy and reliable results.
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)
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.
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)
Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation.
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.
Imaginary Time Step Method to Solve the Dirac Equation with Nonlocal Potential
International Nuclear Information System (INIS)
Zhang Ying; Liang Haozhao; Meng Jie
2009-01-01
The imaginary time step (ITS) method is applied to solve the Dirac equation with nonlocal potentials in coordinate space. Taking the nucleus 12 C as an example, even with nonlocal potentials, the direct ITS evolution for the Dirac equation still meets the disaster of the Dirac sea. However, following the recipe in our former investigation, the disaster can be avoided by the ITS evolution for the corresponding Schroedinger-like equation without localization, which gives the convergent results exactly the same with those obtained iteratively by the shooting method with localized effective potentials.
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.
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
Solving Nonlinear Fractional Differential Equation by Generalized Mittag-Leffler Function Method
Arafa, A. A. M.; Rida, S. Z.; Mohammadein, A. A.; Ali, H. M.
2013-06-01
In this paper, we use Mittag—Leffler function method for solving some nonlinear fractional differential equations. A new solution is constructed in power series. The fractional derivatives are described by Caputo's sense. To illustrate the reliability of the method, some examples are provided.
Optimal Homotopy Asymptotic Method for Solving System of Fredholm Integral Equations
Directory of Open Access Journals (Sweden)
Bahman Ghazanfari
2013-08-01
Full Text Available In this paper, optimal homotopy asymptotic method (OHAM is applied to solve system of Fredholm integral equations. The effectiveness of optimal homotopy asymptotic method is presented. This method provides easy tools to control the convergence region of approximating solution series wherever necessary. The results of OHAM are compared with homotopy perturbation method (HPM and Taylor series expansion method (TSEM.
Two split cell numerical methods for solving 2-D non-equilibrium radiation transport equations
International Nuclear Information System (INIS)
Feng Tinggui
2004-11-01
Two numerically positive methods, the step characteristic integral method and subcell balance method, for solving radiative transfer equations on quadrilateral grids are presented. Numerical examples shows that the schemes presented are feasible on non-rectangle grid computation, and that the computing results by the schemes presented are comparative to that by the discrete ordinate diamond scheme on rectangle grid. (author)
Who Solved the Bernoulli Differential Equation and How Did They Do It?
Parker, Adam E.
2013-01-01
The Bernoulli brothers, Jacob and Johann, and Leibniz: Any of these might have been first to solve what is called the Bernoulli differential equation. We explore their ideas and the chronology of their work, finding out, among other things, that variation of parameters was used in 1697, 78 years before 1775, when Lagrange introduced it in general.
International Nuclear Information System (INIS)
Kim, Ki Hong; Lee, Dong Hun
1999-01-01
Generalizing the work of Shapiro and Loginov, we derive new formulae of differentiation useful for solving differential equations with complex-valued random coefficients. We apply the formulae to the quantum-mechanical problem of noninteracting electrons moving in a correlated random potential in one dimension
Directory of Open Access Journals (Sweden)
H. Jafari
2010-07-01
Full Text Available In this paper, nonlinear Klein-Gordon equation with quadratic term is solved by means of an analytic technique, namely the Homotopy analysis method (HAM.Comparisons are made between the Adomian decomposition method (ADM, the exact solution and homotopy analysis method. The results reveal that the proposed method is very effective and simple.
FMCEIR: a Monte Carlo program for solving the stationary neutron and gamma transport equation
International Nuclear Information System (INIS)
Taormina, A.
1978-05-01
FMCEIR is a three-dimensional Monte Carlo program for solving the stationary neutron and gamma transport equation. It is used to study the problem of neutron and gamma streaming in the GCFR and HHT reactor channels. (G.T.H.)
Mei, Shu-Li; Lv, Hong-Liang; Ma, Qin
2008-01-01
Based on restricted variational principle, a novel method for interval wavelet construction is proposed. For the excellent local property of quasi-Shannon wavelet, its interval wavelet is constructed, and then applied to solve ordinary differential equations. Parameter choices for the interval wavelet method are discussed and its numerical performance is demonstrated.
Modifying a numerical algorithm for solving the matrix equation X + AX T B = C
Vorontsov, Yu. O.
2013-06-01
Certain modifications are proposed for a numerical algorithm solving the matrix equation X + AX T B = C. By keeping the intermediate results in storage and repeatedly using them, it is possible to reduce the total complexity of the algorithm from O( n 4) to O( n 3) arithmetic operations.
Solving Second-Order Ordinary Differential Equations without Using Complex Numbers
Kougias, Ioannis E.
2009-01-01
Ordinary differential equations (ODEs) is a subject with a wide range of applications and the need of introducing it to students often arises in the last year of high school, as well as in the early stages of tertiary education. The usual methods of solving second-order ODEs with constant coefficients, among others, rely upon the use of complex…
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