SEARCH · Search NASA
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 solution for variety of nonlinear degenerate elliptic boundary value problems, and convergence of associated iterative procedures
High-order (p-type) finite element methods combine the geometric flexibility of standard low-order finite element (or finite volume) techniques with the rapid convergence properties of spectral methods. Various p-type schemes have been proposed for elliptic problems. However, an application of p-type methods to more complex equations, in particular the passive scalar or Navier-Stokes equations, is complicated by the nature of the equations and by efficiency considerations as regards the solution procedure. Patera (1984) has proposed a p-type method for the Navier-Stokes equations, taking into account the arising additional complications. The present study is concerned with an isoparametric spectral element discretization for the solution of flow problems in fully general, curvy geometries. Attention is given to the isoparametric formulation for elliptic equations and a time-splitting scheme for the Navier-Stokes equations.
A boundary method is presented for the solution of elliptic boundary value problems. An approach based on the use of complete systems of solutions is emphasized. The discussion is limited to the Dirichlet problem, even though the present method can possibly be adapted to treat other boundary value problems.
Attention is given to iterative methods applicable to such changing domain cases of elliptic problems in multiconnected domains as those of incompressible inviscid flow with free surfaces. One such formulation is developed and tested on circular and elliptic annuli, using interpolated quadrature points to maintain accuracy when annuli regions are thin. The technique is noted to be applicable to the study of accelerating thin fluid shells.
A method is presented for calculating trajectories for the restricted problem of three bodies which utilizes conic propagation of the state vector with frequency correction of position and velocity by means of a constant or slowly varying function. This method of calculating trajectories was applied to the planar circular restricted three body problem, the planar elliptic restricted problem, and the ephemeral restricted problem. Two methods (the refined method and the straight forward method) of determining the direction of the position correction are presented for the circular restricted problem and the elliptic restricted problem of three bodies. Only the straight forward method was used with the ephemeral restricted problem. The earth, the moon, and a space vehicle comprise the restricted three body model that is used.
Two dimensional elliptic restricted three body problem, considering regularization mechanism and periodic collision orbits
Subroutine PLTMG is a FORTRAN program for solving self-adjoint elliptic boundary value problems in general regions of R-squared. It is based on a piecewise linear triangle finite element method, an adaptive grid refinement procedure, and a multi-level iterative method to solve the resulting sets of linear equations. This paper describes the method and presents some numerical results and comparisons.
The current status of CFD with regard to unstructured grids employing finite element methods and Eulerian frames is reviewed. Algorithms suitable for the computation of large three-dimensional problems involving flow past arbitrary geometries are developed. Adaptive mesh refinement strategy is reviewed, and domain splitting or local time-stepping are briefly addressed. The development of search algorithms of optimal order, variable time-stepping Jacobi smoothers for elliptic problems, and transport concepts for hyperbolics to help achieve good performance for unstructured multigrid processes is discussed. As examples, transient supersonic flow in a channel, regular shock reflection of a wall, viscous flow past a protruberance, potential flow past a cylinder, and Burgers equation are considered.
A class of preconditioners is presented for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure. They are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method and a recent method proposed by Bramble-Pasciak-Xu.
The fluid flow inside the space shuttle main engine (SSME) traverses through a complex geometrical configuration. The flow is compressible, viscous, and turbulent with pockets of separated regions. Several computer codes are being developed to solve three dimensional Navier-Stokes equations with different turbulence models for analyzing the SSME internal flow. The locally implicit scheme is a computationally efficient scheme which converges rapidly in multi-grid modes for elliptic problems. It has the promise of providing a rapidly converging algorithm for steady-state viscous flow problems.
Scheme for choosing approximating system of difference equations for degenerate linear and nonlinear elliptic boundary value problems
Elliptic partial differential equations (PDEs) can model many physical phenomena, such as electrostatics, acoustics, wave propagation, and diffusion. In scientific machine learning settings, a high-throughput PDE solver may be required to generate a training dataset, run in the inner loop of an iterative algorithm, or interface directly with a deep neural network. To provide value to machine learning users, such a PDE solver must be compatible with standard automatic differentiation frameworks, scale efficiently when run on graphics processing units (GPUs), and maintain high accuracy for a large range of input parameters. We have designed the jaxhps package with these use-cases in mind by implementing a highly efficient and accurate solver for elliptic problems with native hardware acceleration and automatic differentiation support.
This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].
The development of a multicolored successive over relaxation (SOR) program for the finite element machine is discussed. The multicolored SOR method uses a generalization of the classical Red/Black grid point ordering for the SOR method. These multicolored orderings have the advantage of allowing the SOR method to be implemented as a Jacobi method, which is ideal for arrays of processors, but still enjoy the greater rate of convergence of the SOR method. The program solves a general second order self adjoint elliptic problem on a square region with Dirichlet boundary conditions, discretized by quadratic elements on triangular regions. For this general problem and discretization, six colors are necessary for the multicolored method to operate efficiently. The specific problem that was solved using the six color program was Poisson's equation; for Poisson's equation, three colors are necessary but six may be used. In general, the number of colors needed is a function of the differential equation, the region and boundary conditions, and the particular finite element used for the discretization.
Adaptive refinement and the complicated data structures required to support it are discussed. These data structures must be carefully tuned, especially in three dimensions where the time and storage requirements of algorithms are crucial. Another major issue is grid generation. The options available seem to be curvilinear fitted grids, constructed on iterative graphics systems, and unfitted Cartesian grids, which can be constructed automatically. On several grounds, including storage requirements, the second option seems preferrable for the well behaved scalar elliptic problems considered here. A variety of techniques for treatment of boundary conditions on such grids are reviewed. A new approach, which may overcome some of the difficulties encountered with previous approaches, is also presented.
A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.
Elliptic problems with corner singularities are discussed. Finite element approximations based on variational principles of the least squares type tend to display poor convergence properties in such contexts. Moreover, mesh refinement or the use of special singular elements do not appreciably improve matters. It is shown that if the least squares formulation is done in appropriately weighted space, then optimal convergence results in unweighted spaces like L(2).
A two-step explicit finite element based solution procedure for the compressible Euler equations is described. Convergence to steady state can be accelerated by using a multigrid technique. The geometric flexibility of the finite element method is retained by using a sequence of unnested grids. The viability of this approach is demonstrated for elliptic problems and initial experiences with the technique applied to the Euler equations are reported.