Institution
Vaughn College of Aeronautics and Technology
Education•New York, New York, United States•
About: Vaughn College of Aeronautics and Technology is a education organization based out in New York, New York, United States. It is known for research contribution in the topics: Gravitational microlensing & Planetary system. The organization has 727 authors who have published 708 publications receiving 14082 citations. The organization is also known as: College of Aeronautics.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, a simplified version of the conventional Burnett equations is proposed to simulate the rotational nonequilibrium effect in a diatomic gas, and the Navier-Stokes and the simplified conventional Burnett equation are modified by adding a rotational relaxation mod.
Abstract: This paper describes the computations of hypersonic flows in a diatomic gas in rotational nonequilibrium using a newly developed simplified set of Burnett equations designated as simplified conventional Burnett equations. Since the original formulation by Burnett, a number of variations to the original Burnett equations have been proposed, and the differences among these variants and their merits/shortcomings have been described in the literature. A new variant is created based on the conventional Burnett equations for hypersonic flows by neglecting higher-order terms that are inversely proportional to the Mach number. This set of simplified conventional Burnett equations is linearly stable for small disturbances in contrast to the conventional Burnett equations that suffer from Bobylev instability. To simulate the rotational nonequilibrium effect in a diatomic gas, both the Navier–Stokes and the simplified conventional Burnett equations are modified by including a rotational nonequilibrium relaxation mod...
8 citations
••
01 Jan 1968TL;DR: In this article, the authors discuss design considerations in advanced gas-turbine combustion chambers, including the amount of air participating in primary combustion, the size of the eddies created in the primary zone, and the degree of mixing achieved between fuel and air.
Abstract: Publisher Summary
This chapter discusses design considerations in advanced gas-turbine combustion chambers. The basic geometry of a combustion chamber is largely dictated by the need to achieve efficient combustion with the minimum of pressure loss and at overall mixture strengths that lie well outside the inflammability limits of kerosine air mixtures. However, within the limits imposed by these considerations, appreciable variations can be made in the amount of air participating in primary combustion, the size of the eddies created in the primary zone, and the degree of mixing achieved between the fuel and air. Small changes in any one of these variables can have a marked effect on combustor characteristics, and their combined effect is to allow considerable scope and flexibility in chamber design. As designers gain more confidence in exploiting these variables, the all-purpose type of combustion unit that is prevalent today will gradually disappear to be replaced by combustors that are tailor-made to meet a few specific combustion requirements.
8 citations
••
TL;DR: The experiments on large matrices and a real application in the structure from motion indicate that the memory requirement of the proposed algorithm is mild, making it suitable for real applications that often involve large-scale matrix decomposition.
Abstract: The $L_{1}$ -norm cost function of the low-rank approximation of the matrix with missing entries is not smooth, and also cannot be transformed into a standard linear or quadratic programming problem, and thus, the optimization of this cost function is still not well solved. To tackle this problem, first, a mollifier is used to smooth the cost function. High closeness of the smoothed function to the original one can be obtained by tuning the parameters contained in the mollifier. Next, a recurrent neural network is proposed to optimize the mollified function, which will converge to a local minimum. In addition, to boost the speed of the system, the mollifying process is implemented by a filtering procedure. The influence of two mollifier parameters is theoretically analyzed and experimentally confirmed, showing that one of the parameters is critical to computational efficiency and accuracy, while the other not. A large number of experiments on synthetic data show that the proposed method is competitive to the state-of-the-art methods. In particular, the experiments on large matrices and a real application in the structure from motion indicate that the memory requirement of the proposed algorithm is mild, making it suitable for real applications that often involve large-scale matrix decomposition.
8 citations
••
TL;DR: In this paper, a novel approach combining radial basis function interpolation with Galerkin projection to efficiently solve general optimal control problems is presented, which offers a highly flexible framework for direct transcription by using any interpolant functions from the broad class of global RBFs and arbitrary discretization points that do not necessarily need to be on a mesh of points.
Abstract: This work presents a novel approach combining radial basis function (RBF) interpolation with Galerkin projection to efficiently solve general optimal control problems. The goal is to develop a highly flexible solution to optimal control problems, especially nonsmooth problems involving discontinuities, while accounting for trajectory accuracy and computational efficiency simultaneously. The proposed solution, called the RBF-Galerkin method, offers a highly flexible framework for direct transcription by using any interpolant functions from the broad class of global RBFs and any arbitrary discretization points that do not necessarily need to be on a mesh of points. The RBF-Galerkin costate mapping theorem is developed that describes an exact equivalency between the Karush-Kuhn-Tucker (KKT) conditions of the nonlinear programming problem resulted from the RBF-Galerkin method and the discretized form of the first-order necessary conditions of the optimal control problem, if a set of discrete conditions holds. The efficacy of the proposed method along with the accuracy of the RBF-Galerkin costate mapping theorem is confirmed against an analytical solution for a bang-bang optimal control problem. In addition, the proposed approach is compared against both local and global polynomial methods for a robot motion planning problem to verify its accuracy and computational efficiency.
8 citations
••
01 Jan 2007TL;DR: This chapter explores various systems of axes and notation, wherein aerodynamic controls and engine controls are explained and the last section mentions the aerodynamic reference centers.
Abstract: This chapter explores various systems of axes and notation. By making the appropriate choice of axis, systems order and consistency may be introduced to the process of model building. The order and consistency play an important role in the definition of the mathematical framework. Only the most basic commonly used axes systems appropriate to aircraft are discussed in the chapter. It gives a description of the earth axes and various kinds of aircraft body fixed axes. It is not important which axis system is chosen provided it models the flight condition to be investigated, the end-result does not depend on the choice of axis system. However, when compiling data for use in the equations of motion of an aircraft it is quite common for some data to be referred. Further, euler angles and aircraft attitude is explained. The angles defined by the right handed rotation about the three axes of a right handed system of axes are called Euler angles. The chapter also defines controls notion, wherein aerodynamic controls and engine controls are explained. The last section mentions the aerodynamic reference centers.
8 citations
Authors
Showing all 732 results
Name | H-index | Papers | Citations |
---|---|---|---|
Xiang Zhang | 154 | 1733 | 117576 |
Denis J. Sullivan | 61 | 332 | 14092 |
To. Saito | 51 | 183 | 9392 |
Arthur H. Lefebvre | 41 | 123 | 4896 |
Michele Meo | 40 | 223 | 5557 |
Robin S. Langley | 40 | 263 | 5601 |
Ning Qin | 37 | 283 | 5011 |
Holger Babinsky | 33 | 242 | 4068 |
B. S. Gaudi | 31 | 64 | 2560 |
Philip J. Longhurst | 29 | 80 | 2578 |
Michael Gaster | 27 | 66 | 3998 |
Don Harris | 26 | 129 | 2537 |
To. Saito | 25 | 56 | 2362 |
John F. O'Connell | 22 | 89 | 1763 |
Rade Vignjevic | 21 | 84 | 1563 |