A Picard Iterative Method for Estimating Solutions to Certain Differential Equations
Numerical implementation of Picard iteration for estimating solutions to certain differential equations
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Numerical implementation of Picard iteration for estimating solutions to certain differential equations
This study presents Nebo, a declarative domain-specific language embedded in C++ for discretizing partial differential equations for transport phenomena on multiple architectures. Application programmers use Nebo to write code that appears sequential but can be run in parallel, without editing the code. Currently Nebo supports single-thread execution, multi-thread execution, and many-core (GPU-based) execution. With single-thread execution, Nebo performs on par with code written by domain experts. With multi-thread execution, Nebo can linearly scale (with roughly 90% efficiency) up to 12 cores, compared to its single-thread execution. Moreover, Nebo’s many-core execution can be over 140x faster than its single-thread execution.
Solution of differential equations by predictor corrector formulas for high order accuracy
The Adams Bashforth predictor coefficients and the Adams Moulton corrector coefficients for the integration of differential equations are presented for methods of 1st to 20th order. The order of the method as presented refers to the highest order difference formula used in Newton's backward difference interpolation formula, on which the Adams method is based. The Adams method is a polynomial approximation method derived from Newton's backward difference interpolation formula. The Newton formula is derived and expanded to 20th order. The Adams predictor and corrector formulas are derived and expressed in terms of differences of the derivatives, as well as in terms of the derivatives themselves. All coefficients are given to 18 significant digits. For the difference formula only, the ratio coefficients are given to 10th order.
Conventionally programmed digital computers can process numbers with great speed and precision, but do not easily recognize patterns or imprecise or contradictory data. Instead of being programmed in the conventional sense, artificial neural networks (ANN's) are capable of self-learning through exposure to repeated examples. However, the training of an ANN can be a time consuming and unpredictable process. A general method is being developed by the author to mate the adaptability of the ANN with the speed and precision of the digital computer. This method has been successful in building feedforward networks that can approximate functions and their partial derivatives from examples in a single iteration. The general method also allows the formation of feedforward networks that can approximate the solution to nonlinear ordinary and partial differential equations to desired accuracy without the need of examples. It is believed that continued research will produce artificial neural networks that can be used with confidence in practical scientific computing and engineering applications.
Explore the source record for details and available documents.
Recently the determination of the best technique for numerically solving systems of ordinary differential equations on a digital computer has received much attention. The use of these formulas in conjunction with a stepsize control developed is explained, and one of the formulas is chosen for comparison with other integration techniques. This comparison of one of the best of Fehlberg's formulas with the different numerical techniques described in previous studies on a variety of test problems clearly shows the superiority of Fehlberg's formula. That is, on each of the test problems, the chosen Fehlberg formula is able to achieve a given accuracy in less computer time than any of the other techniques tested. Also, the computer program for the chosen Fehlberg formula is less complex and easier to use than the computer programs for most of the other techniques. To illustrate the use of the chosen Fehlberg formula, a computer listing of its application to several example problems is included along with a sample of the computer output from these applications.
Numerical solution of coupled radial differential equations which are encountered in multichannel scattering problems is presented. Numerical approach is based on the combination of the exterior complex scaling method and the finite-elements method with the discrete variable representation. This method can be used not only to solve multichannel scattering problem but also to find bound states and resonance positions and widths directly by diagonalization of the corresponding complex scaled Hamiltonian. Efficiency and accuracy of this method is demonstrated on an analytically solvable two-channel problem.
New Lie series method for numerical integration of ordinary differential equations, and restricted three-body problem application
A new corrector formula for predictor-corrector methods for numerical solutions of ordinary differential equations is presented. Two considerations for choosing corrector formulas are given: (1) the coefficient in the error term and (2) its stability properties. The graph of the roots of an equation plotted against its stability region, of different values, is presented along with the tables that correspond to various corrector equations, including Hamming's and Milne and Reynolds'.
Numerical integration of nonlinear differential equations by use of rational approximation
Series of computer subroutines integrates systems of ordinary differential equations and is used for numerical quadrature.
We discuss an Adams-type predictor-corrector method for the numerical solution of fractional differential equations. The method may be used both for linear and for nonlinear problems, and it may be extended to multi-term equations (involving more than one differential operator) too.
A numerical procedure is proposed for solving optimal control problems governed by linear retarded functional differential equations. The procedure is based on the idea of 'averaging approximations', due to Banks and Burns (1975). For illustration, numerical results generated on an IBM 370/158 computer, which demonstrate the rapid convergence of the method are presented.
Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.
Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.
A comprehensive review of methods of numerically generating curvilinear coordinate systems with coordinate lines coincident with all boundary segments is given. Some general mathematical framework and error analysis common to such coordinate systems is also included. The general categories of generating systems are those based on conformal mapping, orthogonal systems, nearly orthogonal systems, systems produced as the solution of elliptic and hyperbolic partial differential equations, and systems generated algebraically by interpolation among the boundaries. Also covered are the control of coordinate line spacing by functions embedded in the partial differential operators of the generating system and by subsequent stretching transformation. Dynamically adaptive coordinate systems, coupled with the physical solution, and time-dependent systems that follow moving boundaries are treated. References reporting experience using such coordinate systems are reviewed as well as those covering the system development.
We develop exterior calculus approaches for partial differential equations on radial manifolds. We introduce numerical methods that approximate with spectral accuracy the exterior derivative \(\mathbf {d}\) , Hodge star \(\star \) , and their compositions. To achieve discretizations with high precision and symmetry, we develop hyperinterpolation methods based on spherical harmonics and Lebedev quadrature. We perform convergence studies of our numerical exterior derivative operator \(\overline{\mathbf {d}}\) and Hodge star operator \(\overline{\star }\) showing each converge spectrally to \(\mathbf {d}\) and \(\star \) . We demonstrate how the numerical operators can be naturally composed to formulate general numerical approximations for solving differential equations on manifolds. We introduce findings for the Laplace–Beltrami equations demonstrating our approach.