SEARCH · Search NASA

Results for “problem”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS1996

Classical problems in computational aero-acoustics

In relation to the expected problems in the development of computational aeroacoustics (CAA), the preliminary applications were to classical problems where the known analytical solutions could be used to validate the numerical results. Such comparisons were used to overcome the numerical problems inherent in these calculations. Comparisons were made between the various numerical approaches to the problems such as direct simulations, acoustic analogies and acoustic/viscous splitting techniques. The aim was to demonstrate the applicability of CAA as a tool in the same class as computational fluid dynamics. The scattering problems that occur are considered and simple sources are discussed.

Hardin, Jay C.↗

NASA NTRS1996

Preconditioned Mixed Spectral Element Methods for Elasticity and Stokes Problems

Preconditioned iterative methods for the indefinite systems obtained by discretizing the linear elasticity and Stokes problems with mixed spectral elements in three dimensions are introduced and analyzed. The resulting stiffness matrices have the structure of saddle point problems with a penalty term, which is associated with the Poisson ratio for elasticity problems or with stabilization techniques for Stokes problems. The main results of this paper show that the convergence rate of the resulting algorithms is independent of the penalty parameter, the number of spectral elements Nu and mildly dependent on the spectral degree eta via the inf-sup constant. The preconditioners proposed for the whole indefinite system are block-diagonal and block-triangular. Numerical experiments presented in the final section show that these algorithms are a practical and efficient strategy for the iterative solution of the indefinite problems arising from mixed spectral element discretizations of elliptic systems.

Pavarino, Luca F.↗

NASA NTRS1996

A Multigrid Algorithm for Immersed Interface Problems

Many physical problems involve interior interfaces across which the coefficients in the problem, the solution, its derivatives, the flux, or the source term may have jumps. These interior interfaces may or may not align with a underlying Cartesian grid. Zhilin Li, in his dissertation, showed how to discretize such elliptic problems using only a Cartesian grid and the known jump conditions to second order accuracy. In this paper, we describe how to apply the full multigrid algorithm in this context. In particular, the restriction, interpolation, and coarse grid problem will be described. Numerical results for several model problems are given to demonstrate that good rates can be obtained even when jumps in the coefficients are large and do not align with the grid.

Adams, Loyce↗

NASA NTRS1996

Effective Numerical Methods for Solving Elliptical Problems in Strengthened Sobolev Spaces

Fourth-order elliptic boundary value problems in the plane can be reduced to operator equations in Hilbert spaces G that are certain subspaces of the Sobolev space W(sub 2)(exp 2)(Omega) is identical with G(sup (2)). Appearance of asymptotically optimal algorithms for Stokes type problems made it natural to focus on an approach that considers rot w is identical with (D(sub 2)w - D(sub 1)w) is identical with vector of u as a new unknown vector-function, which automatically satisfies the condition div vector of u = 0. In this work, we show that this approach can also be developed for an important class of problems from the theory of plates and shells with stiffeners. The main mathematical problem was to show that the well-known inf-sup condition (normal solvability of the divergence operator) holds for special Hilbert spaces. This result is also essential for certain hydrodynamics problems.

D'yakonov, Eugene G.↗

NASA NTRS1997

An Application of the Difference Potentials Method to Solving External Problems in CFD

Numerical solution of infinite-domain boundary-value problems requires some special techniques that would make the problem available for treatment on the computer. Indeed, the problem must be discretized in a way that the computer operates with only finite amount of information. Therefore, the original infinite-domain formulation must be altered and/or augmented so that on one hand the solution is not changed (or changed slightly) and on the other hand the finite discrete formulation becomes available. One widely used approach to constructing such discretizations consists of truncating the unbounded original domain and then setting the artificial boundary conditions (ABC's) at the newly formed external boundary. The role of the ABC's is to close the truncated problem and at the same time to ensure that the solution found inside the finite computational domain would be maximally close to (in the ideal case, exactly the same as) the corresponding fragment of the original infinite-domain solution. Let us emphasize that the proper treatment of artificial boundaries may have a profound impact on the overall quality and performance of numerical algorithms. The latter statement is corroborated by the numerous computational experiments and especially concerns the area of CFD, in which external problems present a wide class of practically important formulations. In this paper, we review some work that has been done over the recent years on constructing highly accurate nonlocal ABC's for calculation of compressible external flows. The approach is based on implementation of the generalized potentials and pseudodifferential boundary projection operators analogous to those proposed first by Calderon. The difference potentials method (DPM) by Ryaben'kii is used for the effective computation of the generalized potentials and projections. The resulting ABC's clearly outperform the existing methods from the standpoints of accuracy and robustness, in many cases noticeably speed up the multigrid convergence, and at the same time are quite comparable to other methods from the standpoints of geometric universality and simplicity of implementation.

Ryaben 'Kii, Victor S.↗

NASA NTRS1993

Improved Finite Element Modeling of the Turbofan Engine Inlet Radiation Problem

Improvements have been made in the finite element model of the acoustic radiated field from a turbofan engine inlet in the presence of a mean flow. The problem of acoustic radiation from a turbofan engine inlet is difficult to model numerically because of the large domain and high frequencies involved. A numerical model with conventional finite elements in the near field and wave envelope elements in the far field has been constructed. By employing an irrotational mean flow assumption, both the mean flow and the acoustic perturbation problem have been posed in an axisymmetric formulation in terms of the velocity potential; thereby minimizing computer storage and time requirements. The finite element mesh has been altered in search of an improved solution. The mean flow problem has been reformulated with new boundary conditions to make it theoretically rigorous. The sound source at the fan face has been modeled as a combination of positive and negative propagating duct eigenfunctions. Therefore, a finite element duct eigenvalue problem has been solved on the fan face and the resulting modal matrix has been used to implement a source boundary condition on the fan face in the acoustic radiation problem. In the post processing of the solution, the acoustic pressure has been evaluated at Gauss points inside the elements and the nodal pressure values have been interpolated from them. This has significantly improved the results. The effect of the geometric position of the transition circle between conventional finite elements and wave envelope elements has been studied and it has been found that the transition can be made nearer to the inlet than previously assumed.

Roy, Indranil Danda↗

NASA NTRS1997

Execution of Multidisciplinary Design Optimization Approaches on Common Test Problems

A class of synthetic problems for testing multidisciplinary design optimization (MDO) approaches is presented. These test problems are easy to reproduce because all functions are given as closed-form mathematical expressions. They are constructed in such a way that the optimal value of all variables and the objective is unity. The test problems involve three disciplines and allow the user to specify the number of design variables, state variables, coupling functions, design constraints, controlling design constraints, and the strength of coupling. Several MDO approaches were executed on two sample synthetic test problems. These approaches included single-level optimization approaches, collaborative optimization approaches, and concurrent subspace optimization approaches. Execution results are presented, and the robustness and efficiency of these approaches an evaluated for these sample problems.

Balling, R. J.↗

NASA NTRS1998

On the Numerical Formulation of Parametric Linear Fractional Transformation (LFT) Uncertainty Models for Multivariate Matrix Polynomial Problems

Robust control system analysis and design is based on an uncertainty description, called a linear fractional transformation (LFT), which separates the uncertain (or varying) part of the system from the nominal system. These models are also useful in the design of gain-scheduled control systems based on Linear Parameter Varying (LPV) methods. Low-order LFT models are difficult to form for problems involving nonlinear parameter variations. This paper presents a numerical computational method for constructing and LFT model for a given LPV model. The method is developed for multivariate polynomial problems, and uses simple matrix computations to obtain an exact low-order LFT representation of the given LPV system without the use of model reduction. Although the method is developed for multivariate polynomial problems, multivariate rational problems can also be solved using this method by reformulating the rational problem into a polynomial form.

Belcastro, Christine M.↗

NASA NTRS1999

30 Years of Wahba's Problem

This article discusses a problem proposed by Grace Wahba: Find the orthogonal matrix A with determinant +1 that minimizes the loss function L(A) is identical with the 1/2(summation from i( a(sub i) * absolute value of (b(sub i)- Ar(sub i))squared). where {b(sub i)} is a set of unit vectors measured in a spacecraft's body frame, {r(sub i)} e the corresponding unit vectors in a reference frame and {a(sub i) are non-negative weights). The orthogonal Procrustes problem is to find the orthogonal matrix A that is closest to B in the sense of the Fobenius norm, so that Wahba's Problem is equivalent to the orthogonal Procrustes problem with the provision that the determinant of A must be +1. The article reviews various solutions to this problem and the implementations of the various solutions.

Markley, F. Landis↗

NASA NTRS1996

The Newton Modified Barrier Method for QP Problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a "hot start". Starting at such a "hot start", at most Omicron(1n 1n epsilon(exp -1)) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, epsilon > 0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that only Omicron(1n epsilon(exp -1))omicron(ln 1n epsilon(exp-1)) Newton steps are required to reach an epsilon-approximation to the solution from any "hot start". In order to reach the "hot start", one has to perform Omicron(square root(m) 1n C) Newton steps, where m characterizes the size of the problem and C > 0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.

Melman, A.↗

NASA NTRS1997

The Problem of Size in Robust Design

To facilitate the effective solution of multidisciplinary, multiobjective complex design problems, a departure from the traditional parametric design analysis and single objective optimization approaches is necessary in the preliminary stages of design. A necessary tradeoff becomes one of efficiency vs. accuracy as approximate models are sought to allow fast analysis and effective exploration of a preliminary design space. In this paper we apply a general robust design approach for efficient and comprehensive preliminary design to a large complex system: a high speed civil transport (HSCT) aircraft. Specifically, we investigate the HSCT wing configuration design, incorporating life cycle economic uncertainties to identify economically robust solutions. The approach is built on the foundation of statistical experimentation and modeling techniques and robust design principles, and is specialized through incorporation of the compromise Decision Support Problem for multiobjective design. For large problems however, as in the HSCT example, this robust design approach developed for efficient and comprehensive design breaks down with the problem of size - combinatorial explosion in experimentation and model building with number of variables -and both efficiency and accuracy are sacrificed. Our focus in this paper is on identifying and discussing the implications and open issues associated with the problem of size for the preliminary design of large complex systems.

Koch, Patrick N.↗

NASA NTRS2000

Computation of Transonic Nozzle Sound Transmission and Rotor Problems by the Dispersion-Relation-Preserving Scheme

The transonic nozzle transmission problem and the open rotor noise radiation problem are solved computationally. Both are multiple length scales problems. For efficient and accurate numerical simulation, the multiple-size-mesh multiple-time-step Dispersion-Relation-Preserving scheme is used to calculate the time periodic solution. To ensure an accurate solution, high quality numerical boundary conditions are also needed. For the nozzle problem, a set of nonhomogeneous, outflow boundary conditions are required. The nonhomogeneous boundary conditions not only generate the incoming sound waves but also, at the same time, allow the reflected acoustic waves and entropy waves, if present, to exit the computation domain without reflection. For the open rotor problem, there is an apparent singularity at the axis of rotation. An analytic extension approach is developed to provide a high quality axis boundary treatment.

Tam, Christopher K. W.↗

NASA NTRS2000

Solution of Third Computational Workshop Internal Propagation Problems using Low Order Schemes

The problems solved are propagation of sound waves through a transonic nozzle and shock-sound interaction. The first problem is solved using a MacCormack scheme. The second problem is solved by perturbation of a conservative Euler equation solution to the steady state. The problems are solved on evenly spaced grids. While solutions were found, the methods selected and not using stretched grids lead to solutions which do not compare well with those found using more accurate schemes. However, the perturbation of the mean flow scheme used to solve the second problem shows promise.

Miles, Jeffrey Hilton↗

NASA NTRS2002

Problems in Assessment of the UV Penetration into Natural Waters from Space-based Measurements

Satellite instruments currently provide global maps of surface UV (ultraviolet) irradiance by combining backscattered radiance data with radiative transfer models. The models are often limited by uncertainties in physical input parameters of the atmosphere and surface. Global mapping of the underwater UV irradiance creates further challenges for the models. The uncertainties in physical input parameters become more serious because of the presence of absorbing and scattering quantities caused by biological processes within the oceans. In this paper we summarize the problems encountered in the assessment of the underwater UV irradiance from space-based measurements, and propose approaches to resolve the problems. We have developed a radiative transfer scheme for computation of the UV irradiance in the atmosphere-ocean system. The scheme makes use of input parameters derived from satellite instruments such as TOMS (Total Ozone Mapping Spectrometer) and SeaWiFS (Sea-viewing Wide Field-of-view Sensor). The major problem in assessment of the surface UV irradiance is to accurately quantify the effects of clouds. Unlike the standard TOMS UV algorithm, we use the cloud fraction products available from SeaWiFS and MODIS (Moderate Resolution Imaging Spectrometer) to calculate instantaneous surface flux at the ocean surface. Daily UV doses can be calculated by assuming a model of constant cloudiness throughout the day. Both SeaWiFS and MODIS provide some estimates of seawater optical properties in the visible. To calculate the underwater UV flux the seawater optical properties must be extrapolated down to shorter wavelengths. Currently, the problem of accurate extrapolation of visible data down to the UV spectral range is not solved completely, and there are few available measurements. The major difficulty is insufficient correlation between photosynthetic and photoprotective pigments of phytoplankton absorbing in the visible and UV respectively. We propose to empirically parameterize seawater absorption in the UV on a basis of available data sets of bio-optical measurements from a variety of ocean waters. Another problem is the lack of reliable data on pure seawater absorption in the UV. Laboratory measurements of the UV absorption of both pure water and pure seawater are required.

Vasilkov, Alexander P.↗

NASA NTRS2001

Continuous Measurements and Quantitative Constraints: Challenge Problems for Discrete Modeling Techniques

We present some diagnosis and control problems that are difficult to solve with discrete or purely qualitative techniques. We analyze the nature of the problems, classify them and explain why they are frequently encountered in systems with closed loop control. This paper illustrates the problem with several examples drawn from industrial and aerospace applications and presents detailed information on one important application: In-Situ Resource Utilization (ISRU) on Mars. The model for an ISRU plant is analyzed showing where qualitative techniques are inadequate to identify certain failure modes and to maintain control of the system in degraded environments. We show why the solution to the problem will result in significantly more robust and reliable control systems. Finally, we illustrate requirements for a solution to the problem by means of examples.

Goodrich, Charles H.↗

NASA NTRS2002

Meshless Local Petrov-Galerkin Method for Bending Problems

Recent literature shows extensive research work on meshless or element-free methods as alternatives to the versatile Finite Element Method. One such meshless method is the Meshless Local Petrov-Galerkin (MLPG) method. In this report, the method is developed for bending of beams - C1 problems. A generalized moving least squares (GMLS) interpolation is used to construct the trial functions, and spline and power weight functions are used as the test functions. The method is applied to problems for which exact solutions are available to evaluate its effectiveness. The accuracy of the method is demonstrated for problems with load discontinuities and continuous beam problems. A Petrov-Galerkin implementation of the method is shown to greatly reduce computational time and effort and is thus preferable over the previously developed Galerkin approach. The MLPG method for beam problems yields very accurate deflections and slopes and continuous moment and shear forces without the need for elaborate post-processing techniques.

Phillips, Dawn R.↗

NASA NTRS2003

Further Developments in the MLPG Method for Beam Problems

An accurate and yet simple Meshless Local Petrov-Galerkin (MLPG) formulation for analyzing beam problems is presented. In the formulation, simple weight functions are chosen as test functions as in the conventional MLPG method. Linear test functions are also chosen, leading to a variation of the MLPG method that is computationally efficient compared to the conventional implementation. The MLPG method is evaluated by applying the formulation to a variety of patch tests, thin beam problems, and problems with load discontinuities. The formulation successfully reproduces exact solutions to machine accuracy when higher order power and spline functions are chosen as test functions or when the linear test function is used, and when constructing the trial functions, the order of the basis function is properly balanced by the order of the weight function. For mixed boundary value problems, deflections, slopes, moments, and shear forces are calculated to the same accuracy by the MLPG method without the use of elaborate post-processing techniques. Problems with load discontinuities require special care - when a reasonable number of nodes are used, the method yields very accurate results.

Raju, I. S.↗

NASA NTRS2003

On the Critical Behaviour, Crossover Point and Complexity of the Exact Cover Problem

Research into quantum algorithms for NP-complete problems has rekindled interest in the detailed study a broad class of combinatorial problems. A recent paper applied the quantum adiabatic evolution algorithm to the Exact Cover problem for 3-sets (EC3), and provided an empirical evidence that the algorithm was polynomial. In this paper we provide a detailed study of the characteristics of the exact cover problem. We present the annealing approximation applied to EC3, which gives an over-estimate of the phase transition point. We also identify empirically the phase transition point. We also study the complexity of two classical algorithms on this problem: Davis-Putnam and Simulated Annealing. For these algorithms, EC3 is significantly easier than 3-SAT.

Morris, Robin D.↗