Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms Parabolic Partial Differential Equations”

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.

At least 19 records

Noniterative three-dimensional grid generation using parabolic partial differential equations

A new algorithm for generating three-dimensional grids has been developed and implemented which numerically solves a parabolic partial differential equation (PDE). The solution procedure marches outward in two coordinate directions, and requires inversion of a scalar tridiagonal system in the third. Source terms have been introduced to control the spacing and angle of grid lines near the grid boundaries, and to control the outer boundary point distribution. The method has been found to generate grids about 100 times faster than comparable grids generated via solution of elliptic PDEs, and produces smooth grids for finite-difference flow calculations.

Edwards, T. A.↗

Accuracy and convergence of a finite element algorithm for turbulent boundary layer flow

The Galerkin-Weighted Residuals formulation is employed to derive an implicit finite element solution algorithm for the nonlinear parabolic partial differential equation system governing turbulent boundary layer flow. Solution accuracy and convergence with discretization refinement are quantized in several error norms using linear and quadratic basis functions. Richardson extrapolation is used to isolate integration truncation error in all norms, and Newton iteration is employed for all equation solutions performed in double-precision. The mathematical theory supporting accuracy and convergence concepts for linear elliptic equations appears extensible to the nonlinear equations characteristic of turbulent boundary layer flow.

Soliman, M. O.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, Joel H.↗

A fast semi-implicit algorithm for problems of mixed type

Certain physical processes are modeled by partial differential equations which are parabolic over part of the domain and elliptic over the remainder. A family of semi-implicit algorithms which are well suited to initial-boundary value problems of this mixed type is discussed. One important feature of these algorithms is the use of an approximate inverse for the solution of the implicit linear system. A strong error analysis results in an estimate of the total error as a function of approximate inverse error e and time step h.

Frederickson, P. O.↗

Utility of a finite element solution algorithm for initial-value problems

The Galerkin criterion within a finite element Weighted Residuals formulation is employed to establish an implicit solution algorithm for an initial-value partial differential equation. Numerical solutions of a transient parabolic and a hyperbolic equation, obtained using linear, quadratic and two cubic finite element basis functions, are employed to quantize accuracy and confirm and refine theoretical convergence rate estimates. The linear basis algorithm for the hyperbolic equation displays excellent accuracy on a coarse computational grid and a high-order convergence rate with discretization refinement. Good accuracy and a strong convergence rate in surface flux are determined for a nonhomogeneous Neumann boundary constraint applied to a parabolic equation. The results amply demonstrate the impact of the nondiagonal finite element initial-value matrix structure on solution accuracy and/or convergence rate.

Baker, A. J.↗

A high order accurate finite element algorithm for high Reynolds number flow prediction

A Galerkin-weighted residuals formulation is employed to establish an implicit finite element solution algorithm for generally nonlinear initial-boundary value problems. Solution accuracy, and convergence rate with discretization refinement, are quantized in several error norms, by a systematic study of numerical solutions to several nonlinear parabolic and a hyperbolic partial differential equation characteristic of the equations governing fluid flows. Solutions are generated using selective linear, quadratic and cubic basis functions. Richardson extrapolation is employed to generate a higher-order accurate solution to facilitate isolation of truncation error in all norms. Extension of the mathematical theory underlying accuracy and convergence concepts for linear elliptic equations is predicted for equations characteristic of laminar and turbulent fluid flows at nonmodest Reynolds number. The nondiagonal initial-value matrix structure introduced by the finite element theory is determined intrinsic to improved solution accuracy and convergence. A factored Jacobian iteration algorithm is derived and evaluated to yield a consequential reduction in both computer storage and execution CPU requirements while retaining solution accuracy.

Baker, A. J.↗

An interaction algorithm for prediction of mean and fluctuating velocities in two-dimensional aerodynamic wake flows

A theoretical analysis is presented yielding sets of partial differential equations for determination of turbulent aerodynamic flowfields in the vicinity of an airfoil trailing edge. A four phase interaction algorithm is derived to complete the analysis. Following input, the first computational phase is an elementary viscous corrected two dimensional potential flow solution yielding an estimate of the inviscid-flow induced pressure distribution. Phase C involves solution of the turbulent two dimensional boundary layer equations over the trailing edge, with transition to a two dimensional parabolic Navier-Stokes equation system describing the near-wake merging of the upper and lower surface boundary layers. An iteration provides refinement of the potential flow induced pressure coupling to the viscous flow solutions. The final phase is a complete two dimensional Navier-Stokes analysis of the wake flow in the vicinity of a blunt-bases airfoil. A finite element numerical algorithm is presented which is applicable to solution of all partial differential equation sets of inviscid-viscous aerodynamic interaction algorithm. Numerical results are discussed.

Baker, A. J.↗

Accuracy and convergence of a finite element algorithm for laminar boundary layer flow

The Galerkin-weighted residuals formulation is employed to derive an implicit finite element solution algorithm for a generally non-linear initial-boundary value problem. Solution accuracy and convergence with discretization refinement are quantized in several error norms, for the non-linear parabolic partial differential equation system governing laminar boundary layer flow, using linear, quadratic and cubic functions. Richardson extrapolation is used to isolate integration truncation error in all norms, and Newton iteration is employed for all equation solutions performed in double-precision. The mathematical theory supporting accuracy and convergence concepts for linear elliptic equations appears extensible to the non-linear equations characteristic of laminar boundary layer flow.

Soliman, M. O.↗

Numerical study of finite-rate supersonic combustion using parabolized equations

A set of partial differential equations, describing the two-dimensional supersonic chemically-reacting flow of the hydrogen-air system, is formulated such that the equations are parabolic in the streamwise direction. A fully-implicit fully-coupled finite-difference algorithm is used to develop a computer code which solves the governing equations by marching in the streamwise direction. The combustion process is modeled by a two-step finite-rate chemistry whereas turbulence is simulated by an algebraic turbulence model. Results of two calculations of internal supersonic reacting flow show fairly good agreement with the results obtained by the more costly full Navier-Stokes procedure.

Chitsomboon, T.↗

Real-time optical laboratory solution of parabolic differential equations

An optical laboratory matrix-vector processor is used to solve parabolic differential equations (the transient diffusion equation with two space variables and time) by an explicit algorithm. This includes optical matrix-vector nonbase-2 encoded laboratory data, the combination of nonbase-2 and frequency-multiplexed data on such processors, a high-accuracy optical laboratory solution of a partial differential equation, new data partitioning techniques, and a discussion of a multiprocessor optical matrix-vector architecture.

Casasent, David↗

On several aspects and applications of the multigrid method for solving partial differential equations

Several aspects of multigrid methods are briefly described. The main subjects include the development of very efficient multigrid algorithms for systems of elliptic equations (Cauchy-Riemann, Stokes, Navier-Stokes), as well as the development of control and prediction tools (based on local mode Fourier analysis), used to analyze, check and improve these algorithms. Preliminary research on multigrid algorithms for time dependent parabolic equations is also described. Improvements in existing multigrid processes and algorithms for elliptic equations were studied.

Dinar, N.↗

Finite difference procedure for boundary layers including effects of longitudinal and transverse curvatures

A second order viscous layer solution procedure has been developed that does in a consistent way include curvature effects and the corresponding normal pressure gradients. In the present system, the normal momentum equation is retained. The parabolic system of nonlinear partial differential equations is converted by linear finite differencing procedures to a system of linear algebraic equations and solved in primitive coordinates. The solutions have been shown to give smooth stable distributions for all the variables, most particularly the normal velocity which plays an important role in the interaction procedure. An algorithm for matching the viscous layer solution with a rotational characteristics outer solution has been developed.

Tassa, Y.↗

Exponential Time Differencing Schemes for Fuel Depletion and Transport in Molten Salt Reactors: Theory and Implementation

A numerical framework for modeling depletion and mass transport in liquid-fueled molten salt reactions is presented based on exponential time differencing. The solution method involves using the finite volume method to transform the system of partial differential equations (PDEs) into a much larger system of ordinary differential equations. The key part of this method involves solving for the exponential of a matrix. We explore six different algorithms to compute the exponential in a series of progression problems that explore physical transport phenomena in molten salt reactors. This framework shows good results for solving linear parabolic PDEs with each of the six matrix exponential algorithms. For large problems, the series solvers such as Padé and Taylor have large run times, which can be mitigated by using the Krylov subspace.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Numerical Algorithms Based on Biorthogonal Wavelets

Wavelet bases are used to generate spaces of approximation for the resolution of bidimensional elliptic and parabolic problems. Under some specific hypotheses relating the properties of the wavelets to the order of the involved operators, it is shown that an approximate solution can be built. This approximation is then stable and converges towards the exact solution. It is designed such that fast algorithms involving biorthogonal multi resolution analyses can be used to resolve the corresponding numerical problems. Detailed algorithms are provided as well as the results of numerical tests on partial differential equations defined on the bidimensional torus.

Ponenti, Pj.↗

Numerical Algorithms Based on Biorthogonal Wavelets

Wavelet bases are used to generate spaces of approximation for the resolution of bidimensional elliptic and parabolic problems. Under some specific hypotheses relating the properties of the wavelets to the order of the involved operators, it is shown that an approximate solution can be built. This approximation is then stable and converges towards the exact solution. It is designed such that fast algorithms involving biorthogonal multi resolution analyses can be used to resolve the corresponding numerical problems. Detailed algorithms are provided as well as the results of numerical tests on partial differential equations defined on the bidimensional torus.

Ponenti, Pj.↗

A new explicit method for the numerical solution of parabolic differential equations

A new method is derived for solving parabolic partial differential equations arising in transient heat conduction or in boundary-layer flows. The method is based on a combination of the modified differential quadrature (MDQ) method with the rational Runge-Kutta time-integration scheme. It is fully explicit, requires no matrix inversion, and is stable for any time-step for the heat equations. Burgers equation and the one- and two-dimensional heat equations are solved to demonstrate the accuracy and efficiency of the proposed algorithm. The present method is found to be very accurate and efficient when results are compared with analytic solutions.

Satofuka, N.↗