Cartesian to geodetic coordinates conversion on a triaxial ellipsoid
Ligas, Marcin
2012-04-01
A new method of transforming Cartesian to geodetic (or planetographic) coordinates on a triaxial ellipsoid is presented. The method is based on simple reasoning coming from essentials of vector calculus. The reasoning results in solving a nonlinear system of equations for coordinates of the point being the projection of a point located outside or inside a triaxial ellipsoid along the normal to the ellipsoid. The presented method has been compared to a vector method of Feltens (J Geod 83:129-137, 2009) who claims that no other methods are available in the literature. Generally, our method turns out to be more accurate, faster and applicable to celestial bodies characterized by different geometric parameters. The presented method also fits to the classical problem of converting Cartesian to geodetic coordinates on the ellipsoid of revolution.
Choi, Cheol Ho
2004-02-22
A new way of generating the multipole moments of Cartesian Gaussian functions in spherical polar coordinates has been established, bypassing the intermediary of Cartesian moment tensors. A new set of recurrence relations have also been derived for the resulting analytic integral values. The new method furnishes a conceptually simple and numerically efficient evaluation procedure for the multipole moments. The advantages over existing methods are documented. The results are relevant for the linear scaling quantum theories based on the fast multipole method. PMID:15268515
Lyapunov-based Low-thrust Optimal Orbit Transfer: An approach in Cartesian coordinates
Zhang, Hantian; Cao, Qingjie
2014-01-01
This paper presents a simple approach to low-thrust optimal-fuel and optimal-time transfer problems between two elliptic orbits using the Cartesian coordinates system. In this case, an orbit is described by its specific angular momentum and Laplace vectors with a free injection point. Trajectory optimization with the pseudospectral method and nonlinear programming are supported by the initial guess generated from the Chang-Chichka-Marsden Lyapunov-based transfer controller. This approach successfully solves several low-thrust optimal problems. Numerical results show that the Lyapunov-based initial guess overcomes the difficulty in optimization caused by the strong oscillation of variables in the Cartesian coordinates system. Furthermore, a comparison of the results shows that obtaining the optimal transfer solution through the polynomial approximation by utilizing Cartesian coordinates is easier than using orbital elements, which normally produce strongly nonlinear equations of motion. In this paper, the Eart...
Equivalence of the Path Integral for Fermions in Cartesian and Spherical Coordinates
Briggs, Andrew; Camblong, Horacio E.; Ordonez, Carlos R.
2011-01-01
The path-integral calculation for the free energy of a spin-1/2 Dirac-fermion gas is performed in spherical polar coordinates for a flat spacetime geometry. Its equivalence with the Cartesian-coordinate representation is explicitly established. This evaluation involves a relevant limiting case of the fermionic path integral in a Schwarzschild background, whose near-horizon limit has been shown to be related to black hole thermodynamics.
New advance on non-hydrostatic shallow granular flow model in a global Cartesian coordinate system
Yuan, L; Zhai, J; Wu, S F; Patra, A K; Pitman, E B
2016-01-01
Mathematical modeling of granular avalanche flows over a general topography needs appropriate forms of shallow granular flow models. Current shallow granular flow models suited to arbitrary topography can be grossly divided into two types, those formulated in bed-fitted curvilinear coordinates (e.g., Ref.~\\cite{{Puda2003}}), and those formulated in global Cartesian coordinates (e.g., Refs.~\\cite{{Bouchut2004},{Denlinger2004},{Castro2014}}). In the recent years, several improvements have been made in global Cartesian formulations for shallow granular flows. In this paper, we first perform a review of the Cartesian model of Denlinger and Iverson \\cite{Denlinger2004} and the Cartesian Boussinesq-type granular flow theory of Castr-Ogaz \\emph{et al.} \\cite{Castro2014}. Both formulations account for the effect of nonzero vertical acceleration on depth-averaged momentum fluxes and stress states. We then further calculate the vertical normal stress of Castr-Ogaz \\emph{et al.}~\\cite{Castro2014} and the basal normal st...
An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in Cartesian coordinates, which is considerably simpler. Under open boundary conditions, an expression for multipole moments of point dipoles in a cell is derived. These make the program appropriate for nanomagnetic simulations, including magnetic nanoparticles and ferrofluids. The performance is optimized in terms of cell size and parameter set (expansion order and opening angle) and the trade off between computing time and accuracy is quantitatively studied. A rule of thumb is proposed to decide the appropriate average number of dipoles in the smallest cells, and an optimal choice of parameter set is suggested. Finally, the superiority of Cartesian coordinate FMM is demonstrated by comparison to spherical harmonics FMM and FFT.
Density functional calculation of many-electron systems in cartesian coordinate grid
Roy, Amlan K.
2010-01-01
A recently developed density functional method, within Hohenberg-Kohn-Sham framework, is used for faithful description of atoms, molecules in Cartesian coordinate grid, by using an LCAO-MO ansatz. Classical Coulomb potential is obtained by means of a Fourier convolution technique. All two-body potentials (including exchange-correlation (XC)) are constructed directly on real grid, while their corresponding matrix elements are computed from numerical integration. Detailed systematic investigati...
Zhang, Wen
2008-01-01
An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in cartesian coordinates, which is considerably simpler. Under open boundary conditions, an expression for multipole moments of point dipoles in a cell is derived. These make the program appropriate for nanomagnetic simulations, including magnetic nanoparticles and ferrofluids. The performance is optimized in terms of cell size and parameter set (expansion order and opening angle) and trade off between computing time and accuracy is quantitatively studied. A rule of thumb is proposed to decide the average number of dipoles in the smallest cells, and an optimal choice of parameter set is suggested.
Density functional calculation of many-electron systems in cartesian coordinate grid
Roy, Amlan K
2011-01-01
A recently developed density functional method, within Hohenberg-Kohn-Sham framework, is used for faithful description of atoms, molecules in Cartesian coordinate grid, by using an LCAO-MO ansatz. Classical Coulomb potential is obtained by means of a Fourier convolution technique. All two-body potentials (including exchange-correlation (XC)) are constructed directly on real grid, while their corresponding matrix elements are computed from numerical integration. Detailed systematic investigation is made for a representative set of atoms/molecules through a number of properties like total energies, component energies, ionization energies, orbital energies, etc. Two nonlocal XC functionals (FT97 and PBE) are considered for pseudopotential calculation of 35 species while preliminary all-electron results are reported for 6 atoms using the LDA XC density functional. Comparison with literature results, wherever possible, exhibits near-complete agreement. This offers a simple efficient route towards accurate reliable...
Zimmerman Peter A
2010-06-01
Full Text Available Abstract Background Diagnosis of infectious diseases now benefits from advancing technology to perform multiplex analysis of a growing number of variables. These advances enable simultaneous surveillance of markers characterizing species and strain complexity, mutations associated with drug susceptibility, and antigen-based polymorphisms in relation to evaluation of vaccine effectiveness. We have recently developed assays detecting single nucleotide polymorphisms (SNPs in the P. falciparum genome that take advantage of post-PCR ligation detection reaction and fluorescent microsphere labeling strategies. Data from these assays produce a spectrum of outcomes showing that infections result from single to multiple strains. Traditional methods for distinguishing true positive signal from background can cause false positive diagnoses leading to incorrect interpretation of outcomes associated with disease treatment. Results Following analysis of Plasmodium falciparum dihydrofolate reductase SNPs associated with resistance to a commonly used antimalarial drug, Fansidar (Sulfadoxine/pyrimethamine, and presumably neutral SNPs for parasite strain differentiation, we first evaluated our data after setting a background signal based on the mean plus three standard deviations for known negative control samples. Our analysis of single allelic controls suggested that background for the absent allele increased as the concentration of the target allele increased. To address this problem, we introduced a simple change of variables from customary (X,Y (Cartesian coordinates to planar polar coordinates (X = rcos(θ, Y = rsin(θ. Classification of multidimensional fluorescence signals based on histograms of angular and radial data distributions proved more effective than classification based on Cartesian thresholds. Comparison with known diallelic dilution controls suggests that histogram-based classification is effective for major:minor allele concentration ratios as
GONG Yan-Jun; WU Zhen-Sen; WU Jia-Ji
2009-01-01
We present an analytical model of Doppler spectra in backscattering from arbitrary rough convex bodies of revolution rotating around their axes in the global Cartesian coordinate system. This analytical model is applied to analyse Doppler spectra in backscatter from two cones and two cylinders, as well as two ellipsoids of revolution. We numerically analyse the influences of attitude and geometry size of objects on Doppler spectra. The analytical model can give contribution of the surface roughness, attitude and geometry size of convex bodies of revolution to Doppler spectra and may contribute to laser Doppler velocimetry as well as ladar applications.
Vandewalle, Kristof; Festjens, Nele; Plets, Evelyn; Vuylsteke, Marnik; Saeys, Yvan; Callewaert, Nico
2015-01-01
Reverse genetics research approaches require the availability of methods to rapidly generate specific mutants. Alternatively, where these methods are lacking, the construction of pre-characterized libraries of mutants can be extremely valuable. However, this can be complex, expensive and time consuming. Here, we describe a robust, easy to implement parallel sequencing-based method (Cartesian Pooling-Coordinate Sequencing or CP-CSeq) that reports both on the identity as well as on the location of sequence-tagged biological entities in well-plate archived clone collections. We demonstrate this approach using a transposon insertion mutant library of the Mycobacterium bovis BCG vaccine strain, providing the largest resource of mutants in any strain of the M. tuberculosis complex. The method is applicable to any entity for which sequence-tagged identification is possible. PMID:25960123
Yao Yevenyo Ziggah
2013-01-01
Full Text Available The aim of this research is to study and analyze statistical models applicable in bringing out arelationship between global coordinates and cartesian planimetric coordinates of some known controlstations in the University of Mines and Technology (UMaT campus. To achieve the aims of this research,the Global Position System (GPS latitudes and longitudes of selected control stations with knowncartesian planimetric coordinates were determined using the Handheld GPS receiver at different epoch(morning and evening. Linear Regression analysis was then conducted to establish the correlationbetween global and cartesian planimetric coordinates of the selected control stations and regressionmodels generated to show the results. The correlation coefficient r, a t-test for non -zero slope, t-test oncorrelation coefficient, graphical residual analysis, test of normality, comparing model predictions toobserved data, were used to evaluate and check the adequacy of the models. The obtained resultsindicated that the proposed linear regression models are suitable for predictions at 95% confidenceinterval and do not violate any of the statistical assumptions of a linear model. However, the proposedregression models for the evening observation gave better prediction accuracy than the morning. Acomputer programming algorithm and a designed interface was created for the proposed regressionmodels established using Microsoft C++ standard edition 6.0, thus making it easier in applying themodels in making cartesian planimetric coordinates prediction at different epoch at UMaT.
Emílio Borges
2007-04-01
Full Text Available A simple method to obtain molecular Cartesian coordinates as a function of vibrational normal modes is presented in this work. The method does not require the definition of special matrices, like the F and G of Wilson, neither of group theory. The Eckart's conditions together with the diagonalization of kinetic and potential energy are the only required expressions. This makes the present approach appropriate to be used as a preliminary study for more advanced concepts concerning vibrational analysis. Examples are given for diatomic and triatomic molecules.
Spectral pairs in Cartesian coordinates
Jorgensen, Palle E. T.; Pedersen, Steen
1999-01-01
Let $ \\Omega \\subset R^d $ have finite positive Lebesgue measure, and let $ \\mathcal{L}^{2}(\\Omega) $ be the corresponding Hilbert space of $ \\mathcal{L}^{2} $-functions on $ \\Omega $. We shall consider the exponential functions $ e_{\\lambda} $ on $ \\Omega $ given by $ e_{\\lambda}(x)=e^{i2\\pi\\lambda x} $. If these functions form an orthogonal basis for $ \\mathcal{L}^{2}(\\Omega) $, when $ \\lambda $ ranges over some subset $ \\Lambda $ in $ R^d $, then we say that $ (\\Omega,\\Lambda) $ is a spect...
Cartesian tensors an introduction
Temple, G
2004-01-01
This undergraduate text provides an introduction to the theory of Cartesian tensors, defining tensors as multilinear functions of direction, and simplifying many theorems in a manner that lends unity to the subject. The author notes the importance of the analysis of the structure of tensors in terms of spectral sets of projection operators as part of the very substance of quantum theory. He therefore provides an elementary discussion of the subject, in addition to a view of isotropic tensors and spinor analysis within the confines of Euclidean space. The text concludes with an examination of t
Miller, Julian F
2011-01-01
Cartesian Genetic Programming (CGP) is a highly effective and increasingly popular form of genetic programming. It represents programs in the form of directed graphs, and a particular characteristic is that it has a highly redundant genotype - phenotype mapping, in that genes can be noncoding. It has spawned a number of new forms, each improving on the efficiency, among them modular, or embedded, CGP, and self-modifying CGP. It has been applied to many problems in both computer science and applied sciences. This book contains chapters written by the leading figures in the development and appli
Irreducible Cartesian tensors of highest weight, for arbitrary order
Mane, S. R.
2016-03-01
A closed form expression is presented for the irreducible Cartesian tensor of highest weight, for arbitrary order. Two proofs are offered, one employing bookkeeping of indices and, after establishing the connection with the so-called natural tensors and their projection operators, the other one employing purely coordinate-free tensor manipulations. Some theorems and formulas in the published literature are generalized from SO(3) to SO(n), for dimensions n ≥ 3.
A Hybrid Advection Scheme for Conserving Angular Momentum on a Refined Cartesian Mesh
Byerly, Zachary D; Tohline, Joel E; Marcello, Dominic C
2014-01-01
We test a new "hybrid" scheme for simulating dynamical fluid flows in which cylindrical components of the momentum are advected across a rotating Cartesian coordinate mesh. This hybrid scheme allows us to conserve angular momentum to machine precision while capitalizing on the advantages offered by a Cartesian mesh, such as a straightforward implementation of mesh refinement. Our test focuses on measuring the real and imaginary parts of the eigenfrequency of unstable axisymmetric modes that naturally arise in massless polytropic tori having a range of different aspect ratios, and quantifying the uncertainty in these measurements. Our measured eigenfrequencies show good agreement with the results obtained from the linear stability analysis of Kojima (1986) and from nonlinear hydrodynamic simulations performed on a cylindrical coordinate mesh by Woodward et al. (1994). When compared against results conducted with a traditional Cartesian advection scheme, the hybrid scheme achieves qualitative convergence at the...
Cartesian approach for constrained mechanical systems
Ramírez, Rafael
2010-01-01
In the history of mechanics, there have been two points of view for studying mechanical systems: Newtonian and Cartesian. According the Descartes point of view, the motion of mechanical systems is described by the first-order differential equations in the N dimensional configuration space . In this paper we develop the Cartesian approach for mechanical systems with constraints which are linear with respect to velocity.
Turing instabilities on Cartesian product networks
Asllani, Malbor; Busiello, Daniel M.; Carletti, Timoteo; Fanelli, Duccio; Planchon, Gwendoline
2015-08-01
The problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor product of the eigenvectors of the discrete Laplacian operators, associated to each of the individual networks that build the Cartesian product. The dispersion relation which controls the onset of the instability depends on a set of discrete wavelengths, the eigenvalues of the aforementioned Laplacians. Patterns can develop on the Cartesian network, if they are supported on at least one of its constitutive sub-graphs. Multiplex networks are also obtained under specific prescriptions. In this case, the criteria for the instability reduce to compact explicit formulae. Numerical simulations carried out for the Mimura-Murray reaction kinetics confirm the adequacy of the proposed theory.
史汝超; 张亚军; 徐胜利
2014-01-01
采用 NGFM(New version of Ghost Fluid Method)处理复杂计算域的固壁边界，用RGFM(Real Ghost Fluid Method)求解气-水界面附近网格节点的状态参数，从而在直角坐标系下对复杂计算域的水下高压气泡膨胀问题进行数值模拟。流场控制方程选用 Euler 方程，用五阶 WENO 格式离散空间导数项，二阶 Runge-Kutta 法离散时间导数项；气-水界面追踪使用 Level Set 方法，对 Level Set 方程，用五阶 HJ-WENO (Hamilton-Jacobi WENO)和三阶Runge-Kutta 法求解。将计算结果与任意坐标系下的结果进行对比，验证了 NGFM 在笛卡尔网格中处理复杂形状固壁边界的可行性。得到了水下流场压力等值线图、高压气泡的演变过程以及特定点处的压力-时间曲线。计算结果表明，高压气泡在固壁反射激波的作用下，膨胀过程受到抑制；强激波在固壁的反射会导致固壁附近出现大范围的空化流动。%We adopted a new version of ghost fluid method (NGFM)to treat the wall boundary in a complex calculation region in Cartesian coordinate system,and real ghost fluid method (RGFM)to predict the flow states at grid nodes just next to the gas-liquid interface.Flow field was solved by Euler equation with 5th-order WENO spatial discretization and 2nd-order Runge-Kutta (R-K)time discretization.We used the level set method to keep track of gas-liquid interface.Level set function was discretized by 5th-order Hamilton-Jacobi WENO and 3rd-order R-K method.We verified that NGFM was easy to extend and could be applied to treat complex wall boundary in Cartesian grid by comparing with results in arbitrary coordinate system.We carried out pressure contours,the change process of bubble shape and pressure history at some given points.The numerical results demonstrate that the expansion of high pressure bubble is restricted by the reflected shock wave from the wall.It is also shown that the reflection of strong shock wave from
Conversion of contours to cartesian grids
Mann, Jakob; Broe, Brian Riget
A robust and efficient method of calculating a cartesian grid of heights or roughnesses from contour line maps is developed. The purpose of the grids is to serve as input for atmospheric flow solvers such as WAsP Engineering or EllipSys3D. The method builds on Delaunay triangulation constrained to...
Frequency-Offset Cartesian Feedback Based on Polyphase Difference Amplifiers
Zanchi, Marta G.; Pauly, John M.; Scott, Greig C
2010-01-01
A modified Cartesian feedback method called “frequency-offset Cartesian feedback” and based on polyphase difference amplifiers is described that significantly reduces the problems associated with quadrature errors and DC-offsets in classic Cartesian feedback power amplifier control systems.
Çavşak, Hasan; Elmas, Ali
2014-01-01
In this study, comparisons of the various calculations are made to achieve the best results in gravity computation. In the three dimensional (3D) gravity study, mass surfaces are defined by dividing the triangle surfaces. The more triangle surface is taken, the more precise definition of mass are made. Triangular pyramids are taken into consideration as the 3D master model. This model is formed between each triangle surface and calculation point. This method can describe complex shaped format...
Irreducible Cartesian tensor expansions of scalar fields
It is shown how a scalar function V(parallel R + Σ/sub i equals 1/sup n/ a/sub i/parallel) of a sum of n + 1 vectors can be expanded as a multiple Cartesian tensor series in the vectors a/ sub i/. This expansion is a rearrangement of the multiple Taylor series expansion of such a function. In order to prove the fundamental theorem, generalized Cartesian Legendre polynomials are defined. The theorem is applied to the eigenfunctions of the Laplace operator and to inverse powers. The expansion of the latter type of function leads to forms involving generalized hypergeometric functions in several variables. As a special case, the Cartesian form of the multipole expansion of the electrostatic potential between two linear molecules is derived. A number of sum rules for hypergeometric functions and addition formulas for (standard and modified) spherical Bessel functions are proved by using a reduction property of the generalized Legendre polynomials. The case of the expansion of a tensorial function is also briefly discussed
Adventures in Coordinate Space
Chambers, J. E.
2003-08-01
A variety of coordinate systems have been used to study the N-body problem for cases involving a dominant central mass. These include the traditional Keplerian orbital elements and the canonical Delaunay variables, which both incorporate conserved quantities of the two-body problem. Recently, Cartesian coordinate systems have returned to favour with the rise of mixed-variable symplectic integrators, since these coordinates prove to be more efficient than using orbital elements. Three sets of canonical Cartesian coordinates are well known, each with its own advantages and disadvantages. Inertial coordinates (which include barycentric coordinates as a special case) are the simplest and easiest to implement. However, they suffer from the disadvantage that the motion of the central body must be calculated explicitly, leading to relatively large errors in general. Jacobi coordinates overcome this problem by replacing the coordinates and momenta of the central body with those of the system as a whole, so that momentum is conserved exactly. This leads to substantial improvements in accuracy, but has the disadvantage that every object is treated differently, and interactions between each pair of bodies are now expressed in a complicated manner involving the coordinates of many bodies. Canonical heliocentric coordinates (also known as democratic heliocentric coordinates) treat all bodies equally, and conserve the centre of mass motion, but at the cost of introducing momentum cross terms into the kinetic energy. This complicates the development of higher order symplectic integrators and symplectic correctors, as well as the development of methods used to resolve close encounters with the central body. Here I will re-examine the set of possible canonical Cartesian coordinate systems to determine if it is possible to (a) conserve the centre of mass motion, (b) treat all bodies equally, and (c) eliminate the momentum cross terms. I will demonstrate that this is indeed possible
Duality between coordinates and Dirac field
Abdalla, Maria Christina B; Vancea, I V
2000-01-01
The duality between the Cartesian coordinates on the Minkowski space-time andthe Dirac field is investigated. Two distinct possibilities to define thisduality are shown to exist. In both cases, the equations satisfied byprepotentials are of second order.
Quality-based generation of weather radar Cartesian products
K. Ośródka; J. Szturc
2015-01-01
Weather radar data volumes are commonly processed to obtain various 2-D Cartesian products based on the transfer from polar to Cartesian representations through a certain interpolation method. In this research an algorithm of the spatial interpolation of polar reflectivity data employing quality index data is applied to find the Cartesian reflectivity as plan position indicator products. On this basis, quality-based versions of standard algorithms for the generation of the foll...
Electrostatic PIC with adaptive Cartesian mesh
Kolobov, Vladimir I
2016-01-01
We describe an initial implementation of an electrostatic Particle-in-Cell (ES-PIC) module with adaptive Cartesian mesh in our Unified Flow Solver framework. Challenges of PIC method with cell-based adaptive mesh refinement (AMR) are related to a decrease of the particle-per-cell number in the refined cells with a corresponding increase of the numerical noise. The developed ES-PIC solver is validated for capacitively coupled plasma, its AMR capabilities are demonstrated for simulations of streamer development during high-pressure gas breakdown. It is shown that cell-based AMR provides a convenient particle management algorithm for exponential multiplications of electrons and ions in the ionization events.
Electrostatic PIC with adaptive Cartesian mesh
Kolobov, Vladimir; Arslanbekov, Robert
2016-05-01
We describe an initial implementation of an electrostatic Particle-in-Cell (ES-PIC) module with adaptive Cartesian mesh in our Unified Flow Solver framework. Challenges of PIC method with cell-based adaptive mesh refinement (AMR) are related to a decrease of the particle-per-cell number in the refined cells with a corresponding increase of the numerical noise. The developed ES-PIC solver is validated for capacitively coupled plasma, its AMR capabilities are demonstrated for simulations of streamer development during high-pressure gas breakdown. It is shown that cell-based AMR provides a convenient particle management algorithm for exponential multiplications of electrons and ions in the ionization events.
This paper presents a Cartesian method for the simultaneous fitting of the bathymetry and shorelines in a three-dimensional, hydrodynamic model for free-surface flows. The model, named LESS3D (Lake and Estuarine Simulation System in Three Dimensions), solves flux-based finite difference equations in the Cartesian-coordinate system (x,y,z). It uses a bilinear bottom to fit the bottom topography and keeps track the dynamic position of the shoreline. The resulting computational cells are hybrid: interior cells are regular Cartesian grid cells with six rectangular faces, and boundary/bottom cells (at least one face is the water-solid interface) are unstructured cells whose faces are generally not rectangular. With the bilinear interpolation, the shape of a boundary/bottom cell can be determined at each time step. This allows the Cartesian coordinate model to accurately track the dynamic position of the shorelines. The method was tested with a laboratory experiment of a Tsunami runup case on a circular island. It was also tested for an estuary in Florida, USA. Both model applications demonstrated that the Cartesian method is quite robust. Because the present method does not require any coordinate transformation, it can be an attractive alternative to curvilinear grid model
Cartesian anisotropic mesh adaptation for compressible flow
Simulating transient compressible flows involving shock waves presents challenges to the CFD practitioner in terms of the mesh quality required to resolve discontinuities and prevent smearing. This paper discusses a novel two-dimensional Cartesian anisotropic mesh adaptation technique implemented for compressible flow. This technique, developed for laminar flow by Ham, Lien and Strong, is efficient because it refines and coarsens cells using criteria that consider the solution in each of the cardinal directions separately. In this paper the method will be applied to compressible flow. The procedure shows promise in its ability to deliver good quality solutions while achieving computational savings. The convection scheme used is the Advective Upstream Splitting Method (Plus), and the refinement/ coarsening criteria are based on work done by Ham et al. Transient shock wave diffraction over a backward step and shock reflection over a forward step are considered as test cases because they demonstrate that the quality of the solution can be maintained as the mesh is refined and coarsened in time. The data structure is explained in relation to the computational mesh, and the object-oriented design and implementation of the code is presented. Refinement and coarsening algorithms are outlined. Computational savings over uniform and isotropic mesh approaches are shown to be significant. (author)
Lin, Dejun
2015-09-01
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green's function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4-16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
Bilateral Teleoperation in Cartesian Space with Time-Varying Delay
Zhang Chen
2012-10-01
Full Text Available The bilateral control of a teleoperator in Cartesian space with time‐varying delay is studied in this paper. Compared with the traditional joint‐space teleoperation mode, bilateral control in Cartesian space has advantages when dealing with the kinematically dissimilar (KDS teleoperation systems. A Cartesian space‐based PD‐like bilateral controller with dissipation factors is designed. Considering the fact that attitude errors derived by rotation matrix cannot be directly used for PD control, a quaternion‐based approach is adopted to calculate the attitude errors in Cartesian space. In order to overcome the instability brought about by communication delay, local damping components are employed at both ends of the teleoperator system. The variation of time delay may generate extra energy and influence the stability of the system, thus dissipation factors are introduced into the controller. The stability of the proposed bilateral controller is proved and the simulations show the effectiveness of the approach.
Hegel's Solution to Cartesian Dualism of Mind and Body
Farzad Haji Mirzaie
2015-01-01
In this paper, I am going to review the Hegelian solution to solve Cartesian doctrine of the mind body dualism. Such a dichotomy refers to the fact that in the recognition we are dealing with two completely different and separate domains, i.e., the internal world (ideas, beliefs, concepts, and mentalities), and the external world (the domain of objects) that which refers to the first domain. Hegel believes that Cartesian dualism arises from a categorical mistake. He says that subjectivism is ...
Frequency-Offset Cartesian Feedback Based on Polyphase Difference Amplifiers.
Zanchi, Marta G; Pauly, John M; Scott, Greig C
2010-05-01
A modified Cartesian feedback method called "frequency-offset Cartesian feedback" and based on polyphase difference amplifiers is described that significantly reduces the problems associated with quadrature errors and DC-offsets in classic Cartesian feedback power amplifier control systems.In this method, the reference input and feedback signals are down-converted and compared at a low intermediate frequency (IF) instead of at DC. The polyphase difference amplifiers create a complex control bandwidth centered at this low IF, which is typically offset from DC by 200-1500 kHz. Consequently, the loop gain peak does not overlap DC where voltage offsets, drift, and local oscillator leakage create errors. Moreover, quadrature mismatch errors are significantly attenuated in the control bandwidth. Since the polyphase amplifiers selectively amplify the complex signals characterized by a +90° phase relationship representing positive frequency signals, the control system operates somewhat like single sideband (SSB) modulation. However, the approach still allows the same modulation bandwidth control as classic Cartesian feedback.In this paper, the behavior of the polyphase difference amplifier is described through both the results of simulations, based on a theoretical analysis of their architecture, and experiments. We then describe our first printed circuit board prototype of a frequency-offset Cartesian feedback transmitter and its performance in open and closed loop configuration. This approach should be especially useful in magnetic resonance imaging transmit array systems. PMID:20814450
Configuration space representation in parallel coordinates
Fiorini, Paolo; Inselberg, Alfred
1989-01-01
By means of a system of parallel coordinates, a nonprojective mapping from R exp N to R squared is obtained for any positive integer N. In this way multivariate data and relations can be represented in the Euclidean plane (embedded in the projective plane). Basically, R squared with Cartesian coordinates is augmented by N parallel axes, one for each variable. The N joint variables of a robotic device can be represented graphically by using parallel coordinates. It is pointed out that some properties of the relation are better perceived visually from the parallel coordinate representation, and that new algorithms and data structures can be obtained from this representation. The main features of parallel coordinates are described, and an example is presented of their use for configuration space representation of a mechanical arm (where Cartesian coordinates cannot be used).
Estimation of Cartesian Space Robot Trajectories Using Unit Quaternion Space
Aleš Ude
2014-08-01
Full Text Available The ability to estimate Cartesian space trajectories that include orientation is of great importance for many practical applications. While it is becoming easier to acquire trajectory data by computer vision methods, data measured by general-purpose vision or depth sensors are often rather noisy. Appropriate smoothing methods are thus needed in order to reconstruct smooth Cartesian space trajectories given noisy measurements. In this paper, we propose an optimality criterion for the problem of the smooth estimation of Cartesian space trajectories that include the end-effector orientation.Based on this criterion, we develop an optimization method for trajectory estimation which takes into account the special properties of the orientation space, which we represent by unit quaternions.The efficiency of the developed approach is discussed and experimental results are presented.
Branduardi, Davide; Faraldo-Gómez, José D
2013-09-10
The string method is a molecular-simulation technique that aims to calculate the minimum free-energy path of a chemical reaction or conformational transition, in the space of a pre-defined set of reaction coordinates that is typically highly dimensional. Any descriptor may be used as a reaction coordinate, but arguably the Cartesian coordinates of the atoms involved are the most unprejudiced and intuitive choice. Cartesian coordinates, however, present a non-trivial problem, in that they are not invariant to rigid-body molecular rotations and translations, which ideally ought to be unrestricted in the simulations. To overcome this difficulty, we reformulate the framework of the string method to integrate an on-the-fly structural-alignment algorithm. This approach, referred to as SOMA (String method with Optimal Molecular Alignment), enables the use of Cartesian reaction coordinates in freely tumbling molecular systems. In addition, this scheme permits the dissection of the free-energy change along the most probable path into individual atomic contributions, thus revealing the dominant mechanism of the simulated process. This detailed analysis also provides a physically-meaningful criterion to coarse-grain the representation of the path. To demonstrate the accuracy of the method we analyze the isomerization of the alanine dipeptide in vacuum and the chair-to-inverted-chair transition of β-D mannose in explicit water. Notwithstanding the simplicity of these systems, the SOMA approach reveals novel insights into the atomic mechanism of these isomerizations. In both cases, we find that the dynamics and the energetics of these processes are controlled by interactions involving only a handful of atoms in each molecule. Consistent with this result, we show that a coarse-grained SOMA calculation defined in terms of these subsets of atoms yields nearidentical minimum free-energy paths and committor distributions to those obtained via a highly-dimensional string. PMID
Analysis of a Cartesian PML approximation to acoustic scattering problems in and
Bramble, James H.
2013-08-01
We consider the application of a perfectly matched layer (PML) technique applied in Cartesian geometry to approximate solutions of the acoustic scattering problem in the frequency domain. The PML is viewed as a complex coordinate shift ("stretching") and leads to a variable complex coefficient equation for the acoustic wave posed on an infinite domain, the complement of the bounded scatterer. The use of Cartesian geometry leads to a PML operator with simple coefficients, although, still complex symmetric (non-Hermitian). The PML reformulation results in a problem whose solution coincides with the original solution inside the PML layer while decaying exponentially outside. The rapid decay of the PML solution suggests truncation to a bounded domain with a convenient outer boundary condition and subsequent finite element approximation (for the truncated problem). This paper provides new stability estimates for the Cartesian PML approximations both on the infinite and the truncated domain. We first investigate the stability of the infinite PML approximation as a function of the PML strength σ0. This is done for PML methods which involve continuous piecewise smooth stretching as well as piecewise constant stretching functions. We next introduce a truncation parameter M which determines the size of the PML layer. Our analysis shows that the truncated PML problem is stable provided that the product of Mσ0 is sufficiently large, in which case the solution of the problem on the truncated domain converges exponentially to that of the original problem in the domain of interest near the scatterer. This justifies the simple computational strategy of selecting a fixed PML layer and increasing σ0 to obtain the desired accuracy. The results of numerical experiments varying M and σ0 are given which illustrate the theoretically predicted behavior. © 2013 Elsevier B.V. All rights reserved.
Mixed connectivity of Cartesian graph products and bundles
Erves, Rija
2010-01-01
Mixed connectivity is a generalization of vertex and edge connectivity. A graph is $(p,0)$-connected, $p>0$, if the graph remains connected after removal of any $p-1$ vertices. A graph is $(p,q)$-connected, $p\\geq 0$, $q>0$, if it remains connected after removal of any $p$ vertices and any $q-1$ edges. Cartesian graph bundles are graphs that generalize both covering graphs and Cartesian graph products. It is shown that if graph $F$ is $(p_{F},q_{F})$-connected and graph $B$ is $(p_{B},q_{B})$-connected, then Cartesian graph bundle $G$ with fibre $F$ over the base graph $B$ is $(p_{F}+p_{B},q_{F}+q_{B})$-connected. Furthermore, if $q_{F},q_{B}>0$, then $G$ is also $(p_{F}+p_{B}+1,q_{F}+q_{B}-1)$-connected. Finally, let graphs $G_i, i=1,...,n,$ be $(p_i,q_i)$-connected and let $k$ be the number of graphs with $q_i>0$. The Cartesian graph product $G=G_1\\Box G_2\\Box ... \\Box G_n$ is $(\\sum p_i,\\sum q_i)$-connected, and, for $ k\\geq 1$, it is also $(\\sum p_i+k-1,\\sum q_i-k+1)$-connected.
Efficient Cartesian-grid-based modeling of rotationally symmetric bodies
Shyroki, Dzmitry
2007-01-01
Axially symmetric waveguides, resonators, and scatterers of arbitrary cross section and anisotropy in the cross section can be modeled rigorously with use of 2-D Cartesian-grid based codes by means of mere redefinition of material permittivity and permeability profiles. The method is illustrated by...
The Cartesian Diver, Surface Tension and the Cheerios Effect
Chen, Chi-Tung; Lee, Wen-Tang; Kao, Sung-Kai
2014-01-01
A Cartesian diver can be used to measure the surface tension of a liquid to a certain extent. The surface tension measurement is related to the two critical pressures at which the diver is about to sink and about to emerge. After sinking because of increasing pressure, the diver is repulsed to the centre of the vessel. After the pressure is…
A Lot of Good Physics in the Cartesian Diver
De Luca, Roberto; Ganci, Salvatore
2011-01-01
The Cartesian diver experiment certainly occupies a place of honour in old physics textbooks as a vivid demonstration of Archimedes' buoyancy. The original experiment, as described in old textbooks, shows Archimedes buoyancy qualitatively: when the increased weight of the diver is not counterbalanced by Archimedes' buoyancy, the diver sinks. When…
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
Lin, Dejun, E-mail: dejun.lin@gmail.com [Department of Biochemistry and Biophysics, University of Rochester Medical Center, Rochester, New York 14642 (United States)
2015-09-21
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
Lin, Dejun
2015-09-21
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green's function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4-16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
Duality between coordinates and Dirac field
Abdalla, M. C. B.; Gadelha, A. L.; Vancea, I. V.
2000-01-01
The duality between the Cartesian coordinates on the Minkowski space-time and the Dirac field is investigated. Two distinct possibilities to define this duality are shown to exist. In both cases, the equations satisfied by prepotentials are of second order.
Duality between coordinates and Dirac field
Abdalla, M. C. B.; Gadelha, A. L.; Vancea, I. V.
2000-07-01
The duality between the Cartesian coordinates on the Minkowski space-time and the Dirac field is investigated. Two distinct possibilities to define this duality are shown to exist. In both cases, the equations satisfied by prepotentials are of second order.
Derived strengths of preference relations on coordinates
Wakker, Peter
1988-01-01
textabstractway is indicated to derive, from a preference relation on a Cartesian product, strength of preference relations on the coordinate sets. These strengths of preference relations are then used to reformulate several well-known properties of preference relations, and make their meaning more transparent. A new result for dynamic contexts is given.
Cartesian grid methods for the compressible Navier-Stokes equations
Skøien, Are Arstad
2012-01-01
A Cartesian grid method has been developed for solving the 2D Euler and Navier-Stokes equations for viscous and inviscid compressible flow, respectively. Both steady and unsteady flows have been considered. Using a simplified ghost point treatment, we consider the closest grid points as mirror points of the ghost points. Wall boundary conditions are imposed at the ghost points of the immersed boundary. The accuracy of the method has been investigated for various test cases. We show computed e...
Cognitive Semantics: An Extension of the Cartesian Legacy
Karmakar, Samir
2006-01-01
The basic intention of this article is to show how the cognitive semantics inherits its ancestry from the Cartesian foundation. The emergence of the cognitive semantics is envisaged here as an integral part of the knowledge evolution, in terms of shifts, which ultimately determines the future direction of our epistemological quest. Basically two questions have been emphasized here: (a) how (and what amount of) common sense metaphysics can be incorporated within the existing system of knowledg...
Topics in graph theory graphs and their Cartesian product
Imrich, Wilfried; Rall, Douglas F
2008-01-01
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.
ONMCGP: Orthogonal Neighbourhood Mutation Cartesian Genetic Programming for Evolvable Hardware
Evolvable Hardware is facing the problems of scalability and stalling effect. This paper proposed a novel Orthogonal Neighbourhood Mutation (ONM) operator in Cartesian genetic programming (CGP), to reduce the stalling effect in CGP and improve the efficiency of the algorithms.The method incorporates with Differential Evolution strategy. Demonstrated by experiments on benchmark, the proposed Orthogonal Neighbourhood Search can jump out of Local optima, reduce the stalling effect in CGP and the algorithm convergence faster
Hegel's Solution to Cartesian Dualism of Mind and Body
Farzad
2015-10-01
Full Text Available In this paper, I am going to review the Hegelian solution to solve Cartesian doctrine of the mind body dualism. Such a dichotomy refers to the fact that in the recognition we are dealing with two completely different and separate domains, i.e., the internal world (ideas, beliefs, concepts, and mentalities, and the external world (the domain of objects that which refers to the first domain. Hegel believes that Cartesian dualism arises from a categorical mistake. He says that subjectivism is the starting point that fundamentally is wrong. Hegel argues that a genuine philosophy could overcome the dichotomy. According to Hegel, it is only by the idea of "absolute" and “identity in differences” that could be possible to go out of this dualism. The role of philosophy, for him, is theorizing "about the real world”. Hegel says that these contradictions are within the "structure of consciousness." By adopting the right approach in explaining Cartesian doctrine of the mind body dualism from a phenomenological perspective, it can be possible to show the mind’s Odyssey within reality.
Topology preserving advection of implicit interfaces on Cartesian grids
Qin, Zhipeng; Delaney, Keegan; Riaz, Amir; Balaras, Elias
2015-06-01
Accurate representation of implicit interface topology is important for the numerical computation of two phase flow on Cartesian grids. A new method is proposed for the construction of signed distance function by geometrically projecting interface topology onto the Cartesian grid using a multi-level projection framework. The method involves a stepwise improvement in the approximation to the signed distance function based on pointwise, piecewise and locally smooth reconstructions of the interface. We show that this approach provides accurate representation of the projected interface and its topology on the Cartesian grid, including the distance from the interface and the interface normal and curvature. The projected interface can be in the form of either a connected set of marker particles that evolve with Lagrangian advection, or a discrete set of points associated with an implicit interface that evolves with the advection of a scalar function. The signed distance function obtained with geometric projection is independent of the details of the scaler field, in contrast to the conventional approach where advection and reinitialization cannot be decoupled. As a result, errors introduced by reinitialization do not amplify advection errors, which leads to substantial improvement in both volume conservation and topology representation.
Development of a Cartesian grid based CFD solver (CARBS)
Formulation for 3D transient incompressible CFD solver is developed. The solution of variable property, laminar/turbulent, steady/unsteady, single/multi specie, incompressible with heat transfer in complex geometry will be obtained. The formulation can handle a flow system in which any number of arbitrarily shaped solid and fluid regions are present. The solver is based on the use of Cartesian grids. A method is proposed to handle complex shaped objects and boundaries on Cartesian grids. Implementation of multi-material, different types of boundary conditions, thermo physical properties is also considered. The proposed method is validated by solving two test cases. 1st test case is that of lid driven flow in inclined cavity. 2nd test case is the flow over cylinder. The 1st test case involved steady internal flow subjected to WALL boundaries. The 2nd test case involved unsteady external flow subjected to INLET, OUTLET and FREE-SLIP boundary types. In both the test cases, non-orthogonal geometry was involved. It was found that, under such a wide conditions, the Cartesian grid based code was found to give results which were matching well with benchmark data. Convergence characteristics are excellent. In all cases, the mass residue was converged to 1E-8. Based on this, development of 3D general purpose code based on the proposed approach can be taken up. (author)
On Double Interpolation in Polar Coordinates
Antoniu Nicula
2009-10-01
Full Text Available Interpolation is an important tool in numerical modeling of real-life systems. The Lagrange interpolation is frequently used, due to particular advantages in implementation. The bi-dimensional version may be implemented with Cartesian or with polar coordinate system. Choice of the coordinate system is important in order to obtain accurate results. The polar case has particular properties that can be exploited to minimize some of the common disadvantages of polynomial interpolation.
On Double Interpolation in Polar Coordinates
Antoniu Nicula; Florin Vancea; Codruţa Vancea
2009-01-01
Interpolation is an important tool in numerical modeling of real-life systems. The Lagrange interpolation is frequently used, due to particular advantages in implementation. The bi-dimensional version may be implemented with Cartesian or with polar coordinate system. Choice of the coordinate system is important in order to obtain accurate results. The polar case has particular properties that can be exploited to minimize some of the common disadvantages of polynomial interpolation.
A Cartesian embedded boundary method for hyperbolic conservation laws
Sjogreen, B; Petersson, N A
2006-12-04
The authors develop an embedded boundary finite difference technique for solving the compressible two- or three-dimensional Euler equations in complex geometries on a Cartesian grid. The method is second order accurate with an explicit time step determined by the grid size away from the boundary. Slope limiters are used on the embedded boundary to avoid non-physical oscillations near shock waves. They show computed examples of supersonic flow past a cylinder and compare with results computed on a body fitted grid. Furthermore, they discuss the implementation of the method for thin geometries, and show computed examples of transonic flow past an airfoil.
Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
Moustafa, Salli; Dutka Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre
2014-01-01
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOM...
Cartesian Dualism and Conceptual Change of the Soul
İlyas Altuner
2013-01-01
Cartesian philosophy inserts into philosophy the conception of consciousness which is a source for modern psychology, by leaving traditional understanding on the soul. Whereas Descartes reduces the soul to an organism which animates only or animal spirits, he connects thought to faculty of mind or rational soul that which he exalts as a gift of God. Thus, human being is named a mental thing in that he thinks, and a machine in that he acts. The exaltation of thought means that the only thing w...
ADAPTIVE LAYERED CARTESIAN CUT CELL METHOD FOR THE UNSTRUCTURED HEXAHEDRAL GRIDS GENERATION
WU Peining; TAN Jianrong; LIU Zhenyu
2007-01-01
Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the unstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. Vertex merging algorithm based on relaxed AVL tree is investigated to construct topological structure for stereo lithography (STL) files, and a topology-based self-adaptive layered slicing algorithm with special features control strategy is brought forward. With the help of convex hull, a new points-in-polygon method is employed to improve the Cartesian cut cell method. By integrating the self-adaptive layered slicing algorithm and the improved Cartesian cut cell method, the adaptive layered Cartesian cut cell method gains the volume data of the complex CAD model in STL file and generates the unstructured hexahedral anisotropic Cartesian grids.
The Wigner-Eckart Theorem for Reducible Symmetric Cartesian Tensor Operators
Bouzas, Antonio O.
2015-01-01
We explicitly establish a unitary correspondence between spherical irreducible tensor operators and cartesian tensor operators of any rank. That unitary relation is implemented by means of a basis of integer-spin wave functions that constitute simultaneously a basis of the spaces of cartesian and spherical irreducible tensors. As a consequence, we extend the Wigner--Eckart theorem to cartesian irreducible tensor operators of any rank, and to totally symmetric reducible ones. We also discuss t...
[Cartesian misunderstanding as a cause of therapeutic failure].
Isler, H
1986-01-01
Headache patients disassociate themselves from their own automatic responses, relying on the traditional separation of body and mind. On the other hand, patients who obtain voluntary control of automatic functions by biofeedback training modify not only vegetative but also voluntary behaviour patterns, losing "neurotic" traits. The basic misconception of the separation of body and mind, Cartesian dualism, is now ingrained in our culture. In the 17th century Descartes asserted that concepts applied to the soul must be entirely different from those used for the body in order to improve comprehension of the immortality of the soul. This dualism also led to "enlightenment" and to many later social and philosophical developments. But his basic neurophysiology was obsolete when he wrote it down. Other models from mainstream natural philosophy were better compatible with observation and experiments. Gassendi assumed a "body soul" consisting of energy as the functional principle of the nervous system, and Willis accommodated a series of anticipations of 19th century discoveries within this model. No comparable progress resulted from Descartes' own medieval model. Cartesian dualism has become untenable in view of recent neuropsychology but it still obstructs our management of functional patients. Instead of reinforcing the delusion of separation of psyche and soma, we ought to encourage patients to understand that their malfunctioning organs are on-line with their emotions, and with their mind. PMID:2420000
Adjoint Formulation for an Embedded-Boundary Cartesian Method
Nemec, Marian; Aftosmis, Michael J.; Murman, Scott M.; Pulliam, Thomas H.
2004-01-01
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
A fast apparent horizon finder for three-dimensional Cartesian grids in numerical relativity
In 3 + 1 numerical simulations of dynamic black-hole spacetimes, it is useful to be able to find the apparent horizon(s) (AH) in each slice of a time evolution. A number of AH finders are available, but they often take many minutes to run, so they are too slow to be practically usable at each time step. Here I present a new AH finder, AHFINDERDIRECT, which is very fast and accurate: at typical resolutions it takes only a few seconds to find an AH ∼ 10-5m accuracy on a GHz-class processor. I assume that an AH to be searched for is a Strahlkoerper ('star-shaped region') with respect to some local origin, and so parametrize the AH shape by r = h(angle) for some single-valued function h:S2 → R2. The AH equation then becomes a nonlinear elliptic PDE in h on S2, whose coefficients are algebraic functions of gij, Kij, and the Cartesian-coordinate spatial derivatives of gij. I discretize S2 using six angular patches (one each in the neighbourhood of the ±x, ± y, and ±z axes) to avoid coordinate singularities, and finite difference the AH equation in the angular coordinates using fourth-order finite differencing. I solve the resulting system of nonlinear algebraic equations (for h at the angular grid points) by Newton's method, using a 'symbolic differentiation' technique to compute the Jacobian matrix. AHFINDERDIRECT is implemented as a thorn in the CACTUS computational toolkit, and is freely available by anonymous CVS checkout
Guiding center orbit studies in a Tokamak Edge geometry employing boozer and Cartesian coordinate
Guiding center Monte-Carlo codes (GCMC) in both open and closed field line regions in the tokamak edge geometry are developed for the future applications in examining the integration of core and edge turbulence transport simulations. Introducing a simple analytical model for the edge geometry, the orbital studies are presented. (copyright 2008 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)
Moving Heat Source Reconstruction from Cauchy Boundary Data: The Cartesian Coordinates Case
Nilson C. Roberty
2011-01-01
Full Text Available We consider the problem of reconstruction of an unknown characteristic interval and block transient thermal source inside a domain. By exploring the definition of an Extended Dirichlet to Neumann map in the time space cylinder that has been introduced in Roberty and Rainha (2010a, we can treat the problem with methods similar to that used in the analysis of the stationary source reconstruction problem. Further, the finite difference θ-scheme applied to the transient heat conduction equation leads to a model based on a sequence of modified Helmholtz equation solutions. For each modified Helmholtz equation the characteristic interval and parallelepiped source function may be reconstructed uniquely from the Cauchy boundary data. Using representation formula we establish reciprocity functional mapping functions that are solutions of the modified Helmholtz equation to their integral in the unknown characteristic support. Numerical experiment for capture of an interval and an rectangular parallelepiped characteristic source inside a cubic box domain from boundary data are presented in threedimensional and one-dimensional implementations. The problem of centroid determination is addressed and questions are discussed from an computational points of view.
Červený, V.; Pšenčík, Ivan
2015-01-01
Roč. 25, - (2015), s. 109-155. ISSN 2336-3827 Institutional support: RVO:67985530 Keywords : integral superposition of paraxial Gaussian beams * inhomogeneous anisotropic media * S waves in weakly anisotropic media Subject RIV: DC - Siesmology, Volcanology, Earth Structure
Freitas, Andreia C.; Wylezinska, Marzena; BIRCH, MALCOLM J.; Petersen, Steffen E; Miquel, Marc E
2016-01-01
Dynamic imaging of the vocal tract using real-time MRI has been an active and growing area of research, having demonstrated great potential to become routinely performed in the clinical evaluation of speech and swallowing disorders. Although many technical advances have been made in regards to acquisition and reconstruction methodologies, there is still no consensus in best practice protocols. This study aims to compare Cartesian and non-Cartesian real-time MRI sequences, regarding image qual...
The Numerical Simulation of Ship Waves using Cartesian Grid Methods
Sussman, Mark
2014-01-01
Two different cartesian-grid methods are used to simulate the flow around the DDG 5415. The first technique uses a "coupled level-set and volume-of-fluid" (CLS) technique to model the free-surface interface. The no-flux boundary condition on the hull is imposed using a finite-volume technique. The second technique uses a level-set technique (LS) to model the free-surface interface. A body-force technique is used to impose the hull boundary condition. The predictions of both numerical techniques are compared to whisker-probe measurements of the DDG 5415. The level-set technique is also used to investigate the breakup of a two-dimensional spray sheet.
A variant of Marstrand's theorem for projections of cartesian products
Velázquez, Jorge Erick López
2011-01-01
We prove the following variant of Marstrand's theorem about projections of cartesian products of sets: Consider the space $\\Lambda_m=\\set{(t,O), t\\in\\R, O\\in SO(m)}$ with the natural measure and set $\\Lambda=\\Lambda_{m_1}\\times\\ppp\\times\\Lambda_{m_n}$. For every $\\la=(t_1,O_1,\\ppp,t_n,O_n)\\in\\Lambda$ and every $x=(x^1,\\ppp,x^n)\\in\\R^{m_1}\\times\\ppp\\times\\R^{m_n}$ we define $\\pi_\\la(x)=\\pi(t_1O_1x^1,\\ppp,t_nO_nx^n)$. Suppose that $\\pi$ is surjective and set $$\\mathfrak{m}:=\\min\\set{\\sum_{i\\in I}\\dim_H(K_i) + \\dim\\pi(\\bigoplus_{i\\in I^c}\\R^{m_i}), I\\subset\\set{1,\\ppp,n}, I\
Neural Network Schemes in Cartesian Space Control of Robot Manipulators
Yiannis S. BOUTALIS
2001-12-01
Full Text Available In this paper we are studying the Cartesian space robot manipulator control problem by using Neural Networks (NN. Although NN compensation for model uncertainties has been traditionally carried out by modifying the joint torque/force of the robot, it is also possible to achieve the same objective by using the NN to modify other quantities of the controller. We present and evaluate four different NN controller designs to achieve disturbance rejection for an uncertain system. The design perspectives are dependent on the compensated position by NN. There are four quantities that can be compensated: torque , force F, control input U and the input trajectory Xd. By defining a unified training signal all NN control schemes have the same goal of minimizing the same objective functions. We compare the four schemes in respect to their control performance and the efficiency of the NN designs, which is demonstrated via simulations.
Multi-fault Tolerance for Cartesian Data Distributions
Ali, Nawab; Krishnamoorthy, Sriram; Halappanavar, Mahantesh; Daily, Jeffrey A.
2013-06-01
Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale sys- tems. Algorithm-based fault tolerance (ABFT) is a promising approach that involves modications to the algorithm to recover from faults with lower over- heads than replicated storage and a signicant reduction in lost work compared to checkpoint-restart techniques. Fault-tolerant linear algebra (FTLA) algo- rithms employ additional processors that store parities along the dimensions of a matrix to tolerate multiple, simultaneous faults. Existing approaches as- sume regular data distributions (blocked or block-cyclic) with the failures of each data block being independent. To match the characteristics of failures on parallel computers, we extend these approaches to mapping parity blocks in several important ways. First, we handle parity computation for generalized Cartesian data distributions with each processor holding arbitrary subsets of blocks in a Cartesian-distributed array. Second, techniques to handle corre- lated failures, i.e., multiple processors that can be expected to fail together, are presented. Third, we handle the colocation of parity blocks with the data blocks and do not require them to be on additional processors. Several al- ternative approaches, based on graph matching, are presented that attempt to balance the memory overhead on processors while guaranteeing the same fault tolerance properties as existing approaches that assume independent fail- ures on regular blocked data distributions. The evaluation of these algorithms demonstrates that the additional desirable properties are provided by the pro- posed approach with minimal overhead.
Extending a CAD-Based Cartesian Mesh Generator for the Lattice Boltzmann Method
Cantrell, J Nathan [ORNL; Inclan, Eric J [ORNL; Joshi, Abhijit S [ORNL; Popov, Emilian L [ORNL; Jain, Prashant K [ORNL
2012-01-01
This paper describes the development of a custom preprocessor for the PaRAllel Thermal Hydraulics simulations using Advanced Mesoscopic methods (PRATHAM) code based on an open-source mesh generator, CartGen [1]. PRATHAM is a three-dimensional (3D) lattice Boltzmann method (LBM) based parallel flow simulation software currently under development at the Oak Ridge National Laboratory. The LBM algorithm in PRATHAM requires a uniform, coordinate system-aligned, non-body-fitted structured mesh for its computational domain. CartGen [1], which is a GNU-licensed open source code, already comes with some of the above needed functionalities. However, it needs to be further extended to fully support the LBM specific preprocessing requirements. Therefore, CartGen is being modified to (i) be compiler independent while converting a neutral-format STL (Stereolithography) CAD geometry to a uniform structured Cartesian mesh, (ii) provide a mechanism for PRATHAM to import the mesh and identify the fluid/solid domains, and (iii) provide a mechanism to visually identify and tag the domain boundaries on which to apply different boundary conditions.
Ghysels, A.; Van Neck, D.; Waroquier, M.
2007-10-01
Partial optimization is a useful technique to reduce the computational load in simulations of extended systems. In such nonequilibrium structures, the accurate calculation of localized vibrational modes can be troublesome, since the standard normal mode analysis becomes inappropriate. In a previous paper [A. Ghysels et al., J. Chem. Phys. 126, 224102 (2007)], the mobile block Hessian (MBH) approach was presented to deal with the vibrational analysis in partially optimized systems. In the MBH model, the nonoptimized regions of the system are represented by one or several blocks, which can move as rigid bodies with respect to the atoms of the optimized region. In this way unphysical imaginary frequencies are avoided and the translational/rotational invariance of the potential energy surface is fully respected. In this paper we focus on issues concerning the practical numerical implementation of the MBH model. The MBH normal mode equations are worked out for several coordinate choices. The introduction of a consistent group-theoretical notation facilitates the treatment of both the case of a single block and the case of multiple blocks. Special attention is paid to the formulation in terms of Cartesian variables, in order to provide a link with the standard output of common molecular modeling programs.
A Fast Apparent-Horizon Finder for 3-Dimensional Cartesian Grids in Numerical Relativity
Thornburg, J
2004-01-01
In 3+1 numerical simulations of dynamic black hole spacetimes, it's useful to be able to find the apparent horizon(s) (AH) in each slice of a time evolution. A number of AH finders are available, but they often take many minutes to run, so they're too slow to be practically usable at each time step. Here I present a new AH finder,_AHFinderDirect_, which is very fast and accurate, typically taking only a few seconds to find an AH to $sim 10^{-5} m$ accuracy on a GHz-class processor. I assume that an AH to be searched for is a Strahlk"orper (star-shaped region) with respect to some local origin, and so parameterize the AH shape by $r = h(angle)$ for some single-valued function $h: S^2 to Re^+$. The AH equation then becomes a nonlinear elliptic PDE in $h$ on $S^2$, whose coefficients are algebraic functions of $g_{ij}$, $K_{ij}$, and the Cartesian-coordinate spatial derivatives of $g_{ij}$. I discretize $S^2$ using 6 angular patches (one each in the neighborhood of the $pm x$, $pm y$, and $pm z$ axes) to avoid c...
Some studies on generalized coordinate sets for polyatomic molecules
Li, Wenjin; Ma, Ao
2015-12-01
Generalized coordinates are widely used in various analyses of the trajectories of polyatomic molecules from molecular dynamics simulations, such as normal mode analysis and force distribution analysis. Here, we presented detailed discussions on the properties of some specific sets of generalized coordinates, which separate translational, rotational, and vibrational motions of a molecule from one another once the trajectories of dynamical systems are known. Efficient methods were suggested for estimating the transformation matrix between generalized and Cartesian coordinates. Some properties of the well-known BAT coordinates (bond length, angle, and torsional coordinates) were discussed as well.
General formulation of vibronic spectroscopy in internal coordinates
Baiardi, Alberto; Bloino, Julien; Barone, Vincenzo
2016-02-01
Our general platform integrating time-independent and time-dependent evaluations of vibronic effects at the harmonic level for different kinds of absorption and emission one-photon, conventional and chiral spectroscopies has been extended to support various sets of internal coordinates. Thanks to the implementation of analytical first and second derivatives of different internal coordinates with respect to cartesian ones, both vertical and adiabatic models are available, with the inclusion of mode mixing and, possibly, Herzberg-Teller contributions. Furthermore, all supported non-redundant sets of coordinates are built from a fully automatized algorithm using only a primitive redundant set derived from a bond order-based molecular topology. Together with conventional stretching, bending, and torsion coordinates, the availability of additional coordinates (including linear and out-of-plane bendings) allows a proper treatment of specific systems, including, for instance, inter-molecular hydrogen bridges. A number of case studies are analysed, showing that cartesian and internal coordinates are nearly equivalent for semi-rigid systems not experiencing significant geometry distortions between initial and final electronic states. At variance, delocalized (possibly weighted) internal coordinates become much more effective than their cartesian counterparts for flexible systems and/or in the presence of significant geometry distortions accompanying electronic transitions.
Trajectory Planning of Multiple Coordinating Robots Using Genetic Algorithms
S. Sun; Morris, A.S.; Zalzala, A.M.S.
1995-01-01
The paper focuses on the problem of trajectory planning of multiple coordinating robots. When multiple robots collaborate to manipulate one object, a redundant system can follow. These can be described in Cartesian coordinate space by an nth order polynomial. This paper presents an optimisation method based on Genetic Algorithms. (GA'S)which chooses the parameters of the polynomial, such that the execution time and the drive torques for the robot joints are minimized. With the robot's dynamic...
A System for Acoustic Field Measurement Employing Cartesian Robot
Szczodrak Maciej
2016-09-01
Full Text Available A system setup for measurements of acoustic field, together with the results of 3D visualisations of acoustic energy flow are presented in the paper. Spatial sampling of the field is performed by a Cartesian robot. Automatization of the measurement process is achieved with the use of a specialized control system. The method is based on measuring the sound pressure (scalar and particle velocity(vector quantities. The aim of the system is to collect data with a high precision and repeatability. The system is employed for measurements of acoustic energy flow in the proximity of an artificial head in an anechoic chamber. In the measurement setup an algorithm for generation of the probe movement path is included. The algorithm finds the optimum path of the robot movement, taking into account a given 3D object shape present in the measurement space. The results are presented for two cases, first without any obstacle and the other - with an artificial head in the sound field.
A note on the partition dimension of Cartesian product graphs
Yero, Ismael G
2010-01-01
Let $G=(V,E)$ be a connected graph. The distance between two vertices $u,v\\in V$, denoted by $d(u, v)$, is the length of a shortest $u-v$ path in $G$. The distance between a vertex $v\\in V$ and a subset $P\\subset V$ is defined as $min\\{d(v, x): x \\in P\\}$, and it is denoted by $d(v, P)$. An ordered partition $\\{P_1,P_2, ...,P_t\\}$ of vertices of a graph $G$, is a \\emph{resolving partition}of $G$, if all the distance vectors $(d(v,P_1),d(v,P_2),...,d(v,P_t))$ are different. The \\emph{partition dimension} of $G$, denoted by $pd(G)$, is the minimum number of sets in any resolving partition of $G$. In this article we study the partition dimension of Cartesian product graphs. More precisely, we show that for all pairs of connected graphs $G, H$, $pd(G\\times H)\\le pd(G)+pd(H)$ and $pd(G\\times H)\\le pd(G)+dim(H).$ Consequently, we show that $pd(G\\times H)\\le dim(G)+dim(H)+1.$
Roman domination in Cartesian product graphs and strong product graphs
Yero, Ismael G
2011-01-01
A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. The minimum cardinality of a dominating set for $G$ is called the domination number of $G$. A map $f : V \\rightarrow \\{0, 1, 2\\}$ is a Roman dominating function on a graph $G$ if for every vertex $v$ with $f(v) = 0$, there exists a vertex $u$, adjacent to $v$, such that $f(u) = 2$. The weight of a Roman dominating function is given by $f(V) =\\sum_{u\\in V}f(u)$. The minimum weight of a Roman dominating function on $G$ is called the Roman domination number of $G$. In this article we study the Roman domination number of Cartesian product graphs and strong product graphs. More precisely, we study the relationships between the Roman domination number of product graphs and the (Roman) domination number of the factors.
Shared memory parallelism for 3D cartesian discrete ordinates solver
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multi-core + SIMD - Single Instruction on Multiple Data) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46*106 spatial cells and 1*1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40.74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool. (authors)
Computing global offensive alliances in Cartesian product graphs
Yero, Ismael G
2012-01-01
A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The global offensive alliance number of $G$, $\\gamma_o(G)$, is the minimum cardinality of a global offensive alliance in $G$. A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex not belonging to $S$ has at least one neighbor in $S$. The domination number of $G$, $\\gamma(G)$, is the minimum cardinality of a dominating set of $G$. In this work we obtain closed formulas for the global offensive alliance number of several families of Cartesian product graphs, we also prove that $\\gamma_o(G\\square H)\\ge \\frac{\\gamma(G)\\gamma_o(H)}{2}$ for any graphs $G$ and $H$ and we show that if $G$ has an efficient dominating set, then $\\gamma_o(G\\square H)\\ge \\gamma(G)\\gamma_o(H).$ Moreover, we present a Vizing-like conjecture for the global offensive alliance number and we prove it for several families of grap...
Solus Secedo and Sapere Aude: Cartesian Meditation as Kantian Enlightenment
Suma Rajiva
2015-11-01
Full Text Available Recently Samuel Fleischacker has developed Kant’s model of enlightenment as a “minimalist enlightenment” in the tradition of a relatively thin proceduralism focused on the form of public debate and interaction. I want to discuss the possibility that such a minimalism, endorsed by Fleischacker, Habermas, Rawls, and others, benefits from a metaphysics of critical individual subjectivity as a prerequisite for the social proceduralism of the minimalist enlightenment. I argue that Kant’s enlightenment, metaphysically thicker than much contemporary proceduralism, constitutes a recovery and transformation of a subjective interiority deeply Cartesian in spirit and central to the reciprocity of the community of subjects in What is Enlightenment. This opens a space for a site of resistance to the social. Descartes’ solus secedo describes the analogical space of such a resistance for Kant’s sapere aude. The Meditations thus point forward implicitly to how a rational subject might achieve critical distance from tradition in its various forms, epistemic, ethical, moral, and political.
Static Aeroelastic Analysis with an Inviscid Cartesian Method
Rodriguez, David L.; Aftosmis, Michael J.; Nemec, Marian; Smith, Stephen C.
2014-01-01
An embedded-boundary, Cartesian-mesh flow solver is coupled with a three degree-of-freedom structural model to perform static, aeroelastic analysis of complex aircraft geometries. The approach solves a nonlinear, aerostructural system of equations using a loosely-coupled strategy. An open-source, 3-D discrete-geometry engine is utilized to deform a triangulated surface geometry according to the shape predicted by the structural model under the computed aerodynamic loads. The deformation scheme is capable of modeling large deflections and is applicable to the design of modern, very-flexible transport wings. The coupling interface is modular so that aerodynamic or structural analysis methods can be easily swapped or enhanced. After verifying the structural model with comparisons to Euler beam theory, two applications of the analysis method are presented as validation. The first is a relatively stiff, transport wing model which was a subject of a recent workshop on aeroelasticity. The second is a very flexible model recently tested in a low speed wind tunnel. Both cases show that the aeroelastic analysis method produces results in excellent agreement with experimental data.
Tolerating Correlated Failures for Generalized Cartesian Distributions via Bipartite Matching
Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. A key ingredient of any approach to fault tolerance is effective support for fault tolerant data storage. A typical application execution consists of phases in which certain data structures are modified while others are read-only. Often, read-only data structures constitute a large fraction of total memory consumed. Fault tolerance for read-only data can be ensured through the use of checksums or parities, without resorting to expensive in-memory duplication or checkpointing to secondary storage. In this paper, we present a graph-matching approach to compute and store parity data for read-only matrices that are compatible with fault tolerant linear algebra (FTLA). Typical approaches only support blocked data distributions with each process holding one block with the parity located on additional processes. The matrices are assumed to be blocked by a cartesian grid with each block assigned to a process. We consider a generalized distribution in which each process can be assigned arbitrary blocks. We also account for the fact that multiple processes might be part of the same failure unit, say an SMP node. The flexibility enabled by our novel application of graph matching extends fault tolerance support to data distributions beyond those supported by prior work. We evaluate the matching implementations and cost to compute the parity and recover lost data, demonstrating the low overhead incurred by our approach.
Tolerating Correlated Failures for Generalized Cartesian Distributions via Bipartite Matching
Ali, Nawab; Krishnamoorthy, Sriram; Halappanavar, Mahantesh; Daily, Jeffrey A.
2011-05-05
Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. A key ingredient of any approach to fault tolerance is effective support for fault tolerant data storage. A typical application execution consists of phases in which certain data structures are modified while others are read-only. Often, read-only data structures constitute a large fraction of total memory consumed. Fault tolerance for read-only data can be ensured through the use of checksums or parities, without resorting to expensive in-memory duplication or checkpointing to secondary storage. In this paper, we present a graph-matching approach to compute and store parity data for read-only matrices that are compatible with fault tolerant linear algebra (FTLA). Typical approaches only support blocked data distributions with each process holding one block with the parity located on additional processes. The matrices are assumed to be blocked by a cartesian grid with each block assigned to a process. We consider a generalized distribution in which each process can be assigned arbitrary blocks. We also account for the fact that multiple processes might be part of the same failure unit, say an SMP node. The flexibility enabled by our novel application of graph matching extends fault tolerance support to data distributions beyond those supported by prior work. We evaluate the matching implementations and cost to compute the parity and recover lost data, demonstrating the low overhead incurred by our approach.
A multilevel Cartesian non-uniform grid time domain algorithm
A multilevel Cartesian non-uniform grid time domain algorithm (CNGTDA) is introduced to rapidly compute transient wave fields radiated by time dependent three-dimensional source constellations. CNGTDA leverages the observation that transient wave fields generated by temporally bandlimited and spatially confined source constellations can be recovered via interpolation from appropriately delay- and amplitude-compensated field samples. This property is used in conjunction with a multilevel scheme, in which the computational domain is hierarchically decomposed into subdomains with sparse non-uniform grids used to obtain the fields. For both surface and volumetric source distributions, the computational cost of CNGTDA to compute the transient field at Ns observation locations from Ns collocated sources for Nt discrete time instances scales as O(NtNslogNs) and O(NtNslog2Ns) in the low- and high-frequency regimes, respectively. Coupled with marching-on-in-time (MOT) time domain integral equations, CNGTDA can facilitate efficient analysis of large scale time domain electromagnetic and acoustic problems.
Towards Efficient Viscous Modeling Based on Cartesian Methods for Automated Flow Simulation Project
National Aeronautics and Space Administration — The proposed work aims at developing techniques that will address the current limitations of Cartesian-based Navier-Stokes CFD schemes by exploring three promising...
On the research of flow around obstacle using the viscous Cartesian grid technique
Liu Yan-Hua
2012-01-01
Full Text Available A new 2-D viscous Cartesian grid is proposed in current research. It is a combination of the existent body-fitted grid and Cartesian grid technology. On the interface of the two different type of grid, a fined triangular mesh is used to connect the two grids. Tests with flow around the cylinder and aerofoil NACA0012 show that the proposed scheme is easy for implement with high accuracy.
The Impact of Dutch Cartesian Medical Reformers in Early Enlightenment German Culture
Munt, A. H.
2005-01-01
This study analyses the reception and influence of Dutch Cartesian medical reformers in German culture during the Early Enlightenment period. The impact of their proposed reforms, involving the rejection of traditional Galenic-Aristotelian theory and practice, and placing medicine in an essentially new, mechanistic scienceoriented Cartesian philosophical framework, is discussed in the context of the large number of German translations of their works, published often in several ...
The impact of Dutch Cartesian medical reformers in early Enlightenment German culture (1680-1720).
Munt, A. H.
2005-01-01
This study analyses the reception and influence of Dutch Cartesian medical reformers in German culture during the Early Enlightenment period. The impact of their proposed reforms, involving the rejection of traditional Galenic-Aristotelian theory and practice, and placing medicine in an essentially new, mechanistic science-oriented Cartesian philosophical framework, is discussed in the context of the large number of German translations of their works, published often in several editions in va...
On Energy of the Friedman Universes in Conformally Flat Coordinates
Recently many authors have calculated energy of the Friedman universes by using coordinate-dependent double index energy-momentum complexes in Cartesian comoving coordinates (t, x, y, z) and concluded that the flat and closed Friedman universes are energy-free. In this paper by using Einstein canonical energy-momentum complex and by doing calculations in conformally flat coordinates we show that such conclusion is incorrect. The results obtained in this paper are compatible with the results of our previous paper, see J. Garecki, Found. Phys. 37, 341 (2007), where we have used coordinate-independent averaged energy-momentum tensors to analyze the energy of Friedman universes. (author)
Multiscale geometric modeling of macromolecules I: Cartesian representation
Xia, Kelin; Feng, Xin; Chen, Zhan; Tong, Yiying; Wei, Guo-Wei
2014-01-01
This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace-Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the
Multiscale geometric modeling of macromolecules I: Cartesian representation
This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace–Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the
Advances in non-Cartesian parallel magnetic resonance imaging using the GRAPPA operator
This thesis has presented several new non-Cartesian parallel imaging methods which simplify both gridding and the reconstruction of images from undersampled data. A novel approach which uses the concepts of parallel imaging to grid data sampled along a non-Cartesian trajectory called GRAPPA Operator Gridding (GROG) is described. GROG shifts any acquired k-space data point to its nearest Cartesian location, thereby converting non-Cartesian to Cartesian data. The only requirements for GROG are a multi-channel acquisition and a calibration dataset for the determination of the GROG weights. Then an extension of GRAPPA Operator Gridding, namely Self-Calibrating GRAPPA Operator Gridding (SC-GROG) is discussed. SC-GROG is a method by which non-Cartesian data can be gridded using spatial information from a multi-channel coil array without the need for an additional calibration dataset, as required in standard GROG. Although GROG can be used to grid undersampled datasets, it is important to note that this method uses parallel imaging only for gridding, and not to reconstruct artifact-free images from undersampled data. Thereafter a simple, novel method for performing modified Cartesian GRAPPA reconstructions on undersampled non-Cartesian k-space data gridded using GROG to arrive at a non-aliased image is introduced. Because the undersampled non-Cartesian data cannot be reconstructed using a single GRAPPA kernel, several Cartesian patterns are selected for the reconstruction. Finally a novel method of using GROG to mimic the bunched phase encoding acquisition (BPE) scheme is discussed. In MRI, it is generally assumed that an artifact-free image can be reconstructed only from sampled points which fulfill the Nyquist criterion. However, the BPE reconstruction is based on the Generalized Sampling Theorem of Papoulis, which states that a continuous signal can be reconstructed from sampled points as long as the points are on average sampled at the Nyquist frequency. A novel
Advances in non-Cartesian parallel magnetic resonance imaging using the GRAPPA operator
Seiberlich, Nicole
2008-07-21
This thesis has presented several new non-Cartesian parallel imaging methods which simplify both gridding and the reconstruction of images from undersampled data. A novel approach which uses the concepts of parallel imaging to grid data sampled along a non-Cartesian trajectory called GRAPPA Operator Gridding (GROG) is described. GROG shifts any acquired k-space data point to its nearest Cartesian location, thereby converting non-Cartesian to Cartesian data. The only requirements for GROG are a multi-channel acquisition and a calibration dataset for the determination of the GROG weights. Then an extension of GRAPPA Operator Gridding, namely Self-Calibrating GRAPPA Operator Gridding (SC-GROG) is discussed. SC-GROG is a method by which non-Cartesian data can be gridded using spatial information from a multi-channel coil array without the need for an additional calibration dataset, as required in standard GROG. Although GROG can be used to grid undersampled datasets, it is important to note that this method uses parallel imaging only for gridding, and not to reconstruct artifact-free images from undersampled data. Thereafter a simple, novel method for performing modified Cartesian GRAPPA reconstructions on undersampled non-Cartesian k-space data gridded using GROG to arrive at a non-aliased image is introduced. Because the undersampled non-Cartesian data cannot be reconstructed using a single GRAPPA kernel, several Cartesian patterns are selected for the reconstruction. Finally a novel method of using GROG to mimic the bunched phase encoding acquisition (BPE) scheme is discussed. In MRI, it is generally assumed that an artifact-free image can be reconstructed only from sampled points which fulfill the Nyquist criterion. However, the BPE reconstruction is based on the Generalized Sampling Theorem of Papoulis, which states that a continuous signal can be reconstructed from sampled points as long as the points are on average sampled at the Nyquist frequency. A novel
Baumgarte, Thomas W; Cordero-Carrión, Isabel; Müller, Ewald
2012-01-01
In the absence of symmetry assumptions most numerical relativity simulations adopt Cartesian coordinates. While Cartesian coordinates have some desirable properties, spherical polar coordinates appear better suited for certain applications, including gravitational collapse and supernova simulations. Development of numerical relativity codes in spherical polar coordinates has been hampered by the need to handle the coordinate singularities at the origin and on the axis, for example by careful regularization of the appropriate variables. Assuming spherical symmetry and adopting a covariant version of the BSSN equations, Montero and Cordero-Carri\\'on recently demonstrated that such a regularization is not necessary when a partially implicit Runge-Kutta (PIRK) method is used for the time evolution of the gravitational fields. Here we report on an implementation of the BSSN equations in spherical polar coordinates without any symmetry assumptions. Using a PIRK method we obtain stable simulations in three spatial d...
Analysis of Crustal Magnetisation in Cartesian Vector Harmonics
Gubbins, D.; Ivers, D.; Williams, S.
2015-12-01
We present a new set of functions, Vector Cartesian Harmonics (VCH), analogous to the Vector Spherical Harmonics that we have applied recently to global models of crustal and lithospheric magnetisation. Like their spherical counterpart, the VCH form a complete, orthogonal set: planar models of magnetisation can be expanded in them. There are 3 distinct types of VCH, one representing that part of the magnetisation which generates the potential magnetic field above the surface, another the potential magnetic field below the surface, and a toroidal function that generates only a non-potential field. One function therefore describes the magnetisation detected by observations of the magnetic anomaly while the other two describe the null space of an inversion of magnetic observations for magnetisation. The formalism is therefore ideal for analysing the results of inversions for magnetic structures in plane layers such as local or regional surveys where Earth's curvature can be ignored. The null space is in general very large, being an arbitrary combination of a doubly-infinite set of vector functions. However, in the absence of remanence and when the inducing field is uniform the null space reduces to only 2 types of structure, uniform susceptibility (Runcorn's Theorem) and a pattern of susceptibility induced by a uniform field, the null space is restricted to uniform magnetisation and 1D patterns of susceptibility aligned with a horizontal inducing field. Both these cases are already well known, but this analysis shows them to be the ONLY members of the null space. We also give results for familiar text-book structures to show the nature of the null space in each case. Curiously, inversion of the magnetic field from a buried dipole returns exactly half the correct magnitude plus a spurious distributed magnetisation. A more complex application is the topographic structure based on the Bishop formation in California (Fairhead and Williams, SEG exp. abstr. 25, 845, 2006
General relativistic hydrodynamics in curvilinear coordinates
Montero, Pedro J; Müller, Ewald
2013-01-01
In this paper we report on what we believe is the first successful implementation of relativistic hydrodynamics, coupled to dynamical spacetimes, in spherical polar coordinates without symmetry assumptions. We employ a high-resolution shock-capturing scheme, which requires that the equations be cast in flux-conservative form. One example of such a form is the :Valencia" formulation, which has been adopted in numerous applications, in particular in Cartesian coordinates. Here we generalize this formulation to allow for a reference-metric approach, which provides a natural framework for calculations in curvilinear coordinates. In spherical polar coordinates, for example, it allows for an analytical treatment of the singular r and sin(\\theta) terms that appear in the equations. We experiment with different versions of our generalized Valencia formulation in numerical implementations of relativistic hydrodynamics for both fixed and dynamical spacetimes. We consider a number of different tests -- non-rotating and ...
Contrast sensitivity to angular frequency gratings is not higher than to Cartesian gratings
Zana Y.
2004-01-01
Full Text Available When contrast sensitivity functions to Cartesian and angular gratings were compared in previous studies the peak sensitivity to angular stimuli was reported to be 0.21 log units higher. In experiments carried out to repeat this result, we used the same two-alternative forced-choice paradigm, but improved experimental control and precision by increasing contrast resolution from 8 to 12 bits, increasing the screen refresh rate from 30 Hz interlaced to 85 Hz non-interlaced, linearizing the voltage-luminance relation, modulating luminance in frequencies that minimize pixel aliasing, and improving control of the subject's exposure to the stimuli. The contrast sensitivity functions to Cartesian and angular gratings were similar in form and peak sensitivity (2.4 cycles per visual degree (c/deg and 32 c/360º, respectively to those reported in a previous study (3 c/deg and 32 c/360º, respectively, but peak sensitivity to angular stimuli was 0.13 log units lower than that to Cartesian stimuli. When the experiment was repeated, this time simulating the experimental control level used in the previous study, no difference between the peak sensitivity to Cartesian and angular stimuli was found. This result agrees with most current models that assume Cartesian filtering at the first visual processing stage. The discrepancy in the results is explained in part by differences in the degree of experimental control.
Freitas, Andreia C.; Wylezinska, Marzena; Birch, Malcolm J.; Petersen, Steffen E.; Miquel, Marc E.
2016-01-01
Dynamic imaging of the vocal tract using real-time MRI has been an active and growing area of research, having demonstrated great potential to become routinely performed in the clinical evaluation of speech and swallowing disorders. Although many technical advances have been made in regards to acquisition and reconstruction methodologies, there is still no consensus in best practice protocols. This study aims to compare Cartesian and non-Cartesian real-time MRI sequences, regarding image quality and temporal resolution trade-off, for dynamic speech imaging. Five subjects were imaged at 1.5T, while performing normal phonation, in order to assess velar motion and velopharyngeal closure. Data was acquired using both Cartesian and non-Cartesian (spiral and radial) real-time sequences at five different spatial-temporal resolution sets, between 10 fps (1.7×1.7×10 mm3) and 25 fps (1.5×1.5×10 mm3). Only standard scanning resources provided by the MRI scanner manufacturer were used to ensure easy applicability to clinical evaluation and reproducibility. Data sets were evaluated by comparing measurements of the velar structure, dynamic contrast-to-noise ratio and image quality visual scoring. Results showed that for all proposed sequences, FLASH spiral acquisitions provided higher contrast-to-noise ratio, up to a 170.34% increase at 20 fps, than equivalent bSSFP Cartesian acquisitions for the same spatial-temporal resolution. At higher frame rates (22 and 25 fps), spiral protocols were optimal and provided higher CNR and visual scoring than equivalent radial protocols. Comparison of dynamic imaging at 10 and 22 fps for radial and spiral acquisitions revealed no significant difference in CNR performance, thus indicating that temporal resolution can be doubled without compromising spatial resolution (1.9×1.9 mm2) or CNR. In summary, this study suggests that the use of FLASH spiral protocols should be preferred over bSSFP Cartesian for the dynamic imaging of velopharyngeal
Freitas, Andreia C; Wylezinska, Marzena; Birch, Malcolm J; Petersen, Steffen E; Miquel, Marc E
2016-01-01
Dynamic imaging of the vocal tract using real-time MRI has been an active and growing area of research, having demonstrated great potential to become routinely performed in the clinical evaluation of speech and swallowing disorders. Although many technical advances have been made in regards to acquisition and reconstruction methodologies, there is still no consensus in best practice protocols. This study aims to compare Cartesian and non-Cartesian real-time MRI sequences, regarding image quality and temporal resolution trade-off, for dynamic speech imaging. Five subjects were imaged at 1.5T, while performing normal phonation, in order to assess velar motion and velopharyngeal closure. Data was acquired using both Cartesian and non-Cartesian (spiral and radial) real-time sequences at five different spatial-temporal resolution sets, between 10 fps (1.7×1.7×10 mm3) and 25 fps (1.5×1.5×10 mm3). Only standard scanning resources provided by the MRI scanner manufacturer were used to ensure easy applicability to clinical evaluation and reproducibility. Data sets were evaluated by comparing measurements of the velar structure, dynamic contrast-to-noise ratio and image quality visual scoring. Results showed that for all proposed sequences, FLASH spiral acquisitions provided higher contrast-to-noise ratio, up to a 170.34% increase at 20 fps, than equivalent bSSFP Cartesian acquisitions for the same spatial-temporal resolution. At higher frame rates (22 and 25 fps), spiral protocols were optimal and provided higher CNR and visual scoring than equivalent radial protocols. Comparison of dynamic imaging at 10 and 22 fps for radial and spiral acquisitions revealed no significant difference in CNR performance, thus indicating that temporal resolution can be doubled without compromising spatial resolution (1.9×1.9 mm2) or CNR. In summary, this study suggests that the use of FLASH spiral protocols should be preferred over bSSFP Cartesian for the dynamic imaging of velopharyngeal
Yan, Su; Arslanbekov, Robert R; Kolobov, Vladimir I; Jin, Jian-Ming
2016-01-01
A discontinuous Galerkin time-domain (DGTD) method based on dynamically adaptive Cartesian meshes (ACM) is developed for a full-wave analysis of electromagnetic fields in dispersive media. Hierarchical Cartesian grids offer simplicity close to that of structured grids and the flexibility of unstructured grids while being highly suited for adaptive mesh refinement (AMR). The developed DGTD-ACM achieves a desired accuracy by refining non-conformal meshes near material interfaces to reduce stair-casing errors without sacrificing the high efficiency afforded with uniform Cartesian meshes. Moreover, DGTD-ACM can dynamically refine the mesh to resolve the local variation of the fields during propagation of electromagnetic pulses. A local time-stepping scheme is adopted to alleviate the constraint on the time-step size due to the stability condition of the explicit time integration. Simulations of electromagnetic wave diffraction over conducting and dielectric cylinders and spheres demonstrate that the proposed meth...
Parameter Studies, time-dependent simulations and design with automated Cartesian methods
Aftosmis, Michael
2005-01-01
Over the past decade, NASA has made a substantial investment in developing adaptive Cartesian grid methods for aerodynamic simulation. Cartesian-based methods played a key role in both the Space Shuttle Accident Investigation and in NASA's return to flight activities. The talk will provide an overview of recent technological developments focusing on the generation of large-scale aerodynamic databases, automated CAD-based design, and time-dependent simulations with of bodies in relative motion. Automation, scalability and robustness underly all of these applications and research in each of these topics will be presented.
A Cartesian Cut Cell Method for Rarefied Flow Simulations around Moving Obstacles
Dechristé, Guillaume
2015-01-01
For accurate simulations of rarefied gas flows around moving obstacles, we propose a cut cell method on Cartesian grids: it allows exact conservation and accurate treatment of boundary conditions. Our approach is designed to treat Cartesian cells and various kind of cut cells by the same algorithm, with no need to identify the specific shape of each cut cell. This makes the implementation quite simple, and allows a direct extension to 3D problems. Such simulations are also made possible by using an adaptive mesh refinement technique and a hybrid parallel implementation. This is illustrated by several test cases, including a 3D unsteady simulation of the Crookes radiometer.
Non-commutativity in polar coordinates
Edwards, James P
2016-01-01
We reconsider the fundamental commutation relations for non-commutative $\\mathbb{R}^{2}$ described in polar coordinates with non-commutativity parameter $\\theta$. Previous analysis found that the natural transition from Cartesian coordinates to polars led to a representation of $\\left[\\hat{r}, \\hat{\\varphi}\\right]$ as an everywhere diverging series. We compute the Borel resummation of this series, showing that it can subsequently be extended throughout parameter space and hence provide an interpretation of this commutator. Our analysis provides a complete solution for arbitrary $r$ and $\\theta$ that reproduces the earlier calculations at lowest order. We compare our results to previous literature in the (pseudo-)commuting limit, finding a surprising spatial dependence for the coordinate commutator when $\\theta \\gg r^{2}$. We raise some questions for future study in light of this progress.
An improved method for calculating self-motion coordinates for redundant manipulators
For a redundant manipulator, the objective of redundancy resolution is to follow a specified path in Cartesian space and simultaneously perform another task (for example, maximize an objective function or avoid obstacles) at every point along the path. The conventional methods have several drawbacks: a new function must be defined for each task, the extended Jacobian can be singular, closed cycles in Cartesian space may not yield closed cycles in joint space, and the objective is point-wise redundancy resolution (to determine a single point in joint space for each point in Cartesian space). The author divides the redundancy resolution problem into two parts: (1) calculate self-motion coordinates for all possible positions of a manipulator at each point along a Cartesian path and (2) determination of optimal self-motion coordinates that maximize an objective function along the path. This paper will discuss the first part of the problem. The path-wise approach overcomes all of the drawbacks of conventional redundancy resolution methods: no need to define a new function for each task, extended Jacobian cannot be singular, and closed cycles in extended Cartesian space will yield closed cycles in joint space
"Mens Sana in Corpore Sano": Cartesian Dualism and the Marginalisation of Sex Education
Paechter, Carrie
2004-01-01
Cartesian dualism has left a heavy legacy in terms of how we think about ourselves, so that we treat humans as minds within bodies rather than mind/body unities. This has far-reaching effects on our conceptualisation of the sex/gender distinction and on the relationship between bodies and identities. Related to this is a dualism that is embedded…
A rhizome as a map of a rupture of the Cartesian dualism:
Cergolj Edwards, Katja
2008-01-01
This essay explores the potentiality of organizing the immediate reality of lived experience of modern individual through a construct of Deleuze' and Guattari's rhizome. This practice, claimed in this essay, negates the traditional construction of knowledge, based on Cartesian perspectivalism, and offers nomadic identities of postcolonial world prospective of active, performative construction of personal bricolages
Rapid Non-Cartesian Parallel Imaging Reconstruction on Commodity Graphics Hardware
Sørensen, Thomas Sangild; Atkinson, David; Boubertakh, Redha;
2008-01-01
This presentation describes an implementation of non-Cartesian SENSE and kt-SENSE accelerated on commodity graphics hardware. This inexpensive hardware platform is now fully programmable and very suited for solving reconstruction problems. We show that for both SENSE and kt-SENSE the reconstruction...
Shin, J.G. [LG Electronics, Seoul (Korea); Lee, T.H.; Park, J.B. [Yonsei University, Seoul (Korea); Yoon, T.S. [Changwon University, Changwon (Korea); Choi, Y.H. [Kyonggi University, Suwon (Korea)
2003-01-01
A Coordinate-Transformation Extended Robust Kalman Filter (CERKF) designed in the Krein space is proposed, and then applied to a nonlinear incoming ballistic missile tracking system with parameter uncertainties. First, the Extended Robust Kalman filter (ERKF) is proposed to handle the nonlinearity of measurement equation which occurs whenever the polar coordinate system is transformed into the Cartesian coordinate system. Moreover, linearization error inevitably occurs and deteriorates the tracking performance, which is considerably reduced by the proposed CERKF. Through the simulation results, we show that the proposed CERKF, which uses the measurement coordinate system, has less RMS error than the previous ERKF which is designed in the Krein space using the Cartesian system. We also verify that the robustness and the stability of the proposed filter are guaranteed in two radars: the phased array radar and the scanning radar. (author). 9 refs., 5 figs.
Krzyżek, Robert
2015-09-01
The paper presents an innovative solution which increases the reliability of determining the coordinates of corners of building structures in the RTN GNSS mode. Having performed the surveys of the base points in real time, it is proposed to use the method of line-line intersection, which results in capturing the Cartesian coordinates X, Y of the corners of buildings. The coordinates which were obtained in this way, are subjected to an innovative solution called the method of vectors translation. This method involves modeling the coordinates obtained by the algorithm developed by the author. As a result, we obtain the Cartesian coordinates X and Y of the corners of building structures, the accuracy and reliability of determining which is on a very high level.
Qiu, Zhi-cheng
2012-07-01
A flexible Cartesian manipulator is a coupling system with a moving rigid body and flexible structures. Thus, vibration suppression problem must be solved to guarantee the stability and control accuracy. A characteristic model based nonlinear golden section adaptive control (CMNGSAC) algorithm is implemented to suppress the vibration of a flexible Cartesian smart material manipulator driven by a ballscrew mechanism using an AC servomotor. The system modeling is derived to recognize the dynamical characteristics. The closed loop stability is analyzed based on the model. Also, an experimental setup is constructed to verify the adopted method. Experimental comparison studies are conducted for modal frequencies' identification and active vibration control of the flexible manipulator. The active vibration control experiments include set-point vibration control responses, vibration suppression under resonant excitation and simultaneous translating and vibration suppression using different control methods. The experimental results demonstrate that the controller can suppress both the larger and the lower amplitude vibration near the equilibrium point effectively.
Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation
Buning, Pieter G.; Pulliam, Thomas H.
2011-01-01
An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.
A Cartesian Adaptive Level Set Method for Two-Phase Flows
Ham, F.; Young, Y.-N.
2003-01-01
In the present contribution we develop a level set method based on local anisotropic Cartesian adaptation as described in Ham et al. (2002). Such an approach should allow for the smallest possible Cartesian grid capable of resolving a given flow. The remainder of the paper is organized as follows. In section 2 the level set formulation for free surface calculations is presented and its strengths and weaknesses relative to the other free surface methods reviewed. In section 3 the collocated numerical method is described. In section 4 the method is validated by solving the 2D and 3D drop oscilation problem. In section 5 we present some results from more complex cases including the 3D drop breakup in an impulsively accelerated free stream, and the 3D immiscible Rayleigh-Taylor instability. Conclusions are given in section 6.
On the Use of Parmetric-CAD Systems and Cartesian Methods for Aerodynamic Design
Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.
2004-01-01
Automated, high-fidelity tools for aerodynamic design face critical issues in attempting to optimize real-life geometry arid in permitting radical design changes. Success in these areas promises not only significantly shorter design- cycle times, but also superior and unconventional designs. To address these issues, we investigate the use of a parmetric-CAD system in conjunction with an embedded-boundary Cartesian method. Our goal is to combine the modeling capabilities of feature-based CAD with the robustness and flexibility of component-based Cartesian volume-mesh generation for complex geometry problems. We present the development of an automated optimization frame-work with a focus on the deployment of such a CAD-based design approach in a heterogeneous parallel computing environment.
Aerodynamic Design of Complex Configurations Using Cartesian Methods and CAD Geometry
Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.
2003-01-01
The objective for this paper is to present the development of an optimization capability for the Cartesian inviscid-flow analysis package of Aftosmis et al. We evaluate and characterize the following modules within the new optimization framework: (1) A component-based geometry parameterization approach using a CAD solid representation and the CAPRI interface. (2) The use of Cartesian methods in the development Optimization techniques using a genetic algorithm. The discussion and investigations focus on several real world problems of the optimization process. We examine the architectural issues associated with the deployment of a CAD-based design approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute nodes. In addition, we study the influence of noise on the performance of optimization techniques, and the overall efficiency of the optimization process for aerodynamic design of complex three-dimensional configurations. of automated optimization tools. rithm and a gradient-based algorithm.
OTAHAL,THOMAS J.; GALLIS,MICHAIL A.; BARTEL,TIMOTHY J.
2000-06-27
This paper presents an investigation of a technique for using two-dimensional bodies composed of simple polygons with a body decoupled uniform Cmtesian grid in the Direct Simulation Monte Carlo method (DSMC). The method employs an automated grid pre-processing scheme beginning form a CAD geometry definition file, and is based on polygon triangulation using a trapezoid algorithm. A particle-body intersection time comparison is presented between the Icarus DSMC code using a body-fitted structured grid and using a structured body-decoupled Cartesian grid with both linear and logarithmic search techniques. A comparison of neutral flow over a cylinder is presented using the structured body fitted grid and the Cartesian body de-coupled grid.
Durfee, Edmund H.
1999-01-01
To coordinate, intelligent agents might need to know something about themselves, about each other, about how others view themselves and others, about how others think others view themselves and others, and so on. Taken to an extreme, the amount of knowledge an agent might possess to coordinate its interactions with others might outstrip the agent's limited reasoning capacity (its available time, memory, and so on). Much of the work in studying and building multiagent systems has thus been dev...
Cartesian Stiffness Matrix Mapping of a Translational Parallel Mechanism with Elastic Joints
Maurizio Ruggiu
2012-01-01
This paper is devoted to calculating the Cartesian stiffness matrix of a translational parallel manipulator with elastic joints. The calculation takes into account the contribution of the Jacobian variation because of the change of manipulator configuration due to the elasticity and it covers the entire theoretical workspace of the manipulator. Three kineto‐static adimensional indices are proposed to measure the response of the manipulator in terms of stiffness.
Cartesian Stiffness Matrix Mapping of a Translational Parallel Mechanism with Elastic Joints
Maurizio Ruggiu
2012-11-01
Full Text Available This paper is devoted to calculating the Cartesian stiffness matrix of a translational parallel manipulator with elastic joints. The calculation takes into account the contribution of the Jacobian variation because of the change of manipulator configuration due to the elasticity and it covers the entire theoretical workspace of the manipulator. Three kineto‐static adimensional indices are proposed to measure the response of the manipulator in terms of stiffness.
Nadal, E.; Ródenas, J. J.; Albelda, J.; Tur, M.; Tarancón, J. E.; Fuenmayor, F.J.
2013-01-01
This work presents an analysis methodology based on the use of the Finite Element Method (FEM) nowadays considered one of the main numerical tools for solving Boundary Value Problems (BVPs). The proposed methodology, so-called cg-FEM (Cartesian grid FEM), has been implemented for fast and accurate numerical analysis of 2D linear elasticity problems. The traditional FEM uses geometry-conforming meshes; however, in cg-FEM the analysis mesh is not conformal to the geometry. This allows for defin...
Plasticity of intermediate mechanics students’ coordinate system choice
Eleanor C. Sayre
2008-11-01
Full Text Available We investigate the interplay between mathematics and physics resources in intermediate mechanics students. In the mechanics course, the selection and application of coordinate systems is a consistent thread. At the University of Maine, students often start the course with a strong preference to use Cartesian coordinates, in accordance with their prior physics and mathematics classes. In small-group interviews and in homework help sessions, we ask students to define a coordinate system and set up the equations of motion for a simple pendulum for which polar coordinates are more appropriate. We analyze video data from several encounters using a combination of Process/Object theory and Resource Theory. We find that students sometimes persist in using an inappropriate Cartesian system. Furthermore, students often derive (rather than recall the details of the polar coordinate system, indicating that their knowledge is far from solid. To describe our work more precisely, we define a scale of plasticity and several heuristics for defining resources and their plasticity.
Kim, Seungil
2010-01-01
In this paper, we study the spectrum of the operator which results when the Perfectly Matched Layer (PML) is applied in Cartesian geometry to the Laplacian on an unbounded domain. This is often thought of as a complex change of variables or "complex stretching." The reason that such an operator is of interest is that it can be used to provide a very effective domain truncation approach for approximating acoustic scattering problems posed on unbounded domains. Stretching associated with polar or spherical geometry lead to constant coefficient operators outside of a bounded transition layer and so even though they are on unbounded domains, they (and their numerical approximations) can be analyzed by more standard compact perturbation arguments. In contrast, operators associated with Cartesian stretching are non-constant in unbounded regions and hence cannot be analyzed via a compact perturbation approach. Alternatively, to show that the scattering problem PML operator associated with Cartesian geometry is stable for real nonzero wave numbers, we show that the essential spectrum of the higher order part only intersects the real axis at the origin. This enables us to conclude stability of the PML scattering problem from a uniqueness result given in a subsequent publication. © 2009 Elsevier Inc. All rights reserved.
Density- and wavefunction-normalized Cartesian spherical harmonics for l≤ 20
The widely used pseudoatom formalism in experimental X-ray charge-density studies makes use of real spherical harmonics when describing the angular component of aspherical deformations of the atomic electron density in molecules and crystals. The analytical form of the density-normalized Cartesian spherical harmonic functions for up to l≤7 and the corresponding normalization coefficients were reported previously by Paturle & Coppens. It was shown that the analytical form for normalization coefficients is available primarily for I≤4. Only in very special cases it is possible to derive an analytical representation of the normalization coefficients for 4 < l≤ 7. In most cases for l > 4 the density normalization coefficients were calculated numerically to within seven significant figures. In this study we review the literature on the density-normalized spherical harmonics, clarify the existing notations, use the Paturle & Coppens method in the Wolfram Mathematica software to derive the Cartesian spherical harmonics for l≤20 and determine the density normalization coefficients to 35 significant figures, and computer-generate a Fortran90 code. The article primarily targets researchers who work in the field of experimental X-ray electron density, but may be of some use to all who are interested in Cartesian spherical harmonics
LIU Wei; YANG Jun; TIAN Jing
2012-01-01
A three-dimensional time-domain algorithm, which is based on tile augmented KZK （Khokhlov-Zabolotskaya-Kuznetsov） equation, is proposed to simulate the nonlinear field of the parametric array. First, KZK equation is transformed into TBE （Transformed beam equation）. Then, the effects of diffraction （in parabolic approximation）, thermoviscous absorption, relax- ation, and nonlinearity are solved with finite difference methods. The numerical results of this code agree well with the theoretical and experimental results presented in previous studies, which demonstrates the validity of the three-dimensional algorithm. Using this code to calcu- late the nonlinear field of the parametric array in air, it is found that the small time interval is important to the accuracy of the simulation results of the difference frequency wave in the case of high sound pressure level, and the errors caused by taking relaxation absorption for thermoviscous absorption are influenced by the characteristic frequency.
Minor, B.M.
1993-09-01
The exponential characteristic spatial quadrature for discrete ordinates neutral particle transport with rectangular cells is developed. Numerical problems arising in the derivation required the development of exponential moment functions. These functions are used to remove indeterminant forms which can cause catastrophic cancellations. The EC method is positive and nonlinear. It conserves particles and satisfies first moment balance. Comparisons of the EC method's performance to other methods in optically thin and thick spatial cells were performed. For optically thin cells, the EC method was shown to converge to the correct answer, with third order truncation error in the thin cell limit. In deep penetration problems, the EC method attained its highest computational efficiencies compared to the other methods. For all the deep penetration problems examined, the number of spatial cells required by the EC method to attain a desired accuracy was less than the other methods.... Mathematics functions, Nuclear radiation, Nuclear engineering, Radiation attenuation, Radiation shielding, Transport theory, Radiation transport.
van Joolen*, Vince; Givoli, Dan; Neta, Beny
2003-07-01
Among the many areas of research that Professor Kawahara has been active in is the subject of open boundaries in which linear time-dependent dispersive waves are considered in an unbounded domain. The infinite domain is truncated via an artificial boundary B on which an open boundary condition (OBC) is imposed. In this paper, Higdon OBCs and Hagstrom-Hariharan (HH) OBCs are considered. Higdon-type conditions, originally implemented as low-order OBCs, are made accessible for any desired order via a new scheme. The higher-order Higdon OBC is then reformulated using auxiliary variables and made compatible for use with finite element (FE) methods. Methodologies for selecting Higdon parameters are also proposed. The performances of these schemes are demonstrated in two numerical examples. This is followed by a discussion of the HH OBC, which is applicable to non-dispersive media on cylindrical and spherical geometries. The paper extends this OBC to the "slightly dispersive" case.
Joolen, Vince Van; Givoli, Dan; Neta, Beny
2003-01-01
International J. Computational Fluid Dynamics, 17(4), (2003), 263–274. The article of record as published may be located at http://dx.doi.org/10.1080/1061856031000113608 Among the many areas of research that Professor Kawahara has been active in is the subject of open boundaries in which linear time-dependent dispersive waves are considered in an unbounded domain. The infinite domain is truncated via an artificial boundary B on which an open boundary condition (OBC) is imposed. In this ...
We describe a method of solving the nuclear Skyrme-Hartree-Fock problem by using a deformed Cartesian harmonic oscillator basis. The complete list of expressions required to calculate local densities, total energy, and self-consistent fields is presented, and an implementation of the self-consistent symmetries is discussed. Formulas to calculate matrix elements in the Cartesian harmonic oscillator basis are derived for the nuclear and Coulomb interactions. (authors)
Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method
Nemec, Marian; Aftosmis, Michael J.
2004-01-01
Adjoint 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 optimization. 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 (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et 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. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented
Wang, Hsiang-Hsu; Taam, Ronald E
2015-01-01
Investigating the evolution of disk galaxies and the dynamics of proto-stellar disks can involve the use of both a hydrodynamical and a Poisson solver. These systems are usually approximated as infinitesimally thin disks using two- dimensional Cartesian or polar coordinates. In Cartesian coordinates, the calcu- lations of the hydrodynamics and self-gravitational forces are relatively straight- forward for attaining second order accuracy. However, in polar coordinates, a second order calculation of self-gravitational forces is required for matching the second order accuracy of hydrodynamical schemes. We present a direct algorithm for calculating self-gravitational forces with second order accuracy without artifi- cial boundary conditions. The Poisson integral in polar coordinates is expressed in a convolution form and the corresponding numerical complexity is nearly lin- ear using a fast Fourier transform. Examples with analytic solutions are used to verify that the truncated error of this algorithm is of seco...
Quesne, C
2014-01-01
A simple derivation of the classical solutions of a nonlinear model describing a harmonic oscillator on the sphere and the hyperbolic plane is presented in polar coordinates. These solutions are then related to those in cartesian coordinates, whose form was previously guessed. In addition, the nature of the classical orthogonal polynomials entering the bound-state radial wavefunctions of the corresponding quantum model is identified.
A second order Cartesian finite volume method for elliptic interface and embedded Dirichlet problems
We present a finite volume method to solve elliptic equations with immersed interface conditions. This method allows discontinuities on the solution and its normal derivatives on an interface inside the domain on a Cartesian grid. The main idea is to use a piecewise polynomial representation of the solution on a dual grid that avoid distinctions between the different interface configurations. The method achieves second order accuracy with a compact nine-point stencil. Moreover, we show that this method applies to solve embedded Dirichlet and Neumann problems. (authors)
Three-dimensional multigroup diffusion code ANDEX based on nodal method for cartesian geometry
An analytic polynomial nodal method using partial currents has been derived for the solution of multigroup neutron diffusion equations in three-dimensional (3-D) cartesian geometry. This method is characterized by expressing the source and leakage terms in an auxiliary 1-D diffusion equation by quadratic polynomials and solving it analytically. Based on this method, we have developed a 3-D multigroup diffusion code ANDEX, and applied to 2-D LWR and 3-D FBR models. The results of keff, power distributions and computing time have been compared with those of finite difference method calculations. (author)
Application of high-order diamond differencing schemes to 3D Cartesian geometries
An innovative high-order discrete ordinate method for the resolution of the time-independent Boltzmann transport equation in 3D Cartesian geometries is presented. This approach consists in a generalization of the classical diamond differencing scheme to high-order spatial approximations. To insure convergence of the source iteration in presence of high diffusive and strong heterogeneous media, diffusion synthetic acceleration (DSA) has been implemented, conjugated with a Krylov subspace method, GMRES(m). We provide numerical comparisons of this 3D high-order SN method with SPn and Monte- Carlo reference calculations. (authors)
CAD-Based Aerodynamic Design of Complex Configurations using a Cartesian Method
Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.
2003-01-01
A modular framework for aerodynamic optimization of complex geometries is developed. By working directly with a parametric CAD system, complex-geometry models are modified nnd tessellated in an automatic fashion. The use of a component-based Cartesian method significantly reduces the demands on the CAD system, and also provides for robust and efficient flowfield analysis. The optimization is controlled using either a genetic or quasi-Newton algorithm. Parallel efficiency of the framework is maintained even when subject to limited CAD resources by dynamically re-allocating the processors of the flow solver. Overall, the resulting framework can explore designs incorporating large shape modifications and changes in topology.
Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry
Nemec, Marian; Aftosmis,Michael J.
2006-01-01
Cartesian-mesh methods 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) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, 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 included 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 objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach
System Wide Joint Position Sensor Fault Tolerance in Robot Systems Using Cartesian Accelerometers
Aldridge, Hal A.; Juang, Jer-Nan
1997-01-01
Joint position sensors are necessary for most robot control systems. A single position sensor failure in a normal robot system can greatly degrade performance. This paper presents a method to obtain position information from Cartesian accelerometers without integration. Depending on the number and location of the accelerometers. the proposed system can tolerate the loss of multiple position sensors. A solution technique suitable for real-time implementation is presented. Simulations were conducted using 5 triaxial accelerometers to recover from the loss of up to 4 joint position sensors on a 7 degree of freedom robot moving in general three dimensional space. The simulations show good estimation performance using non-ideal accelerometer measurements.
A. Ball
Overview From a technical perspective, CMS has been in “beam operation” state since 6th November. The detector is fully closed with all components operational and the magnetic field is normally at the nominal 3.8T. The UXC cavern is normally closed with the radiation veto set. Access to UXC is now only possible during downtimes of LHC. Such accesses must be carefully planned, documented and carried out in agreement with CMS Technical Coordination, Experimental Area Management, LHC programme coordination and the CCC. Material flow in and out of UXC is now strictly controlled. Access to USC remains possible at any time, although, for safety reasons, it is necessary to register with the shift crew in the control room before going down.It is obligatory for all material leaving UXC to pass through the underground buffer zone for RP scanning, database entry and appropriate labeling for traceability. Technical coordination (notably Stephane Bally and Christoph Schaefer), the shift crew and run ...
Elking, Dennis M
2016-08-15
New equations for torque and atomic force are derived for use in flexible molecule force fields with atomic multipoles. The expressions are based on Cartesian tensors with arbitrary multipole rank. The standard method for rotating Cartesian tensor multipoles and calculating torque is to first represent the tensor with n indexes and 3(n) redundant components. In this work, new expressions for directly rotating the unique (n + 1)(n + 2)/2 Cartesian tensor multipole components Θpqr are given by introducing Cartesian tensor rotation matrix elements X(R). A polynomial expression and a recursion relation for X(R) are derived. For comparison, the analogous rotation matrix for spherical tensor multipoles are the Wigner functions D(R). The expressions for X(R) are used to derive simple equations for torque and atomic force. The torque and atomic force equations are applied to the geometry optimization of small molecule crystal unit cells. In addition, a discussion of computational efficiency as a function of increasing multipole rank is given for Cartesian tensors. © 2016 Wiley Periodicals, Inc. PMID:27349179
The Numerical Simulation of Ship Waves Using Cartesian Grid Methods with Adaptive Mesh Refinement
Dommermuth, Douglas G; Beck, Robert F; O'Shea, Thomas T; Wyatt, Donald C; Olson, Kevin; MacNeice, Peter
2014-01-01
Cartesian-grid methods with Adaptive Mesh Refinement (AMR) are ideally suited for simulating the breaking of waves, the formation of spray, and the entrainment of air around ships. As a result of the cartesian-grid formulation, minimal input is required to describe the ships geometry. A surface panelization of the ship hull is used as input to automatically generate a three-dimensional model. No three-dimensional gridding is required. The AMR portion of the numerical algorithm automatically clusters grid points near the ship in regions where wave breaking, spray formation, and air entrainment occur. Away from the ship, where the flow is less turbulent, the mesh is coarser. The numerical computations are implemented using parallel algorithms. Together, the ease of input and usage, the ability to resolve complex free-surface phenomena, and the speed of the numerical algorithms provide a robust capability for simulating the free-surface disturbances near a ship. Here, numerical predictions, with and without AMR,...
The Cartesian Path Planning of Free- Floating Space Robot using Particle Swarm Optimization
Yangsheng Xu
2008-11-01
Full Text Available The Cartesian path planning of free-floating space robot is much more complex than that of fixed-based manipulators, since the end-effector pose (position and orientation is path dependent, and the position-level kinematic equations can not be used to determine the joint angles. In this paper, a method based on particle swarm optimization (PSO is proposed to solve this problem. Firstly, we parameterize the joint trajectory using polynomial functions, and then normalize the parameterized trajectory. Secondly, the Cartesian path planning is transformed to an optimization problem by integrating the differential kinematic equations. The object function is defined according to the accuracy requirement, and it is the function of the parameters to be defined. Finally, we use the Particle Swarm Optimization (PSO algorithm to search the unknown parameters. The approach has the following traits: 1 The limits on joint angles, rates and accelerations are included in the planning algorithm; 2 There exist not any kinematic and dynamic singularities, since only the direct kinematic equations are used; 3 The attitude singularities do not exist, for the orientation is represented by quaternion; 4 The optimization algorithm is not affected by the initial parameters. Simulation results verify the proposed method.
Applications of Space-Filling-Curves to Cartesian Methods for CFD
Aftosmis, M. J.; Murman, S. M.; Berger, M. J.
2003-01-01
This paper presents a variety of novel uses of space-filling-curves (SFCs) for Cartesian mesh methods in CFD. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, many are applicable on general body-fitted meshes-both structured and unstructured. We demonstrate the use of single theta(N log N) SFC-based reordering to produce single-pass (theta(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 640 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 15% of ideal even with only around 50,000 cells in each sub-domain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with theta(M + N) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for control surface deflection or finite-difference-based gradient design methods.
Systematic and Deterministic Graph-Minor Embedding of Cartesian Products of Complete Graphs
Zaribafiyan, Arman; Marchand, Dominic J. J.; Changiz Rezaei, Seyed Saeed
The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. The overhead of the widely used heuristic techniques is quickly proving to be a significant bottleneck for real-world applications. To alleviate this obstacle, we propose a systematic deterministic embedding method that exploits the structures of both the input graph of the specific combinatorial optimization problem and the quantum annealer. We focus on the specific case of the Cartesian product of two complete graphs, a regular structure that occurs in many problems. We first divide the problem by embedding one of the factors of the Cartesian product in a repeatable unit. The resulting simplified problem consists of placing copies of this unit and connecting them together appropriately. Aside from the obvious speed and efficiency advantages of a systematic deterministic approach, the embeddings produced can be easily scaled for larger processors and show desirable properties with respect to the number of qubits used and the chain length distribution.
E. Nadal
2013-01-01
Full Text Available This work presents an analysis methodology based on the use of the Finite Element Method (FEM nowadays considered one of the main numerical tools for solving Boundary Value Problems (BVPs. The proposed methodology, so-called cg-FEM (Cartesian grid FEM, has been implemented for fast and accurate numerical analysis of 2D linear elasticity problems. The traditional FEM uses geometry-conforming meshes; however, in cg-FEM the analysis mesh is not conformal to the geometry. This allows for defining very efficient mesh generation techniques and using a robust integration procedure, to accurately integrate the domain’s geometry. The hierarchical data structure used in cg-FEM together with the Cartesian meshes allow for trivial data sharing between similar entities. The cg-FEM methodology uses advanced recovery techniques to obtain an improved solution of the displacement and stress fields (for which a discretization error estimator in energy norm is available that will be the output of the analysis. All this results in a substantial increase in accuracy and computational efficiency with respect to the standard FEM. cg-FEM has been applied in structural shape optimization showing robustness and computational efficiency in comparison with FEM solutions obtained with a commercial code, despite the fact that cg-FEM has been fully implemented in MATLAB.
Cartesian Mesh Linearized Euler Equations Solver for Aeroacoustic Problems around Full Aircraft
Yuma Fukushima
2015-01-01
Full Text Available The linearized Euler equations (LEEs solver for aeroacoustic problems has been developed on block-structured Cartesian mesh to address complex geometry. Taking advantage of the benefits of Cartesian mesh, we employ high-order schemes for spatial derivatives and for time integration. On the other hand, the difficulty of accommodating curved wall boundaries is addressed by the immersed boundary method. The resulting LEEs solver is robust to complex geometry and numerically efficient in a parallel environment. The accuracy and effectiveness of the present solver are validated by one-dimensional and three-dimensional test cases. Acoustic scattering around a sphere and noise propagation from the JT15D nacelle are computed. The results show good agreement with analytical, computational, and experimental results. Finally, noise propagation around fuselage-wing-nacelle configurations is computed as a practical example. The results show that the sound pressure level below the over-the-wing nacelle (OWN configuration is much lower than that of the conventional DLR-F6 aircraft configuration due to the shielding effect of the OWN configuration.
Timmermans, Bram; Zabala-Iturriagagoitia, Jon Mikel
2013-01-01
not focused on the role this policy instrument can play in the promotion of (knowledge-intensive) entrepreneurship. This paper investigates this link in more detail and introduces the concept of coordinated unbundling as a strategy that can facilitate this purpose. We also present a framework on how......Public procurement for innovation is a matter of using public demand to trigger innovation. Empirical studies have demonstrated that demand-based policy instruments can be considered to be a powerful tool in stimulating innovative processes among existing firms; however, the existing literature has...
Semantyczne założenia sceptycyzmu kartezjańskiego (Semantic Presuppositions of Cartesian Skepticism
Krzysztof Posłajko
2010-12-01
Full Text Available The paper purports to show that in order to formulate the hypothesis that all our beliefs are collectively false – which is taken to be the core of Cartesian skepticism – one must accept the presumption that semantic properties of subject`s beliefs locally supervene on “internal” properties of said subject. In order to show that the responses to skepticism from semantic externalism, i.e. those formulated by Putnam and Davidson, are analyzed. It is argued that even though these arguments are controversial they indicate that Cartesian skeptic must assume that subject beliefs` semantic properties can remain the same in different surroundings, which is exactly what the supervenience thesis amounts to. Finally, it is pointed out that the skepticism introduced by Kripke in his discussion of rule-following is indeed more radical than traditional, Cartesian one, as the former denies the very thesis that the latter must assume.
A. Ball
2010-01-01
Operational Experience At the end of the first full-year running period of LHC, CMS is established as a reliable, robust and mature experiment. In particular common systems and infrastructure faults accounted for <0.6 % CMS downtime during LHC pp physics. Technical operation throughout the entire year was rather smooth, the main faults requiring UXC access being sub-detector power systems and rack-cooling turbines. All such problems were corrected during scheduled technical stops, in the shadow of tunnel access needed by the LHC, or in negotiated accesses or access extensions. Nevertheless, the number of necessary accesses to the UXC averaged more than one per week and the technical stops were inevitably packed with work packages, typically 30 being executed within a few days, placing a high load on the coordination and area management teams. It is an appropriate moment for CMS Technical Coordination to thank all those in many CERN departments and in the Collaboration, who were involved in CMS techni...
Models and Algorithms for Tracking Target with Coordinated Turn Motion
Xianghui Yuan
2014-01-01
Full Text Available Tracking target with coordinated turn (CT motion is highly dependent on the models and algorithms. First, the widely used models are compared in this paper—coordinated turn (CT model with known turn rate, augmented coordinated turn (ACT model with Cartesian velocity, ACT model with polar velocity, CT model using a kinematic constraint, and maneuver centered circular motion model. Then, in the single model tracking framework, the tracking algorithms for the last four models are compared and the suggestions on the choice of models for different practical target tracking problems are given. Finally, in the multiple models (MM framework, the algorithm based on expectation maximization (EM algorithm is derived, including both the batch form and the recursive form. Compared with the widely used interacting multiple model (IMM algorithm, the EM algorithm shows its effectiveness.
Phase-space distributions in quasi-polar coordinates and the fractional Fourier transform.
Alieva, T; Bastiaans, M J
2000-12-01
The ambiguity function and Cohen's class of bilinear phase-space distributions are represented in a quasipolar coordinate system instead of in a Cartesian system. Relationships between these distributions and the fractional Fourier transform are derived; in particular, derivatives of the ambiguity function are related to moments of the fractional power spectra. A simplification is achieved for the description of underspread signals, for optical beam characterization, and for the generation of signal-adaptive phase-space distributions. PMID:11140493
Kumar, D.
1980-01-01
The computer program AFTBDY generates a body fitted curvilinear coordinate system for a wedge curved after body. This wedge curved after body is being used in an experimental program. The coordinate system generated by AFTBDY is used to solve 3D compressible N.S. equations. The coordinate system in the physical plane is a cartesian x,y,z system, whereas, in the transformed plane a rectangular xi, eta, zeta system is used. The coordinate system generated is such that in the transformed plane coordinate spacing in the xi, eta, zeta direction is constant and equal to unity. The physical plane coordinate lines in the different regions are clustered heavily or sparsely depending on the regions where physical quantities to be solved for by the N.S. equations have high or low gradients. The coordinate distribution in the physical plane is such that x stays constant in eta and zeta direction, whereas, z stays constant in xi and eta direction. The desired distribution in x and z is input to the program. Consequently, only the y-coordinate is solved for by the program AFTBDY.
Cuff, Paul; Cover, Thomas
2009-01-01
We develop elements of a theory of cooperation and coordination in networks. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what dependence can be established among the nodes given the communication constraints. Specifically, in a network with communication rates between the nodes, we ask what is the set of all achievable joint distributions p(x1, ..., xm) of actions at the nodes on the network. Several networks are solved, including arbitrarily large cascade networks. Distributed cooperation can be the solution to many problems such as distributed games, distributed control, and establishing mutual information bounds on the influence of one part of a physical system on another.
Redundant internal coordinates, compliance constants and non-bonded interactions - some new insights
Moumita Majumder; Sadasivam Manogaran
2013-01-01
A long standing problem in normal mode analysis is identifying the right internal coordinates given only the cartesian coordinates, the masses of the atoms and the cartesian force constants without using any other additional chemical information. A possible solution is suggested here as drawing the normal modes obtained from the mass weighted cartesian force constant matrix and identifying the correct bonds and angles from the normal mode pictures. If chosen properly, the internal coordinates will have minimum mixing in the normal mode representation. This can in principle lead to an automation algorithm. A complete basis of internal coordinates is defined as the minimum number of valence internal coordinates that describe all the normal modes as completely as possible. It was shown in the literature that the relaxed force constants could be used as a measure of bond order in all atom-atom distance coordinates. Some of the bonded and non-bonded atom pairs can have similar values of the relaxed force constants and hence to use the relaxed force constant as a measure of bond order we need to separate the bonded pairs from the non-bonded ones. This needs extra chemical information of which pairs are bonded. The new definition of complete basis of non-redundant valence internal coordinates helps to identify the bonded pairs effectively without extra information. The hydrogen bonded water clusters (H2O), n = 2-6, methane dimer and methane-water complex are used as examples to verify that the relaxed force constants of bonded pairs are indeed a measure of bond order.
Huang, He
In this thesis, I present the results of studies of the structural properties and phase transition of a charge neutral FCC Lattice Gas with Yukawa Interaction and discuss a novel fast calculation algorithm---Accelerated Cartesian Expansion (ACE) method. In the first part of my thesis, I discuss the results of Monte Carlo simulations carried out to understand the finite temperature (phase transition) properties and the ground state structure of a Yukawa Lattice Gas (YLG) model. In this model the ions interact via the potential q iqjexp(-kappar> ij)/rij where qi,j are the charges of the ions located at the lattice sites i and j with position vectors R i and Rj; rij = Ri-Rj, kappa is a measure of the range of the interaction and is called the screening parameter. This model approximates an interesting quaternary system of great current thermoelectric interest called LAST-m, AgSbPbmTem+2. I have also developed rapid calculation methods for the potential energy calculation in a lattice gas system with periodic boundary condition bases on the Ewald summation method and coded the algorithm to compute the energies in MC simulation. Some of the interesting results of the MC simulations are: (i) how the nature and strength of the phase transition depend on the range of interaction (Yukawa screening parameter kappa) (ii) what is the degeneracy of the ground state for different values of the concentration of charges, and (iii) what is the nature of two-stage disordering transition seen for certain values of x. In addition, based on the analysis of the surface energy of different nano-clusters formed near the transition temperature, the solidification process and the rate of production of these nano-clusters have been studied. In the second part of my thesis, we have developed two methods for rapidly computing potentials of the form R-nu. Both these methods are founded on addition theorems based on Taylor expansions. Taylor's series has a couple of inherent advantages: (i) it
A new DFT method for atoms and molecules in Cartesian grid
Roy, Amlan K
2013-01-01
Electronic structure calculation of atoms and molecules, in the past few decades has largely been dominated by density functional methods. This is primarily due to the fact that this can account for electron correlation effects in a rigorous, tractable manner keeping the computational cost at a manageable level. With recent advances in methodological development, algorithmic progress as well as computer technology, larger physical, chemical and biological systems are amenable to quantum mechanical calculations than ever before. Here we report the development of a new method for accurate reliable description of atoms, molecules within the Hohenberg-Kohn-Sham density functional theory (DFT). In a Cartesian grid, atom-centered localized basis set, electron density, molecular orbitals, two-body potentials are directly built on the grid. We employ a Fourier convolution method for classical Coulomb potentials by making an Ewald-type decomposition technique in terms of short- and long-range interactions. One-body ma...
In this work we report an analytical solution for the monoenergetic neutron diffusion kinetic equation in cartesian geometry. Bearing in mind that the equation for the delayed neutron precursor concentration is a first order linear differential equation in the time variable, to make possible the application of the GITT approach to the kinetic equation, we introduce a fictitious diffusion term multiplied by a positive small value ε. By this procedure, we are able to solve this set of equations. Indeed, applying the GITT technique to the modified diffusion kinetic equation, we come out with a matrix differential equation which has a well known analytical solution when ε goes to zero. We report numerical simulations as well study of numerical convergence of the results attained. (author)
Jeong Kwang-Leol
2014-06-01
Full Text Available The wave attenuation by floating breakwaters in high amplitude waves, which can lead to wave overtopping and breaking, is examined by numerical simulations. The governing equations, the Navier-Stokes equations and the continuity equation, are calculated in a fixed Cartesian grid system. The body boundaries are defined by the line segment connecting the points where the grid line and body surface meet. No-slip and divergence free conditions are satisfied at the body boundary cell. The nonlinear waves near the moving body is defined using the modified markerdensity method. To verify the present numerical method, vortex induced vibration on an elastically mounted cylinder and free roll decay are numerically simulated and the results are compared with those reported in the literature. Using the present numerical method, the wave attenuations by three kinds of floating breakwaters are simulated numerically in a regular wave to compare the performance.
As part of its activity, EDF R and D is developing a new nuclear core simulation code named COCAGNE. This code relies on DIABOLO, a Simplified PN (SPN) method to compute the neutron flux inside the core for eigenvalue calculations. In order to assess the accuracy of SPN calculations, we have developed DOMINO, a new 3D Cartesian SN solver. The parallel implementation of DOMINO is very efficient and allows to complete an eigenvalue calculation involving around 300 x 109 degrees of freedom within a few hours on a single shared-memory supercomputing node. This computation corresponds to a 26-group S8 3D PWR core model used to assess the SPN accuracy. At the pin level, the maximal error for the SP5 DIABOLO fission production rate is lower than 0.2% compared to the S8 DOMINO reference for this 3D PWR core model. (authors)
Courau, T.; Moustafa, S.; Plagne, L.; Poncot, A. [EDF R and D, 1, Av du General de Gaulle, F92141 Clamart cedex (France)
2013-07-01
As part of its activity, EDF R and D is developing a new nuclear core simulation code named COCAGNE. This code relies on DIABOLO, a Simplified PN (SPN) method to compute the neutron flux inside the core for eigenvalue calculations. In order to assess the accuracy of SPN calculations, we have developed DOMINO, a new 3D Cartesian SN solver. The parallel implementation of DOMINO is very efficient and allows to complete an eigenvalue calculation involving around 300 x 10{sup 9} degrees of freedom within a few hours on a single shared-memory supercomputing node. This computation corresponds to a 26-group S{sub 8} 3D PWR core model used to assess the SPN accuracy. At the pin level, the maximal error for the SP{sub 5} DIABOLO fission production rate is lower than 0.2% compared to the S{sub 8} DOMINO reference for this 3D PWR core model. (authors)
Numerical Simulation of Rolling-Airframes Using a Multi-Level Cartesian Method
Murman, Scott M.; Aftosmis, Michael J.; Berger, Marsha J.; Kwak, Dochan (Technical Monitor)
2002-01-01
A supersonic rolling missile with two synchronous canard control surfaces is analyzed using an automated, inviscid, Cartesian method. Sequential-static and time-dependent dynamic simulations of the complete motion are computed for canard dither schedules for level flight, pitch, and yaw maneuver. The dynamic simulations are compared directly against both high-resolution viscous simulations and relevant experimental data, and are also utilized to compute dynamic stability derivatives. The results show that both the body roll rate and canard dither motion influence the roll-averaged forces and moments on the body. At the relatively, low roll rates analyzed in the current work these dynamic effects are modest, however the dynamic computations are effective in predicting the dynamic stability derivatives which can be significant for highly-maneuverable missiles.
Validation of Inlet and Exhaust Boundary Conditions for a Cartesian Method
Pandya, Shishir A.; Murman, Scott M.; Aftosmis, Michael J.
2004-01-01
Inlets and exhaust nozzles are often omitted in aerodynamic simulations of aircraft due to the complexities involved in the modeling of engine details and flow physics. However, the omission is often improper since inlet or plume flows may have a substantial effect on vehicle aerodynamics. A method for modeling the effect of inlets and exhaust plumes using boundary conditions within an inviscid Cartesian flow solver is presented. This approach couples with both CAD systems and legacy geometry to provide an automated tool suitable for parameter studies. The method is validated using two and three-dimensional test problems which are compared with both theoretical and experimental results. The numerical results demonstrate excellent agreement with theory and available data, even for extremely strong jets and very sensitive inlets.
Best of Both Worlds: Uniform sampling in Cartesian and Cayley Molecular Assembly Configuration Space
Ozkan, Aysegul
2014-01-01
EASAL (efficient atlasing and sampling of assembly landscapes) is a recently reported geometric method for representing, visualizing, sampling and computing integrals over the potential energy landscape tailored for small molecular assemblies. EASAL's efficiency arises from the fact that small assembly landscapes permit the use of so-called Cayley parameters (inter-atomic distances) for geometric representation and sampling of the assembly configuration space regions; this results in their isolation, convexification, customized sampling and systematic traversal using a comprehensive topological roadmap, ensuring reasonable coverage of crucial but narrow regions of low effective dimension. However, this alone is inadequate for accurate computation of configurational entropy and other integrals, required for estimation of both free energy and kinetics - where it is essential to obtain uniform sampling in appropriate cartesian or moduli space parameterization. Standard adjustment of Cayley sampling via the Jacob...
ASAM v2.7: a compressible atmospheric model with a Cartesian cut cell approach
M. Jähn
2014-07-01
Full Text Available In this work, the fully compressible, nonhydrostatic atmospheric model ASAM is presented. A cut cell approach is used to include obstacles and orography into the Cartesian grid. Discretization is realized by a mixture of finite differences and finite volumes and a state limiting is applied. An implicit time integration scheme ensures numerical stability around small cells. To make the model applicable for atmospheric problems, physical parameterizations like a Smagorinsky subgrid scale model, a two-moment bulk microphysics scheme, precipitation and vertical surface fluxes by a constant flux layer or a more complex soil model are implemented. Results for three benchmark test cases from the literature are shown. A sensitivity study regarding the development of a convective boundary layer together with island effects at Barbados is carried out to show the capability to perform real case simulations with ASAM.
A Cartesian grid embedded boundary method for Poisson`s equation on irregular domains
Johansen, H. [Univ. of California, Berkeley, CA (United States). Dept. of Mechanical Engineering; Colella, P. [Lawrence Berkeley National Lab., CA (United States). Center for Computational Sciences and Engineering
1997-01-31
The authors present a numerical method for solving Poisson`s equation, with variable coefficients and Dirichlet boundary conditions, on two-dimensional regions. The approach uses a finite-volume discretization, which embeds the domain in a regular Cartesian grid. They treat the solution as a cell-centered quantity, even when those centers are outside the domain. Cells that contain a portion of the domain boundary use conservation differencing of second-order accurate fluxes, on each cell volume. The calculation of the boundary flux ensures that the conditioning of the matrix is relatively unaffected by small cell volumes. This allows them to use multi-grid iterations with a simple point relaxation strategy. They have combined this with an adaptive mesh refinement (AMR) procedure. They provide evidence that the algorithm is second-order accurate on various exact solutions, and compare the adaptive and non-adaptive calculations.
A K De
2014-10-01
A discrete forcing based Cartesian grid method is presented. The nonstaggered arrangement of velocity and pressure is considered. The pressure gradient in localized discrete form is added separately with the velocity making them explicitly coupled. The governing equation is time-integrated implicitly with both linearized and non-linear forms are investigated. Both linear and bi-linear reconstruction techniques are tested for extrapolation of velocity near a complex boundary. The present method is tested for vortical flow in an inclined cavity, flow past circular and inclined square cylinder. Both homogeneous and non-homogeneous Dirichlet forcing problems are tested. The parallelized version of the method is applied to 2D-to-3D transitional flow behind a single and multiple circular cylinders. The present numerical results compare well with the previously documented results.
An adaptive p-refinement strategy applied to nodal expansion method in 3D Cartesian geometry
Highlights: • An adaptive p-refinement approach is developed and implemented successfully in ACNEM. • The proposed strategy enhances the accuracy with regard to the uniform zeroth order solution. • Improvement of results is gained by less computation time relative to uniform high order solution. - Abstract: The aim of this work is to develop a coarse mesh treatment strategy using adaptive polynomial, p, refinement approach for average current nodal expansion method in order to solve the neutron diffusion equation. For performing the adaptive solution process, a posteriori error estimation scheme, i.e. flux gradient has been utilized for finding the probable numerical errors. The high net leakage in a node represents flux gradient existence between neighbor nodes and it may indicate the source of errors for the coarse mesh calculation. Therefore, the relative Cartesian directional net leakage of nodes is considered as an assessment criterion for mesh refinement in a sub-domain. In our proposed approach, the zeroth order nodal expansion solution is used along coarse meshes as large as fuel assemblies to treat neutron populations. Coarse nodes with high directional net leakage may be chosen for implementing higher order polynomial expansion in the corresponding direction, i.e. X and/or Y and/or Z Cartesian directions. Using this strategy, the computational cost and time are reduced relative to uniform high order polynomial solution. In order to demonstrate the efficiency of this approach, a computer program, APNEC, Adaptive P-refinement Nodal Expansion Code, has been developed for solving the neutron diffusion equation using various orders of average current nodal expansion method in 3D rectangular geometry. Some well-known benchmarks are investigated to compare the uniform and adaptive solutions. Results demonstrate the superiority of our proposed strategy in enhancing the accuracy of solution without using uniform high order solution throughout the domain and
C. Delaere
2013-01-01
Since the LHC ceased operations in February, a lot has been going on at Point 5, and Run Coordination continues to monitor closely the advance of maintenance and upgrade activities. In the last months, the Pixel detector was extracted and is now stored in the pixel lab in SX5; the beam pipe has been removed and ME1/1 removal has started. We regained access to the vactank and some work on the RBX of HB has started. Since mid-June, electricity and cooling are back in S1 and S2, allowing us to turn equipment back on, at least during the day. 24/7 shifts are not foreseen in the next weeks, and safety tours are mandatory to keep equipment on overnight, but re-commissioning activities are slowly being resumed. Given the (slight) delays accumulated in LS1, it was decided to merge the two global runs initially foreseen into a single exercise during the week of 4 November 2013. The aim of the global run is to check that we can run (parts of) CMS after several months switched off, with the new VME PCs installed, th...
Christophe Delaere
2013-01-01
The focus of Run Coordination during LS1 is to monitor closely the advance of maintenance and upgrade activities, to smooth interactions between subsystems and to ensure that all are ready in time to resume operations in 2015 with a fully calibrated and understood detector. After electricity and cooling were restored to all equipment, at about the time of the last CMS week, recommissioning activities were resumed for all subsystems. On 7 October, DCS shifts began 24/7 to allow subsystems to remain on to facilitate operations. That culminated with the Global Run in November (GriN), which took place as scheduled during the week of 4 November. The GriN has been the first centrally managed operation since the beginning of LS1, and involved all subdetectors but the Pixel Tracker presently in a lab upstairs. All nights were therefore dedicated to long stable runs with as many subdetectors as possible. Among the many achievements in that week, three items may be highlighted. First, the Strip...
Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry
Nemec, Marian; Aftosmis, Michael J.
2006-01-01
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
A Rational Approach to Ring Flexibility in Internal Coordinate Dynamics
Mazur, A K
1998-01-01
Internal coordinate molecular dynamics (ICMD) is an efficient method for studying biopolymers, but it is readily applicable only to molecules with tree topologies, that is with no internal flexible rings. Common examples violating this condition are prolines and loops closed by S-S bridges in proteins. The most important such case, however, is nucleic acids because the flexibility of the furanose rings always plays an essential role in conformational transitions both in DNA and RNA. There are a few long-known theoretical approaches to this problem, but, in practice, rings with fixed bond lengths are closed by adding appropriate harmonic distance restraints, which is not always acceptable especially in dynamics. This paper tries to overcome this handicap of ICMD and proposes a rational strategy which results in practical numerical algorithms. It gives a unified analytical treatment which shows that this problem is very close to the difficulties encountered by the method of constraints in Cartesian coordinate d...
Adaptive control of nonlinear visual servoing systems for 3D cartesian tracking
Alessandro R. L. Zachi
2006-12-01
Full Text Available This paper presents a control strategy for robot manipulators to perform 3D cartesian tracking using visual servoing. Considering a fixed camera, the 3D cartesian motion is decomposed in a 2D motion on a plane orthogonal to the optical axis and a 1D motion parallel to this axis. An image-based visual servoing approach is used to deal with the nonlinear control problem generated by the depth variation without requiring direct depth estimation. Due to the lack of camera calibration, an adaptive control method is used to ensure both depth and planar tracking in the image frame. The depth feedback loop is closed by measuring the image area of a target object attached to the robot end-effector. Simulation and experimental results obtained with a real robot manipulator illustrate the viability of the proposed scheme.Este trabalho apresenta uma estratégia de controle para robôs manipuladores realizarem rastreamento cartesiano 3D utilizando servovisão. Considerando uma câmera fixa, o movimento cartesiano 3D é decomposto em um movimento 2D sobre um plano ortogonal ao eixo óptico e em outro movimento 1D paralelo ao mesmo eixo. Uma abordagem de servovisão baseada em imagem é utilizada para tratar o problema de controle não-linear, gerado pela variação de profundidade, sem a necessidade de estimar esta medida. Devido à ausência de calibração da câmera, um método de controle adaptativo é utilizado para assegurar rastreamento planar e de profundidade nas coordenadas da imagem. A malha de controle de profundidade é fechada através da medição da área da imagem de um objeto fixado no efetuador do robô. Simulação e resultados experimentais, obtidos com um robô manipulador real, ilustram a viabilidade do esquema proposto.
Omar, Mohamed A
2014-01-01
Initial transient oscillations inhibited in the dynamic simulations responses of multibody systems can lead to inaccurate results, unrealistic load prediction, or simulation failure. These transients could result from incompatible initial conditions, initial constraints violation, and inadequate kinematic assembly. Performing static equilibrium analysis before the dynamic simulation can eliminate these transients and lead to stable simulation. Most exiting multibody formulations determine the static equilibrium position by minimizing the system potential energy. This paper presents a new general purpose approach for solving the static equilibrium in large-scale articulated multibody. The proposed approach introduces an energy drainage mechanism based on Baumgarte constraint stabilization approach to determine the static equilibrium position. The spatial algebra operator is used to express the kinematic and dynamic equations of the closed-loop multibody system. The proposed multibody system formulation utilizes the joint coordinates and modal elastic coordinates as the system generalized coordinates. The recursive nonlinear equations of motion are formulated using the Cartesian coordinates and the joint coordinates to form an augmented set of differential algebraic equations. Then system connectivity matrix is derived from the system topological relations and used to project the Cartesian quantities into the joint subspace leading to minimum set of differential equations. PMID:25045732
Development of a new two-dimensional Cartesian geometry nodal multigroup discrete-ordinates method
Pevey, R.E.
1982-07-01
The purpose of this work is the development and testing of a new family of methods for calculating the spatial dependence of the neutron density in nuclear systems described in two-dimensional Cartesian geometry. The energy and angular dependence of the neutron density is approximated using the multigroup and discrete ordinates techniques, respectively. The resulting FORTRAN computer code is designed to handle an arbitrary number of spatial, energy, and angle subdivisions. Any degree of scattering anisotropy can be handled by the code for either external source or fission systems. The basic approach is to (1) approximate the spatial variation of the neutron source across each spatial subdivision as an expansion in terms of a user-supplied set of exponential basis functions; (2) solve analytically for the resulting neutron density inside each region; and (3) approximate this density in the basis function space in order to calculate the next iteration flux-dependent source terms. In the general case the calculation is iterative due to neutron sources which depend on the neutron density itself, such as scattering interactions.
Viability of Bioprinted Cellular Constructs Using a Three Dispenser Cartesian Printer
Dennis, SG.; Trusk, T.; Richards, D.; Jia, J.; Tan, Y.; Mei, Y.; Fann, S.; Markwald, R.; Yost, M.
2016-01-01
Tissue engineering has centralized its focus on the construction of replacements for non-functional or damaged tissue. The utilization of three-dimensional bioprinting in tissue engineering has generated new methods for the printing of cells and matrix to fabricate biomimetic tissue constructs. The solid freeform fabrication (SFF) method developed for three-dimensional bioprinting uses an additive manufacturing approach by depositing droplets of cells and hydrogels in a layer-by-layer fashion. Bioprinting fabrication is dependent on the specific placement of biological materials into three-dimensional architectures, and the printed constructs should closely mimic the complex organization of cells and extracellular matrices in native tissue. This paper highlights the use of the Palmetto Printer, a Cartesian bioprinter, as well as the process of producing spatially organized, viable constructs while simultaneously allowing control of environmental factors. This methodology utilizes computer-aided design and computer-aided manufacturing to produce these specific and complex geometries. Finally, this approach allows for the reproducible production of fabricated constructs optimized by controllable printing parameters. PMID:26436877
We describe hybrid spectral nodal methods for discrete ordinates (SN) eigenvalue problems in Cartesian geometry. These coarse-mesh methods are based on three ingredients: the use of the standard discretized spatial balance SN equations; the use of the non-standard spectral diamond (SD) auxiliary equations in the multiplying regions of the domain, e.g. fuel assemblies; and the use of the non-standard spectral Green's function (SGF) auxiliary equations in the non-multiplying regions of the domain, e.g., the reflector. In slab-geometry the hybrid SD-SGF method generates numerical results that are completely free of spatial truncation errors. In X,Y-geometry, we obtain a system of two 'slab-geometry' SN equations for the node-edge average angular fluxes by transverse-integrating the X,Y-geometry SN equations separately in the y- and then in the x-directions within an arbitrary node of the spatial grid set up on the domain. In this paper, we approximate the transverse leakage terms by constants. These are the only approximations considered in the SD-SGF-constant nodal method, as the source terms, that include scattering and eventually fission events, are treated exactly. We show numerical results to typical model problems to illustrate the accuracy of spectral nodal methods for coarse-mesh SN criticality calculations. (author)
The variational nodal method (VNM) has been generalized to three dimensions and used to solve a set of five criticality problems, in Cartesian, triangular, and hexagonal geometries. The code is implemented within the IDF 3D neutronics production code on a Cray-XMP. The first four benchmarks are taken from Takeda and Ikeda, and the last is a simplified sixth-core model of the Experimental Breeder Reactor II (EBR-II). Comparisons are made to various SN codes, the other nodal methods, and Monte Carlo reference solutions. The VNM is based on a variational principle whose Euler-Lagrange equation is the even-parity transport equation. Nodal balance is imposed through the odd-parity fluxes used as a Lagrange multiplier on nodal interfaces. Even- and odd-parity fluxes are expanded in a classical Ritz procedure with complete sets of orthogonal polynomials in space and angle. The VNM is cast in response matrix form, and the even- and odd-parity fluxes are replaced by partial current moments on the nodal interfaces
Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.; Nixon, David (Technical Monitor)
1998-01-01
The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.
Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids
Weinzierl, Tobias
2011-01-01
Almost all approaches to solving partial differential equations (PDEs) are based upon a spatial discretization of the computational domain-a grid. This paper presents an algorithm to generate, store, and traverse a hierarchy of d-dimensional Cartesian grids represented by a (k = 3)- spacetree, a generalization of the well-known octree concept, and it also shows the correctness of the approach. These grids may change their adaptive structure throughout the traversal. The algorithm uses 2d + 4 stacks as data structures for both cells and vertices, and the storage requirements for the pure grid reduce to one bit per vertex for both the complete grid connectivity structure and the multilevel grid relations. Since the traversal algorithm uses only stacks, the algorithm\\'s cache hit rate is continually higher than 99.9 percent, and the runtime per vertex remains almost constant; i.e., it does not depend on the overall number of vertices or the adaptivity pattern. We use the algorithmic approach as the fundamental concept for a mesh management for d-dimensional PDEs and for a matrix-free PDE solver represented by a compact discrete 3 d-point operator. In the latter case, one can implement a Jacobi smoother, a Krylov solver, or a geometric multigrid scheme within the presented traversal scheme which inherits the low memory requirements and the good memory access characteristics directly. © 2011 Society for Industrial and Applied Mathematics.
Platonism, cartesianism and Hegel’s thought in the Matrix Trilogy
Milidrag Predrag
2013-01-01
Full Text Available In this article I will try to interpret changes in Neo, the main character in The Matrix Trilogy, against the background of the ideas of Plato and Descartes, as well as Hegel’s from his Philosophy of History and The Phenomenology of Spirit. Although “philosophical” The Matrix Trilogy is not long-winded and boring film: instead of talking endlessly, the characters are working ceaselessly, and that work is changing them. Contrary to widespread opinion, this interpretation does not find the presence of Descartes’ hyperbolic doubt in the first part of trilogy, but first film sees as a pure Platonism. Nevertheless, there are the Cartesian motifs (e.g. dualism, freeing mind from preconceived opinions, acquiring different habits of belief. The result of the first film is the position of Hegelian unhappy consciousness. This is just a preparation for the key moment of whole Trilogy that is the dialogue between Neo and Architect. Neo’s decision to chose to save Trinity is interpreted in Hegel’s terms of the infinite right of the subject to satisfy himself in his activity and work; because of that, this, sixth Neo is new. After showing the differences in the objectives of Neo and Agent Smith, and transformations of the objectives of humans, the third part of the article analyzes the very end of the Matrix Revolutions, using Marx’s ideas, with some references to Plato and Nietzsche.
ASAM v2.7: a compressible atmospheric model with a Cartesian cut cell approach
M. Jähn
2015-02-01
Full Text Available In this work, the fully compressible, three-dimensional, nonhydrostatic atmospheric model called All Scale Atmospheric Model (ASAM is presented. A cut cell approach is used to include obstacles and orography into the Cartesian grid. Discretization is realized by a mixture of finite differences and finite volumes and a state limiting is applied. Necessary shifting and interpolation techniques are outlined. The method can be generalized to any other orthogonal grids, e.g., a lat–long grid. A linear implicit Rosenbrock time integration scheme ensures numerical stability in the presence of fast sound waves and around small cells. Analyses of five two-dimensional benchmark test cases from the literature are carried out to show that the described method produces meaningful results with respect to conservation properties and model accuracy. The test cases are partly modified in a way that the flow field or scalars interact with cut cells. To make the model applicable for atmospheric problems, physical parameterizations like a Smagorinsky subgrid-scale model, a two-moment bulk microphysics scheme, and precipitation and surface fluxes using a sophisticated multi-layer soil model are implemented and described. Results of an idealized three-dimensional simulation are shown, where the flow field around an idealized mountain with subsequent gravity wave generation, latent heat release, orographic clouds and precipitation are modeled.
Path Planning of Free-Floating Robot in Cartesian Space Using Direct Kinematics
Wenfu Xu
2008-11-01
Full Text Available Dynamic singularities make it difficult to plan the Cartesian path of freefloating robot. In order to avoid its effect, the direct kinematic equations are used for path planning in the paper. Here, the joint position, rate and acceleration are bounded. Firstly, the joint trajectories are parameterized by polynomial or sinusoidal functions. And the two parametric functions are compared in details. It is the first contribution of the paper that polynomial functions can be used when the joint angles are limited(In the similar work of other researchers, only sinusoidla functions could be used. Secondly, the joint functions are normalized and the system of equations about the parameters is established by integrating the differential kinematics equations. Normalization is another contribution of the paper. After normalization, the boundary of the parameters is determined beforehand, and the general criterion to assign the initial guess of the unknown parameters is supplied. The criterion is independent on the planning conditions such as the total time tf. Finally, the parametes are solved by the iterative Newtonian method. Modification of tf may not result in the recalculation of the parameters. Simulation results verify the path planning method.
Development of a new two-dimensional Cartesian geometry nodal multigroup discrete-ordinates method
The purpose of this work is the development and testing of a new family of methods for calculating the spatial dependence of the neutron density in nuclear systems described in two-dimensional Cartesian geometry. The energy and angular dependence of the neutron density is approximated using the multigroup and discrete ordinates techniques, respectively. The resulting FORTRAN computer code is designed to handle an arbitrary number of spatial, energy, and angle subdivisions. Any degree of scattering anisotropy can be handled by the code for either external source or fission systems. The basic approach is to (1) approximate the spatial variation of the neutron source across each spatial subdivision as an expansion in terms of a user-supplied set of exponential basis functions; (2) solve analytically for the resulting neutron density inside each region; and (3) approximate this density in the basis function space in order to calculate the next iteration flux-dependent source terms. In the general case the calculation is iterative due to neutron sources which depend on the neutron density itself, such as scattering interactions
On the Use of CAD and Cartesian Methods for Aerodynamic Optimization
Nemec, M.; Aftosmis, M. J.; Pulliam, T. H.
2004-01-01
The objective for this paper is to present the development of an optimization capability for Curt3D, a Cartesian inviscid-flow analysis package. We present the construction of a new optimization framework and we focus on the following issues: 1) Component-based geometry parameterization approach using parametric-CAD models and CAPRI. A novel geometry server is introduced that addresses the issue of parallel efficiency while only sparingly consuming CAD resources; 2) The use of genetic and gradient-based algorithms for three-dimensional aerodynamic design problems. The influence of noise on the optimization methods is studied. Our goal is to create a responsive and automated framework that efficiently identifies design modifications that result in substantial performance improvements. In addition, we examine the architectural issues associated with the deployment of a CAD-based approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute engines. We demonstrate the effectiveness of the framework for a design problem that features topology changes and complex geometry.
Cartesian Kerr-Schild variation on the Newman-Janis ansatz
Nawarajan, Deloshan
2016-01-01
The Newman-Janis ansatz is a procedure (an "ansatz" or "trick") for obtaining the Kerr spacetime from the Schwarzschild spacetime. This 50 year old "trick" continues to generate heated discussion and debate even to this day. Most of the debate focusses on whether the Newman-Janis procedure can be upgraded to the status of an "algorithm", or if it is perhaps merely an inspired "ansatz", or possibly just a random "trick" of no deep physical significance. (That the Newman-Janis procedure very quickly led to the discovery of the Kerr-Newman spacetime is a point very much in its favour.) In the current article we will not answer these deeper questions, we shall instead present a much simpler alternative variation on the theme of the Newman-Janis ansatz that might be easier to work with. We shall present a 2-step version of the Newman-Janis trick that works directly with the Kerr-Schild "Cartesian" metric presentation of the Kerr spacetime. That is, we show how the original 4-step Newman--Janis procedure can, (usin...
Başar, Erol; Güntekin, Bahar
2007-04-01
The Cartesian System is a fundamental conceptual and analytical framework related and interwoven with the concept and applications of Newtonian Dynamics. In order to analyze quantum processes physicist moved to a Probabilistic Cartesian System in which the causality principle became a probabilistic one. This means the trajectories of particles (obeying quantum rules) can be described only with the concept of cloudy wave packets. The approach to the brain-body-mind problem requires more than the prerequisite of modern physics and quantum dynamics. In the analysis of the brain-body-mind construct we have to include uncertain causalities and consequently multiple uncertain causalities. These multiple causalities originate from (1) nonlinear properties of the vegetative system (e.g. irregularities in biochemical transmitters, cardiac output, turbulences in the vascular system, respiratory apnea, nonlinear oscillatory interactions in peristalsis); (2) nonlinear behavior of the neuronal electricity (e.g. chaotic behavior measured by EEG), (3) genetic modulations, and (4) additional to these physiological entities nonlinear properties of physical processes in the body. The brain shows deterministic chaos with a correlation dimension of approx. D(2)=6, the smooth muscles approx. D(2)=3. According to these facts we propose a hyper-probabilistic approach or a hyper-probabilistic Cartesian System to describe and analyze the processes in the brain-body-mind system. If we add aspects as our sentiments, emotions and creativity to this construct, better said to this already hyper-probabilistic construct, this "New Cartesian System" is more than hyper-probabilistic, it is a nebulous system, we can predict the future only in a nebulous way; however, despite this chain of reasoning we can still provide predictions on brain-body-mind incorporations. We tentatively assume that the processes or mechanisms of the brain-body-mind system can be analyzed and predicted similar to the
In this work we report an analytical solution for the time-dependent one-dimensional neutron transport equation in cartesian geometry for bounded and unbounded domain. The main idea consists in the application of the Laplace transform technique in time variable, solution of the resulting equation by the LTSN method and reconstruction of the angular flux in time-variable by numerical inversion scheme. We report numerical simulations and results validations with the ones of literature. (author)
An interior-point method for the Cartesian P*(k-linear complementarity problem over symmetric cones
B Kheirfam
2014-06-01
Full Text Available A novel primal-dual path-following interior-point algorithm for the Cartesian P*(k-linear complementarity problem over symmetric cones is presented. The algorithm is based on a reformulation of the central path for finding the search directions. For a full Nesterov-Todd step feasible interior-point algorithm based on the new search directions, the complexity bound of the algorithm with small-update approach is the best-available bound.
Liu, Yangfan; Bolton, J Stuart
2016-08-01
The (Cartesian) multipole series, i.e., the series comprising monopole, dipoles, quadrupoles, etc., can be used, as an alternative to the spherical or cylindrical wave series, in representing sound fields in a wide range of problems, such as source radiation, sound scattering, etc. The proofs of the completeness of the spherical and cylindrical wave series in these problems are classical results, and it is also generally agreed that the Cartesian multipole series spans the same space as the spherical waves: a rigorous mathematical proof of that statement has, however, not been presented. In the present work, such a proof of the completeness of the Cartesian multipole series, both in two and three dimensions, is given, and the linear dependence relations among different orders of multipoles are discussed, which then allows one to easily extract a basis from the multipole series. In particular, it is concluded that the multipoles comprising the two highest orders in the series form a basis of the whole series, since the multipoles of all the lower source orders can be expressed as a linear combination of that basis. PMID:27586772
Shooshtary, S; Solbach, K
2015-08-01
A 7 Tesla Magnetic Resonance Imaging (MRI) system with parallel transmission (pTx) for 32 near-magnet Cartesian feedback loop power amplifiers (PA) with output power of 1kW is under construction at Erwin L. Hahn Institute for Magnetic Resonance Imaging. Variation of load impedance due to mutual coupling of neighborhood coils in the array may lead to instability of the Cartesian feedback loop amplifier. MRI safety requires unconditional stability of the PAs at any load. In order to avoid instability in the pTx system, conditions and limits of stability have to be investigated for every possible excitation mode for the coil array. In this work, an efficient method of stability check for an array of two transmit channels (Tx) with Cartesian feedback loop amplifier and a selective excitation mode for the coil array is proposed which allows extension of stability investigations to a large pTx array with any arbitrary excitation mode for the coil array. PMID:26736573
Limitations of Radar Coordinates
Bini, Donato; Lusanna, Luca; Mashhoon, Bahram
2004-01-01
The construction of a radar coordinate system about the world line of an observer is discussed. Radar coordinates for a hyperbolic observer as well as a uniformly rotating observer are described in detail. The utility of the notion of radar distance and the admissibility of radar coordinates are investigated. Our results provide a critical assessment of the physical significance of radar coordinates.
Dimbylow, Peter
2011-07-21
This paper sets out to explore the effects of voxel resolution, from 2 mm down to 0.1 mm for Cartesian co-ordinates and the differences between Cartesian and spherical polar co-ordinates for a standardized test-bed model of the eye. This model was taken from the work of Yoriyaz et al (2005 Radiat. Prot. Dosim. 115 316-9) who have developed a detailed geometric description of the eye including choroid, retina, sclera, lens, cornea, anterior chamber, vitreous humour and optic nerve for ophthalmic brachytherapy. The spherical co-ordinate model has radial and angular steplengths of 0.1 mm and 0.25°, respectively. The current density averaged over 1 cm(2) and the 99th percentile value of the induced electric field have been calculated in the retina and central nervous system for uniform magnetic fields. The Cartesian co-ordinate calculations proceed in a sequence of grids at 2, 1, 0.5, 0.2 and 0.1 mm resolution with the potentials from the previous calculation at a coarser grid providing the boundary conditions on the finer grid. The 0.2 mm grid provides the boundary conditions for the spherical polar calculations. Comparisons are made with the International Commission on Non-Ionizing Radiation Protection reference levels. PMID:21725142
Dimbylow, Peter, E-mail: peter.dimbylow@hpa.org.uk [Health Protection Agency, Chilton, Didcot, Oxon OX11 0RQ (United Kingdom)
2011-07-21
This paper sets out to explore the effects of voxel resolution, from 2 mm down to 0.1 mm for Cartesian co-ordinates and the differences between Cartesian and spherical polar co-ordinates for a standardized test-bed model of the eye. This model was taken from the work of Yoriyaz et al (2005 Radiat. Prot. Dosim. 115 316-9) who have developed a detailed geometric description of the eye including choroid, retina, sclera, lens, cornea, anterior chamber, vitreous humour and optic nerve for ophthalmic brachytherapy. The spherical co-ordinate model has radial and angular steplengths of 0.1 mm and 0.25{sup 0}, respectively. The current density averaged over 1 cm{sup 2} and the 99th percentile value of the induced electric field have been calculated in the retina and central nervous system for uniform magnetic fields. The Cartesian co-ordinate calculations proceed in a sequence of grids at 2, 1, 0.5, 0.2 and 0.1 mm resolution with the potentials from the previous calculation at a coarser grid providing the boundary conditions on the finer grid. The 0.2 mm grid provides the boundary conditions for the spherical polar calculations. Comparisons are made with the International Commission on Non-Ionizing Radiation Protection reference levels.
Poliakovsky, Arkady
2015-01-01
Under the classical non-relativistic consideration of the space-time we propose the model of the laws of gravitation and Electrodynamics, invariant under the galilean transformations and moreover, under every change of non-inertial cartesian coordinate system. Being in the frames of non-relativistic model of the space-time, we adopt some general ideas of the General Theory of Relativity, like the assumption of covariance of the most general physical laws in every inertial and non-inertial coordinate system and equivalence of factious forces in non-inertial coordinate systems and the force of gravitation.
Vaillon, R.; Lallemand, M.; Lemonnier, D. [Ecole Nationale Superieure de Mecanique et d`Aerotechnique (ENSMA), 86 - Poitiers (France)
1996-12-31
The method of discrete ordinates, which is more and more widely used in radiant heat transfer studies, is mainly developed in Cartesian, (r,z) and (r,{Theta}) cylindrical, and spherical coordinates. In this study, the approach of this method is performed in orthogonal curvilinear coordinates: determination of the radiant heat transfer equation, treatment of the angular redistribution terms, numerical procedure. Some examples of application are described in 2-D geometry defined in curvilinear coordinates along a curve and at the thermal equilibrium. A comparison is made with the discrete ordinates method in association with the finite-volumes method in non structured mesh. (J.S.) 27 refs.
ABCXYZ is a computer code for obtaining the Cartesian components of the vector potential and the magnetic field on an observed grid from an arrangement of current-carrying wires. Arbitrary combinations of straight line segments, arcs, and loops are allowed in the specification of the currents. Arbitrary positions and orientations of the current-carrying elements are also allowed. Specification of the wire diameter permits the computation of well-defined fields, even in the interiors of the conductors. An optical feature generates magnetic field lines. Extensive graphical and printed output is available to the user including contour, grid-line, and field-line plots. 12 figures, 1 table
Janssen, Maarten
2003-01-01
textabstractThis comment makes four related points. First, explaining coordination is different from explaining cooperation. Second, solving the coordination problem is more important for the theory of games than solving the cooperation problem. Third, a version of the Principle of Coordination can be rationalized on individualistic grounds. Finally, psychological game theory should consider how players perceive their gaming situation. ---------------------------------------------------------...
J. Foss, Nicolai
2009-01-01
Important aspects of leadership behavior can be rendered intelligible through a focus on coordination games. The concept of common knowledge is shown to be particularly important to understanding leadership. Thus, leaders may establish common knowledge conditions and assist the coordination of strategies in this way, or make decisions in situations where coordination problems persist in spite of common knowledge.
Quantifying linguistic coordination
Fusaroli, Riccardo; Tylén, Kristian
task (Bahrami et al 2010, Fusaroli et al. 2012) we extend to linguistic coordination dynamical measures of recurrence employed in the analysis of sensorimotor coordination (such as heart-rate (Konvalinka et al 2011), postural sway (Shockley 2005) and eye-movements (Dale, Richardson and Kirkham 2012...... linguistic coordination and their effects at a fine-degree....
Most, Sebastian; Nowak, Wolfgang; Bijeljic, Branko
2016-04-01
For understanding non-Fickian transport in porous media, thorough understanding of pore-scale processes is required. When using particle methods as research instruments, we need a detailed understanding of the dependence and memory between subsequent increments in particle motion. We are especially interested in the dependence and memory of the spatial increments (size and direction) at consecutive time steps. Understanding the increment statistics is crucial for the upscaling that always becomes essential for transport simulations at larger scales. Upscaling means averaging over a (representative elementary) volume to save limited computational resources. However, this averaging means a loss of detail and therefore dispersion models should compensate for this loss. Formulating an appropriate dispersion model requires a detailed understanding of the dependencies and memory effects in the transport process. Particle-based simulations for transport in porous media are usually conducted and analyzed in a Cartesian coordinate system. We will show that, for understanding the process physically and representing the process statistically, it is more appropriate to switch to a spherical coordinate system that moves with each particle. Increment statistics in a Cartesian coordinate system usually reveal that a large displacement in longitudinal direction triggers a large displacement in transverse direction as fast flow channels are not perfectly aligned with the Cartesian axis along the main flow direction. We can overcome this inherent link, typical for the Cartesian description by using the absolute displacements together with the direction of the particle movement, where the direction is determined by the angles azimuth and elevation. This can be understood as a Lagrangian spherical process description. The root of the dependence of the transport process is in the complex pore geometry. For some time past, high-resolution micro-CT scans of pore space geometry became the
Miao, Sha; Hendrickson, Kelli; Liu, Yuming; Subramani, Hariprasad
2015-11-01
This work presents a novel and efficient Cartesian-grid based simulation capability for the study of an incompressible, turbulent gas layer over a liquid flow with disparate Reynolds numbers in two phases. This capability couples a turbulent gas-flow solver and a liquid-layer based on a second-order accurate Boundary Data Immersion Method (BDIM) at the deformable interface. The turbulent gas flow solver solves the incompressible Navier-Stokes equations via direct numerical simulation or through turbulence closure (unsteady Reynolds-Averaged Navier-Stokes Models) for Reynolds numbers O(106). In this application, a laminar liquid layer solution is obtained from depth-integrated Navier-Stokes equations utilizing shallow water wave assumptions. The immersed boundary method (BDIM) enforces the coupling at the deformable interface, the boundary conditions to turbulence closure equations and defines the domain geometry on the Cartesian grid. Validations are made for the turbulent gas channel flow over high-viscosity liquid. This simulation capability can be applied to problems in the oil and industrial sector such as channel and pipe flows with heavy oils as well as wind wave generation in shallow waters. Sponsored by the Chevron Energy Technology Company.
Gravity inversion in spherical coordinates using tesseroids
Uieda, Leonardo; Barbosa, Valeria C. F.
2014-05-01
Satellite observations of the gravity field have provided geophysicists with exceptionally dense and uniform coverage of data over vast areas. This enables regional or global scale high resolution geophysical investigations. Techniques like forward modeling and inversion of gravity anomalies are routinely used to investigate large geologic structures, such as large igneous provinces, suture zones, intracratonic basins, and the Moho. Accurately modeling such large structures requires taking the sphericity of the Earth into account. A reasonable approximation is to assume a spherical Earth and use spherical coordinates. In recent years, efforts have been made to advance forward modeling in spherical coordinates using tesseroids, particularly with respect to speed and accuracy. Conversely, traditional space domain inverse modeling methods have not yet been adapted to use spherical coordinates and tesseroids. In the literature there are a range of inversion methods that have been developed for Cartesian coordinates and right rectangular prisms. These include methods for estimating the relief of an interface, like the Moho or the basement of a sedimentary basin. Another category includes methods to estimate the density distribution in a medium. The latter apply many algorithms to solve the inverse problem, ranging from analytic solutions to random search methods as well as systematic search methods. We present an adaptation for tesseroids of the systematic search method of "planting anomalous densities". This method can be used to estimate the geometry of geologic structures. As prior information, it requires knowledge of the approximate densities and positions of the structures. The main advantage of this method is its computational efficiency, requiring little computer memory and processing time. We demonstrate the shortcomings and capabilities of this approach using applications to synthetic and field data. Performing the inversion of gravity and gravity gradient
Generalized harmonic spatial coordinates and hyperbolic shift conditions
We propose a generalization of the condition for harmonic spatial coordinates analogous to the generalization of the harmonic time slices introduced by Bona et al., and closely related to dynamic shift conditions recently proposed by Lindblom and Scheel, and Bona and Palenzuela. These generalized harmonic spatial coordinates imply a condition for the shift vector that has the form of an evolution equation for the shift components. We find that in order to decouple the slicing condition from the evolution equation for the shift it is necessary to use a rescaled shift vector. The initial form of the generalized harmonic shift condition is not spatially covariant, but we propose a simple way to make it fully covariant so that it can be used in coordinate systems other than Cartesian. We also analyze the effect of the shift condition proposed here on the hyperbolicity of the evolution equations of general relativity in 1+1 dimensions and 3+1 spherical symmetry, and study the possible development of blowups. Finally, we perform a series of numerical experiments to illustrate the behavior of this shift condition
Mapping brains without coordinates
Kötter, Rolf; Wanke, Egon
2005-01-01
Brain mapping has evolved considerably over the last century. While most emphasis has been placed on coordinate-based spatial atlases, coordinate-independent parcellation-based mapping is an important technique for accessing the multitude of structural and functional data that have been reported from invasive experiments, and provides for flexible and efficient representations of information. Here, we provide an introduction to motivations, concepts, techniques and implications of coordinate-...
Loshchilov, Ilya; Schoenauer, Marc; Sebag, Michèle
2011-01-01
Independence from the coordinate system is one source of efficiency and robustness for the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). The recently proposed Adaptive Encoding (AE) procedure generalizes CMA-ES adaptive mechanism, and can be used together with any optimization algorithm. Adaptive Encoding gradually builds a transformation of the coordinate system such that the new coordinates are as decorrelated as possible with respect to the objective function. But any optimizat...
Cartesian Control of a Spray-Painting Robot with Redundant Degrees of Freedom
Olav Egeland
1987-10-01
Full Text Available A controller for redundant manipulators with a small, fast manipulator mounted on a positioning part has been developed. The controller distributes the fast motion to the small, fast manipulator and the slow, gross motion to the positioning part. A position reference is generated on-line to the positioning part to avoid singularities and the loss of degrees of freedom. This reference is selected according to an ad hoc procedure which makes the small, fast manipulator work around the centre of its working range. In the control system, the task space position vector is augmented with the generalized coordinates of the positioning part. The resulting augmented task space vector contains a set of generalized coordinates for the manipulator. Feedback linearization and decoupling are applied in the augmented task space to obtain a model consisting of decoupled double integrators. The low and high frequency motion is distributed by controlling the double integrators associated with the end effector with a high bandwidth, while the double integrators associated with the positioning part are controlled with a low bandwidth.
Gillies, Val; Harden, Angela; Johnson, Katherine; Reavey, Paula; Strange, Vicki; Willig, Carla
2004-03-01
The research presented in this paper uses memory work as a method to explore six women's collective constructions of two embodied practices, sweating and pain. The paper identifies limitations in the ways in which social constructionist research has theorized the relationship between discourse and materiality, and it proposes an approach to the study of embodiment which enjoins, rather than bridges, the discursive and the non-discursive. The paper presents an analysis of 25 memories of sweating and pain which suggests that Cartesian dualism is central to the women's accounts of their experiences. However, such dualism does not operate as a stable organizing principle. Rather, it offers two strategies for the performance of a split between mind and body. The paper traces the ways in which dualism can be both functional and restrictive, and explores the tensions between these two forms. The paper concludes by identifiying opportunities and limitations associated with memory work as a method for studying embodiment. PMID:15035700
Crockett, Robert; Graves, Daniel; Colella, Phillip
2009-10-23
We present a method for solving Poisson and heat equations with discon- tinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materi- als, as described in Johansen& Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 106, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.
IVS Technology Coordinator Report
Whitney, Alan
2013-01-01
This report of the Technology Coordinator includes the following: 1) continued work to implement the new VLBI2010 system, 2) the 1st International VLBI Technology Workshop, 3) a VLBI Digital- Backend Intercomparison Workshop, 4) DiFX software correlator development for geodetic VLBI, 5) a review of progress towards global VLBI standards, and 6) a welcome to new IVS Technology Coordinator Bill Petrachenko.
De Chiffre, Leonardo
This document is used in connection with three exercises of 2 hours duration as a part of the course GEOMETRICAL METROLOGY AND MACHINE TESTING. The exercises concern three aspects of coordinate measuring: 1) Measuring and verification of tolerances on coordinate measuring machines, 2) Traceabilit...
Hamilton, Scott; Hamilton, Trevor J
2015-01-01
A fundamental discussion in lower-level undergraduate neuroscience and psychology courses is Descartes's "radical" or "mind-body" dualism. According to Descartes, our thinking mind, the res cogitans, is separate from the body as physical matter or substance, the res extensa. Since the transmission of sensory stimuli from the body to the mind is a physical capacity shared with animals, it can be confused, misled, or uncertain (e.g., bodily senses imply that ice and water are different substances). True certainty thus arises from within the mind and its capacity to doubt physical stimuli. Since this doubting mind is a thinking thing that is distinct from bodily stimuli, truth and certainty are reached through the doubting mind as cogito ergo sum, or the certainty of itself as it thinks: hence Descartes's famous maxim, I think, therefore I am. However, in the last century of Western philosophy, with nervous system investigation, and with recent advances in neuroscience, the potential avenues to explore student's understanding of the epistemology and effects of Cartesian mind-body dualism has expanded. This article further explores this expansion, highlighting pedagogical practices and tools instructors can use to enhance a psychology student's understanding of Cartesian dualistic epistemology, in order to think more critically about its implicit assumptions and effects on learning. It does so in two ways: first, by offering instructors an alternative philosophical perspective to dualistic thinking: a mind-body holism that is antithetical to the assumed binaries of dualistic epistemology. Second, it supplements this philosophical argument with a practical component: simple mind-body illusions that instructors may use to demonstrate contrary epistemologies to students. Combining these short philosophical and neuroscience arguments thereby acts as a pedagogical tool to open new conceptual spaces within which learning may occur. PMID:26321981
Ji-Guo Su
2015-08-01
Full Text Available BtuCD–BtuF from Escherichia coli is a binding protein-dependent adenosine triphosphate (ATP-binding cassette (ABC transporter system that uses the energy of ATP hydrolysis to transmit vitamin B12 across cellular membranes. Experimental studies have showed that during the transport cycle, the transporter undergoes conformational transitions between the “inward-facing” and “outward-facing” states, which results in the open–closed motions of the cytoplasmic gate of the transport channel. The opening–closing of the channel gate play critical roles for the function of the transporter, which enables the substrate vitamin B12 to be translocated into the cell. In the present work, the extent of opening of the cytoplasmic gate was chosen as a function-related internal coordinate. Then the mean-square fluctuation of the internal coordinate, as well as the cross-correlation between the displacement of the internal coordinate and the movement of each residue in the protein, were calculated based on the normal mode analysis of the elastic network model to analyze the function-related motions encoded in the structure of the system. In addition, the key residues important for the functional motions of the transporter were predicted by using a perturbation method. In order to facilitate the calculations, the internal coordinate was introduced as one of the axes of the coordinate space and the conventional Cartesian coordinate space was transformed into the internal/Cartesian space with linear approximation. All the calculations were carried out in this internal/Cartesian space. Our method can successfully identify the functional motions and key residues for the transporter BtuCD–BtuF, which are well consistent with the experimental observations.
On Reaction Coordinate Optimality.
Krivov, Sergei V
2013-01-01
The following question is addressed: how to establish that a constructed reaction coordinate is optimal, i.e., that it provides an accurate description of dynamics. It is shown that the reaction coordinate is optimal if its cut free energy profile, determined using length-weighted transitions, is constant, i.e., it is position and sampling interval independent. The observation leads to a number of interesting results. In particular, the equilibrium flux between two boundary states can be computed exactly as diffusion on a free energy profile associated with the coordinate. The mean square displacement, for the trajectory projected onto the coordinate, grows linear with time. That for the same trajectory projected onto a suboptimal coordinate grows slower than linear with time. The results are illustrated on a number of model systems, Sierpinski gasket, FIP35 protein, and beta3s peptide. PMID:26589017
Coordination failure caused by sunspots
Beugnot, Julie; Gürgüç, Zeynep; Øvlisen, Frederik Roose; Roos, Michael M. W.
2012-01-01
In a coordination game with Pareto-ranked equilibria, we study whether a sunspot can lead to either coordination on an inferior equilibrium (mis-coordination) or to out-of equilibrium behavior (dis-coordination). While much of the literature searches for mechanisms to attain coordination on the e......-dominant equilibrium, but in the sunspot treatment, dis-coordination is frequent. Sunspots lead to significant inefficiency, and we conclude that sunspots can indeed cause coordination failure....
Poirot, Jordan; De Luna, Paolo; Rainer, Gregor
2016-04-01
We comprehensively characterize spiking and visual evoked potential (VEP) activity in tree shrew V1 and V2 using Cartesian, hyperbolic, and polar gratings. Neural selectivity to structure of Cartesian gratings was higher than other grating classes in both visual areas. From V1 to V2, structure selectivity of spiking activity increased, whereas corresponding VEP values tended to decrease, suggesting that single-neuron coding of Cartesian grating attributes improved while the cortical columnar organization of these neurons became less precise from V1 to V2. We observed that neurons in V2 generally exhibited similar selectivity for polar and Cartesian gratings, suggesting that structure of polar-like stimuli might be encoded as early as in V2. This hypothesis is supported by the preference shift from V1 to V2 toward polar gratings of higher spatial frequency, consistent with the notion that V2 neurons encode visual scene borders and contours. Neural sensitivity to modulations of polarity of hyperbolic gratings was highest among all grating classes and closely related to the visual receptive field (RF) organization of ON- and OFF-dominated subregions. We show that spatial RF reconstructions depend strongly on grating class, suggesting that intracortical contributions to RF structure are strongest for Cartesian and polar gratings. Hyperbolic gratings tend to recruit least cortical elaboration such that the RF maps are similar to those generated by sparse noise, which most closely approximate feedforward inputs. Our findings complement previous literature in primates, rodents, and carnivores and highlight novel aspects of shape representation and coding occurring in mammalian early visual cortex. PMID:26843607
Supercritical Airfoil Coordinates
National Aeronautics and Space Administration — Rectangular Supercritical Wing (Ricketts) - design and measured locations are provided in an Excel file RSW_airfoil_coordinates_ricketts.xls . One sheet is with Non...
... in Action Medical Editor & Editorial Advisory Board Sponsors Sponsorship Opporunities Spread the Word Shop AAP Find a Pediatrician ... Movement and Coordination Page Content Article Body At this age, your child will seem to be continually on the go— ...
Angeletos, George-Marios; Hellwig, Christian; Pavan, Alessandro
2003-01-01
This paper examines the ability of a policy maker to control equilibrium outcomes in an environment where market participants play a coordination game with information heterogeneity. We consider defense policies against speculative currency attacks in a model where speculators observe the fundamentals with idiosyncratic noise. The policy maker is willing to take a costly policy action only for moderate fundamentals. Market participants can use this information to coordinate on di.erent respon...
Attribute coordination in organizations
Yingyi Qian; Gerard Roland; Chenggang Xu
2001-01-01
We study coordination in organizations with a variety of organizational forms. Coordination in organization is modeled as the adjustment of attributes and capacities of tasks when facing external shocks. An M-form (U-form) organization groups complementary (substitutable) tasks together in one unit. In the presence of only attribute shocks, particularly when gains from specialization are small, communication is poor, or shocks are more likely, the expected payoff of the decentralized M-form i...
Continuous parallel coordinates.
Heinrich, Julian; Weiskopf, Daniel
2009-01-01
Typical scientific data is represented on a grid with appropriate interpolation or approximation schemes,defined on a continuous domain. The visualization of such data in parallel coordinates may reveal patterns latently contained in the data and thus can improve the understanding of multidimensional relations. In this paper, we adopt the concept of continuous scatterplots for the visualization of spatially continuous input data to derive a density model for parallel coordinates. Based on the point-line duality between scatterplots and parallel coordinates, we propose a mathematical model that maps density from a continuous scatterplot to parallel coordinates and present different algorithms for both numerical and analytical computation of the resulting density field. In addition, we show how the 2-D model can be used to successively construct continuous parallel coordinates with an arbitrary number of dimensions. Since continuous parallel coordinates interpolate data values within grid cells, a scalable and dense visualization is achieved, which will be demonstrated for typical multi-variate scientific data. PMID:19834230
Laundal, K. M.; Richmond, A. D.
2016-07-01
Geospace phenomena such as the aurora, plasma motion, ionospheric currents and associated magnetic field disturbances are highly organized by Earth's main magnetic field. This is due to the fact that the charged particles that comprise space plasma can move almost freely along magnetic field lines, but not across them. For this reason it is sensible to present such phenomena relative to Earth's magnetic field. A large variety of magnetic coordinate systems exist, designed for different purposes and regions, ranging from the magnetopause to the ionosphere. In this paper we review the most common magnetic coordinate systems and describe how they are defined, where they are used, and how to convert between them. The definitions are presented based on the spherical harmonic expansion coefficients of the International Geomagnetic Reference Field (IGRF) and, in some of the coordinate systems, the position of the Sun which we show how to calculate from the time and date. The most detailed coordinate systems take the full IGRF into account and define magnetic latitude and longitude such that they are constant along field lines. These coordinate systems, which are useful at ionospheric altitudes, are non-orthogonal. We show how to handle vectors and vector calculus in such coordinates, and discuss how systematic errors may appear if this is not done correctly.
Trost, Nico; Jiménez, Javier; Imke, Uwe; Sanchez, Victor
2014-06-01
TWOPORFLOW is a thermo-hydraulic code based on a porous media approach to simulate single- and two-phase flow including boiling. It is under development at the Institute for Neutron Physics and Reactor Technology (INR) at KIT. The code features a 3D transient solution of the mass, momentum and energy conservation equations for two inter-penetrating fluids with a semi-implicit continuous Eulerian type solver. The application domain of TWOPORFLOW includes the flow in standard porous media and in structured porous media such as micro-channels and cores of nuclear power plants. In the latter case, the fluid domain is coupled to a fuel rod model, describing the heat flow inside the solid structure. In this work, detailed profiling tools have been utilized to determine the optimization potential of TWOPORFLOW. As a result, bottle-necks were identified and reduced in the most feasible way, leading for instance to an optimization of the water-steam property computation. Furthermore, an OpenMP implementation addressing the routines in charge of inter-phase momentum-, energy- and mass-coupling delivered good performance together with a high scalability on shared memory architectures. In contrast to that, the approach for distributed memory systems was to solve sub-problems resulting by the decomposition of the initial Cartesian geometry. Thread communication for the sub-problem boundary updates was accomplished by the Message Passing Interface (MPI) standard.
Aftosmis, M. J.; Berger, M. J.; Murman, S. M.; Kwak, Dochan (Technical Monitor)
2002-01-01
The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.
Lyra, W; Klahr, H; Piskunov, N
2007-01-01
We present global 3D MHD simulations of disks of gas and solids, aiming at developing models that can be used to study various scenarios of planet formation and planet-disk interaction in turbulent accretion disks. A second goal is to show that Cartesian codes are comparable to cylindrical and spherical ones in handling the magnetohydrodynamics of the disk simulations, as the disk-in-a-box models presented here develop and sustain MHD turbulence. We investigate the dependence of the magnetorotational instability on disk scale height, finding evidence that the turbulence generated by the magnetorotational instability grows with thermal pressure. The turbulent stresses depend on the thermal pressure obeying a power law of 0.24+/-0.03, compatible with the value of 0.25 found in shearing box calculations. The ratio of stresses decreased with increasing temperature. We also study the dynamics of boulders in the hydromagnetic turbulence. The vertical turbulent diffusion of the embedded boulders is comparable to the...
The objective of this work is to obtain an analytical solution of the neutron diffusion kinetic equation in one-dimensional cartesian geometry, to monoenergetic and multigroup problems. These equations are of the type stiff, due to large differences in the orders of magnitude of the time scales of the physical phenomena involved, which make them difficult to solve. The basic idea of the proposed method is applying the spectral expansion in the scalar flux and in the precursor concentration, taking moments and solving the resulting matrix problem by the Laplace transform technique. Bearing in mind that the equation for the precursor concentration is a first order linear differential equation in the time variable, to enable the application of the spectral method we introduce a fictitious diffusion term multiplied by a positive value which tends to zero. This procedure opened the possibility to find an analytical solution to the problem studied. We report numerical simulations and analysis of the results obtained with the precision controlled by the truncation order of the series. (author)
Le Chenadec, Vincent; Bay, Yong Yi
2015-11-01
The treatment of complex geometries in Computational Fluid Dynamics applications is a challenging endeavor, which immersed boundary and cut-cell techniques can significantly simplify by alleviating the meshing process required by body-fitted meshes. These methods also introduce new challenges, in that the formulation of accurate and well-posed discrete operators is not trivial. A cut-cell method for the solution of the incompressible Navier-Stokes equation is proposed for staggered Cartesian grids. In both scalar and vector cases, the emphasis is set on the structure of the discrete operators, designed to mimic the properties of the continuous ones while retaining a nearest-neighbor stencil. For convective transport, different forms are proposed (divergence, advective and skew-symmetric), and shown to be equivalent when the discrete continuity equation is satisfied. This ensures mass, momentum and kinetic energy conservation. For diffusive transport, conservative and symmetric operators are proposed for both Dirichlet and Neumann boundary conditions. Symmetry ensures the existence of a sink term (viscous dissipation) in the discrete kinetic energy budget, which is beneficial for stability. The accuracy of method is finally assessed in standard test cases.
Generator Coordinate Truncations
Hagino, K; Reinhard, P G
2003-01-01
We investigate the accuracy of several schemes to calculate ground-state correlation energies using the generator coordinate technique. Our test-bed for the study is the $sd$ interacting boson model, equivalent to a 6-level Lipkin-type model. We find that the simplified projection of a triaxial generator coordinate state using the $S_3$ subgroup of the rotation group is not very accurate in the parameter space of the Hamiltonian of interest. On the other hand, a full rotational projection of an axial generator coordinate state gives remarkable accuracy. We also discuss the validity of the simplified treatment using the extended Gaussian overlap approximation (top-GOA), and show that it works reasonably well when the number of boson is four or larger.
Coordination and citizen participation.
Tucker, D J
1980-03-01
This study investigates the validity of the assumption that coordination and citizen participation are related inversely and, thus, are incompatible as features in the same social service reform strategy. Seventeen social service organizations situated in the same urban area were studied. Data were obtained by structured interview. The concepts of coordination and citizen participation were operationalized by means of scales. The findings support the validity of the assumption noted above. Although interpretations of the findings can be provided, they are post-factum. This implies a need for explanatory research which might be guided by theories of community power structure and of organizational behavior. PMID:10246483
Introduction to Coordination Chemistry
Lawrance, Geoffrey Alan
2010-01-01
Introduction to Coordination Chemistry examines and explains how metals and molecules that bind as ligands interact, and the consequences of this assembly process. This book describes the chemical and physical properties and behavior of the complex assemblies that form, and applications that may arise as a result of these properties. Coordination complexes are an important but often hidden part of our world?even part of us?and what they do is probed in this book. This book distills the essence of this topic for undergraduate students and for research scientists.
Highlights: ► The multi-group IDE-NDK was solved numerically in 2D-Cartesian geometry. ► The progressive basic polynomial (BPn) methods showed no numerical oscillations. ► The BP2 algorithm showed good accuracy and efficiency. -- Abstract: The multi-group time-integro-differential equations of the neutron diffusion kinetics (IDE-NDK) was solved numerically in 2D Cartesian geometry with the use of the basic-progressive polynomial approximation (BPn). Two applications were computed: a ramp, and an instantaneous change of the thermal removal macroscopic cross sections of the driver material of the 2D-TWGL benchmark problems. The BP2 algorithm showed good accuracy when compared with the results of other codes. BPn did not show the undesirable oscillations that appeared in other codes.
Chen, Zhaopeng; Lii, Neal Y.; Wimböck, Thomas; Shaowei, Fan; Hong, Liu
2011-01-01
This paper presents impedance controllers with adaptive friction compensation for the five-finger dexterous robot hand DLR-HIT II in both joint and Cartesian space. A FPGAbased control hardware and software architecture with real-time communication is designed to fulfill the requirements of the impedance controller. Modeling of the robot finger with exible joints and mechanical couplings in the differential gear-box are described in this paper. In order to address the friction due to t...
Sawada, Ryohto; Ishikawa, Kenichi L
2016-01-01
We report a three-dimensional numerical implementation of multiconfiguration time-dependent Hartree-Fock (MCTDHF) based on a multi-resolution Cartesian grid, with no need to assume any symmetry of molecular structure. We successfully compute high-harmonic generation (HHG) of H2 and H2O. The present implementation will open a way to the first-principle theoretical study of intense-field and attosecond-pulse induced ultrafast phenomena in general molecules.
McGavin, Dennis G; Tennant, W Craighead
2009-06-17
In setting up a spin Hamiltonian (SH) to study high-spin Zeeman and high-spin nuclear and/or electronic interactions in electron paramagnetic resonance (EPR) experiments, it is argued that a maximally reduced SH (MRSH) framed in tesseral combinations of spherical tensor operators is necessary. Then, the SH contains only those terms that are necessary and sufficient to describe the particular spin system. The paper proceeds then to obtain interrelationships between the parameters of the MRSH and those of alternative SHs expressed in Cartesian tensor and Stevens operator-equivalent forms. The examples taken, initially, are those of Cartesian and Stevens' expressions for high-spin Zeeman terms of dimension BS(3) and BS(5). Starting from the well-known decomposition of the general Cartesian tensor of second rank to three irreducible tensors of ranks 0, 1 and 2, the decomposition of Cartesian tensors of ranks 4 and 6 are treated similarly. Next, following a generalization of the tesseral spherical tensor equations, the interrelationships amongst the parameters of the three kinds of expressions, as derived from equivalent SHs, are determined and detailed tables, including all redundancy equations, set out. In each of these cases the lowest symmetry, [Formula: see text] Laue class, is assumed and then examples of relationships for specific higher symmetries derived therefrom. The validity of a spin Hamiltonian containing mixtures of terms from the three expressions is considered in some detail for several specific symmetries, including again the lowest symmetry. Finally, we address the application of some of the relationships derived here to seldom-observed low-symmetry effects in EPR spectra, when high-spin electronic and nuclear interactions are present. PMID:21693947
Recursive Advice for Coordination
Terepeta, Michal Tomasz; Nielson, Hanne Riis; Nielson, Flemming
Aspect-oriented programming is a programming paradigm that is often praised for the ability to create modular software and separate cross-cutting concerns. Recently aspects have been also considered in the context of coordination languages, offering similar advantages. However, introducing aspect...... systems. Even though primarily used for analysis of recursive programs, we are able to adapt them to fit this new context....
Steiner, Jakub
2008-01-01
Roč. 139, č. 1 (2008), s. 25-46. ISSN 0022-0531 R&D Projects: GA MŠk LC542 Institutional research plan: CEZ:AV0Z70850503 Keywords : coordination * general equilibrium * global game s Subject RIV: AH - Economics Impact factor: 1.224, year: 2008
Facets of coordination chemistry
Agarwala, BV
1993-01-01
A concise account of coordination chemistry since its inception is given here together with some of the newer significant facets. This book covers a broad spectrum of various topics on Environment, Cyclic Voltammetry, Chromatography, Metal Complexes of biological interest, Alkoxides, NMR spectroscopy and others. These are useful to the scientific community engaged in the field of Inorganic Chemistry and Analytical Chemistry.
Coordinating Work with Groupware
Pors, Jens Kaaber; Simonsen, Jesper
One important goal of employing groupware is to make possible complex collaboration between geographically distributed groups. This requires a dual transformation of both technology and work practice. The challenge is to reduce the complexity of the coordination work by successfully integrating...
Muralidharan, Balaji; Menon, Suresh
2016-09-01
A new adaptive finite volume conservative cut-cell method that is third-order accurate for simulation of compressible viscous flows is presented. A high-order reconstruction approach using cell centered piecewise polynomial approximation of flow quantities, developed in the past for body-fitted grids, is now extended to the Cartesian based cut-cell method. It is shown that the presence of cut-cells of very low volume results in numerical oscillations in the flow solution near the embedded boundaries when standard small cell treatment techniques are employed. A novel cell clustering approach for polynomial reconstruction in the vicinity of the small cells is proposed and is shown to achieve smooth representation of flow field quantities and their derivatives on immersed interfaces. It is further shown through numerical examples that the proposed clustering method achieves the design order of accuracy and is fairly insensitive to the cluster size. Results are presented for canonical flow past a single cylinder and a sphere at different flow Reynolds numbers to verify the accuracy of the scheme. Investigations are then performed for flow over two staggered cylinders and the results are compared with prior data for the same configuration. All the simulations are carried out with both quadratic and cubic reconstruction, and the results indicate a clear improvement with the cubic reconstruction. The new cut-cell approach with cell clustering is able to predict accurate results even at relatively low resolutions. The ability of the high-order cut-cell method in handling sharp geometrical corners and narrow gaps is also demonstrated using various examples. Finally, three-dimensional flow interactions between a pair of spheres in cross flow is investigated using the proposed cut-cell scheme. The results are shown to be in excellent agreement with past studies, which employed body-fitted grids for studying this complex case.
Barros, R.C.; Filho, H.A.; Oliveira, F.B.S. [Departamento de Modelagem Computacional, Instituto Politecnico, Universidade do Estado do Rio de Janeiro- UERJ, Rua Alberto Rangel s/n, 28630-050 Nova Friburgo, RJ (Brazil); Silva, F.C. da [Programa de Engenharia Nuclear, COPPE, Universidade Federal do Rio de Janeiro - UFRJ, Caixa Postal 68509, 21945-970 Rio de Janeiro, RJ (Brazil)]. e-mail: dickbarros@uol.com.br
2004-07-01
Presented here are the advances in spectral nodal methods for discrete ordinates (SN) eigenvalue problems in Cartesian geometry. These coarse-mesh methods are based on three ingredients: (i) the use of the standard discretized spatial balance SN equations; (ii) the use of the non-standard spectral diamond (SD) auxiliary equations in the multiplying regions of the domain, e.g. fuel assemblies; and (iii) the use of the non-standard spectral Green's function (SGF) auxiliary equations in the non-multiplying regions of the domain, e.g., the reflector. In slab-geometry the hybrid SD-SGF method generates numerical results that are completely free of spatial truncation errors. In X,Y-geometry, we obtain a system of two 'slab-geometry' SN equations for the node-edge average angular fluxes by transverse-integrating the X,Y-geometry SN equations separately in the y- and then in the x-directions within an arbitrary node of the spatial grid set up on the domain. In this paper, we approximate the transverse leakage terms by constants. These are the only approximations considered in the SD-SGF-constant nodal method, as the source terms, that include scattering and eventually fission events, are treated exactly. Moreover, we describe in this paper the progress of the approximate SN albedo boundary conditions for substituting the non-multiplying regions around the nuclear reactor core. We show numerical results to typical model problems to illustrate the accuracy of spectral nodal methods for coarse-mesh SN criticality calculations. (Author)
Yuan, Xuefei
2012-07-01
Numerical simulations of the four-field extended magnetohydrodynamics (MHD) equations with hyper-resistivity terms present a difficult challenge because of demanding spatial resolution requirements. A time-dependent sequence of . r-refinement adaptive grids obtained from solving a single Monge-Ampère (MA) equation addresses the high-resolution requirements near the . x-point for numerical simulation of the magnetic reconnection problem. The MHD equations are transformed from Cartesian coordinates to solution-defined curvilinear coordinates. After the application of an implicit scheme to the time-dependent problem, the parallel Newton-Krylov-Schwarz (NKS) algorithm is used to solve the system at each time step. Convergence and accuracy studies show that the curvilinear solution requires less computational effort than a pure Cartesian treatment. This is due both to the more optimal placement of the grid points and to the improved convergence of the implicit solver, nonlinearly and linearly. The latter effect, which is significant (more than an order of magnitude in number of inner linear iterations for equivalent accuracy), does not yet seem to be widely appreciated. © 2012 Elsevier Inc.
Dai, Liang; Schmidt, Fabian
2015-01-01
Fermi Normal Coordinates (FNC) are a useful frame for isolating the locally observable, physical effects of a long-wavelength spacetime perturbation. Their cosmological application, however, is hampered by the fact that they are only valid on scales much smaller than the horizon. We introduce a generalization that we call Conformal Fermi Coordinates (CFC). CFC preserve all the advantages of FNC, but in addition are valid outside the horizon. They allow us to calculate the coupling of long- and short-wavelength modes on all scales larger than the sound horizon of the cosmological fluid, starting from the epoch of inflation until today, by removing the complications of the second order Einstein equations to a large extent, and eliminating all gauge ambiguities. As an application, we present a calculation of the effect of long-wavelength tensor modes on small scale density fluctuations. We recover previous results, but clarify the physical content of the individual contributions in terms of locally measurable ef...
Principles of Coordination Polymerisation
Kuran, Witold
2001-11-01
The first all-inclusive text covering coordination polymerisation, including important classes of non-hydrocarbon monomers. Charting the achievements and progress in the field, in terms of both basic and industrial research, this book offers a unified and complete overview of coordination polymerisation. Provides detailed description of the historical development of the subject Presents a unified view of catalysis, mechanisms, structures and utility Encourages learning through a step-by-step progression from basic to in-depth text Features end-of-chapter exercises to reinforce understanding Offers a full bibliography and comprehensive literature review Requisite reading for research students studying introductory and advanced courses in; polymer science, catalysis and polymerisation catalysis, and valuable reference for researchers and technicians in industry.
Communication and interference coordination
Blasco-Serrano, Ricardo; Thobaben, Ragnar; Skoglund, Mikael
2014-01-01
We study the problem of controlling the interference created to an external observer by a communication processes. We model the interference in terms of its type (empirical distribution), and we analyze the consequences of placing constraints on the admissible type. Considering a single interfering link, we characterize the communication-interference capacity region. Then, we look at a scenario where the interference is jointly created by two users allowed to coordinate their actions prior to...
1990-01-01
We show that when relevant market information such as price is difficult to communicate, advertising plays a key role in bringing about optimal coordination of purchase behavior: an efficient firm uses advertising expenditures in place of price to inform sophisticated consumers that it offers a better deal. This provides a theoretical explanation for Benham's (1972) empirical association of the ability to advertise with lower prices and larger scale. We find that advertising improves welfare ...