Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cartesian”

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 37 records · Page 2

Cartesian control of redundant robots

A Cartesian-space position/force controller is presented for redundant robots. The proposed control structure partitions the control problem into a nonredundant position/force trajectory tracking problem and a redundant mapping problem between Cartesian control input F is a set member of the set R(sup m) and robot actuator torque T is a set member of the set R(sup n) (for redundant robots, m is less than n). The underdetermined nature of the F yields T map is exploited so that the robot redundancy is utilized to improve the dynamic response of the robot. This dynamically optimal F yields T map is implemented locally (in time) so that it is computationally efficient for on-line control; however, it is shown that the map possesses globally optimal characteristics. Additionally, it is demonstrated that the dynamically optimal F yields T map can be modified so that the robot redundancy is used to simultaneously improve the dynamic response and realize any specified kinematic performance objective (e.g., manipulability maximization or obstacle avoidance). Computer simulation results are given for a four degree of freedom planar redundant robot under Cartesian control, and demonstrate that position/force trajectory tracking and effective redundancy utilization can be achieved simultaneously with the proposed controller.

Colbaugh, R.↗

Cartesian-based control of a deformable robot manipulator

A control scheme for the 6-DOF Cincinnati-Milacron T3 robot arm is developed and demonstrated by means of numerical simulations. The arm is modeled as an open-loop articulated system with both actuators and position and velocity sensors at each joint, and a Cartesian-frame control algorithm is constructed in which (1) an adaptive scheme decouples the end-effector subsystem from the complex highly nonlinear main system and (2) a servo scheme drives the reduced system to follow a presumed end-effector trajectory on the basis of the Cartesian-frame feedback gains. The velocity transformation used to transfer the control forces from the Cartesian frame to joint-based space is explained, and the simulation results are presented in extensive graphs and diagrams. The control is found to respond well to system-topology changes and robot-environment impacts.

Chang, C. W.↗

A Cartesian grid approach with hierarchical refinement for compressible flows

Many numerical studies of flows that involve complex geometries are limited by the difficulties in generating suitable grids. We present a Cartesian boundary scheme for two-dimensional, compressible flows that is unfettered by the need to generate a computational grid and so it may be used, routinely, even for the most awkward of geometries. In essence, an arbitrary-shaped body is allowed to blank out some region of a background Cartesian mesh and the resultant cut-cells are singled out for special treatment. This is done within a finite-volume framework and so, in principle, any explicit flux-based integration scheme can take advantage of this method for enforcing solid boundary conditions. For best effect, the present Cartesian boundary scheme has been combined with a sophisticated, local mesh refinement scheme, and a number of examples are shown in order to demonstrate the efficacy of the combined algorithm for simulations of shock interaction phenomena.

Quirk, James J.↗

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

An accuracy assessment of Cartesian-mesh approaches for the Euler equations

A critical assessment of the accuracy of Cartesian-mesh approaches for steady, transonic solutions of the Euler equations of gas dynamics is made. An exact solution of the Euler equations (Ringleb's flow) is used not only to infer the order of the truncation error of the Cartesian-mesh approaches, but also to compare the magnitude of the discrete error directly to that obtained with a structured mesh approach. Uniformly and adaptively refined solutions using a Cartesian-mesh approach are obtained and compared to each other and to uniformly refined structured mesh results. The effect of cell merging is investigated as well as the use of two different K-exact reconstruction procedures. The solution methodology of the schemes is explained and tabulated results are presented to compare the solution accuracies.

Coirier, William J.↗

The adaptive, cut-cell Cartesian approach (warts and all)

Solution-adaptive methods based on cutting bodies out of Cartesian grids are gaining popularity now that the ways of circumventing the accuracy problems associated with small cut cells have been developed. Researchers are applying Cartesian-based schemes to a broad class of problems now, and, although there is still development work to be done, it is becoming clearer which problems are best suited to the approach (and which are not). The purpose of this paper is to give a candid assessment, based on applying Cartesian schemes to a variety of problems, of the strengths and weaknesses of the approach as it is currently implemented.

Powell, Kenneth G.↗

Solution adaptive Cartesian grid methods for aerodynamic flows with complex geometries

Cartesian methods for computational fluid dynamics are considered to offer an accurate and robust approach for the simulation of aerodynamic flows around geometrically complex bodies. A part of the ongoing research in this domain is reviewed with the aim of providing insight into the fundamental challenges faced by the practitioners of this approach, and a guide to further research. The integration schemes used in Cartesian solvers are similar to those used in other approaches. The emphasis is on the geometric algorithms, surface modeling and boundary conditions required to design a successful Cartesian mesh scheme.

Aftosmis, Michael J.↗

Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

Development and Applications of 3D Cartesian CFD Technology

The urgent need for dramatic reductions in aircraft design cycle time is focusing scrutiny upon all aspects of computational fluid dynamics (CFD). These reductions will most likely come not from increased reliance upon user-interactive (and therefore time-expensive) methods, but instead from methods that can be fully automated and incorporated into 'black box' solutions. In comparison with tetrahedral methods, three-dimensional Cartesian grid approaches are in relative infancy, but initial experiences with automated Cartesian techniques are quite promising. Our research is targeted at furthering the development of Cartesian methods so that they can become key elements of a completely automatic grid generation/flow solution procedure applicable to the Euler analysis of complex aircraft geometries.

Melton, John E.↗

High Energy Boundary Conditions for a Cartesian Mesh Euler Solver

Inlets and exhaust nozzles are common place in the world of flight. Yet, many aerodynamic simulation packages do not provide a method of modelling such high energy boundaries in the flow field. For the purposes of aerodynamic simulation, inlets and exhausts are often fared over and it is assumed that the flow differences resulting from this assumption are minimal. While this is an adequate assumption for the prediction of lift, the lack of a plume behind the aircraft creates an evacuated base region thus effecting both drag and pitching moment values. In addition, the flow in the base region is often mis-predicted resulting in incorrect base drag. In order to accurately predict these quantities, a method for specifying inlet and exhaust conditions needs to be available in aerodynamic simulation packages. A method for a first approximation of a plume without accounting for chemical reactions is added to the Cartesian mesh based aerodynamic simulation package CART3D. The method consists of 3 steps. In the first step, a components approach where each triangle is assigned a component number is used. Here, a method for marking the inlet or exhaust plane triangles as separate components is discussed. In step two, the flow solver is modified to accept a reference state for the components marked inlet or exhaust. In the third step, the flow solver uses these separated components and the reference state to compute the correct flow condition at that triangle. The present method is implemented in the CART3D package which consists of a set of tools for generating a Cartesian volume mesh from a set of component triangulations. The Euler equations are solved on the resulting unstructured Cartesian mesh. The present methods is implemented in this package and its usefulness is demonstrated with two validation cases. A generic missile body is also presented to show the usefulness of the method on a real world geometry.

Pandya, Shishir↗

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗

Efficient Fluid Dynamic Design Optimization Using Cartesian Grids

This report is subdivided in three parts. The first one reviews a new approach to the computation of inviscid flows using Cartesian grid methods. The crux of the method is the curvature-corrected symmetry technique (CCST) developed by the present authors for body-fitted grids. The method introduces ghost cells near the boundaries whose values are developed from an assumed flow-field model in vicinity of the wall consisting of a vortex flow, which satisfies the normal momentum equation and the non-penetration condition. The CCST boundary condition was shown to be substantially more accurate than traditional boundary condition approaches. This improved boundary condition is adapted to a Cartesian mesh formulation, which we call the Ghost Body-Cell Method (GBCM). In this approach, all cell centers exterior to the body are computed with fluxes at the four surrounding cell edges. There is no need for special treatment corresponding to cut cells which complicate other Cartesian mesh methods.

Dadone, A.↗

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Nemec, Marian↗

Electronic Absolute Cartesian Autocollimator

An electronic absolute Cartesian autocollimator performs the same basic optical function as does a conventional all-optical or a conventional electronic autocollimator but differs in the nature of its optical target and the manner in which the position of the image of the target is measured. The term absolute in the name of this apparatus reflects the nature of the position measurement, which, unlike in a conventional electronic autocollimator, is based absolutely on the position of the image rather than on an assumed proportionality between the position and the levels of processed analog electronic signals. The term Cartesian in the name of this apparatus reflects the nature of its optical target. Figure 1 depicts the electronic functional blocks of an electronic absolute Cartesian autocollimator along with its basic optical layout, which is the same as that of a conventional autocollimator. Referring first to the optical layout and functions only, this or any autocollimator is used to measure the compound angular deviation of a flat datum mirror with respect to the optical axis of the autocollimator itself. The optical components include an illuminated target, a beam splitter, an objective or collimating lens, and a viewer or detector (described in more detail below) at a viewing plane. The target and the viewing planes are focal planes of the lens. Target light reflected by the datum mirror is imaged on the viewing plane at unit magnification by the collimating lens. If the normal to the datum mirror is parallel to the optical axis of the autocollimator, then the target image is centered on the viewing plane. Any angular deviation of the normal from the optical axis manifests itself as a lateral displacement of the target image from the center. The magnitude of the displacement is proportional to the focal length and to the magnitude (assumed to be small) of the angular deviation. The direction of the displacement is perpendicular to the axis about which the mirror is slightly tilted. Hence, one can determine the amount and direction of tilt from the coordinates of the target image on the viewing plane.

Leviton, Douglas B.↗

10-th order of accuracy for numerical solution of 3-D elasticity equations for heterogeneous materials on unfitted Cartesian meshes

We have developed the Optimal Local Truncation Error Method (OLTEM) with 10-th order of accuracy on unfitted Cartesian meshes for a system of 3-D elasticity equations with smooth irregular interfaces. 5 x 5 x 5 = 125-point stencils (similar to those for quadratic finite elements) for elastic heterogeneous materials are used for OLTEM. There are no unknowns at the interface points between different materials; the structure of the global discrete equations is the same for homogeneous and heterogeneous materials. The calculation of unknown stencil coefficients is based on the minimization of the local truncation error of the stencil equations and yields the optimal 10-th order of accuracy for OLTEM on unfitted Cartesian meshes, i.e., the increase by 7 orders in accuracy compared to quadratic finite elements on conformal meshes. A new post-processing procedure provides the 9-th order of accuracy for stresses in the 3-D case. Similar to basic computations it uses OLTEM with the 125-point stencils, the interface conditions and the elasticity equations. It was shown that the use of the elasticity equations for post-processing improves the accuracy of 0.1% stresses by 6 orders compared to post-processing without the use of PDEs. At an accuracy of for stresses, OLTEM with the new post-processing procedure reduces the number of degrees of freedom by 360 - 8000 times compared to quadratic finite elements with similar stencils. OLTEM with the 125-point stencils yields even more accurate results than high-order finite elements with much wider stencils. OLTEM provides accurate numerical results for compressible and nearly incompressible materials.

elasticity equations↗

Cartesian grid simulations of gas-solids flow systems with complex geometry

Complex geometries encountered in many applications of gas–solids flow need special treatment in most legacy multiphase flow solvers with Cartesian numerical grid. This paper briefly outlines the implementation of a cut cell technique in the open-source multiphase flow solver—MFIX for accurate representation of complex geometries. Specifically, applications of the Cartesian cut cell method to different gas–solids fluidization systems including a small scale bubbling fluidized bed with submerged tube bundle and a complete pilot-scale circulating fluidized bed will be presented. In addition to qualitative predictions on the general flow behaviors inside each system, quantitative comparison with the available experimental data will be presented. Furthermore, some results on extending the current cut-cell technique to Lagrangian–Eulerian simulations will be presented.

42 ENGINEERING↗

A Parallel Code for Solving the Molecular Time Dependent Schroedinger Equation in Cartesian Coordinates

Reproducing molecular dynamics is at the root of the basic principles of chemical change and physical properties of the matter. New insight on molecular encounters can be gained by solving the Schroedinger equation in cartesian coordinates, provided one can overcome the massive calculations that it implies. We have developed a parallel code for solving the molecular Time Dependent Schroedinger Equation (TDSE) in cartesian coordinates. Variable order Finite Difference methods result in sparse Hamiltonian matrices which can make the large scale problem solving feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗