Embedded diagonally implicit Runge-Kutta algorithms on parallel computers
NASA Astrophysics Data System (ADS)
van der Houwen, P. J.; Sommeijer, B. P.; Couzy, W.
1992-01-01
This paper investigates diagonally implicit Runge-Kutta methods in which the implicit relations can be solved in parallel and are singly diagonal-implicit on each processor. The algorithms are based on diagonally implicit iteration of fully implicit Runge-Kutta methods of high order. The iteration scheme is chosen in such a way that the resulting algorithm is A(α ) -stable or L(α ) -stable with α equal or very close to π /2 . In this way, highly stable, singly diagonal-implicit Runge-Kutta methods of orders up to 10 can be constructed. Because of the iterative nature of the methods, embedded formulas of lower orders are automatically available, allowing a strategy for step and order variation.
Diagonally Implicit Symplectic Runge-Kutta Methods with High Algebraic and Dispersion Order
Cong, Y. H.; Jiang, C. X.
2014-01-01
The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. A diagonally implicit symplectic nine-stages Runge-Kutta method with algebraic order 6 and dispersion order 8 is presented. Numerical experiments with some Hamiltonian oscillatory problems are presented to show the proposed method is as competitive as the existing same type Runge-Kutta methods. PMID:24977178
Singly implicit diagonally extended Runge-Kutta methods of fourth order
NASA Astrophysics Data System (ADS)
Skvortsov, L. M.
2014-05-01
Singly implicit diagonally extended Runge-Kutta methods make it possible to combine the merits of diagonally implicit methods (namely, the simplicity of implementation) and fully implicit ones (high stage order). Due to this combination, they can be very efficient at solving stiff and differential-algebraic problems. In this paper, fourth-order methods with an explicit first stage are examined. The methods have the third or fourth stage order. Consideration is given to an efficient implementation of these methods. The results of tests in which the proposed methods were compared with the fifth-order RADAU IIA method are presented.
Diagonally Implicit Runge-Kutta Methods for Ordinary Differential Equations. A Review
NASA Technical Reports Server (NTRS)
Kennedy, Christopher A.; Carpenter, Mark H.
2016-01-01
A review of diagonally implicit Runge-Kutta (DIRK) methods applied to rst-order ordinary di erential equations (ODEs) is undertaken. The goal of this review is to summarize the characteristics, assess the potential, and then design several nearly optimal, general purpose, DIRK-type methods. Over 20 important aspects of DIRKtype methods are reviewed. A design study is then conducted on DIRK-type methods having from two to seven implicit stages. From this, 15 schemes are selected for general purpose application. Testing of the 15 chosen methods is done on three singular perturbation problems. Based on the review of method characteristics, these methods focus on having a stage order of two, sti accuracy, L-stability, high quality embedded and dense-output methods, small magnitudes of the algebraic stability matrix eigenvalues, small values of aii, and small or vanishing values of the internal stability function for large eigenvalues of the Jacobian. Among the 15 new methods, ESDIRK4(3)6L[2]SA is recommended as a good default method for solving sti problems at moderate error tolerances.
Stage-parallel fully implicit Runge-Kutta solvers for discontinuous Galerkin fluid simulations
NASA Astrophysics Data System (ADS)
Pazner, Will; Persson, Per-Olof
2017-04-01
In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge-Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems, which has seen success for fluid flow problems and discontinuous Galerkin discretizations. By transforming the resulting linear system of equations, one can obtain a method which is much less computationally expensive than the untransformed formulation, and which compares competitively with other time-integration schemes, such as diagonally implicit Runge-Kutta (DIRK) methods. We develop and test several ILU-based preconditioners effective for these large systems. We additionally employ a parallel-in-time strategy to compute the Runge-Kutta stages simultaneously. Numerical experiments are performed on the Navier-Stokes equations using Euler vortex and 2D and 3D NACA airfoil test cases in serial and in parallel settings. The fully implicit Radau IIA Runge-Kutta methods compare favorably with equal-order DIRK methods in terms of accuracy, number of GMRES iterations, number of matrix-vector multiplications, and wall-clock time, for a wide range of time steps.
Minimally implicit Runge-Kutta methods for Resistive Relativistic MHD
NASA Astrophysics Data System (ADS)
Aloy, Miguel-Á.; Cordero-Carrión, Isabel
2016-05-01
The Relativistic Resistive Magnetohydrodynamic (RRMHD) equations are a hyperbolic system of partial differential equations used to describe the dynamics of relativistic magnetized fluids with a finite conductivity. Close to the ideal magnetohydrodynamic regime, the source term proportional to the conductivity becomes potentially stiff and cannot be handled with standard explicit time integration methods. We propose a new class of methods to deal with the stiffness fo the system, which we name Minimally Implicit Runge-Kutta methods. These methods avoid the development of numerical instabilities without increasing the computational costs in comparison with explicit methods, need no iterative extra loop in order to recover the primitive (physical) variables, the analytical inversion of the implicit operator is trivial and the several stages can actually be viewed as stages of explicit Runge-Kutta methods with an effective time-step. We test these methods with two different one-dimensional test beds in varied conductivity regimes, and show that our second-order schemes satisfy the theoretical expectations.
On implicit Runge-Kutta methods for parallel computations
NASA Technical Reports Server (NTRS)
Keeling, Stephen L.
1987-01-01
Implicit Runge-Kutta methods which are well-suited for parallel computations are characterized. It is claimed that such methods are first of all, those for which the associated rational approximation to the exponential has distinct poles, and these are called multiply explicit (MIRK) methods. Also, because of the so-called order reduction phenomenon, there is reason to require that these poles be real. Then, it is proved that a necessary condition for a q-stage, real MIRK to be A sub 0-stable with maximal order q + 1 is that q = 1, 2, 3, or 5. Nevertheless, it is shown that for every positive integer q, there exists a q-stage, real MIRK which is I-stable with order q. Finally, some useful examples of algebraically stable MIRKs are given.
Implicit High Order Strong Stability Preserving Runge-Kutta Time Discretizations
2009-02-05
ods and the algebraically stable methods, respectively) are unconditionally stable. 3. The implicit SSP Runge-Kutta of order p > 1 have an SSP...coefficient that is not dramatically larger than those for explicit methods [15, 3, 12]. 4. Any SSP method must have stage order p < 2, and explicit...Runge-Kutta method must have stage order p < 1. The stage order p is a lower bound on the order of convergence when a method is applied to arbitrarily
NASA Astrophysics Data System (ADS)
Langer, Stefan
2014-11-01
For unstructured finite volume methods an agglomeration multigrid with an implicit multistage Runge-Kutta method as a smoother is developed for solving the compressible Reynolds averaged Navier-Stokes (RANS) equations. The implicit Runge-Kutta method is interpreted as a preconditioned explicit Runge-Kutta method. The construction of the preconditioner is based on an approximate derivative. The linear systems are solved approximately with a symmetric Gauss-Seidel method. To significantly improve this solution method grid anisotropy is treated within the Gauss-Seidel iteration in such a way that the strong couplings in the linear system are resolved by tridiagonal systems constructed along these directions of strong coupling. The agglomeration strategy is adapted to this procedure by taking into account exactly these anisotropies in such a way that a directional coarsening is applied along these directions of strong coupling. Turbulence effects are included by a Spalart-Allmaras model, and the additional transport-type equation is approximately solved in a loosely coupled manner with the same method. For two-dimensional and three-dimensional numerical examples and a variety of differently generated meshes we show the wide range of applicability of the solution method. Finally, we exploit the GMRES method to determine approximate spectral information of the linearized RANS equations. This approximate spectral information is used to discuss and compare characteristics of multistage Runge-Kutta methods.
Parallel Implicit Runge-Kutta Methods Applied to Coupled Orbit/Attitude Propagation
NASA Astrophysics Data System (ADS)
Hatten, Noble; Russell, Ryan P.
2016-12-01
A variable-step Gauss-Legendre implicit Runge-Kutta (GLIRK) propagator is applied to coupled orbit/attitude propagation. Concepts previously shown to improve efficiency in 3DOF propagation are modified and extended to the 6DOF problem, including the use of variable-fidelity dynamics models. The impact of computing the stage dynamics of a single step in parallel is examined using up to 23 threads and 22 associated GLIRK stages; one thread is reserved for an extra dynamics function evaluation used in the estimation of the local truncation error. Efficiency is found to peak for typical examples when using approximately 8 to 12 stages for both serial and parallel implementations. Accuracy and efficiency compare favorably to explicit Runge-Kutta and linear-multistep solvers for representative scenarios. However, linear-multistep methods are found to be more efficient for some applications, particularly in a serial computing environment, or when parallelism can be applied across multiple trajectories.
NASA Astrophysics Data System (ADS)
Ismail, Amira; Gorgey, Annie
2015-10-01
Extrapolation involves taking a certain linear combination of the numerical solutions of a base method applied with different stepsizes to obtain greater accuracy. This linear combination is done so as to eliminate the leading error term. The technique of extrapolation in accelerating convergence has been successfully in numerical solution of ordinary differential equations. In this study, symmetric Runge-Kutta methods for solving linear and nonlinear stiff problem are considered. Symmetric methods admit asymptotic error expansion in even powers of the stepsize and are therefore of special interest because successive extrapolations can increase the order by two at time. Although extrapolation can give greater accuracy, due to the stepsize chosen, the numerical approximations are often destroy due to the accumulated round off errors. Therefore, it is important to control the rounding errors especially when applying extrapolation. One way to minimize round off errors is by applying compensated summation. In this paper, the numerical results are given for the symmetric Runge-Kutta methods Implicit Midpoint and Implicit Trapezoidal Rule applied with and without compensated summation. The result shows that symmetric methods with higher level extrapolation using compensated summation gives much smaller errors. On the other hand, symmetric methods without compensated summation when applied with extrapolation, the errors are affected badly by rounding errors.
Generalized disks of contractivity for explicit and implicit Runge-Kutta methods
NASA Technical Reports Server (NTRS)
Dahlquist, G.; Jeltsch, R.
1979-01-01
The A-contractivity of Runge-Kutta methods with respect to an inner product norm was investigated thoroughly by Butcher and Burrage (who used the term B-stability). Their theory is extended to contractivity in a region bounded by a circle through the origin. The largest possible circle is calculated for many known explicit Runge-Kutta methods. As a rule it is considerably smaller than the stability region, and in several cases it degenerates to a point. It is shown that an explicit Runge-Kutta method cannot be contractive in any circle of this class if it is more than fourth order accurate.
NASA Astrophysics Data System (ADS)
Cavaglieri, Daniele; Bewley, Thomas
2015-04-01
Implicit/explicit (IMEX) Runge-Kutta (RK) schemes are effective for time-marching ODE systems with both stiff and nonstiff terms on the RHS; such schemes implement an (often A-stable or better) implicit RK scheme for the stiff part of the ODE, which is often linear, and, simultaneously, a (more convenient) explicit RK scheme for the nonstiff part of the ODE, which is often nonlinear. Low-storage RK schemes are especially effective for time-marching high-dimensional ODE discretizations of PDE systems on modern (cache-based) computational hardware, in which memory management is often the most significant computational bottleneck. In this paper, we develop and characterize eight new low-storage implicit/explicit RK schemes which have higher accuracy and better stability properties than the only low-storage implicit/explicit RK scheme available previously, the venerable second-order Crank-Nicolson/Runge-Kutta-Wray (CN/RKW3) algorithm that has dominated the DNS/LES literature for the last 25 years, while requiring similar storage (two, three, or four registers of length N) and comparable floating-point operations per timestep.
NASA Astrophysics Data System (ADS)
Kazemi-Kamyab, V.; van Zuijlen, A. H.; Bijl, H.
2014-09-01
Thermal interaction of fluids and solids, or conjugate heat transfer (CHT), is encountered in many engineering applications. Since time-accurate computations of unsteady CHT can be computationally demanding, we consider the use of high order implicit time integration schemes which have the potential to be more efficient relative to the commonly used second order implicit schemes. We present a strongly-coupled solution algorithm where the high order L-stable explicit first-stage singly diagonally implicit Runge-Kutta (ESDIRK) schemes are used to advance the solution in time within each separate fluid and solid subdomains. Furthermore, the stability and rate of convergence of performing (Gauss-Seidel) subiterations at each stage of the ESDIRK schemes are analyzed. The results from solving a numerical example (an unsteady conjugate natural convection in an enclosure) show good agreement with the performed analytical stability analysis. In addition, the (computational) work-(temporal) precision character of several schemes in solving a strongly coupled CHT problem is compared over a range of accuracy requirements. From the efficiency investigation, it is observed that performing subiterations with the strongly-coupled ESDIRK algorithm is more efficient than lowering time-step size using a high order loosely-coupled IMEX algorithm. In addition, by using the ESDIRK schemes, gain in computational efficiency relative to Crank-Nicolson is observed for time-accurate solutions (a factor of 1.4 using the fourth order ESDIRK). The computational gain is higher for smaller tolerances.
NASA Astrophysics Data System (ADS)
Kulikov, G. Yu.
2015-06-01
A technique for constructing nested implicit Runge-Kutta methods in the class of mono-implicit formulas of this type is studied. These formulas are highly efficient in practice, since the dimension of the original system of differential equations is preserved, which is not possible in the case of implicit multistage Runge-Kutta formulas of the general from. On the other hand, nested implicit Runge-Kutta methods inherit all major properties of general formulas of this form, such as A-stability, symmetry, and symplecticity in a certain sense. Moreover, they can have sufficiently high stage and classical orders and, without requiring high extra costs, can ensure dense output of integration results of the same accuracy as the order of the underlying method. Thus, nested methods are efficient when applied to the numerical integration of differential equations of various sorts, including stiff and nonstiff problems, Hamiltonian systems, and invertible equations. In this paper, previously proposed nested methods based on the Gauss quadrature formulas are generalized to Lobatto-type methods. Additionally, a unified technique for constructing all such methods is proposed. Its performance is demonstrated as applied to embedded examples of nested implicit formulas of various orders. All the methods constructed are supplied with tools for local error estimation and automatic variable-stepsize mesh generation based on an optimal stepsize selection. These numerical methods are verified by solving test problems with known solutions. Additionally, a comparative analysis of these methods with Matlab built-in solvers is presented.
Elkina, N V; Fedotov, A M; Herzing, C; Ruhl, H
2014-05-01
The Landau-Lifshitz equation provides an efficient way to account for the effects of radiation reaction without acquiring the nonphysical solutions typical for the Lorentz-Abraham-Dirac equation. We solve the Landau-Lifshitz equation in its covariant four-vector form in order to control both the energy and momentum of radiating particles. Our study reveals that implicit time-symmetric collocation methods of the Runge-Kutta-Nyström type are superior in accuracy and better at maintaining the mass-shell condition than their explicit counterparts. We carry out an extensive study of numerical accuracy by comparing the analytical and numerical solutions of the Landau-Lifshitz equation. Finally, we present the results of the simulation of particle scattering by a focused laser pulse. Due to radiation reaction, particles are less capable of penetrating into the focal region compared to the case where radiation reaction is neglected. Our results are important for designing forthcoming experiments with high intensity laser fields.
NASA Technical Reports Server (NTRS)
Kanevsky, Alex
2004-01-01
My goal is to develop and implement efficient, accurate, and robust Implicit-Explicit Runge-Kutta (IMEX RK) methods [9] for overcoming geometry-induced stiffness with applications to computational electromagnetics (CEM), computational fluid dynamics (CFD) and computational aeroacoustics (CAA). IMEX algorithms solve the non-stiff portions of the domain using explicit methods, and isolate and solve the more expensive stiff portions using implicit methods. Current algorithms in CEM can only simulate purely harmonic (up to lOGHz plane wave) EM scattering by fighter aircraft, which are assumed to be pure metallic shells, and cannot handle the inclusion of coatings, penetration into and radiation out of the aircraft. Efficient MEX RK methods could potentially increase current CEM capabilities by 1-2 orders of magnitude, allowing scientists and engineers to attack more challenging and realistic problems.
Extrapolated stabilized explicit Runge-Kutta methods
NASA Astrophysics Data System (ADS)
Martín-Vaquero, J.; Kleefeld, B.
2016-12-01
Extrapolated Stabilized Explicit Runge-Kutta methods (ESERK) are proposed to solve multi-dimensional nonlinear partial differential equations (PDEs). In such methods it is necessary to evaluate the function nt times per step, but the stability region is O (nt2). Hence, the computational cost is O (nt) times lower than for a traditional explicit algorithm. In that way stiff problems can be integrated by the use of simple explicit evaluations in which case implicit methods usually had to be used. Therefore, they are especially well-suited for the method of lines (MOL) discretizations of parabolic nonlinear multi-dimensional PDEs. In this work, first s-stages first-order methods with extended stability along the negative real axis are obtained. They have slightly shorter stability regions than other traditional first-order stabilized explicit Runge-Kutta algorithms (also called Runge-Kutta-Chebyshev codes). Later, they are used to derive nt-stages second- and fourth-order schemes using Richardson extrapolation. The stability regions of these fourth-order codes include the interval [ - 0.01nt2, 0 ] (nt being the number of total functions evaluations), which are shorter than stability regions of ROCK4 methods, for example. However, the new algorithms neither suffer from propagation of errors (as other Runge-Kutta-Chebyshev codes as ROCK4 or DUMKA) nor internal instabilities. Additionally, many other types of higher-order (and also lower-order) methods can be obtained easily in a similar way. These methods also allow adaptation of the length step with no extra cost. Hence, the stability domain is adapted precisely to the spectrum of the problem at the current time of integration in an optimal way, i.e., with minimal number of additional stages. We compare the new techniques with other well-known algorithms with good results in very stiff diffusion or reaction-diffusion multi-dimensional nonlinear equations.
Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations
NASA Technical Reports Server (NTRS)
Kennedy, Christopher A.; Carpenter, Mark H.
2001-01-01
Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations. First, accuracy, stability, conservation, and dense output are considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, N = 2, additive Runge-Kutta ARK2 methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms are of equal order to those of the elemental methods. Derived ARK2 methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z(exp [I]) goes to infinity, and retain high stability efficiency in the absence of stiffness, z(exp [I]) goes to zero. Extrapolation-type stage-value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK2 error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK2 methods while offering error control and stage-value predictors.
Convergence acceleration of rational Runge-Kutta scheme for Euler and Navier-Stokes equations
NASA Astrophysics Data System (ADS)
Morinishi, Koji; Nobuyuki, Satofuka
Modifications introduced to improve the performance of the rational-Runge-Kutta Euler/Navier-Stokes solver of Morishini and Satofuka (1987 and 1988) are discussed, summarizing the results of recent investigations. The derivation of the governing equations and the basic numerical procedure are outlined, and the use of the residual-averaging technique and multigrid methods to accelerate convergence is explained. Results are presented in graphs for (1) two-dimensional inviscid flow on a NACA 0012 airfoil at Mach 0.8 and angle of attack alpha = 1.25 deg, (2) two-dimensional viscous flow on an RAE 2822 airfoil at Mach 0.73 and alpha = 2.80 deg, and (3) three-dimensional inviscid flow on the ONERA M6 wing at Mach 0.84 and alpha = 3.06 deg. The steady-state convergence of the method is shown to be comparable to that of diagonalized implicit approximate-factorization schemes.
Composite group of explicit Runge-Kutta methods
NASA Astrophysics Data System (ADS)
Hamid, Fatin Nadiah Abd; Rabiei, Faranak; Ismail, Fudziah
2016-06-01
In this paper,the composite groups of Runge-Kutta (RK) method are proposed. The composite group of RK method of third and second order, RK3(2) and fourth and third order RK4(3) base on classical Runge-Kutta method are derived. The proposed methods are two-step in nature and have less number of function evaluations compared to the existing Runge-Kutta method. The order conditions up to order four are obtained using rooted trees and composite rule introduced by J. C Butcher. The stability regions of RK3(2) and RK4(3) methods are presented and initial value problems of first order ordinary differential equations are carried out. Numerical results are compared with existing Runge-Kutta method.
A third order Runge-Kutta algorithm on a manifold
NASA Technical Reports Server (NTRS)
Crouch, P. E.; Grossman, R. G.; Yan, Y.
1992-01-01
A third order Runge-Kutta type algorithm is described with the property that it preserves certain geometric structures. In particular, if the algorithm is initialized on a Lie group, then the resulting iterates remain on the Lie group.
Galerkin/Runge-Kutta discretizations for semilinear parabolic equations
NASA Technical Reports Server (NTRS)
Keeling, Stephen L.
1987-01-01
A new class of fully discrete Galerkin/Runge-Kutta methods is constructed and analyzed for semilinear parabolic initial boundary value problems. Unlike any classical counterpart, this class offers arbitrarily high, optimal order convergence. In support of this claim, error estimates are proved, and computational results are presented. Furthermore, it is noted that special Runge-Kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method.
NASA Astrophysics Data System (ADS)
Emmrich, Etienne; Thalhammer, Mechthild
2010-04-01
Stiffly accurate implicit Runge-Kutta methods are studied for the time discretisation of nonlinear first-order evolution equations. The equation is supposed to be governed by a time-dependent hemicontinuous operator that is (up to a shift) monotone and coercive, and fulfills a certain growth condition. It is proven that the piecewise constant as well as the piecewise linear interpolant of the time-discrete solution converges towards the exact weak solution, provided the Runge-Kutta method is consistent and satisfies a stability criterion that implies algebraic stability; examples are the Radau IIA and Lobatto IIIC methods. The convergence analysis is also extended to problems involving a strongly continuous perturbation of the monotone main part.
Energy-conserving Runge-Kutta methods for the incompressible Navier-Stokes equations
NASA Astrophysics Data System (ADS)
Sanderse, B.
2013-01-01
Energy-conserving methods have recently gained popularity for the spatial discretization of the incompressible Navier-Stokes equations. In this paper implicit Runge-Kutta methods are investigated which keep this property when integrating in time. Firstly, a number of energy-conserving Runge-Kutta methods based on Gauss, Radau and Lobatto quadrature are constructed. These methods are suitable for convection-dominated problems (such as turbulent flows), because they do not introduce artificial diffusion and are stable for any time step. Secondly, to obtain robust time-integration methods that work also for stiff problems, the energy-conserving methods are extended to a new class of additive Runge-Kutta methods, which combine energy conservation with L-stability. In this class, the Radau IIA/B method has the best properties. Results for a number of test cases on two-stage methods indicate that for pure convection problems the additive Radau IIA/B method is competitive with the Gauss methods. However, for stiff problems, such as convection-dominated flows with thin boundary layers, both the higher order Gauss and Radau IIA/B method suffer from order reduction. Overall, the Gauss methods are the preferred method for energy-conserving time integration of the incompressible Navier-Stokes equations.
Galerkin/Runge-Kutta discretizations of nonlinear parabolic equations
NASA Astrophysics Data System (ADS)
Hansen, Eskil
2007-08-01
Global error bounds are derived for full Galerkin/Runge-Kutta discretizations of nonlinear parabolic problems, including the evolution governed by the p-Laplacian with p[greater-or-equal, slanted]2. The analysis presented here is not based on linearization procedures, but on the fully nonlinear framework of logarithmic Lipschitz constants and an extended B-convergence theory. The global error is bounded in L2 by [Delta]xr/2+[Delta]tq, where r is the convergence order of the Galerkin method applied to the underlying stationary problem and q is the stiff order of the algebraically stable Runge-Kutta method.
A weighted Runge-Kutta discontinuous Galerkin method for wavefield modelling
NASA Astrophysics Data System (ADS)
He, Xijun; Yang, Dinghui; Wu, Hao
2015-03-01
In this paper, we propose a weighted Runge-Kutta (RK) discontinuous Galerkin (WRKDG) method for wavefield modelling. For this method, we first transform the seismic wave equations in 2-D heterogeneous anisotropic media into a first-order hyperbolic system, and then combine the discontinuous Galerkin method (DGM) with a weighted RK time discretization. The time discretization is based on an implicit diagonal RK method and an explicit technique, which changes the implicit RK method into an explicit one. In addition, we introduce a weighting factor in the process. Linear and quadratic polynomials for spatial basis functions are typically employed. We investigate the properties of the method in great detail, including the stability criteria and numerical dispersion relations for solving the 2-D acoustic equations. Our analysis indicates that the stability condition for the WRKDG method is more relaxed compared with the classic total variation diminishing (TVD) RK discontinuous Galerkin (RKDG) method, resulting in a 1.7 times superiority for P1 element and is about as efficient as TVD RKDG method for P2 element in computational efficiency. We also demonstrate that the WRKDG method can suppress numerical dispersion more efficiently than the staggered-grid (SG) method on the same grid. The WRKDG method is applied to simulate the wavefields in a large velocity contrast model, a 2-D homogeneous transversely isotropic (TI) model, a fluid-filled fracture model, and a 2-D SEG/EAGE salt dome model. Regular rectangular and irregular triangular elements are used. The numerical results show that the WRKDG method can effectively suppress numerical dispersion and provide accurate information on the wavefield on a coarse mesh. Therefore, the method evidently reduces the scale of the problem and increases computational efficiency. In addition, promising numerical tests show that the WRKDG method combines well with split perfectly matched layer boundary conditions.
Trigonometrical fitting conditions for two derivative Runge Kutta methods
NASA Astrophysics Data System (ADS)
Monovasilis, Th.; Kalogiratou, Z.; Simos, T. E.
2016-12-01
Trigonometrically fitted two derivative explicit Runge-Kutta methods are considered in this work. We give order conditions for trigonometrically fitted methods that use several evaluations of the f and the g functions. We present modified methods based on methods with several f evaluations and one g evaluation.
Runge-Kutta Methods for Linear Ordinary Differential Equations
NASA Technical Reports Server (NTRS)
Zingg, David W.; Chisholm, Todd T.
1997-01-01
Three new Runge-Kutta methods are presented for numerical integration of systems of linear inhomogeneous ordinary differential equations (ODES) with constant coefficients. Such ODEs arise in the numerical solution of the partial differential equations governing linear wave phenomena. The restriction to linear ODEs with constant coefficients reduces the number of conditions which the coefficients of the Runge-Kutta method must satisfy. This freedom is used to develop methods which are more efficient than conventional Runge-Kutta methods. A fourth-order method is presented which uses only two memory locations per dependent variable, while the classical fourth-order Runge-Kutta method uses three. This method is an excellent choice for simulations of linear wave phenomena if memory is a primary concern. In addition, fifth- and sixth-order methods are presented which require five and six stages, respectively, one fewer than their conventional counterparts, and are therefore more efficient. These methods are an excellent option for use with high-order spatial discretizations.
Convergence Acceleration of Runge-Kutta Schemes for Solving the Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
Swanson, Roy C., Jr.; Turkel, Eli; Rossow, C.-C.
2007-01-01
The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 can be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. This RK/implicit scheme is used as a smoother for multigrid. Fourier analysis is applied to determine damping properties. Numerical dissipation operators based on the Roe scheme, a matrix dissipation, and the CUSP scheme are considered in evaluating the RK/implicit scheme. In addition, the effect of the number of RK stages is examined. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. Turbulent flows over an airfoil and wing at subsonic and transonic conditions are computed. The effects of the cell aspect ratio on convergence are investigated for Reynolds numbers between 5:7 x 10(exp 6) and 100 x 10(exp 6). It is demonstrated that the implicit preconditioner can reduce the computational time of a well-tuned standard RK scheme by a factor between four and ten.
An unconditionally stable Runge-Kutta method for unsteady rotor-stator interaction
NASA Technical Reports Server (NTRS)
Chima, Rodrick V.; Jorgenson, Philip C. E.
1989-01-01
A quasi-three-dimensional analysis has been developed for unsteady rotor-stator interaction in turbomachinery. The analysis solves the unsteady Euler or thin-layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stress-surface thickness. The Baldwin-Lomax eddy-viscosity model is used for turbulent flows. The equations are integrated in time using an explicit four-stage Runge-Kutta scheme with a constant time step. Implicit residual smoothing is used to increase the stability limit of the time-accurate computations. The scheme is described, and stability and accuracy analyses are given.
Explicit Runge-Kutta schemes for incompressible flow with improved energy-conservation properties
NASA Astrophysics Data System (ADS)
Capuano, F.; Coppola, G.; Rández, L.; de Luca, L.
2017-01-01
The application of pseudo-symplectic Runge-Kutta methods to the incompressible Navier-Stokes equations is discussed in this work. In contrast to fully energy-conserving, implicit methods, these are explicit schemes of order p that preserve kinetic energy to order q, with q > p. Use of explicit methods with improved energy-conservation properties is appealing for convection-dominated problems, especially in case of direct and large-eddy simulation of turbulent flows. A number of pseudo-symplectic methods are constructed for application to the incompressible Navier-Stokes equations and compared in terms of accuracy and efficiency by means of numerical simulations.
Some Optimal Runge-Kutta Collocation Methods for Stiff Problems and DAEs
NASA Astrophysics Data System (ADS)
Gonzalez-Pinto, S.; Hernández-Abreu, D.; Montijano, J. I.
2008-09-01
A new family of implicit Runge-Kutta methods was introduced at ICCAM 2008 (Gent) by the present authors. This family of methods is intended to solve numerically stiff problems and DAEs. The s-stage method (for s⩾3) has the following features: it is a collocation method depending on a real free parameter β, has classical convergence order 2s-3 and is strongly A-stable for β ranging in some nonempty open interval Is = (-γs,0). In addition, for β∈Is, all the collocation nodes fall in the interval [0,1]. Moreover, these methods also involve a similar computational cost as that of the corresponding counterpart in the Runge-Kutta Radau IIA family (the method having the same classical order) when solving for their stage values. However, our methods have the additional advantage of possessing a higher stage order than the respective Radau IIA counterparts. This circumstance is important when integrating stiff problems in which case most of numerical methods are affected by an order reduction. In this talk we discuss how to optimize the free parameter depending on the special features of the kind of stiff problems and DAEs to be solved. This point is highly important in order to make competitive our methods when compared with those of the Radau IIA family.
Generation and application of the equations of condition for high order Runge-Kutta methods
NASA Technical Reports Server (NTRS)
Haley, D. C.
1972-01-01
This thesis develops the equations of condition necessary for determining the coefficients for Runge-Kutta methods used in the solution of ordinary differential equations. The equations of condition are developed for Runge-Kutta methods of order four through order nine. Once developed, these equations are used in a comparison of the local truncation errors for several sets of Runge-Kutta coefficients for methods of order three up through methods of order eight.
Runge-Kutta collocation methods for differential-algebraic equations of indices 2 and 3
NASA Astrophysics Data System (ADS)
Skvortsov, L. M.
2012-10-01
Stiffly accurate Runge-Kutta collocation methods with explicit first stage are examined. The parameters of these methods are chosen so as to minimize the errors in the solutions to differential-algebraic equations of indices 2 and 3. This construction results in methods for solving such equations that are superior to the available Runge-Kutta methods.
NASA Astrophysics Data System (ADS)
Schippmann, Bianca; Burchard, Hans
Modelling biogeochemical processes in the surface ocean is still a difficult task due to the challenge to identify the most convenient integration scheme for the reaction terms. The scheme is expected to deal with the model characteristics of positivity and conservativity as well as with the different time scales involved, which occur e.g., whenever photochemical reactions take place in the water column. This paper presents a numerical comparison of the Rosenbrock methods, ROS3 and ROS4, often used for solving chemical reactions, to the explicit fourth-order Runge-Kutta method and the unconditionally positive modified Patankar schemes. Following their successful application in air chemistry, we here test the hypothesis that the Rosenbrock methods are an optimal choice for marine biogeochemical modelling in terms of efficiency and accuracy. In this study the schemes are compared in terms of runtime and accuracy and are applied to two test cases of different complexity: a zero-dimensional nutrient-phytoplankton-detritus (NPD)-type model and a one-dimensional nutrient-phytoplankton-zooplankton-detritus (NPZD)-type model. Applying the Rosenbrock methods to the simple NPD model shows their advantage over the other applied methods. They give the most accurate results of all solvers, especially for large step sizes, in less computing time due to their semi-implicitness and adaptive step sizing. On the contrary, for the one-dimensional NPZD model problem this is only the case in comparison to the Runge-Kutta solver, while their performance is worse than that of the second-order modified Patankar scheme. They need longer runtimes than the latter ones in order to achieve similarly accurate results. However, the modified Patankar schemes are not conservative if the system reactions contain more than one source compound. Thus, for more complex marine biogeochemical problems, it is recommended to apply the Rosenbrock methods while for simpler models the use of the second
A generalization of the Runge-Kutta iteration
NASA Astrophysics Data System (ADS)
Haelterman, R.; Vierendeels, J.; van Heule, D.
2009-02-01
Iterative solvers in combination with multi-grid have been used extensively to solve large algebraic systems. One of the best known is the Runge-Kutta iteration. We show that a generally used formulation [A. Jameson, Numerical solution of the Euler equations for compressible inviscid fluids, in: F. Angrand, A. Dervieux, J.A. Désidéri, R. Glowinski (Eds.), Numerical Methods for the Euler Equations of Fluid Dynamics, SIAM, Philadelphia, 1985, pp. 199-245] does not allow to form all possible polynomial transmittance functions and we propose a new formulation to remedy this, without using an excessive number of coefficients. After having converted the optimal parameters found in previous studies (e.g. [B. Van Leer, C.H. Tai, K.G. Powell, Design of optimally smoothing multi-stage schemes for the Euler equations, AIAA Paper 89-1923, 1989]) we compare them with those that we obtain when we optimize for an integrated 2-grid V-cycle and show that this results in superior performance using a low number of stages. We also propose a variant of our new formulation that roughly follows the idea of the Martinelli-Jameson scheme [A. Jameson, Analysis and design of numerical schemes for gas dynamics 1, artificial diffusion, upwind biasing, limiter and their effect on multigrid convergence, Int. J. Comput. Fluid Dyn. 4 (1995) 171-218; J.V. Lassaline, Optimal multistage relaxation coefficients for multigrid flow solvers. http://www.ryerson.ca/~jvl/papers/cfd2005.pdf] used on the advection-diffusion equation which that can be extended to other types. Gains in the order of 30%-50% have been shown with respect to classical iterative schemes on the advection equation. Better results were also obtained on the advection-diffusion equation than with the Martinelli-Jameson coefficients, but with less than half the number of matrix-vector multiplications.
Discovery and Optimization of Low-Storage Runge-Kutta Methods
2015-06-01
NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS DISCOVERY AND OPTIMIZATION OF LOW-STORAGE RUNGE-KUTTA METHODS by Matthew T. Fletcher June 2015... DISCOVERY AND OPTIMIZATION OF LOW-STORAGE RUNGE-KUTTA METH- ODS 5. FUNDING NUMBERS 6. AUTHOR(S) Matthew T. Fletcher 7. PERFORMING ORGANIZATION NAME(S...239–18 i THIS PAGE INTENTIONALLY LEFT BLANK ii Approved for public release; distribution is unlimited DISCOVERY AND OPTIMIZATION OF LOW-STORAGE RUNGE
Gwinner, J; Thalhammer, M
The convergence of full discretisations by implicit Runge-Kutta and nonconforming Galerkin methods applied to nonlinear evolutionary inequalities is studied. The scope of applications includes differential inclusions governed by a nonlinear operator that is monotone and fulfills a certain growth condition. A basic assumption on the considered class of stiffly accurate Runge-Kutta time discretisations is a stability criterion which is in particular satisfied by the Radau IIA and Lobatto IIIC methods. In order to allow nonconforming hp-finite element approximations of unilateral constraints, set convergence of convex subsets in the sense of Glowinski-Mosco-Stummel is utilised. An appropriate formulation of the fully discrete variational inequality is deduced on the basis of a characteristic example of use, a Signorini-type initial-boundary value problem. Under hypotheses close to the existence theory of nonlinear first-order evolutionary equations and inequalities involving a monotone main part, a convergence result for the piecewise constant in time interpolant is established.
NASA Astrophysics Data System (ADS)
Toulorge, T.; Desmet, W.
2012-02-01
We study the performance of methods of lines combining discontinuous Galerkin spatial discretizations and explicit Runge-Kutta time integrators, with the aim of deriving optimal Runge-Kutta schemes for wave propagation applications. We review relevant Runge-Kutta methods from literature, and consider schemes of order q from 3 to 4, and number of stages up to q + 4, for optimization. From a user point of view, the problem of the computational efficiency involves the choice of the best combination of mesh and numerical method; two scenarios are defined. In the first one, the element size is totally free, and a 8-stage, fourth-order Runge-Kutta scheme is found to minimize a cost measure depending on both accuracy and stability. In the second one, the elements are assumed to be constrained to such a small size by geometrical features of the computational domain, that accuracy is disregarded. We then derive one 7-stage, third-order scheme and one 8-stage, fourth-order scheme that maximize the stability limit. The performance of the three new schemes is thoroughly analyzed, and the benefits are illustrated with two examples. For each of these Runge-Kutta methods, we provide the coefficients for a 2 N-storage implementation, along with the information needed by the user to employ them optimally.
Using 4th order Runge-Kutta method for solving a twisted Skyrme string equation
NASA Astrophysics Data System (ADS)
Hadi, Miftachul; Anderson, Malcolm; Husein, Andri
2016-03-01
We study numerical solution, especially using 4th order Runge-Kutta method, for solving a twisted Skyrme string equation. We find numerically that the value of minimum energy per unit length of vortex solution for a twisted Skyrmion string is 20.37 × 1060 eV/m.
A fourth order modified trigonometrically fitted symplectic Runge-Kutta-Nyström method
NASA Astrophysics Data System (ADS)
Kalogiratou, Z.; Monovasilis, Th.; Simos, T. E.
2013-10-01
In this work we construct a modified trigonometrically fitted symplectic Runge Kutta Nyström method based on the forth order five stages method of Calvo and Sanz-Serna. We apply the new method on the numerical integration of the two-body problem.
NASA Technical Reports Server (NTRS)
Cockrell, C. R.
1989-01-01
Numerical solutions of the differential equation which describe the electric field within an inhomogeneous layer of permittivity, upon which a perpendicularly-polarized plane wave is incident, are considered. Richmond's method and the Runge-Kutta method are compared for linear and exponential profiles of permittivities. These two approximate solutions are also compared with the exact solutions.
A Runge-Kutta discontinuous Galerkin approach to solve reactive flows: The hyperbolic operator
Billet, G.; Ryan, J.
2011-02-20
A Runge-Kutta discontinuous Galerkin method to solve the hyperbolic part of reactive Navier-Stokes equations written in conservation form is presented. Complex thermodynamics laws are taken into account. Particular care has been taken to solve the stiff gaseous interfaces correctly with no restrictive hypothesis. 1D and 2D test cases are presented.
A diagonally inverted LU implicit multigrid scheme
NASA Technical Reports Server (NTRS)
Yokota, Jeffrey W.; Caughey, David A.; Chima, Rodrick V.
1988-01-01
A new Diagonally Inverted LU Implicit scheme is developed within the framework of the multigrid method for the 3-D unsteady Euler equations. The matrix systems that are to be inverted in the LU scheme are treated by local diagonalizing transformations that decouple them into systems of scalar equations. Unlike the Diagonalized ADI method, the time accuracy of the LU scheme is not reduced since the diagonalization procedure does not destroy time conservation. Even more importantly, this diagonalization significantly reduces the computational effort required to solve the LU approximation and therefore transforms it into a more efficient method of numerically solving the 3-D Euler equations.
A Runge-Kutta discontinuous finite element method for high speed flows
NASA Technical Reports Server (NTRS)
Bey, Kim S.; Oden, J. T.
1991-01-01
A Runge-Kutta discontinuous finite element method is developed for hyperbolic systems of conservation laws in two space variables. The discontinuous Galerkin spatial approximation to the conservation laws results in a system of ordinary differential equations which are marched in time using Runge-Kutta methods. Numerical results for the two-dimensional Burger's equation show that the method is (p+1)-order accurate in time and space, where p is the degree of the polynomial approximation of the solution within an element and is capable of capturing shocks over a single element without oscillations. Results for this problem also show that the accuracy of the solution in smooth regions is unaffected by the local projection and that the accuracy in smooth regions increases as p increases. Numerical results for the Euler equations show that the method captures shocks without oscillations and with higher resolution than a first-order scheme.
Efficient low-storage Runge-Kutta schemes with optimized stability regions
NASA Astrophysics Data System (ADS)
Niegemann, Jens; Diehl, Richard; Busch, Kurt
2012-01-01
A variety of numerical calculations, especially when considering wave propagation, are based on the method-of-lines, where time-dependent partial differential equations (PDEs) are first discretized in space. For the remaining time-integration, low-storage Runge-Kutta schemes are particularly popular due to their efficiency and their reduced memory requirements. In this work, we present a numerical approach to generate new low-storage Runge-Kutta (LSRK) schemes with optimized stability regions for advection-dominated problems. Adapted to the spectral shape of a given physical problem, those methods are found to yield significant performance improvements over previously known LSRK schemes. As a concrete example, we present time-domain calculations of Maxwell's equations in fully three-dimensional systems, discretized by a discontinuous Galerkin approach.
Galerkin/Runge-Kutta discretizations for parabolic equations with time dependent coefficients
NASA Technical Reports Server (NTRS)
Keeling, Stephen L.
1987-01-01
A new class of fully discrete Galerkin/Runge-Kutta methods is constructed and analyzed for linear parabolic initial boundary value problems with time dependent coefficients. Unlike any classical counterpart, this class offers arbitrarily high order convergence while significantly avoiding what has been called order reduction. In support of this claim, error estimates are proved, and computational results are presented. Additionally, since the time stepping equations involve coefficient matrices changing at each time step, a preconditioned iterative technique is used to solve the linear systems only approximately. Nevertheless, the resulting algorithm is shown to preserve the original convergence rate while using only the order of work required by the base scheme applied to a linear parabolic problem with time independent coefficients. Furthermore, it is noted that special Runge-Kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method.
Fourth-order 2N-storage Runge-Kutta schemes
NASA Technical Reports Server (NTRS)
Carpenter, Mark H.; Kennedy, Christopher A.
1994-01-01
A family of five-stage fourth-order Runge-Kutta schemes is derived; these schemes required only two storage locations. A particular scheme is identified that has desirable efficiency characteristics for hyperbolic and parabolic initial (boundary) value problems. This scheme is competitive with the classical fourth-order method (high-storage) and is considerably more efficient and accurate than existing third-order low-storage schemes.
Optimal Runge-Kutta Schemes for High-order Spatial and Temporal Discretizations
2015-06-01
combinations. The predictive nature of the von Neumann analysis is then validated through the exploration of the convection of acoustic waves in one...through the exploration of the convection of acoustic waves in one dimension and an isentropic vortex in three dimensions. Is is shown that the...are then shown to extend readily to real world flows in the form of a convecting isentropic vortex. Explicit Runge-Kutta time integrators may seem to
A fourth order modified trigonometrically fitted symplectic Runge-Kutta-Nyström method
NASA Astrophysics Data System (ADS)
Kalogiratou, Z.; Monovasilis, Th.; Simos, T. E.
2014-12-01
In this work we construct a modified trigonometrically fitted symplectic Runge Kutta Nyström method based on the fourth order five stages method of Calvo and Sanz-Serna (1994). We apply the new method on the numerical integration of the two-dimensional harmonic oscillator, the two-body problem, a perturbed two-body problem and two two-dimensional nonlinear oscillatory Hamiltonian systems.
Active and passive symmetrization of Runge-Kutta Lobatto IIIA methods
NASA Astrophysics Data System (ADS)
Gorgey, A.; Chan, R. P. K.
2012-09-01
Symmetrization of the Runge-Kutta Gauss methods have been shown to be robust in solving stiff linear and nonlinear initial value ordinary differential equations [4]. The most efficient way of applying symmmetrization was found to be passive symmetrization with passive extrapolation. In this paper we investigate symmetrization of the Lobatto IIIA methods. We show numerically that the same strategy of using passive symmetrization applied with passive extrapolation of the Lobbatto IIIA methods is also most efficient in solving the nonlinear problems tested.
H[alpha]-stability of modified Runge-Kutta methods for nonlinear neutral pantograph equations
NASA Astrophysics Data System (ADS)
Ma, S. F.; Yang, Z. W.; Liu, M. Z.
2007-11-01
In this paper, we investigate H[alpha]-stability of algebraically stable Runge-Kutta methods with a variable stepsize for nonlinear neutral pantograph equations. As a result, the Radau IA, Radau IIA, Lobatto IIIC method, the odd-stage Gauss-Legendre methods and the one-leg [theta]-method with are H[alpha]-stable for nonlinear neutral pantograph equations. Some experiments are given.
High-order implicit time-marching methods for unsteady fluid flow simulation
NASA Astrophysics Data System (ADS)
Boom, Pieter David
Unsteady computational fluid dynamics (CFD) is increasingly becoming a critical tool in the development of emerging technologies and modern aircraft. In spite of rapid mathematical and technological advancement, these simulations remain computationally intensive and time consuming. More efficient temporal integration will promote a wider use of unsteady analysis and extend its range of applicability. This thesis presents an investigation of efficient high-order implicit time-marching methods for application in unsteady compressible CFD. A generalisation of time-marching methods based on summation-by-parts (SBP) operators is described which reduces the number of stages required to obtain a prescribed order of accuracy, thus improving their efficiency. The classical accuracy and stability theory is formally extended for these generalised SBP (GSBP) methods, including superconvergence and nonlinear stability. Dual-consistent SBP and GSBP time-marching methods are shown to form a subclass of implicit Runge-Kutta methods, which enables extensions of nonlinear accuracy and stability results. A novel family of fully-implicit GSBP Runge-Kutta schemes based on Gauss quadrature are derived which are both algebraically stable and L-stable with order 2s - 1, where s is the number of stages. In addition, a numerical tool is developed for the construction and optimisation of general linear time-marching methods. The tool is applied to the development of several low-stage-order L-stable diagonally-implicit methods, including a diagonally-implicit GSBP Runge-Kutta scheme. The most notable and efficient method developed is a six-stage fifth-order L-stable stiffly-accurate explicit-first-stage singly-diagonally-implicit Runge-Kutta (ESDIRK5) method with stage order two. The theoretical results developed in this thesis are supported by numerical simulations, and the predicted relative efficiency of the schemes is realised.
Z, Wang; Q, Wang; Dj, Klinke
2016-09-01
Biological processes such as contagious disease spread patterns and tumor growth dynamics are modelled using a set of coupled differential equations. Experimental data is usually used to calibrate models so they can be used to make future predictions. In this study, numerical methods were implemented to approximate solutions to mathematical models that were not solvable analytically, such as a SARS model. More complex models such as a tumor growth model involve high-dimensional parameter spaces; efficient numerical simulation techniques were used to search for optimal or close-to-optimal parameter values in the equations. Runge-Kutta methods are a group of explicit and implicit numerical methods that effectively solve the ordinary differential equations in these models. Effects of the order and the step size of Runge-Kutta methods were studied in order to maximize the search accuracy and efficiency in parameter spaces of the models. Numerical simulation results showed that an order of four gave the best balance between truncation errors and the simulation speed for SIR, SARS, and tumormodels studied in the project. The optimal step size for differential equation solvers was found to be model-dependent.
a New Methodology for the Construction of Optimized RUNGE-KUTTA-NYSTRÖM Methods
NASA Astrophysics Data System (ADS)
Papadopoulos, D. F.; Simos, T. E.
In this paper, a new Runge-Kutta-Nyström method of fourth algebraic order is developed. The new method has zero phase-lag, zero amplification error and zero first integrals of the previous properties. Numerical results indicate that the new method is very efficient for solving numerically the Schrödinger equation. We note that for the first time in the literature we use the requirement of vanishing the first integrals of phase-lag and amplification error in the construction of efficient methods for the numerical solution of the Schrödinger equation.
NASA Astrophysics Data System (ADS)
Wang, Dongling; Xiao, Aiguo; Li, Xueyang
2013-02-01
Based on W-transformation, some parametric symplectic partitioned Runge-Kutta (PRK) methods depending on a real parameter α are developed. For α=0, the corresponding methods become the usual PRK methods, including Radau IA-IA¯ and Lobatto IIIA-IIIB methods as examples. For any α≠0, the corresponding methods are symplectic and there exists a value α∗ such that energy is preserved in the numerical solution at each step. The existence of the parameter and the order of the numerical methods are discussed. Some numerical examples are presented to illustrate these results.
NASA Astrophysics Data System (ADS)
Huang, Yong; Shi, Guo-Dong; Zhu, Ke-Yong
2016-06-01
This paper adopts the Runge-Kutta ray tracing method to obtain the ray-trajectory numerical solution in a two-dimensional gradient index medium. The emitting, absorbing and scattering processes are simulated by the Monte Carlo method. The temperature field and ray trajectory in the medium are obtained by the three methods, the Runge-Kutta ray tracing method, the ray tracing method with the cell model and the discrete curved ray tracing method with the linear refractive index cell model. Comparing the results of the three methods, it is found that the results by the Monte Carlo Runge-Kutta ray tracing method are of the highest accuracy. To improve the computational speed, the variable step-size Runge-Kutta ray tracing method is proposed, and the maximum relative error between the temperature field in the nonscattering medium by this method and the benchmark solution is less than 0.5%. The results also suggest that the Runge-Kutta ray tracing method would make the radiative transfer solution in the three-dimensional graded index media much easier.
NASA Technical Reports Server (NTRS)
Lear, W. M.
1974-01-01
The integration is discussed of the vector differential equation X = F(x, t) from time t sub i to t sub (i = 1) where only the values of x sub i are available for the the integration. No previous values of x or x prime are used. Using an orbit integration problem, comparisons are made between Taylor series integrators and various types and orders of Runge-Kutta integrators. A fourth order Runge-Kutta type integrator for orbital work is presented, and approximate (there may be no exact) fifth order Runge-Kutta integrators are discussed. Also discussed and compared is a self starting integrator ising delta f/delta x. A numerical method for controlling the accuracy of integration is given, and the special equations for accurately integrating accelerometer data are shown.
Global error estimation based on the tolerance proportionality for some adaptive Runge-Kutta codes
NASA Astrophysics Data System (ADS)
Calvo, M.; González-Pinto, S.; Montijano, J. I.
2008-09-01
Modern codes for the numerical solution of Initial Value Problems (IVPs) in ODEs are based in adaptive methods that, for a user supplied tolerance [delta], attempt to advance the integration selecting the size of each step so that some measure of the local error is [similar, equals][delta]. Although this policy does not ensure that the global errors are under the prescribed tolerance, after the early studies of Stetter [Considerations concerning a theory for ODE-solvers, in: R. Burlisch, R.D. Grigorieff, J. Schröder (Eds.), Numerical Treatment of Differential Equations, Proceedings of Oberwolfach, 1976, Lecture Notes in Mathematics, vol. 631, Springer, Berlin, 1978, pp. 188-200; Tolerance proportionality in ODE codes, in: R. März (Ed.), Proceedings of the Second Conference on Numerical Treatment of Ordinary Differential Equations, Humbold University, Berlin, 1980, pp. 109-123] and the extensions of Higham [Global error versus tolerance for explicit Runge-Kutta methods, IMA J. Numer. Anal. 11 (1991) 457-480; The tolerance proportionality of adaptive ODE solvers, J. Comput. Appl. Math. 45 (1993) 227-236; The reliability of standard local error control algorithms for initial value ordinary differential equations, in: Proceedings: The Quality of Numerical Software: Assessment and Enhancement, IFIP Series, Springer, Berlin, 1997], it has been proved that in many existing explicit Runge-Kutta codes the global errors behave asymptotically as some rational power of [delta]. This step-size policy, for a given IVP, determines at each grid point tn a new step-size hn+1=h(tn;[delta]) so that h(t;[delta]) is a continuous function of t. In this paper a study of the tolerance proportionality property under a discontinuous step-size policy that does not allow to change the size of the step if the step-size ratio between two consecutive steps is close to unity is carried out. This theory is applied to obtain global error estimations in a few problems that have been solved with
NASA Technical Reports Server (NTRS)
Cannizzaro, Frank E.; Ash, Robert L.
1992-01-01
A state-of-the-art computer code has been developed that incorporates a modified Runge-Kutta time integration scheme, upwind numerical techniques, multigrid acceleration, and multi-block capabilities (RUMM). A three-dimensional thin-layer formulation of the Navier-Stokes equations is employed. For turbulent flow cases, the Baldwin-Lomax algebraic turbulence model is used. Two different upwind techniques are available: van Leer's flux-vector splitting and Roe's flux-difference splitting. Full approximation multi-grid plus implicit residual and corrector smoothing were implemented to enhance the rate of convergence. Multi-block capabilities were developed to provide geometric flexibility. This feature allows the developed computer code to accommodate any grid topology or grid configuration with multiple topologies. The results shown in this dissertation were chosen to validate the computer code and display its geometric flexibility, which is provided by the multi-block structure.
A computer program for determining truncation error coefficients for Runge-Kutta methods
NASA Technical Reports Server (NTRS)
Horn, M. K.
1980-01-01
The basic structure of a program to generate the truncation error coefficients for Runge-Kutta (RK) methods is reformulated to reduce storage requirements significantly and to accommodate variable dimensioning. This FORTRAN program, SUBROUTINE RKEQ, determines truncation error coefficients for RK algorithms for orders 1 through 10 and extends the order of coefficients through 12 with the 11th- and 12th-order terms determined following the patterns used to establish the lower order coefficients. Both subroutines (the original and RKEQ) are also written to treat RK m-fold methods which utilize m known derivatives of f to increase the order of the algorithm. Setting m = 0 gives the classical RK algorithm.
An explicit Runge-Kutta method for unsteady rotor/stator interaction
NASA Technical Reports Server (NTRS)
Jorgenson, Philip C. E.; Chima, Rodrick V.
1988-01-01
A quasi-three-dimensional rotor/stator analysis has been developed for blade-to-blade flows in turbomachinery. The analysis solves the unsteady Euler or thin-layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stream-surface thickness. The Baldwin-Lomax eddy-viscosity model is used for turbulent flows. The equations are integrated in time using a four-stage Runge-Kutta scheme with a constant timestep. Results are shown for the first stage of the Space Shuttle Main Engine high pressure fuel turbopump. Euler and Navier-Stokes results are compared on the scaled single- and multi-passage machine. The method is relatively fast and the quasi-three-dimensional formulation is applicable to a wide range of turbomachinery geometries.
A Generalized 4th-Order Runge-Kutta Method for the Gross-Pitaevskii Equation
NASA Astrophysics Data System (ADS)
Kandes, Martin
2015-04-01
We present the implementation of a method-of-lines approach for numerically approximating solutions of the time-dependent Gross-Pitaevksii equation in non-uniformly rotating reference frames. Implemented in parallel using a hybrid MPI + OpenMP framework, which will allow for scalable, high-resolution numerical simulations, we utilize an explicit, generalized 4th-order Runge-Kutta time-integration scheme with 2nd- and 4th-order central differences to approximate the spatial derivatives in the equation. The principal objective of this project is to model the effect(s) of inertial forces on quantized vortices within weakly-interacting dilute atomic gas Bose-Einstein condensates in the mean-field limit of the Gross-Pitaevskii equation. Here, we discuss our work-to-date and preliminary results.
GPU acceleration of Runge Kutta-Fehlberg and its comparison with Dormand-Prince method
NASA Astrophysics Data System (ADS)
Seen, Wo Mei; Gobithaasan, R. U.; Miura, Kenjiro T.
2014-07-01
There is a significant reduction of processing time and speedup of performance in computer graphics with the emergence of Graphic Processing Units (GPUs). GPUs have been developed to surpass Central Processing Unit (CPU) in terms of performance and processing speed. This evolution has opened up a new area in computing and researches where highly parallel GPU has been used for non-graphical algorithms. Physical or phenomenal simulations and modelling can be accelerated through General Purpose Graphic Processing Units (GPGPU) and Compute Unified Device Architecture (CUDA) implementations. These phenomena can be represented with mathematical models in the form of Ordinary Differential Equations (ODEs) which encompasses the gist of change rate between independent and dependent variables. ODEs are numerically integrated over time in order to simulate these behaviours. The classical Runge-Kutta (RK) scheme is the common method used to numerically solve ODEs. The Runge Kutta Fehlberg (RKF) scheme has been specially developed to provide an estimate of the principal local truncation error at each step, known as embedding estimate technique. This paper delves into the implementation of RKF scheme for GPU devices and compares its result with Dorman Prince method. A pseudo code is developed to show the implementation in detail. Hence, practitioners will be able to understand the data allocation in GPU, formation of RKF kernels and the flow of data to/from GPU-CPU upon RKF kernel evaluation. The pseudo code is then written in C Language and two ODE models are executed to show the achievable speedup as compared to CPU implementation. The accuracy and efficiency of the proposed implementation method is discussed in the final section of this paper.
NASA Astrophysics Data System (ADS)
Meyer, Chad D.; Balsara, Dinshaw S.; Aslam, Tariq D.
2014-01-01
Parabolic partial differential equations appear in several physical problems, including problems that have a dominant hyperbolic part coupled to a sub-dominant parabolic component. Explicit methods for their solution are easy to implement but have very restrictive time step constraints. Implicit solution methods can be unconditionally stable but have the disadvantage of being computationally costly or difficult to implement. Super-time-stepping methods for treating parabolic terms in mixed type partial differential equations occupy an intermediate position. In such methods each superstep takes “s” explicit Runge-Kutta-like time-steps to advance the parabolic terms by a time-step that is s2 times larger than a single explicit time-step. The expanded stability is usually obtained by mapping the short recursion relation of the explicit Runge-Kutta scheme to the recursion relation of some well-known, stable polynomial. Prior work has built temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Chebyshev polynomials. Since their stability is based on the boundedness of the Chebyshev polynomials, these methods have been called RKC1 and RKC2. In this work we build temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Legendre polynomials. We call these methods RKL1 and RKL2. The RKL1 method is first-order accurate in time; the RKL2 method is second-order accurate in time. We verify that the newly-designed RKL1 and RKL2 schemes have a very desirable monotonicity preserving property for one-dimensional problems - a solution that is monotone at the beginning of a time step retains that property at the end of that time step. It is shown that RKL1 and RKL2 methods are stable for all values of the diffusion coefficient up to the maximum value. We call this a convex monotonicity preserving property and show by examples that it is very useful in
Low-Storage, Explicit Runge-Kutta Schemes for the Compressible Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
Kennedy, Chistopher A.; Carpenter, Mark H.; Lewis, R. Michael
1999-01-01
The derivation of storage explicit Runge-Kutta (ERK) schemes has been performed in the context of integrating the compressible Navier-Stokes equations via direct numerical simulation. Optimization of ERK methods is done across the broad range of properties, such as stability and accuracy efficiency, linear and nonlinear stability, error control reliability, step change stability, and dissipation/dispersion accuracy, subject to varying degrees of memory economization. Following van der Houwen and Wray, 16 ERK pairs are presented using from two to five registers of memory per equation, per grid point and having accuracies from third- to fifth-order. Methods have been assessed using the differential equation testing code DETEST, and with the 1D wave equation. Two of the methods have been applied to the DNS of a compressible jet as well as methane-air and hydrogen-air flames. Derived 3(2) and 4(3) pairs are competitive with existing full-storage methods. Although a substantial efficiency penalty accompanies use of two- and three-register, fifth-order methods, the best contemporary full-storage methods can be pearl), matched while still saving two to three registers of memory.
Runge-Kutta central discontinuous Galerkin BGK method for the Navier-Stokes equations
NASA Astrophysics Data System (ADS)
Ren, Tan; Hu, Jun; Xiong, Tao; Qiu, Jing-Mei
2014-10-01
In this paper, we propose a Runge-Kutta (RK) central discontinuous Galerkin (CDG) gas-kinetic BGK method for the Navier-Stokes equations. The proposed method is based on the CDG method defined on two sets of overlapping meshes to avoid discontinuous solutions at cell interfaces, as well as the gas-kinetic BGK model to evaluate fluxes for both convection and diffusion terms. Redundant representation of the numerical solution in the CDG method offers great convenience in the design of gas-kinetic BGK fluxes. Specifically, the evaluation of fluxes at cell interfaces of one set of computational mesh is right inside the cells of the staggered mesh, hence the corresponding particle distribution function for flux evaluation is much simpler than that in existing gas-kinetic BGK methods. As a central scheme, the proposed CDG-BGK has doubled the memory requirement as the corresponding DG scheme; on the other hand, for the convection part, the CFL time step constraint of the CDG method for numerical stability is relatively large compared with that for the DG method. Numerical boundary conditions have to be treated with special care. Numerical examples for 1D and 2D viscous flow simulations are presented to validate the accuracy and robustness of the proposed RK CDG-BGK method.
Exponential Runge-Kutta integrators for modelling Predator-Prey interactions
NASA Astrophysics Data System (ADS)
Diele, F.; Marangi, C.; Ragni, S.
2012-09-01
Spatially explicit models consisting of reaction-diffusion partial differential equations are considered in order to model prey-predator interactions, since it is known that the role of spatial processes reveals of great interest in the study of the effects of habitat fragmentation on biodiversity. As almost all of the realistic models in biology, these models are nonlinear and their solution is not known in closed form. Our aim is approximating the solution itself by means of exponential Runge-Kutta integrators. Moreover, we apply the shift-and-invert Krylov approach in order to evaluate the entire functions needed for implementing the exponential method. This numerical procedure reveals to be very eff cient in avoiding numerical instability during the simulation, since it allows us to adopt high order in the accuracy. This work has received funding from the European Union's Seventh Framework Programme FP7/2007-2013, SPA.2010.1.1-04: "Stimulating the development of GMES services in specif c are", under grant agreement 263435, project title: Biodiversity Multi-Source Monitoring System:from Space To Species (BIOSOS) coordinated by CNR-ISSIA, Bari-Italy (http://www.biosos.eu).
The design and applications of Runge-Kutta methods for the simulation of planetary orbits
NASA Astrophysics Data System (ADS)
Rabbi, S. M. Fajlay
Since the merger of physics and mathematics at the beginning of 1800s, system of finding solution to n-body problem has been intriguing mathematicians. The resulting differential equations can be solved by a variety of approaches -- for example, the Runge-Kutta Methods (RKn). In this thesis, after a brief historical overview of planetary science, RK3 methods are derived as a three-parameter family of solution methods. A particular instance of this family, FR3, is generated and subsequently tested to show it is indeed a third-order method. The planetary system is modeled as a system of differential of equations using laws of classical mechanics, and the models of planetary motions are generated applying RK4 methods. Kepler's laws of planetary motion are proved empirically using observed data taken from NASA. A new way of expressing Kepler's third law is presented: the orbital velocity of a planet decreases as inverse square root of its orbital radius. Simulation of Sun-Earth-Moon as well as solar system is conducted and compared to that of Dahir's and found is a very similar result. Also, the result of the entire solar system simulation closely matches to that of NASA. Initial position-velocity vectors are generated from NASA-JPL's ephemeris data using post-processing codes obtained from the University of Colorado.
Projected implicit Runge-Kutta methods for differential-algebraic boundary value problems
Ascher, U. ); Petzoid, L. )
1990-09-01
Differential-algebraic boundary value problems arise in the modelling of singular optimal control problems and in parameter estimation for singular systems. A new class of numerical methods for these problems is introduced, and shown to overcome difficulties with previously defined numerical methods. 4 refs., 1 tab.
NASA Astrophysics Data System (ADS)
Langer, Stefan
2013-03-01
For unstructured finite volume methods, we present a line implicit Runge-Kutta method applied as smoother in an agglomerated multigrid algorithm to significantly improve the reliability and convergence rate to approximate steady-state solutions of the Reynolds-averaged Navier-Stokes equations. To describe turbulence, we consider a one-equation Spalart-Allmaras turbulence model. The line implicit Runge-Kutta method extends a basic explicit Runge-Kutta method by a preconditioner given by an approximate derivative of the residual function. The approximate derivative is only constructed along predetermined lines which resolve anisotropies in the given grid. Therefore, the method is a canonical generalisation of point implicit methods. Numerical examples demonstrate the improvements of the line implicit Runge-Kutta when compared with explicit Runge-Kutta methods accelerated with local time stepping.
Runge-Kutta methods combined with compact difference schemes for the unsteady Euler equations
NASA Technical Reports Server (NTRS)
Yu, Sheng-Tao
1992-01-01
Recent development using compact difference schemes to solve the Navier-Stokes equations show spectral-like accuracy. A study was made of the numerical characteristics of various combinations of the Runge-Kutta (RK) methods and compact difference schemes to calculate the unsteady Euler equations. The accuracy of finite difference schemes is assessed based on the evaluations of dissipative error. The objectives are reducing the numerical damping and, at the same time, preserving numerical stability. While this approach has tremendous success solving steady flows, numerical characteristics of unsteady calculations remain largely unclear. For unsteady flows, in addition to the dissipative errors, phase velocity and harmonic content of the numerical results are of concern. As a result of the discretization procedure, the simulated unsteady flow motions actually propagate in a dispersive numerical medium. Consequently, the dispersion characteristics of the numerical schemes which relate the phase velocity and wave number may greatly impact the numerical accuracy. The aim is to assess the numerical accuracy of the simulated results. To this end, the Fourier analysis is to provide the dispersive correlations of various numerical schemes. First, a detailed investigation of the existing RK methods is carried out. A generalized form of an N-step RK method is derived. With this generalized form, the criteria are derived for the three and four-step RK methods to be third and fourth-order time accurate for the non-linear equations, e.g., flow equations. These criteria are then applied to commonly used RK methods such as Jameson's 3-step and 4-step schemes and Wray's algorithm to identify the accuracy of the methods. For the spatial discretization, compact difference schemes are presented. The schemes are formulated in the operator-type to render themselves suitable for the Fourier analyses. The performance of the numerical methods is shown by numerical examples. These examples
Zhang, Zhongxi; Chen, Liang; Bao, Xiaoyi
2010-04-12
A fourth-order Runge-Kutta in the interaction picture (RK4IP) method is presented for solving the coupled nonlinear Schr odinger equation (CNLSE) that governs the light propagation in optical fibers with randomly varying birefringence. The computational error of RK4IP is caused by the fourth-order Runge-Kutta algorithm, better than the split-step approximation limited by the step size. As a result, the step size of RK4IP can have the same order of magnitude as the dispersion length and/or the nonlinear length of the fiber, provided the birefringence effect is small. For communication fibers with random birefringence, the step size of RK4IP can be orders of magnitude larger than the correlation length and the beating length of the fibers, depending on the interaction between linear and nonlinear effects. Our approach can be applied to the fibers having the general form of local birefringence and treat the Kerr nonlinearity without approximation. Our RK4IP results agree well with those obtained from Manakov-PMD approximation, provided the polarization state can be mixed enough on the Poincar e sphere.
NASA Technical Reports Server (NTRS)
Shih, C. C.
1973-01-01
A theoretical investigation of gas flow inside a multilayer insulation system has been made for the case of the broadside pumping process. A set of simultaneous first-order differential equations for the temperature and pressure of the gas mixture was obtained by considering the diffusion mechanism of the gas molecules through the perforations on the insulation layers. A modified Runge-Kutta method was used for numerical experiment. The numerical stability problem was investigated. It has been shown that when the relaxation time is small compared with the time period over which the gas properties change appreciably, the set of differential equations can be replaced by a set of algebraic equations for solution. Numerical examples were given, and comparisons with experimental data were made.
Two-Dimensional Inlet Simulation Using a Diagonal Implicit Algorithm
NASA Technical Reports Server (NTRS)
Chaussee, D.S.; Pulliam, T. H.
1981-01-01
A modification of an implicit approximate-factorization finite-difference algorithm applied to the two-dimensional Euler and Navier-Stokes equations in general curvilinear coordinates is presented for supersonic freestream flow about and through inlets. The modification transforms the coupled system of equations Into an uncoupled diagonal form which requires less computation work. For steady-state applications the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. Solutions are given for inviscid and laminar flow about a two-dimensional wedge inlet configuration. Comparisons are made between computed results and exact theory.
Xu, Zhiliang; Chen, Xu-Yan; Liu, Yingjie
2014-01-01
We present a new formulation of the Runge-Kutta discontinuous Galerkin (RKDG) method [9, 8, 7, 6] for solving conservation Laws with increased CFL numbers. The new formulation requires the computed RKDG solution in a cell to satisfy additional conservation constraint in adjacent cells and does not increase the complexity or change the compactness of the RKDG method. Numerical computations for solving one-dimensional and two-dimensional scalar and systems of nonlinear hyperbolic conservation laws are performed with approximate solutions represented by piecewise quadratic and cubic polynomials, respectively. The hierarchical reconstruction [17, 33] is applied as a limiter to eliminate spurious oscillations in discontinuous solutions. From both numerical experiments and the analytic estimate of the CFL number of the newly formulated method, we find that: 1) this new formulation improves the CFL number over the original RKDG formulation by at least three times or more and thus reduces the overall computational cost; and 2) the new formulation essentially does not compromise the resolution of the numerical solutions of shock wave problems compared with ones computed by the RKDG method. PMID:25414520
Xu, Zhiliang; Chen, Xu-Yan; Liu, Yingjie
2014-12-01
We present a new formulation of the Runge-Kutta discontinuous Galerkin (RKDG) method [9, 8, 7, 6] for solving conservation Laws with increased CFL numbers. The new formulation requires the computed RKDG solution in a cell to satisfy additional conservation constraint in adjacent cells and does not increase the complexity or change the compactness of the RKDG method. Numerical computations for solving one-dimensional and two-dimensional scalar and systems of nonlinear hyperbolic conservation laws are performed with approximate solutions represented by piecewise quadratic and cubic polynomials, respectively. The hierarchical reconstruction [17, 33] is applied as a limiter to eliminate spurious oscillations in discontinuous solutions. From both numerical experiments and the analytic estimate of the CFL number of the newly formulated method, we find that: 1) this new formulation improves the CFL number over the original RKDG formulation by at least three times or more and thus reduces the overall computational cost; and 2) the new formulation essentially does not compromise the resolution of the numerical solutions of shock wave problems compared with ones computed by the RKDG method.
NASA Astrophysics Data System (ADS)
Ma, Xiao; Yang, Dinghui
2017-03-01
The finite-difference method, which is an important numerical tool for solving seismic wave equations, is widely applied in wavefield simulation, wave-equation-based migration and inversion. As the seismic wave phase plays a critical role in forward simulation and inversion, it should be preserved during wavefield simulation. In this paper, we propose a type of phase-preserving stereomodelling method, which is simultaneously symplectic and low numerical dispersive. First, we propose three new time-marching schemes for solving wave equations that are optimal symplectic partitioned Runge-Kutta schemes with minimized phase errors. Relevant simulations on a harmonic oscillator show that even after 200,000 temporal iterations, our schemes can still avoid the phase drifting issue that appears in other symplectic schemes. We use these symplectic schemes as time integrators, and a numerically low dispersive operator called the stereomodelling discrete operator as a spatial discretization approach to solve seismic wave equations. Theoretical analysis on the stability conditions shows that the new methods are more stable than previous methods. We also investigate the numerical dispersion relations of the methods proposed in this study. To further investigate phase accuracy, we compare the numerical solutions generated by the proposed methods with analytic solutions. Several numerical experiments indicate that our proposed methods are efficient for various models and perform well with perfectly matched layer boundary conditions.
NASA Astrophysics Data System (ADS)
Zhang, Chao-Yuan; Ma, Xiao; Yang, Lei; Song, Guo-Jie
2014-03-01
We propose a symplectic partitioned Runge-Kutta (SPRK) method with eighth-order spatial accuracy based on the extended Hamiltonian system of the acoustic wave equation. Known as the eighth-order NSPRK method, this technique uses an eighth-order accurate nearly analytic discrete (NAD) operator to discretize high-order spatial differential operators and employs a second-order SPRK method to discretize temporal derivatives. The stability criteria and numerical dispersion relations of the eighth-order NSPRK method are given by a semi-analytical method and are tested by numerical experiments. We also show the differences of the numerical dispersions between the eighth-order NSPRK method and conventional numerical methods such as the fourth-order NSPRK method, the eighth-order Lax-Wendroff correction (LWC) method and the eighth-order staggered-grid (SG) method. The result shows that the ability of the eighth-order NSPRK method to suppress the numerical dispersion is obviously superior to that of the conventional numerical methods. In the same computational environment, to eliminate visible numerical dispersions, the eighth-order NSPRK is approximately 2.5 times faster than the fourth-order NSPRK and 3.4 times faster than the fourth-order SPRK, and the memory requirement is only approximately 47.17% of the fourth-order NSPRK method and 49.41 % of the fourth-order SPRK method, which indicates the highest computational efficiency. Modeling examples for the two-layer models such as the heterogeneous and Marmousi models show that the wavefields generated by the eighth-order NSPRK method are very clear with no visible numerical dispersion. These numerical experiments illustrate that the eighth-order NSPRK method can effectively suppress numerical dispersion when coarse grids are adopted. Therefore, this method can greatly decrease computer memory requirement and accelerate the forward modeling productivity. In general, the eighth-order NSPRK method has tremendous potential
NASA Astrophysics Data System (ADS)
Mabssout, M.; Pastor, M.; Herreros, M. I.; Quecedo, M.
2006-11-01
This paper presents an alternative formulation of Solid Dynamics problems based on (i) a mathematical model consisting of a system of hyperbolic PDEs where the source term is originated by the viscoplastic strain rate and (ii) a splitting scheme where the two-step Taylor-Galerkin is used for the advective part of the PDE operator while the sources are integrated using a fourth-order Runge-Kutta. Use of the splitting scheme results in a higher accuracy than that of the original two-step Taylor-Galerkin. The scheme performs well when used with linear triangle or tetrahedra for (i) bending-dominated situations (ii) localized failure under dynamic conditions and keeps the advantages of the two-step Taylor-Galerkin concerning numerical dispersion and damping of short wavelengths. Copyright
NASA Astrophysics Data System (ADS)
Franco, J. M.; Gómez, I.
2013-04-01
The construction of high-order exponentially fitted Runge-Kutta-Nyström (EFRKN) methods of explicit type for the numerical solution of oscillatory differential systems is analyzed. Based on two basic symmetric and symplectic EFRKN methods of reference we present two procedures for constructing high-order explicit methods. The first procedure is based on composition methods and it allows the construction of high-order explicit EFRKN methods which are symmetric and symplectic. The second procedure is based on combining different EFRKN methods in order to construct embedded pairs of explicit parallel EFRKN methods which can be implemented in variable-step codes without additional cost. The numerical experiments carried out show the qualitative behavior and the efficiency of the new EFRKN methods when they are compared with some standard methods proposed in the scientific literature for solving second-order nonstiff differential systems. Catalogue identifier: AEOO_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOO_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: GNU General Public License No. of lines in distributed program, including test data, etc.: 2527 No. of bytes in distributed program, including test data, etc.: 107433 Distribution format: tar.gz Programming language: Fortran 77. Computer: Standard PC. Operating system: Windows. It might work with others. Successfully tested by CPC on Linux. RAM: For the test problems used less than 1 MB. Classification: 4.3, 4.12, 16.3, 17.17. Nature of problem: Some models in astronomy and astrophysics, quantum mechanics and nuclear physics lead to second-order oscillatory differential systems. The solution of these oscillatory models requires accurate and efficient numerical methods. The codes SVI-IIEXPOreferee.for and SVI-IIvarreferee.for were developed for this purpose. Solution method: We propose high-order exponentially fitted Runge-Kutta
NASA Technical Reports Server (NTRS)
Carpenter, Mark H.; Gottlieb, David; Abarbanel, Saul; Don, Wai-Sun
1993-01-01
The conventional method of imposing time dependent boundary conditions for Runge-Kutta (RK) time advancement reduces the formal accuracy of the space-time method to first order locally, and second order globally, independently of the spatial operator. This counter intuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case: (1) impose the exact boundary condition only at the end of the complete RK cycle, (2) impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the RK accuracy in all cases, results in a scheme with much reduced CFL condition, rendering the RK scheme less attractive. The second method retains the same allowable time step as the periodic problem. However it is a general remedy only for the linear case. For non-linear hyperbolic equations the second method is effective only for for RK schemes of third order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.
A diagonal implicit scheme for computing flows with finite-rate chemistry
NASA Technical Reports Server (NTRS)
Eberhardt, Scott; Imlay, Scott
1990-01-01
A new algorithm for solving steady, finite-rate chemistry, flow problems is presented. The new scheme eliminates the expense of inverting large block matrices that arise when species conservation equations are introduced. The source Jacobian matrix is replaced by a diagonal matrix which is tailored to account for the fastest reactions in the chemical system. A point-implicit procedure is discussed and then the algorithm is included into the LU-SGS scheme. Solutions are presented for hypervelocity reentry and Hydrogen-Oxygen combustion. For the LU-SGS scheme a CFL number in excess of 10,000 has been achieved.
NASA Technical Reports Server (NTRS)
Swanson, R. C.; Rossow, C.-C.
2008-01-01
A three-stage Runge-Kutta (RK) scheme with multigrid and an implicit preconditioner has been shown to be an effective solver for the fluid dynamic equations. This scheme has been applied to both the compressible and essentially incompressible Reynolds-averaged Navier-Stokes (RANS) equations using the algebraic turbulence model of Baldwin and Lomax (BL). In this paper we focus on the convergence of the RK/implicit scheme when the effects of turbulence are represented by either the Spalart-Allmaras model or the Wilcox k-! model, which are frequently used models in practical fluid dynamic applications. Convergence behavior of the scheme with these turbulence models and the BL model are directly compared. For this initial investigation we solve the flow equations and the partial differential equations of the turbulence models indirectly coupled. With this approach we examine the convergence behavior of each system. Both point and line symmetric Gauss-Seidel are considered for approximating the inverse of the implicit operator of the flow solver. To solve the turbulence equations we use a diagonally dominant alternating direction implicit (DDADI) scheme. Computational results are presented for three airfoil flow cases and comparisons are made with experimental data. We demonstrate that the two-dimensional RANS equations and transport-type equations for turbulence modeling can be efficiently solved with an indirectly coupled algorithm that uses the RK/implicit scheme for the flow equations.
NASA Astrophysics Data System (ADS)
Im, Dong-Kyun; Choi, Seongim; Hyuck Kwon, Jang
2015-01-01
The diagonally implicit harmonic balance method is developed in an overset mesh topology and applied to unsteady rotor flows analysis. Its efficiency is by reducing the complexity of a fully implicit harmonic balance method which becomes more flexible in handling the higher harmonics of the flow solutions. Applied to the overset mesh topology, the efficiency of the method becomes greater by reducing the number of solution interpolations required during the entire solution procedure as the method reduces the unsteady computation into periodic steady state. To verify the accuracy and efficiency of the method, both hovering and unsteady forward flight of Caradonna and Tung and AH-1G rotors are solved. Compared with wind-tunnel experiments, the numerical results demonstrate good agreements at computational cost an order of magnitude more efficient than the conventional time-accurate computation method. The proposed method has great potential in other engineering applications, including flapping wing vehicles, turbo-machinery, wind-turbines, etc.
Asgharzadeh, Hafez; Borazjani, Iman
2017-02-15
The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for nonlinear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the
NASA Astrophysics Data System (ADS)
Asgharzadeh, Hafez; Borazjani, Iman
2017-02-01
The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for non-linear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form a preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the
NASA Astrophysics Data System (ADS)
Cinnella, P.; Content, C.
2016-12-01
Restrictions on the maximum allowable time step of explicit time integration methods for direct and large eddy simulations of compressible turbulent flows at high Reynolds numbers can be very severe, because of the extremely small space steps used close to solid walls to capture tiny and elongated boundary layer structures. A way of increasing stability limits is to use implicit time integration schemes. However, the price to pay is a higher computational cost per time step, higher discretization errors and lower parallel scalability. In quest for an implicit time scheme for scale-resolving simulations providing the best possible compromise between these opposite requirements, we develop a Runge-Kutta implicit residual smoothing (IRS) scheme of fourth-order accuracy, based on a bilaplacian operator. The implicit operator involves the inversion of scalar pentadiagonal systems, for which efficient parallel algorithms are available. The proposed method is assessed against two explicit and two implicit time integration techniques in terms of computational cost required to achieve a threshold level of accuracy. Precisely, the proposed time scheme is compared to four-stages and six-stages low-storage Runge-Kutta method, to the second-order IRS and to a second-order backward scheme solved by means of matrix-free quasi-exact Newton subiterations. Numerical results show that the proposed IRS scheme leads to reductions in computational time by a factor 3 to 5 for an accuracy comparable to that of the corresponding explicit Runge-Kutta scheme.
Acceleration on stretched meshes with line-implicit LU-SGS in parallel implementation
NASA Astrophysics Data System (ADS)
Otero, Evelyn; Eliasson, Peter
2015-02-01
The implicit lower-upper symmetric Gauss-Seidel (LU-SGS) solver is combined with the line-implicit technique to improve convergence on the very anisotropic grids necessary for resolving the boundary layers. The computational fluid dynamics code used is Edge, a Navier-Stokes flow solver for unstructured grids based on a dual grid and edge-based formulation. Multigrid acceleration is applied with the intention to accelerate the convergence to steady state. LU-SGS works in parallel and gives better linear scaling with respect to the number of processors, than the explicit scheme. The ordering techniques investigated have shown that node numbering does influence the convergence and that the orderings from Delaunay and advancing front generation were among the best tested. 2D Reynolds-averaged Navier-Stokes computations have clearly shown the strong efficiency of our novel approach line-implicit LU-SGS which is four times faster than implicit LU-SGS and line-implicit Runge-Kutta. Implicit LU-SGS for Euler and line-implicit LU-SGS for Reynolds-averaged Navier-Stokes are at least twice faster than explicit and line-implicit Runge-Kutta, respectively, for 2D and 3D cases. For 3D Reynolds-averaged Navier-Stokes, multigrid did not accelerate the convergence and therefore may not be needed.
A fifth order implicit method for the numerical solution of differential-algebraic equations
NASA Astrophysics Data System (ADS)
Skvortsov, L. M.
2015-06-01
An implicit two-step Runge-Kutta method of fifth order is proposed for the numerical solution of differential and differential-algebraic equations. The location of nodes in this method makes it possible to estimate the values of higher derivatives at the initial and terminal points of an integration step. Consequently, the proposed method can be regarded as a finite-difference analog of the Obrechkoff method. Numerical results, some of which are presented in this paper, show that our method preserves its order while solving stiff equations and equations of indices two and three. This is the main advantage of the proposed method as compared with the available ones.
Semi-implicit spectral deferred correction methods for ordinary differential equations
Minion, Michael L.
2002-10-06
A semi-implicit formulation of the method of spectral deferred corrections (SISDC) for ordinary differential equations with both stiff and non-stiff terms is presented. Several modifications and variations to the original spectral deferred corrections method by Dutt, Greengard, and Rokhlin concerning the choice of integration points and the form of the correction iteration are presented. The stability and accuracy of the resulting ODE methods are explored analytically and numerically. The SISDC methods are intended to be combined with the method of lines approach to yield a flexible framework for creating higher-order semi-implicit methods for partial differential equations. A discussion and numerical examples of the SISDC method applied to advection-diffusion type equations are included. The results suggest that higher-order SISDC methods are more efficient than semi-implicit Runge-Kutta methods for moderately stiff problems in terms of accuracy per function evaluation.
Global Asymptotic Behavior of Iterative Implicit Schemes
NASA Technical Reports Server (NTRS)
Yee, H. C.; Sweby, P. K.
1994-01-01
The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.
Implicit integration methods for dislocation dynamics
NASA Astrophysics Data System (ADS)
Gardner, D. J.; Woodward, C. S.; Reynolds, D. R.; Hommes, G.; Aubry, S.; Arsenlis, A.
2015-03-01
In dislocation dynamics simulations, strain hardening simulations require integrating stiff systems of ordinary differential equations in time with expensive force calculations, discontinuous topological events and rapidly changing problem size. Current solvers in use often result in small time steps and long simulation times. Faster solvers may help dislocation dynamics simulations accumulate plastic strains at strain rates comparable to experimental observations. This paper investigates the viability of high-order implicit time integrators and robust nonlinear solvers to reduce simulation run times while maintaining the accuracy of the computed solution. In particular, implicit Runge-Kutta time integrators are explored as a way of providing greater accuracy over a larger time step than is typically done with the standard second-order trapezoidal method. In addition, both accelerated fixed point and Newton's method are investigated to provide fast and effective solves for the nonlinear systems that must be resolved within each time step. Results show that integrators of third order are the most effective, while accelerated fixed point and Newton's method both improve solver performance over the standard fixed point method used for the solution of the nonlinear systems.
Implicit integration methods for dislocation dynamics
Gardner, D. J.; Woodward, C. S.; Reynolds, D. R.; ...
2015-01-20
In dislocation dynamics simulations, strain hardening simulations require integrating stiff systems of ordinary differential equations in time with expensive force calculations, discontinuous topological events, and rapidly changing problem size. Current solvers in use often result in small time steps and long simulation times. Faster solvers may help dislocation dynamics simulations accumulate plastic strains at strain rates comparable to experimental observations. Here, this paper investigates the viability of high order implicit time integrators and robust nonlinear solvers to reduce simulation run times while maintaining the accuracy of the computed solution. In particular, implicit Runge-Kutta time integrators are explored as a waymore » of providing greater accuracy over a larger time step than is typically done with the standard second-order trapezoidal method. In addition, both accelerated fixed point and Newton's method are investigated to provide fast and effective solves for the nonlinear systems that must be resolved within each time step. Results show that integrators of third order are the most effective, while accelerated fixed point and Newton's method both improve solver performance over the standard fixed point method used for the solution of the nonlinear systems.« less
Implicit integration methods for dislocation dynamics
Gardner, D. J.; Woodward, C. S.; Reynolds, D. R.; Hommes, G.; Aubry, S.; Arsenlis, A.
2015-01-20
In dislocation dynamics simulations, strain hardening simulations require integrating stiff systems of ordinary differential equations in time with expensive force calculations, discontinuous topological events, and rapidly changing problem size. Current solvers in use often result in small time steps and long simulation times. Faster solvers may help dislocation dynamics simulations accumulate plastic strains at strain rates comparable to experimental observations. Here, this paper investigates the viability of high order implicit time integrators and robust nonlinear solvers to reduce simulation run times while maintaining the accuracy of the computed solution. In particular, implicit Runge-Kutta time integrators are explored as a way of providing greater accuracy over a larger time step than is typically done with the standard second-order trapezoidal method. In addition, both accelerated fixed point and Newton's method are investigated to provide fast and effective solves for the nonlinear systems that must be resolved within each time step. Results show that integrators of third order are the most effective, while accelerated fixed point and Newton's method both improve solver performance over the standard fixed point method used for the solution of the nonlinear systems.
High-Order Implicit-Explicit Multi-Block Time-stepping Method for Hyperbolic PDEs
NASA Technical Reports Server (NTRS)
Nielsen, Tanner B.; Carpenter, Mark H.; Fisher, Travis C.; Frankel, Steven H.
2014-01-01
This work seeks to explore and improve the current time-stepping schemes used in computational fluid dynamics (CFD) in order to reduce overall computational time. A high-order scheme has been developed using a combination of implicit and explicit (IMEX) time-stepping Runge-Kutta (RK) schemes which increases numerical stability with respect to the time step size, resulting in decreased computational time. The IMEX scheme alone does not yield the desired increase in numerical stability, but when used in conjunction with an overlapping partitioned (multi-block) domain significant increase in stability is observed. To show this, the Overlapping-Partition IMEX (OP IMEX) scheme is applied to both one-dimensional (1D) and two-dimensional (2D) problems, the nonlinear viscous Burger's equation and 2D advection equation, respectively. The method uses two different summation by parts (SBP) derivative approximations, second-order and fourth-order accurate. The Dirichlet boundary conditions are imposed using the Simultaneous Approximation Term (SAT) penalty method. The 6-stage additive Runge-Kutta IMEX time integration schemes are fourth-order accurate in time. An increase in numerical stability 65 times greater than the fully explicit scheme is demonstrated to be achievable with the OP IMEX method applied to 1D Burger's equation. Results from the 2D, purely convective, advection equation show stability increases on the order of 10 times the explicit scheme using the OP IMEX method. Also, the domain partitioning method in this work shows potential for breaking the computational domain into manageable sizes such that implicit solutions for full three-dimensional CFD simulations can be computed using direct solving methods rather than the standard iterative methods currently used.
Parameter investigation with line-implicit lower-upper symmetric Gauss-Seidel on 3D stretched grids
NASA Astrophysics Data System (ADS)
Otero, Evelyn; Eliasson, Peter
2015-03-01
An implicit lower-upper symmetric Gauss-Seidel (LU-SGS) solver has been implemented as a multigrid smoother combined with a line-implicit method as an acceleration technique for Reynolds-averaged Navier-Stokes (RANS) simulation on stretched meshes. The computational fluid dynamics code concerned is Edge, an edge-based finite volume Navier-Stokes flow solver for structured and unstructured grids. The paper focuses on the investigation of the parameters related to our novel line-implicit LU-SGS solver for convergence acceleration on 3D RANS meshes. The LU-SGS parameters are defined as the Courant-Friedrichs-Lewy number, the left-hand side dissipation, and the convergence of iterative solution of the linear problem arising from the linearisation of the implicit scheme. The influence of these parameters on the overall convergence is presented and default values are defined for maximum convergence acceleration. The optimised settings are applied to 3D RANS computations for comparison with explicit and line-implicit Runge-Kutta smoothing. For most of the cases, a computing time acceleration of the order of 2 is found depending on the mesh type, namely the boundary layer and the magnitude of residual reduction.
Semi-implicit time integration for P{sub N} thermal radiative transfer
McClarren, Ryan G. Evans, Thomas M.; Lowrie, Robert B.; Densmore, Jeffery D.
2008-08-10
Implicit time integration involving the solution of large systems of equations is the current paradigm for time-dependent radiative transfer. In this paper we present a semi-implicit, linear discontinuous Galerkin method for the spherical harmonics (P{sub N}) equations for thermal radiative transfer in planar geometry. Our method is novel in that the material coupling terms are treated implicitly (via linearizing the emission source) and the streaming operator is treated explicitly using a second-order accurate Runge-Kutta method. The benefit of this approach is that each time step only involves the solution of equations that are local to each cell. This benefit comes at the cost of having the time step limited by a CFL condition based on the speed of light. To guarantee positivity and avoid artificial oscillations, we use a slope-limiting technique. We present analysis and numerical results that show the method is robust in the diffusion limit when the photon mean-free path is not resolved by the spatial mesh. Also, in the diffusion limit the time step restriction relaxes to a less restrictive explicit diffusion CFL condition. We demonstrate with numerical results that away from the diffusion limit our method demonstrates second-order error convergence as the spatial mesh is refined with a fixed CFL number.
An implicit and adaptive nonlinear frequency domain approach for periodic viscous flows
NASA Astrophysics Data System (ADS)
Mosahebi, A.; Nadarajah, S.
2014-12-01
An implicit nonlinear Lower-Upper symmetric Gauss-Seidel (LU-SGS) solver has been extended to the adaptive Nonlinear Frequency Domain method (adaptive NLFD) for periodic viscous flows. The discretized equations are linearized in both spatial and temporal directions, yielding an innovative segregate approach, where the effects of the neighboring cells are transferred to the right-hand-side and are updated iteratively. This property of the solver is aligned with the adaptive NLFD concept, in which different cells have different number of modes; hence, should be treated individually. The segregate analysis of the modal equations prevents assembling and inversion of a large left-hand-side matrix, when high number of modes are involved. This is an important characteristic for a selected flow solver of the adaptive NLFD method, where a high modal content may be required in highly unsteady parts of the flow field. The implicit nonlinear LU-SGS solver has demonstrated to be both robust and computationally efficient as the number of modes is increased. The developed solver is thoroughly validated for the laminar vortex shedding behind a stationary cylinder, high angle of attack NACA0012 airfoil, and a plunging NACA0012 airfoil. An order of magnitude improvement in the computational time is observed through the developed implicit approach over the classical modified 5-stage Runge-Kutta method.
NASA Astrophysics Data System (ADS)
Borazjani, Iman; Asgharzadeh, Hafez
2015-11-01
Flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates with explicit and semi-implicit schemes. Implicit schemes can be used to overcome these restrictions. However, implementing implicit solver for nonlinear equations including Navier-Stokes is not straightforward. Newton-Krylov subspace methods (NKMs) are one of the most advanced iterative methods to solve non-linear equations such as implicit descritization of the Navier-Stokes equation. The efficiency of NKMs massively depends on the Jacobian formation method, e.g., automatic differentiation is very expensive, and matrix-free methods slow down as the mesh is refined. Analytical Jacobian is inexpensive method, but derivation of analytical Jacobian for Navier-Stokes equation on staggered grid is challenging. The NKM with a novel analytical Jacobian was developed and validated against Taylor-Green vortex and pulsatile flow in a 90 degree bend. The developed method successfully handled the complex geometries such as an intracranial aneurysm with multiple overset grids, and immersed boundaries. It is shown that the NKM with an analytical Jacobian is 3 to 25 times faster than the fixed-point implicit Runge-Kutta method, and more than 100 times faster than automatic differentiation depending on the grid (size) and the flow problem. The developed methods are fully parallelized with parallel efficiency of 80-90% on the problems tested.
Theoretical and Computational Studies of Stability, Transition and Flow Control in High-Speed Flows
2008-02-14
implicit Runge - Kutta method is used for temporal integration, where the time step size is obtained based on CFL number and grid size. The steady base flow...five fundamental solutions (continuous spectrum). A fourth order Runge - Kutta integration method with constant step (301 points) was used to integrate...code had an auxiliary role, and it served for verification of the other code that was based on the 4th-order Runge - Kutta solver for equations (A.3) and
High-Order Methods For Wave Propagation
2008-01-01
typically combined with high-order explicit time-integration methods such as the multi-stage Runge - Kutta procedure. In addition to the spatial and temporal... methods include both an explicit Runge - Kutta fourth- order temporally accurate scheme as well as an implicit, approximately factored Beam-Warming scheme of...12]. 3.2.3 Time Integration The equations are integrated in time with the classical fourth-order four-stage Runge - Kutta method . With R denoting the
Open issues in devising software for the numerical solution of implicit delay differential equations
NASA Astrophysics Data System (ADS)
Guglielmi, Nicola
2006-01-01
We consider initial value problems for systems of implicit delay differential equations of the formMy'(t)=f(t,y(t),y([alpha]1(t,y(t))),...,y([alpha]m(t,y(t)))),where M is a constant square matrix (with arbitrary rank) and [alpha]i(t,y(t))[less-than-or-equals, slant]t for all t and i.For a numerical treatment of this kind of problems, a software tool has been recently developed [6]; this code is called RADAR5 and is based on a suitable extension to delay equations of the 3-stage Radau IIA Runge-Kutta method.The aim of this work is that of illustrating some important topics which are being investigated in order to increase the efficiency of the code. They are mainly relevant to(i) the error control strategies in relation to derivative discontinuities arising in the solutions of delay equations;(ii) the integration of problems with unbounded delays (like the pantograph equation);(iii) the applications to problems with special structure (as those arising from spatial discretization of evolutions PDEs with delays).Several numerical examples will also be shown in order to illustrate some of the topics discussed in the paper.
Analysis of numerical stability and amplification matrices: Fourth-order Runge-Kutta methods
NASA Technical Reports Server (NTRS)
Kennedy, E. W.
1979-01-01
Amplification matrices, numerical kernels, stable, and exponentially stable numerical solutions are examined. The various techniques involved in these concepts are applied to certain systems that have Jordan forms, which are nondiagonal, with particular interest in the case of imaginary or zero eigenvalues.
Construction and Analysis of Multi-Rate Partitioned Runge-Kutta Methods
2012-06-01
chapter, that the value of σ ( Courant number) will play an important role in determining where our numerical method is stable, as it measures how fast... method gradually incurred both dissipation and dispersion errors, it was still stable. However, for the same Courant value of 0.5, we notice that the...4245, F. X. Giraldo, Department of Applied Mathematics , Naval Postgraduate School, Spring 2012. [9] D. R. Durran, Numerical Methods for Wave
A symplectic Runge Kutta Nyström method with minimal phase-lag
NASA Astrophysics Data System (ADS)
van de Vyver, H.
2007-07-01
In this Letter we introduce a symplectic explicit RKN method for Hamiltonian systems with periodical solutions. The method has algebraic order three and phase-lag order six at a cost of three function evaluations per step. Numerical experiments show the relevance of the developed algorithm. It is found that the new method is much more efficient than the standard symplectic fourth-order method [M.P. Calvo, J.M. Sanz-Serna, SIAM J. Sci. Comput. 14 (1993) 936].
NASA Astrophysics Data System (ADS)
Asgharzadeh, Hafez; Borazjani, Iman
2014-11-01
Time step-size restrictions and low convergence rates are major bottle necks for implicit solution of the Navier-Stokes in simulations involving complex geometries with moving boundaries. Newton-Krylov method (NKM) is a combination of a Newton-type method for super-linearly convergent solution of nonlinear equations and Krylov subspace methods for solving the Newton correction equations, which can theoretically address both bottle necks. The efficiency of this method vastly depends on the Jacobian forming scheme e.g. automatic differentiation is very expensive and Jacobian-free methods slow down as the mesh is refined. A novel, computationally efficient analytical Jacobian for NKM was developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered curvilinear grids with immersed boundaries. The NKM was validated and verified against Taylor-Green vortex and pulsatile flow in a 90 degree bend and efficiently handles complex geometries such as an intracranial aneurysm with multiple overset grids, pulsatile inlet flow and immersed boundaries. The NKM method is shown to be more efficient than the semi-implicit Runge-Kutta methods and Jabobian-free Newton-Krylov methods. We believe NKM can be applied to many CFD techniques to decrease the computational cost. This work was supported partly by the NIH Grant R03EB014860, and the computational resources were partly provided by Center for Computational Research (CCR) at University at Buffalo.
A variational implementation of the implicit particle filter for the shallow water equations
NASA Astrophysics Data System (ADS)
Souopgui, I.; Morzfeld, M.; Hussaini, M.; Chorin, A. J.
2013-12-01
The estimation of initial conditions for shallow water equations is a well known test problem for operational data assimilation techniques. The state-of-the-art approach to this problem is the variational method (4D-Var), i.e. the computation of the mode of the posterior probability density function (pdf) via the adjoint technique. We add a sampling step to the variational method, thus turning a computation of the conditional mode (a biased estimator) into a computation of the conditional mean (the minimum least square error estimator). Our implementation relies on implicit sampling, which is a Monte Carlo (MC) sampling scheme. The idea in implicit sampling is to first search for the high-probability region of the posterior pdf and then to find samples in this region. Because the samples are concentrated in the high-probability region, fewer samples are required than with competing MC schemes and, thus, implicit sampling can be more efficient than other MC schemes. The search for the high-probability region can be done via a numerical minimization that is very similar to the minimization in 4D-Var. Here, we use existing 4D-Var code to implement the implicit sampling scheme. Once the minimization problem is solved, we obtain samples by solving algebraic equations with a random right-hand-side. These equations can be solved efficiently, so that the additional cost of our approach, compared to 4D-Var, is small. We present numerical experiments to demonstrate the applicability and efficiency of our approach. These numerical experiments mimic physical experiments done with the CORIOLIS turntable in Grenoble (France), which are used to study the drift of a vortex. In particular we consider shallow water equations on a square domain (2.5m x 2.5m) with open boundary conditions and discretize the equations with finite differences on a staggered grid of size 256 x 256 and a fourth order Runge-Kutta time integrator. Our goal is to estimate the initial state (velocities and
Mark, V.; Heilman, K.
1998-01-01
OBJECTIVE—To determine whether stroke patients with diagonal neglect on cancellation may show diagonal neglect on line bisection, and hence to indicate whether diagonal neglect may be related solely to the type of test used or whether instead it may reflect a fundamental spatial disorder. METHODS—Nine patients with subacute right hemispheric stroke who neglected targets primarily in the near left direction on line cancellation bisected diagonal lines of two opposing orientations: near left to far right and far left to near right. The errors were assessed to determine whether line orientation significantly affected bisection error. RESULTS—Eight patients had significant bisection errors. One of these showed no effect of line orientation on error, consistent with lateral neglect. The remaining seven patients had a line orientation effect, indicating a net diagonal spatial bias. For the group, cancellation errors were significantly correlated with the line orientation effect on bisection errors. CONCLUSIONS—A significant diagonal bias on two tests of spatial attention may appear in stroke patients, although the directions of the biases may differ within individual patients. None the less, diagonal neglect may be a fundamental spatial attentional disturbance of right hemispheric stroke. Greater severity of stroke deficit as indicated by cancellation error score may be associated with a greater degree of diagonal neglect on line bisection. PMID:9728947
An improved semi-implicit method for structural dynamics analysis
NASA Technical Reports Server (NTRS)
Park, K. C.
1982-01-01
A semi-implicit algorithm is presented for direct time integration of the structural dynamics equations. The algorithm avoids the factoring of the implicit difference solution matrix and mitigates the unacceptable accuracy losses which plagued previous semi-implicit algorithms. This substantial accuracy improvement is achieved by augmenting the solution matrix with two simple diagonal matrices of the order of the integration truncation error.
Lanczos diagonalization using GPUs
NASA Astrophysics Data System (ADS)
Brouwer, William; J, Sreejith G.; Spiga, Filippo
2013-03-01
Lanczos diagonalization (LD) is an important algorithm for calculating eigenvalues and eigenvectors of large matrices, used in many aspects of condensed matter physics. This presentation details work devoted to exploiting the massive parallelism and scalability of GPUs, in order to enhance LD. One significant application area is the diagonalization of the Hamiltonian for matrices encountered in studies of the fractional quantum Hall effect. A second application discussed in this work is to the Self Consistent Field (SCF) cycle of a Density Functional Theory (DFT) code, Quantum Espresso. Initial results are promising, demonstrating a 18x speedup using GPU, over an optimized CPU implementation.
NASA Astrophysics Data System (ADS)
Kifonidis, K.; Müller, E.
2012-08-01
Aims: We describe and study a family of new multigrid iterative solvers for the multidimensional, implicitly discretized equations of hydrodynamics. Schemes of this class are free of the Courant-Friedrichs-Lewy condition. They are intended for simulations in which widely differing wave propagation timescales are present. A preferred solver in this class is identified. Applications to some simple stiff test problems that are governed by the compressible Euler equations, are presented to evaluate the convergence behavior, and the stability properties of this solver. Algorithmic areas are determined where further work is required to make the method sufficiently efficient and robust for future application to difficult astrophysical flow problems. Methods: The basic equations are formulated and discretized on non-orthogonal, structured curvilinear meshes. Roe's approximate Riemann solver and a second-order accurate reconstruction scheme are used for spatial discretization. Implicit Runge-Kutta (ESDIRK) schemes are employed for temporal discretization. The resulting discrete equations are solved with a full-coarsening, non-linear multigrid method. Smoothing is performed with multistage-implicit smoothers. These are applied here to the time-dependent equations by means of dual time stepping. Results: For steady-state problems, our results show that the efficiency of the present approach is comparable to the best implicit solvers for conservative discretizations of the compressible Euler equations that can be found in the literature. The use of red-black as opposed to symmetric Gauss-Seidel iteration in the multistage-smoother is found to have only a minor impact on multigrid convergence. This should enable scalable parallelization without having to seriously compromise the method's algorithmic efficiency. For time-dependent test problems, our results reveal that the multigrid convergence rate degrades with increasing Courant numbers (i.e. time step sizes). Beyond a
NASA Astrophysics Data System (ADS)
Xia, Yidong
The objective this work is to develop a parallel, implicit reconstructed discontinuous Galerkin (RDG) method using Taylor basis for the solution of the compressible Navier-Stokes equations on 3D hybrid grids. This third-order accurate RDG method is based on a hierarchical weighed essentially non- oscillatory reconstruction scheme, termed as HWENO(P1P 2) to indicate that a quadratic polynomial solution is obtained from the underlying linear polynomial DG solution via a hierarchical WENO reconstruction. The HWENO(P1P2) is designed not only to enhance the accuracy of the underlying DG(P1) method but also to ensure non-linear stability of the RDG method. In this reconstruction scheme, a quadratic polynomial (P2) solution is first reconstructed using a least-squares approach from the underlying linear (P1) discontinuous Galerkin solution. The final quadratic solution is then obtained using a Hermite WENO reconstruction, which is necessary to ensure the linear stability of the RDG method on 3D unstructured grids. The first derivatives of the quadratic polynomial solution are then reconstructed using a WENO reconstruction in order to eliminate spurious oscillations in the vicinity of strong discontinuities, thus ensuring the non-linear stability of the RDG method. The parallelization in the RDG method is based on a message passing interface (MPI) programming paradigm, where the METIS library is used for the partitioning of a mesh into subdomain meshes of approximately the same size. Both multi-stage explicit Runge-Kutta and simple implicit backward Euler methods are implemented for time advancement in the RDG method. In the implicit method, three approaches: analytical differentiation, divided differencing (DD), and automatic differentiation (AD) are developed and implemented to obtain the resulting flux Jacobian matrices. The automatic differentiation is a set of techniques based on the mechanical application of the chain rule to obtain derivatives of a function given as
Recovery Discontinuous Galerkin Jacobian-Free Newton-Krylov Method for All-Speed Flows
HyeongKae Park; Robert Nourgaliev; Vincent Mousseau; Dana Knoll
2008-07-01
A novel numerical algorithm (rDG-JFNK) for all-speed fluid flows with heat conduction and viscosity is introduced. The rDG-JFNK combines the Discontinuous Galerkin spatial discretization with the implicit Runge-Kutta time integration under the Jacobian-free Newton-Krylov framework. We solve fully-compressible Navier-Stokes equations without operator-splitting of hyperbolic, diffusion and reaction terms, which enables fully-coupled high-order temporal discretization. The stability constraint is removed due to the L-stable Explicit, Singly Diagonal Implicit Runge-Kutta (ESDIRK) scheme. The governing equations are solved in the conservative form, which allows one to accurately compute shock dynamics, as well as low-speed flows. For spatial discretization, we develop a “recovery” family of DG, exhibiting nearly-spectral accuracy. To precondition the Krylov-based linear solver (GMRES), we developed an “Operator-Split”-(OS) Physics Based Preconditioner (PBP), in which we transform/simplify the fully-coupled system to a sequence of segregated scalar problems, each can be solved efficiently with Multigrid method. Each scalar problem is designed to target/cluster eigenvalues of the Jacobian matrix associated with a specific physics.
Direct Numerical Simulation of Interfacial Flows: Implicit Sharp-Interface Method (I-SIM)
Robert Nourgaliev; Theo Theofanous; HyeongKae Park; Vincent Mousseau; Dana Knoll
2008-01-01
In recent work (Nourgaliev, Liou, Theofanous, JCP in press) we demonstrated that numerical simulations of interfacial flows in the presence of strong shear must be cast in dynamically sharp terms (sharp interface treatment or SIM), and that moreover they must meet stringent resolution requirements (i.e., resolving the critical layer). The present work is an outgrowth of that work aiming to overcome consequent limitations on the temporal treatment, which become still more severe in the presence of phase change. The key is to avoid operator splitting between interface motion, fluid convection, viscous/heat diffusion and reactions; instead treating all these non-linear operators fully-coupled within a Newton iteration scheme. To this end, the SIM’s cut-cell meshing is combined with the high-orderaccurate implicit Runge-Kutta and the “recovery” Discontinuous Galerkin methods along with a Jacobian-free, Krylov subspace iteration algorithm and its physics-based preconditioning. In particular, the interfacial geometry (i.e., marker’s positions and volumes of cut cells) is a part of the Newton-Krylov solution vector, so that the interface dynamics and fluid motions are fully-(non-linearly)-coupled. We show that our method is: (a) robust (L-stable) and efficient, allowing to step over stability time steps at will while maintaining high-(up to the 5th)-order temporal accuracy; (b) fully conservative, even near multimaterial contacts, without any adverse consequences (pressure/velocity oscillations); and (c) highorder-accurate in spatial discretization (demonstrated here up to the 12th-order for smoothin-the-bulk-fluid flows), capturing interfacial jumps sharply, within one cell. Performance is illustrated with a variety of test problems, including low-Mach-number “manufactured” solutions, shock dynamics/tracking with slow dynamic time scales, and multi-fluid, highspeed shock-tube problems. We briefly discuss preconditioning, and we introduce two physics
Quan, Quan; Zhu, Huangjun; Liu, Si-Yuan; Fei, Shao-Ming; Fan, Heng; Yang, Wen-Li
2016-01-01
We investigate the steerability of two-qubit Bell-diagonal states under projective measurements by the steering party. In the simplest nontrivial scenario of two projective measurements, we solve this problem completely by virtue of the connection between the steering problem and the joint-measurement problem. A necessary and sufficient criterion is derived together with a simple geometrical interpretation. Our study shows that a Bell-diagonal state is steerable by two projective measurements iff it violates the Clauser-Horne-Shimony-Holt (CHSH) inequality, in sharp contrast with the strict hierarchy expected between steering and Bell nonlocality. We also introduce a steering measure and clarify its connections with concurrence and the volume of the steering ellipsoid. In particular, we determine the maximal concurrence and ellipsoid volume of Bell-diagonal states that are not steerable by two projective measurements. Finally, we explore the steerability of Bell-diagonal states under three projective measurements. A simple sufficient criterion is derived, which can detect the steerability of many states that are not steerable by two projective measurements. Our study offers valuable insight on steering of Bell-diagonal states as well as the connections between entanglement, steering, and Bell nonlocality. PMID:26911250
Numerical experiments with an implicit particle filter for the shallow water equations
NASA Astrophysics Data System (ADS)
Souopgui, I.; Chorin, A. J.; Hussaini, M.
2012-12-01
The estimation of initial conditions for the shallow water equations for a given set of later data is a well known test problem for data assimilation codes. A popular approach to this problem is the variational method (4D-Var), i.e. the computation of the mode of the posterior probability density function (pdf) via the adjoint technique. Here, we improve on 4D-Var by computing the conditional mean (the minimum least square error estimator) rather than the mode (a biased estimator) and we do so with implicit sampling, a Monte Carlo (MC) importance sampling method. The idea in implicit sampling is to first search for the high-probability region of the posterior pdf and then to find samples in this region. Because the samples are concentrated in the high-probability region, fewer samples are required than with competing MC schemes. The search for the high-probability region can be implemented by a minimization that is very similar to the minimization in 4D-Var, and we make use of a 4D-Var code in our implementation. The samples are obtained by solving algebraic equations with a random right-hand-side. These equations can be solved efficiently, so that the additional cost of our approach, compared to traditional 4D-Var, is small. The long-term goal is to assimilate experimental data, obtained with the CORIOLIS turntable in Grenoble (France), to study the drift of a vortex. We present results from numerical twin experiments as a first step towards our long-term goal. We discretize the shallow water equations on a square domain (2.5m× 2.5m) using finite differences on a staggered grid of size 28× 28 and a fourth order Runge-Kutta. We assume open boundary conditions and estimate the initial state (velocities and surface height) given noisy observations of the state. We solve the optimization problem using a 4D-Var code that relies on a L-BFGS method; the random algebraic equations are solved with random maps, i.e. we look for solutions in given, but random, directions
Parallelization of implicit finite difference schemes in computational fluid dynamics
NASA Technical Reports Server (NTRS)
Decker, Naomi H.; Naik, Vijay K.; Nicoules, Michel
1990-01-01
Implicit finite difference schemes are often the preferred numerical schemes in computational fluid dynamics, requiring less stringent stability bounds than the explicit schemes. Each iteration in an implicit scheme involves global data dependencies in the form of second and higher order recurrences. Efficient parallel implementations of such iterative methods are considerably more difficult and non-intuitive. The parallelization of the implicit schemes that are used for solving the Euler and the thin layer Navier-Stokes equations and that require inversions of large linear systems in the form of block tri-diagonal and/or block penta-diagonal matrices is discussed. Three-dimensional cases are emphasized and schemes that minimize the total execution time are presented. Partitioning and scheduling schemes for alleviating the effects of the global data dependencies are described. An analysis of the communication and the computation aspects of these methods is presented. The effect of the boundary conditions on the parallel schemes is also discussed.
Nondestructive identification of the Bell diagonal state
Jin Jiasen; Yu Changshui; Song Heshan
2011-03-15
We propose a scheme for identifying an unknown Bell diagonal state. In our scheme the measurements are performed on the probe qubits instead of the Bell diagonal state. The distinct advantage is that the quantum state of the evolved Bell diagonal state ensemble plus probe states will still collapse on the original Bell diagonal state ensemble after the measurement on probe states; i.e., our identification is quantum state nondestructive. How to realize our scheme in the framework of cavity electrodynamics is also shown.
NASA Technical Reports Server (NTRS)
Rogers, S. E.; Kwak, D.; Chang, J. L. C.
1986-01-01
The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.
The delayed coupling method: An algorithm for solving banded diagonal matrix problems in parallel
Mattor, N.; Williams, T.J.; Hewett, D.W.; Dimits, A.M.
1997-09-01
We present a new algorithm for solving banded diagonal matrix problems efficiently on distributed-memory parallel computers, designed originally for use in dynamic alternating-direction implicit partial differential equation solvers. The algorithm optimizes efficiency with respect to the number of numerical operations and to the amount of interprocessor communication. This is called the ``delayed coupling method`` because the communication is deferred until needed. We focus here on tridiagonal and periodic tridiagonal systems.
NASA Astrophysics Data System (ADS)
Graham Hoover, William; Clinton Sprott, Julien; Griswold Hoover, Carol
2016-10-01
We describe the application of adaptive (variable time step) integrators to stiff differential equations encountered in many applications. Linear harmonic oscillators subject to nonlinear thermal constraints can exhibit either stiff or smooth dynamics. Two closely related examples, Nosé's dynamics and Nosé-Hoover dynamics, are both based on Hamiltonian mechanics and generate microstates consistent with Gibbs' canonical ensemble. Nosé's dynamics is stiff and can present severe numerical difficulties. Nosé-Hoover dynamics, although it follows exactly the same trajectory, is smooth and relatively trouble-free. We emphasize the power of adaptive integrators to resolve stiff problems such as the Nosé dynamics for the harmonic oscillator. The solutions also illustrate the power of computer graphics to enrich numerical solutions.
Implicit Causality, Implicit Consequentiality and Semantic Roles
ERIC Educational Resources Information Center
Crinean, Marcelle; Garnham, Alan
2006-01-01
Stewart, Pickering, and Sanford (1998) reported a new type of semantic inference, implicit consequentiality, which they suggest is comparable to, although not directly related to, the well-documented phenomenon of implicit causality. It is our contention that there is a direct relation between these two semantic phenomena but that this relation…
Multigrid calculation of three-dimensional turbomachinery flows
NASA Technical Reports Server (NTRS)
Caughey, David A.
1989-01-01
Research was performed in the general area of computational aerodynamics, with particular emphasis on the development of efficient techniques for the solution of the Euler and Navier-Stokes equations for transonic flows through the complex blade passages associated with turbomachines. In particular, multigrid methods were developed, using both explicit and implicit time-stepping schemes as smoothing algorithms. The specific accomplishments of the research have included: (1) the development of an explicit multigrid method to solve the Euler equations for three-dimensional turbomachinery flows based upon the multigrid implementation of Jameson's explicit Runge-Kutta scheme (Jameson 1983); (2) the development of an implicit multigrid scheme for the three-dimensional Euler equations based upon lower-upper factorization; (3) the development of a multigrid scheme using a diagonalized alternating direction implicit (ADI) algorithm; (4) the extension of the diagonalized ADI multigrid method to solve the Euler equations of inviscid flow for three-dimensional turbomachinery flows; and also (5) the extension of the diagonalized ADI multigrid scheme to solve the Reynolds-averaged Navier-Stokes equations for two-dimensional turbomachinery flows.
NASA Astrophysics Data System (ADS)
Wu, Lingfei; Laeuchli, Jesse; Kalantzis, Vassilis; Stathopoulos, Andreas; Gallopoulos, Efstratios
2016-12-01
A number of applications require the computation of the trace of a matrix that is implicitly available through a function. A common example of a function is the inverse of a large, sparse matrix, which is the focus of this paper. When the evaluation of the function is expensive, the task is computationally challenging because the standard approach is based on a Monte Carlo method which converges slowly. We present a different approach that exploits the pattern correlation, if present, between the diagonal of the inverse of the matrix and the diagonal of some approximate inverse that can be computed inexpensively. We leverage various sampling and fitting techniques to fit the diagonal of the approximation to the diagonal of the inverse. Depending on the quality of the approximate inverse, our method may serve as a standalone kernel for providing a fast trace estimate with a small number of samples. Furthermore, the method can be used as a variance reduction method for Monte Carlo in some cases. This is decided dynamically by our algorithm. An extensive set of experiments with various technique combinations on several matrices from some real applications demonstrate the potential of our method.
The Blended Finite Element Method for Multi-fluid Plasma Modeling
2016-07-01
EM fields is smooth and does not shock Continuous Galerkin Electron fluid and EM fields Q = ∑ i qivi Discontinuous Galerkin Multiple ion and neutral ...with explicit Runge-Kutta time integration Ions and neutrals CG spatial discretization with implicit Crank-Nicolson time integration for the electrons
Diagonal chromatography to study plant protein modifications.
Walton, Alan; Tsiatsiani, Liana; Jacques, Silke; Stes, Elisabeth; Messens, Joris; Van Breusegem, Frank; Goormachtig, Sofie; Gevaert, Kris
2016-08-01
An interesting asset of diagonal chromatography, which we have introduced for contemporary proteome research, is its high versatility concerning proteomic applications. Indeed, the peptide modification or sorting step that is required between consecutive peptide separations can easily be altered and thereby allows for the enrichment of specific, though different types of peptides. Here, we focus on the application of diagonal chromatography for the study of modifications of plant proteins. In particular, we show how diagonal chromatography allows for studying proteins processed by proteases, protein ubiquitination, and the oxidation of protein-bound methionines. We discuss the actual sorting steps needed for each of these applications and the obtained results. This article is part of a Special Issue entitled: Plant Proteomics--a bridge between fundamental processes and crop production, edited by Dr. Hans-Peter Mock.
Langdon, A.B.
1985-03-03
Implicit time integration methods have been used extensively in numerical modelling of slowly varying phenomena in systems that also support rapid variation. Examples include diffusion, hydrodynamics and reaction kinetics. This article discussed implementation of implicit time integration in plasma codes of the ''particle-in-cell'' family, and the benefits to be gained.
NASA Technical Reports Server (NTRS)
Skliar, M.; Ramirez, W. F.
1997-01-01
For an implicitly defined discrete system, a new algorithm for Kalman filtering is developed and an efficient numerical implementation scheme is proposed. Unlike the traditional explicit approach, the implicit filter can be readily applied to ill-conditioned systems and allows for generalization to descriptor systems. The implementation of the implicit filter depends on the solution of the congruence matrix equation (A1)(Px)(AT1) = Py. We develop a general iterative method for the solution of this equation, and prove necessary and sufficient conditions for convergence. It is shown that when the system matrices of an implicit system are sparse, the implicit Kalman filter requires significantly less computer time and storage to implement as compared to the traditional explicit Kalman filter. Simulation results are presented to illustrate and substantiate the theoretical developments.
The diagonal and off-diagonal quark number susceptibility of high temperature and finite density QCD
NASA Astrophysics Data System (ADS)
Hietanen, A.; Rummukainen, K.
2008-04-01
We study the quark number susceptibility of the hot quark-gluon plasma at zero and non-zero quark number density, using lattice Monte Carlo simulations of an effective theory of QCD, electrostatic QCD (EQCD). Analytic continuation is used to obtain results at non-zero quark chemical potential μ. We measure both flavor singlet (diagonal) and non-singlet (off-diagonal) quark number susceptibilities. The diagonal susceptibility approaches the perturbative result above ~ 20Tc, but below that temperature we observe significant deviations. The results agree well with 4d lattice data down to temperatures ~ 2Tc. The off-diagonal susceptibility is more prone to statistical and systematic errors, but the results are consistent with perturbation theory already at 10Tc.
Awareness of Implicit Attitudes
Hahn, Adam; Judd, Charles M.; Hirsh, Holen K.; Blair, Irene V.
2013-01-01
Research on implicit attitudes has raised questions about how well people know their own attitudes. Most research on this question has focused on the correspondence between measures of implicit attitudes and measures of explicit attitudes, with low correspondence interpreted as showing that people have little awareness of their implicit attitudes. We took a different approach and directly asked participants to predict their results on upcoming IAT measures of implicit attitudes toward five different social groups. We found that participants were surprisingly accurate in their predictions. Across four studies, predictions were accurate regardless of whether implicit attitudes were described as true attitudes or culturally learned associations (Studies 1 and 2), regardless of whether predictions were made as specific response patterns (Study 1) or as conceptual responses (Studies 2–4), and regardless of how much experience or explanation participants received before making their predictions (Study 4). Study 3 further suggested that participants’ predictions reflected unique insight into their own implicit responses, beyond intuitions about how people in general might respond. Prediction accuracy occurred despite generally low correspondence between implicit and explicit measures of attitudes, as found in prior research. All together, the research findings cast doubt on the belief that attitudes or evaluations measured by the IAT necessarily reflect unconscious attitudes. PMID:24294868
Electromagnetic direct implicit PIC simulation
Langdon, A.B.
1983-03-29
Interesting modelling of intense electron flow has been done with implicit particle-in-cell simulation codes. In this report, the direct implicit PIC simulation approach is applied to simulations that include full electromagnetic fields. The resulting algorithm offers advantages relative to moment implicit electromagnetic algorithms and may help in our quest for robust and simpler implicit codes.
Probabilities in implicit learning.
Tseng, Philip; Hsu, Tzu-Yu; Tzeng, Ovid J L; Hung, Daisy L; Juan, Chi-Hung
2011-01-01
The visual system possesses a remarkable ability in learning regularities from the environment. In the case of contextual cuing, predictive visual contexts such as spatial configurations are implicitly learned, retained, and used to facilitate visual search-all without one's subjective awareness and conscious effort. Here we investigated whether implicit learning and its facilitatory effects are sensitive to the statistical property of such implicit knowledge. In other words, are highly probable events learned better than less probable ones even when such learning is implicit? We systematically varied the frequencies of context repetition to alter the degrees of learning. Our results showed that search efficiency increased consistently as contextual probabilities increased. Thus, the visual contexts, along with their probability of occurrences, were both picked up by the visual system. Furthermore, even when the total number of exposures was held constant between each probability, the highest probability still enjoyed a greater cuing effect, suggesting that the temporal aspect of implicit learning is also an important factor to consider in addition to the effect of mere frequency. Together, these findings suggest that implicit learning, although bypassing observers' conscious encoding and retrieval effort, behaves much like explicit learning in the sense that its facilitatory effect also varies as a function of its associative strengths.
Diagonalizing sensing matrix of broadband RSE
NASA Astrophysics Data System (ADS)
Sato, Shuichi; Kokeyama, Keiko; Kawazoe, Fumiko; Somiya, Kentaro; Kawamura, Seiji
2006-03-01
For a broadband-operated RSE interferometer, a simple and smart length sensing and control scheme was newly proposed. The sensing matrix could be diagonal, owing to a simple allocation of two RF modulations and to a macroscopic displacement of cavity mirrors, which cause a detuning of the RF modulation sidebands. In this article, the idea of the sensing scheme and an optimization of the relevant parameters will be described.
Investigations on the Incompletely Developed Plane Diagonal-Tension Field
NASA Technical Reports Server (NTRS)
Kuhn, Paul
1940-01-01
This report presents the results of an investigation on the incompletely developed diagonal-tension field. Actual diagonal-tension beams work in an intermediate stage between pure shear and pure diagonal tension; the theory developed by wagner for diagonal tension is not directly applicable. The first part of the paper reviews the most essential items of the theory of pure diagonal tension as well as previous attempts to formulate a theory of incomplete diagonal tension. The second part of the paper describes strain measurement made by the N. A. C. A. to obtain the necessary coefficients for the proposed theory. The third part of the paper discusses the stress analysis of diagonal-tension beams by means of the proposed theory.
Devos, Thierry; Banaji, Mahzarin R
2003-10-01
Recent advances in research on implicit social cognition offer an opportunity to challenge common assumptions about self and identity. In the present article, we critically review a burgeoning line of research on self-related processes known to occur outside conscious awareness or conscious control. Our discussion focuses on these implicit self-related processes as they unfold in the context of social group memberships. That is, we show that group memberships can shape thoughts, preferences, motives, goals, or behaviors without the actor's being aware of such an influence or having control over such expressions. As such, this research brings to the fore facets of the self that often contrast with experiences of reflexive consciousness and introspection. Far from being rigid or monolithic, these processes are highly flexible, context-sensitive, and deeply rooted in socio-structural realities. As such, work on implicit self and identity renew thinking about the interplay between the individual and the collective.
Diagonal gates in the Clifford hierarchy
NASA Astrophysics Data System (ADS)
Cui, Shawn X.; Gottesman, Daniel; Krishna, Anirudh
2017-01-01
The Clifford hierarchy is a set of gates that appears in the theory of fault-tolerant quantum computation, but its precise structure remains elusive. We give a complete characterization of the diagonal gates in the Clifford hierarchy for prime-dimensional qudits. They turn out to be pmth roots of unity raised to polynomial functions of the basis state to which they are applied, and we determine which level of the Clifford hierarchy a given gate sits in based on m and the degree of the polynomial.
Implicit Understanding of Belief.
ERIC Educational Resources Information Center
Clements, Wendy A.; Perner, Josef
1994-01-01
Implicit understanding of false belief was investigated by monitoring where preschoolers looked in anticipation of a protagonist reappearing, when the protagonist mistakenly thinks that his desired object is in a different place from where it really is. Two-year olds erroneously looked at the object's real location whereas most older children…
An Ancient Egyptian Diagonal Star Table in Mallawi, Egypt
NASA Astrophysics Data System (ADS)
Symons, Sarah; Cockcroft, Robert
2013-11-01
A coffin belonging to an Egyptian Middle Kingdom official Hor-em-hetepu, on public display in the Mallawi Monuments Museum, Egypt, contains a previously-unpublished diagonal star table (or "diagonal star clock"). This table adds to the other twenty-four examples of this type of astronomical record or calendar from around 2100 B.C. The table displays a regular diagonal pattern of decan (star or asterism) names, with some interesting points of content, epigraphy, and typology.
Implicit Learning as an Ability
ERIC Educational Resources Information Center
Kaufman, Scott Barry; DeYoung, Caroline G.; Gray, Jeremy R.; Jimenez, Luis; Brown, Jamie; Mackintosh, Nicholas
2010-01-01
The ability to automatically and implicitly detect complex and noisy regularities in the environment is a fundamental aspect of human cognition. Despite considerable interest in implicit processes, few researchers have conceptualized implicit learning as an ability with meaningful individual differences. Instead, various researchers (e.g., Reber,…
Numerical solution of 3D Navier-Stokes equations with upwind implicit schemes
NASA Technical Reports Server (NTRS)
Marx, Yves P.
1990-01-01
An upwind MUSCL type implicit scheme for the three-dimensional Navier-Stokes equations is presented. Comparison between different approximate Riemann solvers (Roe and Osher) are performed and the influence of the reconstructions schemes on the accuracy of the solution as well as on the convergence of the method is studied. A new limiter is introduced in order to remove the problems usually associated with non-linear upwind schemes. The implementation of a diagonal upwind implicit operator for the three-dimensional Navier-Stokes equations is also discussed. Finally the turbulence modeling is assessed. Good prediction of separated flows are demonstrated if a non-equilibrium turbulence model is used.
Diagonal-norm upwind SBP operators
NASA Astrophysics Data System (ADS)
Mattsson, Ken
2017-04-01
High-order accurate first derivative finite difference operators are derived that naturally introduce artificial dissipation. The boundary closures are based on the diagonal-norm summation-by-parts (SBP) framework and the boundary conditions are imposed using a penalty (SAT) technique, to guarantee linear stability for a large class of initial boundary value problems. These novel first derivative SBP operators have a non-central difference stencil in the interior, and come in pairs (for each order of accuracy). The resulting SBP-SAT approximations lead to fully explicit ODE systems. The accuracy and stability properties are demonstrated for linear first- and second-order hyperbolic problems in 1D, and for the compressible Euler equations in 2D. The newly derived first derivative SBP operators lead to significantly more robust and accurate numerical approximations, compared with the exclusive usage of (previously derived central) non-dissipative first derivative SBP operators.
16. View of riveted gusset plate connection between compression diagonal, ...
16. View of riveted gusset plate connection between compression diagonal, tension diagonal, and lateral brace at center of 4th panel from north end of west truss of north span, looking from the east - Bridge No. 4900, Spanning Root River at Trunk Highway 16, Rushford, Fillmore County, MN
15. View showing junction of compression diagonal, vertical member, tension ...
15. View showing junction of compression diagonal, vertical member, tension diagonal, and lower chord members between 5th and 6th panels from north end of north span, looking from the east - Bridge No. 4900, Spanning Root River at Trunk Highway 16, Rushford, Fillmore County, MN
4. VIEW OF EAST PORTION OF LOWER DIAGONAL NO. 1 ...
4. VIEW OF EAST PORTION OF LOWER DIAGONAL NO. 1 DRAIN LOOKING TOWARDS THE CENTRAL BEND, LOOKING 270t EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
3. VIEW OF EAST PORTION OF LOWER DIAGONAL NO. 1 ...
3. VIEW OF EAST PORTION OF LOWER DIAGONAL NO. 1 DRAIN LOOKING TOWARDS THE CENTRAL BEND, LOOKING 2742 EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
7. VIEW OF WEAPONS DELIVERY ROAD CULVERT OF LOWER DIAGONAL ...
7. VIEW OF WEAPONS DELIVERY ROAD CULVERT OF LOWER DIAGONAL NO. 1 DRAIN, LOOKING 522 EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
1. VIEW OF WEST PORTION OF LOWER DIAGONAL NO. 1 ...
1. VIEW OF WEST PORTION OF LOWER DIAGONAL NO. 1 DRAIN LOOKING TOWARDS THE WEST GATE ROAD CULVERT, LOOKING 3052 EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
2. VIEW OF CENTRAL BEND OF LOWER DIAGONAL NO. 1 ...
2. VIEW OF CENTRAL BEND OF LOWER DIAGONAL NO. 1 DRAIN, LOOKING 2932 EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
5. VIEW OF WEST GATE ROAD CULVERT OF LOWER DIAGONAL ...
5. VIEW OF WEST GATE ROAD CULVERT OF LOWER DIAGONAL NO. 1 DRAIN, LOOKING 323' EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
6. VIEW OF WEST GATE ROAD CULVERT OF LOWER DIAGONAL ...
6. VIEW OF WEST GATE ROAD CULVERT OF LOWER DIAGONAL NO. 1 DRAIN, LOOKING 2502 EAST OF NORTH. - Truckee-Carson Irrigation District, Lower Diagonal No. 1 Drain, Bounded by West Gate Road & Weapons Delivery Road, Naval Air Station Fallon, Fallon, Churchill County, NV
Panel Post & Diagonal Brace Joint Detail; Crossbracing Center Joint ...
Panel Post & Diagonal Brace Joint Detail; Crossbracing Center Joint Detail; Chord, Panel Post, Tie Bar, & Diagonal Brace Joint Detail; Chord, Tie Bar, & Crossbracing Joint Detail - Medora Bridge, Spanning East Fork of White River at State Route 235, Medora, Jackson County, IN
Solving block linear systems with low-rank off-diagonal blocks is easily parallelizable
Menkov, V.
1996-12-31
An easily and efficiently parallelizable direct method is given for solving a block linear system Bx = y, where B = D + Q is the sum of a non-singular block diagonal matrix D and a matrix Q with low-rank blocks. This implicitly defines a new preconditioning method with an operation count close to the cost of calculating a matrix-vector product Qw for some w, plus at most twice the cost of calculating Qw for some w. When implemented on a parallel machine the processor utilization can be as good as that of those operations. Order estimates are given for the general case, and an implementation is compared to block SSOR preconditioning.
A multigrid nonoscillatory method for computing high speed flows
NASA Technical Reports Server (NTRS)
Li, C. P.; Shieh, T. H.
1993-01-01
A multigrid method using different smoothers has been developed to solve the Euler equations discretized by a nonoscillatory scheme up to fourth order accuracy. The best smoothing property is provided by a five-stage Runge-Kutta technique with optimized coefficients, yet the most efficient smoother is a backward Euler technique in factored and diagonalized form. The singlegrid solution for a hypersonic, viscous conic flow is in excellent agreement with the solution obtained by the third order MUSCL and Roe's method. Mach 8 inviscid flow computations for a complete entry probe have shown that the accuracy is at least as good as the symmetric TVD scheme of Yee and Harten. The implicit multigrid method is four times more efficient than the explicit multigrid technique and 3.5 times faster than the single-grid implicit technique. For a Mach 8.7 inviscid flow over a blunt delta wing at 30 deg incidence, the CPU reduction factor from the three-level multigrid computation is 2.2 on a grid of 37 x 41 x 73 nodes.
Implicit learning as an ability.
Kaufman, Scott Barry; Deyoung, Colin G; Gray, Jeremy R; Jiménez, Luis; Brown, Jamie; Mackintosh, Nicholas
2010-09-01
The ability to automatically and implicitly detect complex and noisy regularities in the environment is a fundamental aspect of human cognition. Despite considerable interest in implicit processes, few researchers have conceptualized implicit learning as an ability with meaningful individual differences. Instead, various researchers (e.g., Reber, 1993; Stanovich, 2009) have suggested that individual differences in implicit learning are minimal relative to individual differences in explicit learning. In the current study of English 16-17year old students, we investigated the association of individual differences in implicit learning with a variety of cognitive and personality variables. Consistent with prior research and theorizing, implicit learning, as measured by a probabilistic sequence learning task, was more weakly related to psychometric intelligence than was explicit associative learning, and was unrelated to working memory. Structural equation modeling revealed that implicit learning was independently related to two components of psychometric intelligence: verbal analogical reasoning and processing speed. Implicit learning was also independently related to academic performance on two foreign language exams (French, German). Further, implicit learning was significantly associated with aspects of self-reported personality, including intuition, Openness to Experience, and impulsivity. We discuss the implications of implicit learning as an ability for dual-process theories of cognition, intelligence, personality, skill learning, complex cognition, and language acquisition.
Numerical Aspects of Atomic Physics: Helium Basis Sets and Matrix Diagonalization
NASA Astrophysics Data System (ADS)
Jentschura, Ulrich; Noble, Jonathan
2014-03-01
We present a matrix diagonalization algorithm for complex symmetric matrices, which can be used in order to determine the resonance energies of auto-ionizing states of comparatively simple quantum many-body systems such as helium. The algorithm is based in multi-precision arithmetic and proceeds via a tridiagonalization of the complex symmetric (not necessarily Hermitian) input matrix using generalized Householder transformations. Example calculations involving so-called PT-symmetric quantum systems lead to reference values which pertain to the imaginary cubic perturbation (the imaginary cubic anharmonic oscillator). We then proceed to novel basis sets for the helium atom and present results for Bethe logarithms in hydrogen and helium, obtained using the enhanced numerical techniques. Some intricacies of ``canned'' algorithms such as those used in LAPACK will be discussed. Our algorithm, for complex symmetric matrices such as those describing cubic resonances after complex scaling, is faster than LAPACK's built-in routines, for specific classes of input matrices. It also offer flexibility in terms of the calculation of the so-called implicit shift, which is used in order to ``pivot'' the system toward the convergence to diagonal form. We conclude with a wider overview.
Hassin, Ran R.; Bargh, John A.; Engell, Andrew D.; McCulloch, Kathleen C.
2009-01-01
Working Memory (WM) plays a crucial role in many high-level cognitive processes (e.g., reasoning, decision making, goal pursuit and cognitive control). The prevalent view holds that active components of WM are predominantly intentional and conscious. This conception is oftentimes expressed explicitly, but it is best reflected in the nature of major WM tasks: All of them are blatantly explicit. We developed two new WM paradigms that allow for an examination of the role of conscious awareness in WM. Results from five studies show that WM can operate unintentionally and outside of conscious awareness, thus suggesting that the current view should be expanded to include implicit WM. PMID:19442537
Diagonal dominance using function minimization algorithms. [multivariable control system design
NASA Technical Reports Server (NTRS)
Leininger, G. G.
1977-01-01
A new approach to the design of multivariable control systems using the inverse Nyquist array method is proposed. The technique utilizes a conjugate direction function minimization algorithm to achieve dominance over a specified frequency range by minimizing the ratio of the moduli of the off-diagonal terms to the moduli of the diagonal term of the inverse open loop transfer function matrix. The technique is easily implemented in either a batch or interactive computer mode and will yield diagonalization when previously suggested methods fail. The proposed method has been successfully applied to design a control system for a sixteenth order state model of the F-100 turbofan engine with three inputs.
Separability of three qubit Greenberger–Horne–Zeilinger diagonal states
NASA Astrophysics Data System (ADS)
Han, Kyung Hoon; Kye, Seung-Hyeok
2017-04-01
We characterize the separability of three qubit GHZ diagonal states in terms of entries. This enables us to check separability of GHZ diagonal states without decomposition into the sum of pure product states. In the course of discussion, we show that the necessary criterion of Gühne (2011 Entanglement criteria and full separability of multi-qubit quantum states Phys. Lett. A 375 406–10) for (full) separability of three qubit GHZ diagonal states is sufficient with a simpler formula. The main tool is to use entanglement witnesses which are tri-partite Choi matrices of positive bi-linear maps.
Implicit Theories of Peer Relationships
ERIC Educational Resources Information Center
Rudolph, Karen D.
2010-01-01
This research investigated the role of children's implicit theories of peer relationships in their psychological, emotional, and behavioral adjustment. Participants included 206 children (110 girls; 96 boys; M age = 10.13 years, SD = 1.16) who reported on their implicit theories of peer relationships, social goal orientation, need for approval,…
The neuropharmacology of implicit learning.
Uddén, Julia; Folia, Vasiliki; Petersson, Karl Magnus
2010-12-01
Two decades of pharmacologic research on the human capacity to implicitly acquire knowledge as well as cognitive skills and procedures have yielded surprisingly few conclusive insights. We review the empirical literature of the neuropharmacology of implicit learning. We evaluate the findings in the context of relevant computational models related to neurotransmittors such as dopamine, serotonin, acetylcholine and noradrenalin. These include models for reinforcement learning, sequence production, and categorization. We conclude, based on the reviewed literature, that one can predict improved implicit acquisition by moderately elevated dopamine levels and impaired implicit acquisition by moderately decreased dopamine levels. These effects are most prominent in the dorsal striatum. This is supported by a range of behavioral tasks in the empirical literature. Similar predictions can be made for serotonin, although there is yet a lack of support in the literature for serotonin involvement in classical implicit learning tasks. There is currently a lack of evidence for a role of the noradrenergic and cholinergic systems in implicit and related forms of learning. GABA modulators, including benzodiazepines, seem to affect implicit learning in a complex manner and further research is needed. Finally, we identify allosteric AMPA receptors modulators as a potentially interesting target for future investigation of the neuropharmacology of procedural and implicit learning.
Development of Implicit Methods in CFD NASA Ames Research Center 1970's - 1980's
NASA Technical Reports Server (NTRS)
Pulliam, Thomas H.
2010-01-01
The focus here is on the early development (mid 1970's-1980's) at NASA Ames Research Center of implicit methods in Computational Fluid Dynamics (CFD). A class of implicit finite difference schemes of the Beam and Warming approximate factorization type will be addressed. The emphasis will be on the Euler equations. A review of material pertinent to the solution of the Euler equations within the framework of implicit methods will be presented. The eigensystem of the equations will be used extensively in developing a framework for various methods applied to the Euler equations. The development and analysis of various aspects of this class of schemes will be given along with the motivations behind many of the choices. Various acceleration and efficiency modifications such as matrix reduction, diagonalization and flux split schemes will be presented.
Classical limit of diagonal form factors and HHL correlators
NASA Astrophysics Data System (ADS)
Bajnok, Zoltan; Janik, Romuald A.
2017-01-01
We propose an expression for the classical limit of diagonal form factors in which we integrate the corresponding observable over the moduli space of classical solutions. In infinite volume the integral has to be regularized by proper subtractions and we present the one, which corresponds to the classical limit of the connected diagonal form factors. In finite volume the integral is finite and can be expressed in terms of the classical infinite volume diagonal form factors and subvolumes of the moduli space. We analyze carefully the periodicity properties of the finite volume moduli space and found a classical analogue of the Bethe-Yang equations. By applying the results to the heavy-heavy-light three point functions we can express their strong coupling limit in terms of the classical limit of the sine-Gordon diagonal form factors.
4. LOOKING SOUTHWEST AT LATTICED GUARDRAIL, DIAGONALS, ASPHALT DECK AND ...
4. LOOKING SOUTHWEST AT LATTICED GUARDRAIL, DIAGONALS, ASPHALT DECK AND LACED ANGLES ON VERTICALS - Wayne County Bridge No. 122, Spanning West Fork Whitewater River at Main Street, Milton, Wayne County, IN
13. Detail of connection of end portal, top chord, diagonal, ...
13. Detail of connection of end portal, top chord, diagonal, vertical and portal strut. Looking at east end, north side of east span. - Boomershine Bridge, Spanning Twin Creek, Farmersville, Montgomery County, OH
31. DETAIL OF DIAGONAL REINFORCING RODS TYPICAL OF FLOORS IN ...
31. DETAIL OF DIAGONAL REINFORCING RODS TYPICAL OF FLOORS IN CLASSROOMS AT NORTH PORTIONS OF EAST AND WEST WINGS - Frederika Bremer Intermediate School, 1214 Lowry Avenue North, Minneapolis, Hennepin County, MN
33. Coal Fuel Elevator (diagonal in foreground), Fuel Elevator (left), ...
33. Coal Fuel Elevator (diagonal in foreground), Fuel Elevator (left), Fuel Storage Bins (center), and Power Plant (right) Photographs taken by Joseph E.B. Elliot - Huber Coal Breaker, 101 South Main Street, Ashley, Luzerne County, PA
11. DETAIL OF BRIDGE DECK, SHOWING UPPER CHORDS, VERTICALS, DIAGONALS ...
11. DETAIL OF BRIDGE DECK, SHOWING UPPER CHORDS, VERTICALS, DIAGONALS AND GUARDRAILS. VIEW TO WEST. - Whispering Pines Bridge, Spanning East Verde River at Forest Service Control Road, Payson, Gila County, AZ
52. Fixed Span, Top Chord at Panel Point 6; diagonal ...
52. Fixed Span, Top Chord at Panel Point 6; diagonal member goes to intermediate connection 7 & then to bottom chord at 8; looking ESE. - Pacific Shortline Bridge, U.S. Route 20,spanning Missouri River, Sioux City, Woodbury County, IA
Detail view of turnbuckle in diagonal member, with kodachrome film ...
Detail view of turnbuckle in diagonal member, with kodachrome film box on right turnbuckle for scale. - Pennsylvania Railroad, Whitford Bridge, Spanning Amtrak tracks at Whitford Road, Whitford, Chester County, PA
21. DIAGONAL VIEW OF THE 48' MILL STEAM ENGINE. SPARE ...
21. DIAGONAL VIEW OF THE 48' MILL STEAM ENGINE. SPARE VERTICAL ROLLS ARE VISIBLE TO THE LEFT AND RIGHT OF THE ENGINE. - U.S. Steel Homestead Works, 48" Plate Mill, Along Monongahela River, Homestead, Allegheny County, PA
15. DETAIL OF TOP CHORD, SECONDARY VERTICAL POST, DIAGONAL MEMBERS, ...
15. DETAIL OF TOP CHORD, SECONDARY VERTICAL POST, DIAGONAL MEMBERS, AND TOP LATERAL CONNECTION ON WEST SIDE OF TRUSS, VIEW NORTHWEST - Shaytown Road Bridge, Spanning Thornapple River, Vermontville, Eaton County, MI
The repressed and implicit knowledge.
Talvitie, Vesa; Ihanus, Juhani
2002-12-01
The distinction between implicit (non-conscious) and explicit (conscious) knowledge made by cognitive scientists is applied to the psychoanalytic idea of repressed contents. The consequences of repression are suggested to have been caused by implicit representations. Repressed memories can also be treated in terms of explicit representations, which are prevented from becoming activated. Implicit knowledge cannot, however, be made conscious, and thus the idea of becoming conscious of the repressed desires and fears that have never been conscious is contradictory. This tension may be relieved by reconceptualising the idea of becoming conscious of the repressed. It is suggested that this could be seen as creating explicit knowledge about the effects of implicit representations. By applying the implicit/explicit knowledge distinction, psychoanalytic ideas concerning the repressed could be connected to current views in the domain of cognitive orientation.
Implicit Self-Evaluations Predict Changes in Implicit Partner Evaluations
McNulty, James K.; Baker, Levi R.; Olson, Michael A.
2014-01-01
Do people who feel good about themselves have better relations with others? Although the notion that they do is central to both classic and modern theories, there is little strong evidence to support it. We argue that one reason for the lack of evidence is that prior research has relied exclusively on explicit measures of self- and relationship evaluations. The current longitudinal study of newlywed couples used explicit measures of self-, relationship, and partner evaluations as well as implicit measures of self- and partner evaluations to examine the link between self-evaluations and changes in relationship evaluations over the first three years of marriage. Whereas explicit self-evaluations were unrelated to changes in all interpersonal measures, implicit self-evaluations positively predicted changes in implicit partner evaluations. This finding joins others in highlighting the importance of automatic processes and implicit measures to the study of close interpersonal relationships. PMID:24958686
2012-08-01
Schemes (RDS), Spectral Finite Volume/Difference and standard Finite Element (FE). � explicit ( Runge Kutta n-order) and implicit (3 point-backward, Crank...Numerical method 21 2.1 Space discretization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.1.1 AUSM+ scheme...US3D code developed at the University of Minnesota in Prof. Graham Candlers research group has gained widespread use throughout NASA and U.S. Air
A Computational Model of the Eye for Primary and Secondary Blast Injury
2012-10-01
difference scheme [18] and integrated in time using a four-stage Runge - Kutta method . An eight-order implicit spatial filtering proposed by Gaintonde et...each 9 time step (Figure 4A). In general, there are two coupling methods used in fluid structure interaction algorithms— explicit (or weak, one... method . Prentice-Hall. Englewood Cliffs, NJ, Chapter 9. 25Zygote Media Group , Inc is a developer company for computer-generated 3D graphical
Stiff modes in spinvalve simulations with OOMMF
NASA Astrophysics Data System (ADS)
Mitropoulos, Spyridon; Tsiantos, Vassilis; Ovaliadis, Kyriakos; Kechrakos, Dimitris; Donahue, Michael
2016-04-01
Micromagnetic simulations are an important tool for the investigation of magnetic materials. Micromagnetic software uses various techniques to solve differential equations, partial or ordinary, involved in the dynamic simulations. Euler, Runge-Kutta, Adams, and BDF (Backward Differentiation Formulae) are some of the methods used for this purpose. In this paper, spinvalve simulations are investigated. Evidence is presented showing that these systems have stiff modes, and that implicit methods such as BDF are more effective than explicit methods in such cases.
Multigrid time-accurate integration of Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Arnone, Andrea; Liou, Meng-Sing; Povinelli, Louis A.
1993-01-01
Efficient acceleration techniques typical of explicit steady-state solvers are extended to time-accurate calculations. Stability restrictions are greatly reduced by means of a fully implicit time discretization. A four-stage Runge-Kutta scheme with local time stepping, residual smoothing, and multigridding is used instead of traditional time-expensive factorizations. Some applications to natural and forced unsteady viscous flows show the capability of the procedure.
Axisymmetric fully spectral code for hyperbolic equations
NASA Astrophysics Data System (ADS)
Panosso Macedo, Rodrigo; Ansorg, Marcus
2014-11-01
We present a fully pseudo-spectral scheme to solve axisymmetric hyperbolic equations of second order. With the Chebyshev polynomials as basis functions, the numerical grid is based on the Lobbato (for two spatial directions) and Radau (for the time direction) collocation points. The method solves two issues of previous algorithms which were restricted to one spatial dimension, namely, (i) the inversion of a dense matrix and (ii) the acquisition of a sufficiently good initial-guess for non-linear systems of equations. For the first issue, we use the iterative bi-conjugate gradient stabilized method, which we equip with a pre-conditioner based on a singly diagonally implicit Runge-Kutta (“SDIRK”-) method. In this paper, the SDIRK-method is also used to solve issue (ii). The numerical solutions are correct up to machine precision and we do not observe any restriction concerning the time step in comparison with the spatial resolution. As an application, we solve general-relativistic wave equations on a black-hole space-time in so-called hyperboloidal slices and reproduce some recent results available in the literature.
NASA Astrophysics Data System (ADS)
Bidadi, Shreyas; Rani, Sarma L.
2016-01-01
The authors regret that in Fig. 8(c) of the paper, the labels for the dimensionless time t* and flatness S4, as well as the plot legend are incorrect. In place of the original figure, the following figure should be used.
Implicit Numerical Methods in Meteorology
NASA Technical Reports Server (NTRS)
Augenbaum, J.
1984-01-01
The development of a fully implicit finite-difference model, whose time step is chosen solely to resolve accurately the physical flow of interest is discussed. The method is based on an operator factorization which reduces the dimensionality of the implicit approach: at each time step only (spatially) one-dimensional block-tridiagonal linear systems must be solved. The scheme uses two time levels and is second-order accurate in time. Compact implicit spatial differences are used, yielding fourth-order accuracy both vertically and horizontally. In addition, the development of a fully interactive computer code is discussed. With this code the user will have a choice of models, with various levels of accuracy and sophistication, which are imbedded, as subsets of the fully implicit 3D code.
Correlations and diagonal entropy after quantum quenches in XXZ chains
NASA Astrophysics Data System (ADS)
Piroli, Lorenzo; Vernier, Eric; Calabrese, Pasquale; Rigol, Marcos
2017-02-01
We study quantum quenches in the XXZ spin-1 /2 Heisenberg chain from families of ferromagnetic and antiferromagnetic initial states. Using Bethe ansatz techniques, we compute short-range correlators in the complete generalized Gibbs ensemble (GGE), which takes into account all local and quasilocal conservation laws. We compare our results to exact diagonalization and numerical linked cluster expansion calculations for the diagonal ensemble, finding excellent agreement and thus providing a very accurate test for the validity of the complete GGE. Furthermore, we use exact diagonalization to compute the diagonal entropy in the postquench steady state. We show that the Yang-Yang entropy for the complete GGE is consistent with twice the value of the diagonal entropy in the largest chains or the extrapolated result in the thermodynamic limit. Finally, the complete GGE is quantitatively contrasted with the GGE built using only the local conserved charges (local GGE). The predictions of the two ensembles are found to differ significantly in the case of ferromagnetic initial states. Such initial states are better suited than others considered in the literature to experimentally test the validity of the complete GGE and contrast it to the failure of the local GGE.
NASA Astrophysics Data System (ADS)
Doha, E. H.; Bhrawy, A. H.; Abdelkawy, M. A.; Van Gorder, Robert A.
2014-03-01
A Jacobi-Gauss-Lobatto collocation (J-GL-C) method, used in combination with the implicit Runge-Kutta method of fourth order, is proposed as a numerical algorithm for the approximation of solutions to nonlinear Schrödinger equations (NLSE) with initial-boundary data in 1+1 dimensions. Our procedure is implemented in two successive steps. In the first one, the J-GL-C is employed for approximating the functional dependence on the spatial variable, using (N-1) nodes of the Jacobi-Gauss-Lobatto interpolation which depends upon two general Jacobi parameters. The resulting equations together with the two-point boundary conditions induce a system of 2(N-1) first-order ordinary differential equations (ODEs) in time. In the second step, the implicit Runge-Kutta method of fourth order is applied to solve this temporal system. The proposed J-GL-C method, used in combination with the implicit Runge-Kutta method of fourth order, is employed to obtain highly accurate numerical approximations to four types of NLSE, including the attractive and repulsive NLSE and a Gross-Pitaevskii equation with space-periodic potential. The numerical results obtained by this algorithm have been compared with various exact solutions in order to demonstrate the accuracy and efficiency of the proposed method. Indeed, for relatively few nodes used, the absolute error in our numerical solutions is sufficiently small.
Using off-diagonal confinement as a cooling method
Rousseau, V. G.; Hettiarachchilage, K.; Jarrell, M.; Moreno, J.; Sheehy, D. E.
2010-12-15
In a recent letter [Phys. Rev. Lett. 104, 167201 (2010)] we proposed a new confining method for ultracold atoms on optical lattices, which is based on off-diagonal confinement (ODC). This method was shown to have distinct advantages over the conventional diagonal confinement (DC), which makes use of a trapping potential, such as the existence of pure Mott phases and highly populated condensates. In this manuscript we show that the ODC method can also lead to lower temperatures than the DC method for a wide range of control parameters. Using exact diagonalization we determine this range of parameters for the hard-core case and then we extend our results to the soft-core case by performing quantum Monte Carlo (QMC) simulations for both DC and ODC systems at fixed temperature and analyzing the corresponding entropies. We also propose a method for measuring the entropy in QMC simulations.
Critical range evaluation using a diagonal flat plate
NASA Technical Reports Server (NTRS)
Lee, Teh-Hong; Clark, Tony L.; Burnside, Walter D.; Gupta, Inder J.
1992-01-01
A novel technique is presented to image stray signals in RCS measurement ranges. In this technique, the scattered fields of a flat plate in the diagonal plane are measured in a range for various frequencies and look angles. The scattered field data is then processed to generate an inverse synthetic aperture radar (ISAR) image of the diagonal flat plate. It is shown that scattering mechanisms associated with various stray signals can be identified by using the ISAR image. This leads to better understanding of the range and possible chamber improvements. Scattering mechanisms as small as 90 dB below the plate broadside scattered field level have been observed in the image domain due to the high directivity and low sidelobe characteristics associated with the diagonal flat plate backscattered fields. The results obtained from evaluating the two compact range facilities at The Ohio State University ElectroScience Laboratory are presented to illustrate the virtues of this new range evaluation technique.
Semi-implicit finite difference methods for three-dimensional shallow water flow
Casulli, Vincenzo; Cheng, Ralph T.
1992-01-01
A semi-implicit finite difference method for the numerical solution of three-dimensional shallow water flows is presented and discussed. The governing equations are the primitive three-dimensional turbulent mean flow equations where the pressure distribution in the vertical has been assumed to be hydrostatic. In the method of solution a minimal degree of implicitness has been adopted in such a fashion that the resulting algorithm is stable and gives a maximal computational efficiency at a minimal computational cost. At each time step the numerical method requires the solution of one large linear system which can be formally decomposed into a set of small three-diagonal systems coupled with one five-diagonal system. All these linear systems are symmetric and positive definite. Thus the existence and uniquencess of the numerical solution are assured. When only one vertical layer is specified, this method reduces as a special case to a semi-implicit scheme for solving the corresponding two-dimensional shallow water equations. The resulting two- and three-dimensional algorithm has been shown to be fast, accurate and mass-conservative and can also be applied to simulate flooding and drying of tidal mud-flats in conjunction with three-dimensional flows. Furthermore, the resulting algorithm is fully vectorizable for an efficient implementation on modern vector computers.
Quantum Discord of 2 n -Dimensional Bell-Diagonal States
NASA Astrophysics Data System (ADS)
Jafarizadeh, M. A.; Karimi, N.; Amidi, D.; Zahir Olyaei, H.
2016-03-01
In this study, using the concept of relative entropy as a distance measure of correlations we investigate the important issue of evaluating quantum correlations such as entanglement, dissonance and classical correlations for 2 n -dimensional Bell-diagonal states. We provide an analytical technique, which describes how we find the closest classical states(CCS) and the closest separable states(CSS) for these states. Then analytical results are obtained for quantum discord of 2 n -dimensional Bell-diagonal states. As illustration, some special cases are examined. Finally, we investigate the additivity relation between the different correlations for the separable generalized Bloch sphere states.
Spectral sharpening of color sensors: diagonal color constancy and beyond.
Vazquez-Corral, Javier; Bertalmío, Marcelo
2014-02-26
It has now been 20 years since the seminal work by Finlayson et al. on the use of spectral sharpening of sensors to achieve diagonal color constancy. Spectral sharpening is still used today by numerous researchers for different goals unrelated to the original goal of diagonal color constancy e.g., multispectral processing, shadow removal, location of unique hues. This paper reviews the idea of spectral sharpening through the lens of what is known today in color constancy, describes the different methods used for obtaining a set of sharpening sensors and presents an overview of the many different uses that have been found for spectral sharpening over the years.
A brief introduction to symplectic integrators and recent results
Channell, P.J.
1994-02-01
The author begins with a brief synopsis about Hamiltonian systems and symplectic maps. A symplectic integrator is a symplectic map {phi}(q,p;t) that systematically approximates the time t flow of a Hamiltonian system. Systematic means: (1) in time step, t, i.e. the error should vanish as some power of the time step, and (2) in order of approximation, i.e. one would like a hierarchy of such {phi} that have errors that vanish as successively higher powers of the time step. At present the authors known two general types of symplectic integrators: (1) implicit integrators that are derived from a generating function or from algebraic conditions on Runge-Kutta schemes, and (2) explicit integrators that are derived from integrable Hamiltonians or from algebraic conditions on Runge-Kutta schemes.
NASA Astrophysics Data System (ADS)
Klaij, C. M.; van der Vegt, J. J. W.; van der Ven, H.
2006-12-01
The space-time discontinuous Galerkin discretization of the compressible Navier-Stokes equations results in a non-linear system of algebraic equations, which we solve with pseudo-time stepping methods. We show that explicit Runge-Kutta methods developed for the Euler equations suffer from a severe stability constraint linked to the viscous part of the equations and propose an alternative to relieve this constraint while preserving locality. To evaluate its effectiveness, we compare with an implicit-explicit Runge-Kutta method which does not suffer from the viscous stability constraint. We analyze the stability of the methods and illustrate their performance by computing the flow around a 2D airfoil and a 3D delta wing at low and moderate Reynolds numbers.
Navier-Stokes cascade analysis with a stiff Kappa-Epsilon turbulence solver
NASA Technical Reports Server (NTRS)
Liu, Jong-Shang; Sockol, Peter M.; Prahl, Joseph M.
1987-01-01
The two dimensional, compressible, thin layer Navier-Stokes equations with the Baldwin-Lomax turbulence model and the kinetic energy-energy dissipation (k-epsilon) model are solved numerically to simulate the flow through a cascade. The governing equations are solved for the entire flow domain, without the boundary layer assumptions. The stiffness of the k-epsilon equations is discussed. A semi-implicit, Runge-Kutta, time-marching scheme is developed to solve the k-epsilon equations. The impact of the k-epsilon solver on the explicit Runge-Kutta Navier-Stokes solver is discussed. Numerical solutions are presented for two dimensional turbulent flow over a flat plate and a double circular arc cascade and compared with experimental data.
Navier-Stokes cascade analysis with a stiff k-epsilon turbulence solver
NASA Technical Reports Server (NTRS)
Liu, Jong-Shang; Sockol, Peter M.; Prahl, Joseph M.
1988-01-01
The two dimensional, compressible, thin layer Navier-Stokes equations with the Baldwin-Lomax turbulence model and the kinetic energy-energy dissipation (k-epsilon) model are solved numerically to simulate the flow through a cascade. The governing equations are solved for the entire flow domain, without the boundary layer assumptions. The stiffness of the k-epsilon equations is discussed. A semi-implicit, Runge-Kutta, time-marching scheme is developed to solve the k-epsilon equations. The impact of the k-epsilon solver on the explicit Runge-Kutta Navier-Stokes solver is discussed. Numerical solutions are presented for two dimensional turbulent flow over a flat plate and a double circular arc cascade and compared with experimental data.
NASA Technical Reports Server (NTRS)
Atkins, Harold
1991-01-01
A multiple block multigrid method for the solution of the three dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell vertex method which employs central difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques and variable coefficient numerical dissipation results in an efficient and robust scheme is discussed. The multiblock strategy places the block loop within the Runge-Kutta Loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one and two block calculations in which the two block grid is generated by splitting the one block grid. Results are presented for both Euler and Navier-Stokes computations of wing/fuselage combinations.
On stability of diagonal actions and tensor invariants
Anisimov, Artem B
2012-04-30
For a connected simply connected semisimple algebraic group G we prove the existence of invariant tensors in certain tensor powers of rational G-modules and establish relations between the existence of such invariant tensors and stability of diagonal actions of G on affine algebraic varieties. Bibliography: 12 titles.
Improving stochastic estimates with inference methods: Calculating matrix diagonals
NASA Astrophysics Data System (ADS)
Selig, Marco; Oppermann, Niels; Enßlin, Torsten A.
2012-02-01
Estimating the diagonal entries of a matrix, that is not directly accessible but only available as a linear operator in the form of a computer routine, is a common necessity in many computational applications, especially in image reconstruction and statistical inference. Here, methods of statistical inference are used to improve the accuracy or the computational costs of matrix probing methods to estimate matrix diagonals. In particular, the generalized Wiener filter methodology, as developed within information field theory, is shown to significantly improve estimates based on only a few sampling probes, in cases in which some form of continuity of the solution can be assumed. The strength, length scale, and precise functional form of the exploited autocorrelation function of the matrix diagonal is determined from the probes themselves. The developed algorithm is successfully applied to mock and real world problems. These performance tests show that, in situations where a matrix diagonal has to be calculated from only a small number of computationally expensive probes, a speedup by a factor of 2 to 10 is possible with the proposed method.
Penguins and Pandas: A Note on Teaching Cantor's Diagonal Argument
ERIC Educational Resources Information Center
Rauff, James V.
2008-01-01
Cantor's diagonal proof that the set of real numbers is uncountable is one of the most famous arguments in modern mathematics. Mathematics students usually see this proof somewhere in their undergraduate experience, but it is rarely a part of the mathematical curriculum of students of the fine arts or humanities. This note describes contexts that…
Why the South Pacific Convergence Zone is diagonal
NASA Astrophysics Data System (ADS)
van der Wiel, Karin; Matthews, Adrian J.; Joshi, Manoj M.; Stevens, David P.
2016-03-01
During austral summer, the majority of precipitation over the Pacific Ocean is concentrated in the South Pacific Convergence Zone (SPCZ). The surface boundary conditions required to support the diagonally (northwest-southeast) oriented SPCZ are determined through a series of experiments with an atmospheric general circulation model. Continental configuration and orography do not have a significant influence on SPCZ orientation and strength. The key necessary boundary condition is the zonally asymmetric component of the sea surface temperature (SST) distribution. This leads to a strong subtropical anticyclone over the southeast Pacific that, on its western flank, transports warm moist air from the equator into the SPCZ region. This moisture then intensifies (diagonal) bands of convection that are initiated by regions of ascent and reduced static stability ahead of the cyclonic vorticity in Rossby waves that are refracted toward the westerly duct over the equatorial Pacific. The climatological SPCZ is comprised of the superposition of these diagonal bands of convection. When the zonally asymmetric SST component is reduced or removed, the subtropical anticyclone and its associated moisture source is weakened. Despite the presence of Rossby waves, significant moist convection is no longer triggered; the SPCZ disappears. The diagonal SPCZ is robust to large changes (up to ±6 °C) in absolute SST (i.e. where the SST asymmetry is preserved). Extreme cooling (change <-6 °C) results in a weaker and more zonal SPCZ, due to decreasing atmospheric temperature, moisture content and convective available potential energy.
1. Aerial view of turnpike path running diagonally up from ...
1. Aerial view of turnpike path running diagonally up from lower left (present-day Orange Turnpike alignment) and containing on towards upper right through tree clump in center of the bare spot on the landscape, and on through the trees. View looking south. - Orange Turnpike, Parallel to new Orange Turnpike, Monroe, Orange County, NY
34. Coal Fuel Elevator (diagonal in foreground), Fuel Elevator (left), ...
34. Coal Fuel Elevator (diagonal in foreground), Fuel Elevator (left), Fuel Storage Bins (center), and Power Plant (far center), and Retail Coal Storage Bins (right) Photograph taken by George Harven - Huber Coal Breaker, 101 South Main Street, Ashley, Luzerne County, PA
35. Coal Fuel Elevator (diagonal in center), Fuel Elevator (left), ...
35. Coal Fuel Elevator (diagonal in center), Fuel Elevator (left), Fuel Storage Bins (center), and Power Plant (far center), and Retail Coal Storage Bins (right) Photograph taken by George Harven - Huber Coal Breaker, 101 South Main Street, Ashley, Luzerne County, PA
Posture modulates implicit hand maps.
Longo, Matthew R
2015-11-01
Several forms of somatosensation require that afferent signals be informed by stored representations of body size and shape. Recent results have revealed that position sense relies on a highly distorted body representation. Changes of internal hand posture produce plastic alterations of processing in somatosensory cortex. This study therefore investigated how such postural changes affect implicit body representations underlying position sense. Participants localised the knuckles and tips of each finger in external space in two postures: the fingers splayed (Apart posture) or pressed together (Together posture). Comparison of the relative locations of the judgments of each landmark were used to construct implicit maps of represented hand structure. Spreading the fingers apart produced increases in the implicit representation of hand size, with no apparent effect on hand shape. Thus, changes of internal hand posture produce rapid modulation of how the hand itself is represented, paralleling the known effects on somatosensory cortical processing.
Implicit emotional awareness in frontotemporal dementia.
Ibáñez, Agustín; Velásquez, María Marcela; Caro, Miguel Martorell; Manes, Facundo
2013-01-01
The preserved "implicit awareness" in patients with Alzheimer disease (AD) presenting anosognosia has opened a new branch of research regarding explicit-implicit integration. The behavioral variant of frontotemporal dementia (bvFTD), contrary to AD, would present impaired anosognosia-related implicit awareness due to a dysfunctional implicit integration of contextual information caused by an abnormal fronto-insular-temporal network. Loss of insight and anosognosia are pervasive in bvFTD, but no reports have assessed the implicit emotional awareness in this condition. We emphasize the need to investigate and extend our knowledge of implicit contextual integration impairments and their relation with anosognosia in bvFTD vs AD.
Ego depletion impairs implicit learning.
Thompson, Kelsey R; Sanchez, Daniel J; Wesley, Abigail H; Reber, Paul J
2014-01-01
Implicit skill learning occurs incidentally and without conscious awareness of what is learned. However, the rate and effectiveness of learning may still be affected by decreased availability of central processing resources. Dual-task experiments have generally found impairments in implicit learning, however, these studies have also shown that certain characteristics of the secondary task (e.g., timing) can complicate the interpretation of these results. To avoid this problem, the current experiments used a novel method to impose resource constraints prior to engaging in skill learning. Ego depletion theory states that humans possess a limited store of cognitive resources that, when depleted, results in deficits in self-regulation and cognitive control. In a first experiment, we used a standard ego depletion manipulation prior to performance of the Serial Interception Sequence Learning (SISL) task. Depleted participants exhibited poorer test performance than did non-depleted controls, indicating that reducing available executive resources may adversely affect implicit sequence learning, expression of sequence knowledge, or both. In a second experiment, depletion was administered either prior to or after training. Participants who reported higher levels of depletion before or after training again showed less sequence-specific knowledge on the post-training assessment. However, the results did not allow for clear separation of ego depletion effects on learning versus subsequent sequence-specific performance. These results indicate that performance on an implicitly learned sequence can be impaired by a reduction in executive resources, in spite of learning taking place outside of awareness and without conscious intent.
Implicit Learning of Nonlocal Musical Rules: Implicitly Learning More Than Chunks
ERIC Educational Resources Information Center
Kuhn, Gustav; Dienes, Zoltan
2005-01-01
Dominant theories of implicit learning assume that implicit learning merely involves the learning of chunks of adjacent elements in a sequence. In the experiments presented here, participants implicitly learned a nonlocal rule, thus suggesting that implicit learning can go beyond the learning of chunks. Participants were exposed to a set of…
Semantic Generalization in Implicit Language Learning
ERIC Educational Resources Information Center
Paciorek, Albertyna; Williams, John N.
2015-01-01
Despite many years of investigation into implicit learning in nonlinguistic domains, the potential for implicit learning to deliver the kinds of generalizations that underlie natural language competence remains unclear. In a series of experiments, we investigated implicit learning of the semantic preferences of novel verbs, specifically, whether…
Integrating Implicit Bias into Counselor Education
ERIC Educational Resources Information Center
Boysen, Guy A.
2010-01-01
The author reviews the empirical and theoretical literature on implicit bias as it relates to counselor education. Counselor educators can integrate implicit bias into the concepts of multicultural knowledge, awareness, and skill. Knowledge about implicit bias includes its theoretical explanation, measurement, and impact on counseling. Awareness…
Off-diagonal Jacobian support for Nodal BCs
Peterson, John W.; Andrs, David; Gaston, Derek R.; Permann, Cody J.; Slaughter, Andrew E.
2015-01-01
In this brief note, we describe the implementation of o-diagonal Jacobian computations for nodal boundary conditions in the Multiphysics Object Oriented Simulation Environment (MOOSE) [1] framework. There are presently a number of applications [2{5] based on the MOOSE framework that solve complicated physical systems of partial dierential equations whose boundary conditions are often highly nonlinear. Accurately computing the on- and o-diagonal Jacobian and preconditioner entries associated to these constraints is crucial for enabling ecient numerical solvers in these applications. Two key ingredients are required for properly specifying the Jacobian contributions of nonlinear nodal boundary conditions in MOOSE and nite element codes in general: 1. The ability to zero out entire Jacobian matrix rows after \
Block-bordered diagonalization and parallel iterative solvers
Alvarado, F.; Dag, H.; Bruggencate, M. ten
1994-12-31
One of the most common techniques for enhancing parallelism in direct sparse matrix methods is the reorganization of a matrix into a blocked-bordered structure. Incomplete LDU factorization is a very good preconditioner for PCG in serial environments. However, the inherent sequential nature of the preconditioning step makes it less desirable in parallel environments. This paper explores the use of BBD (Blocked Bordered Diagonalization) in connection with ILU preconditioners. The paper shows that BBD-based ILU preconditioners are quite amenable to parallel processing. Neglecting entries from the entire border can result in a blocked diagonal matrix. The result is a great increase in parallelism at the expense of additional iterations. Experiments on the Sequent Symmetry shared memory machine using (mostly) power system that matrices indicate that the method is generally better than conventional ILU preconditioners and in many cases even better than partitioned inverse preconditioners, without the initial setup disadvantages of partitioned inverse preconditioners.
Lee, Jun Chang; Nam, Kyoung Won; Jang, Dong Pyo; Kim, In Young
2015-12-01
Previously suggested diagonal-steering algorithms for binaural hearing support devices have commonly assumed that the direction of the speech signal is known in advance, which is not always the case in many real circumstances. In this study, a new diagonal-steering-based binaural speech localization (BSL) algorithm is proposed, and the performances of the BSL algorithm and the binaural beamforming algorithm, which integrates the BSL and diagonal-steering algorithms, were evaluated using actual speech-in-noise signals in several simulated listening scenarios. Testing sounds were recorded in a KEMAR mannequin setup and two objective indices, improvements in signal-to-noise ratio (SNRi ) and segmental SNR (segSNRi ), were utilized for performance evaluation. Experimental results demonstrated that the accuracy of the BSL was in the 90-100% range when input SNR was -10 to +5 dB range. The average differences between the γ-adjusted and γ-fixed diagonal-steering algorithms (for -15 to +5 dB input SNR) in the talking in the restaurant scenario were 0.203-0.937 dB for SNRi and 0.052-0.437 dB for segSNRi , and in the listening while car driving scenario, the differences were 0.387-0.835 dB for SNRi and 0.259-1.175 dB for segSNRi . In addition, the average difference between the BSL-turned-on and the BSL-turned-off cases for the binaural beamforming algorithm in the listening while car driving scenario was 1.631-4.246 dB for SNRi and 0.574-2.784 dB for segSNRi . In all testing conditions, the γ-adjusted diagonal-steering and BSL algorithm improved the values of the indices more than the conventional algorithms. The binaural beamforming algorithm, which integrates the proposed BSL and diagonal-steering algorithm, is expected to improve the performance of the binaural hearing support devices in noisy situations.
Diagonalization and representation results for nonpositive sesquilinear form measures
NASA Astrophysics Data System (ADS)
Hytönen, Tuomas; Pellonpää, Juha-Pekka; Ylinen, Kari
2008-02-01
We study decompositions of operator measures and more general sesquilinear form measures E into linear combinations of positive parts, and their diagonal vector expansions. The underlying philosophy is to represent E as a trace class valued measure of bounded variation on a new Hilbert space related to E. The choice of the auxiliary Hilbert space fixes a unique decomposition with certain properties, but this choice itself is not canonical. We present relations to Naimark type dilations and direct integrals.
A Summary of Diagonal Tension Part I : Methods of Analysis
NASA Technical Reports Server (NTRS)
Kuhn, Paul; Peterson, James P; Levin, L Ross
1952-01-01
Previously published methods for stress and strength analysis of plane and curved shear webs working in diagonal tension are presented as a unified method. The treatment is sufficiently comprehensive and detailed to make the paper self-contained. Part 1 discusses the theory and methods for calculating the stresses and shear deflections of web systems as well as the strengths of the web, the stiffeners, and the riveting. Part 2, published separately, presents the experimental evidence. (author)
INTERIOR OF HOG BARN SHOWING MILKING STANCHIONS AND DIAGONAL SHEATHING, ...
INTERIOR OF HOG BARN SHOWING MILKING STANCHIONS AND DIAGONAL SHEATHING, LOOKING EAST. (In the 1940s the hog barn was converted to a calf barn to service the growing dairy. After a fire on the property took the Engles main barn in 1954, the building was converted into a milking parlor.) - Engle Farm, Barn, 89 South Ebey Road, Coupeville, Island County, WA
Covariant diagonalization of the perfect fluid stress-energy tensor
NASA Astrophysics Data System (ADS)
Garat, Alcides
2015-02-01
We introduce new tetrads that manifestly and covariantly diagonalize the stress-energy tensor for a perfect fluid with vorticity at every spacetime point. This new tetrad can be applied to introduce simplification in the analysis of astrophysical relativistic problems where vorticity is present through the Carter-Lichnerowicz equation. We also discuss the origin of inertia in this special case from the standpoint of our new local tetrads.
Efficient variational diagonalization of fully many-body localized Hamiltonians
NASA Astrophysics Data System (ADS)
Pollmann, Frank; Khemani, Vedika; Cirac, J. Ignacio; Sondhi, S. L.
2016-07-01
We introduce a variational unitary matrix product operator based variational method that approximately finds all the eigenstates of fully many-body localized one-dimensional Hamiltonians. The computational cost of the variational optimization scales linearly with system size for a fixed depth of the UTN ansatz. We demonstrate the usefulness of our approach by considering the Heisenberg chain in a strongly disordered magnetic field for which we compare the approximation to exact diagonalization results.
NASA Astrophysics Data System (ADS)
Jiang, Zhen-Hua; Yan, Chao; Yu, Jian
2013-08-01
Two types of implicit algorithms have been improved for high order discontinuous Galerkin (DG) method to solve compressible Navier-Stokes (NS) equations on triangular grids. A block lower-upper symmetric Gauss-Seidel (BLU-SGS) approach is implemented as a nonlinear iterative scheme. And a modified LU-SGS (LLU-SGS) approach is suggested to reduce the memory requirements while retain the good convergence performance of the original LU-SGS approach. Both implicit schemes have the significant advantage that only the diagonal block matrix is stored. The resulting implicit high-order DG methods are applied, in combination with Hermite weighted essentially non-oscillatory (HWENO) limiters, to solve viscous flow problems. Numerical results demonstrate that the present implicit methods are able to achieve significant efficiency improvements over explicit counterparts and for viscous flows with shocks, and the HWENO limiters can be used to achieve the desired essentially non-oscillatory shock transition and the designed high-order accuracy simultaneously.
Diagonal dominance for the multivariable Nyquist array using function minimization
NASA Technical Reports Server (NTRS)
Leininger, G. G.
1977-01-01
A new technique for the design of multivariable control systems using the multivariable Nyquist array method was developed. A conjugate direction function minimization algorithm is utilized to achieve a diagonal dominant condition over the extended frequency range of the control system. The minimization is performed on the ratio of the moduli of the off-diagonal terms to the moduli of the diagonal terms of either the inverse or direct open loop transfer function matrix. Several new feedback design concepts were also developed, including: (1) dominance control parameters for each control loop; (2) compensator normalization to evaluate open loop conditions for alternative design configurations; and (3) an interaction index to determine the degree and type of system interaction when all feedback loops are closed simultaneously. This new design capability was implemented on an IBM 360/75 in a batch mode but can be easily adapted to an interactive computer facility. The method was applied to the Pratt and Whitney F100 turbofan engine.
Block diagonal representations for covariance based anomalous change detectors
Matsekh, Anna; Theiler, James
2009-01-01
Change detection methods are of crucial importance in many remote sensing applications such as monitoring and surveillance, where the goal is to identify and separate changes of interest from pervasive changes inevitably present in images taken at different times and in different environmental and illumination conditions. Anomalous change detection (ACD) methods aim to identify rare, unusual, or anomalous changes among the changes of interest. Covariance-based ACD methods provide a powerful tool for detection of unusual changes in hyper-spectral images. In this paper we study the properties of the eigenvalue spectra of a family of ACD matrices in order to better understand the algebraic and numerical behavior of the covariance-based quadratic ACD methods. We propose to use singular vectors of covariance matrices of two hyper-spectral images in whitened coordinates for obtaining block-diagonal representations of the matrices of quadratic ACD methods. SVD transformation gives an equivalent representation of ACD matrices in compact block-diagonal form. In the paper we show that the eigenvalue spectrum of a block-diagonal ACD matrix can be identified analytically as a function of the singular value spectrum of the corresponding covariance matrix in whitened coordinates.
Off-Diagonal Decay of Toric Bergman Kernels
NASA Astrophysics Data System (ADS)
Zelditch, Steve
2016-12-01
We study the off-diagonal decay of Bergman kernels {Π_{h^k}(z,w)} and Berezin kernels {P_{h^k}(z,w)} for ample invariant line bundles over compact toric projective kähler manifolds of dimension m. When the metric is real analytic, {P_{h^k}(z,w) ˜eq k^m exp - k D(z,w)} where {D(z,w)} is the diastasis. When the metric is only {C^{∞}} this asymptotic cannot hold for all {(z,w)} since the diastasis is not even defined for all {(z,w)} close to the diagonal. Our main result is that for general toric {C^{∞}} metrics, {P_{h^k}(z,w) ˜eq k^m exp - k D(z,w)} as long as w lies on the {R_+^m}-orbit of z, and for general {(z,w)}, {lim sup_{k to ∞} 1/k log P_{h^k}(z,w) ≤ - D(z^*,w^*)} where {D(z, w^*)} is the diastasis between z and the translate of w by {(S^1)^m} to the {R_+^m} orbit of z. These results are complementary to Mike Christ's negative results showing that {P_{h^k}(z,w)} does not have off-diagonal exponential decay at "speed" k if {(z,w)} lies on the same {(S^1)^m}-orbit.
Ordered Subspace Clustering With Block-Diagonal Priors.
Wu, Fei; Hu, Yongli; Gao, Junbin; Sun, Yanfeng; Yin, Baocai
2016-12-01
Many application scenarios involve sequential data, but most existing clustering methods do not well utilize the order information embedded in sequential data. In this paper, we study the subspace clustering problem for sequential data and propose a new clustering method, namely ordered sparse clustering with block-diagonal prior (BD-OSC). Instead of using the sparse normalizer in existing sparse subspace clustering methods, a quadratic normalizer for the data sparse representation is adopted to model the correlation among the data sparse coefficients. Additionally, a block-diagonal prior for the spectral clustering affinity matrix is integrated with the model to improve clustering accuracy. To solve the proposed BD-OSC model, which is a complex optimization problem with quadratic normalizer and block-diagonal prior constraint, an efficient algorithm is proposed. We test the proposed clustering method on several types of databases, such as synthetic subspace data set, human face database, video scene clips, motion tracks, and dynamic 3-D face expression sequences. The experiments show that the proposed method outperforms state-of-the-art subspace clustering methods.
Yao, Yao; Zhou, Nengji; Prior, Javier; Zhao, Yang
2015-01-01
It has long been a puzzle on what drives charge separation in artificial polymeric solar cells as a consensus has yet to emerge among rivaling theories based upon electronic localization and delocalization pictures. Here we propose an alternative using the two-bath spin-boson model with simultaneous diagonal and off-diagonal coupling: the critical phase, which is born out of the competition of the two coupling types, and is neither localized nor delocalized. The decoherence-free feature of the critical phase also helps explain sustained coherence of the charge-transfer state. Exploiting Hamiltonian symmetries in an enhanced algorithm of density-matrix renormalization group, we map out boundaries of the critical phase to a precision previously unattainable, and determine the bath spectral densities inducive to the existence of the charge-transfer state. PMID:26412693
Revealing children's implicit spelling representations.
Critten, Sarah; Pine, Karen J; Messer, David J
2013-06-01
Conceptualizing the underlying representations and cognitive mechanisms of children's spelling development is a key challenge for literacy researchers. Using the Representational Redescription model (Karmiloff-Smith), Critten, Pine and Steffler (2007) demonstrated that the acquisition of phonological and morphological knowledge may be underpinned by increasingly explicit levels of spelling representation. However, their proposal that implicit representations may underlie early 'visually based' spelling remains unresolved. Children (N = 101, aged 4-6 years) were given a recognition task (Critten et al., 2007) and a novel production task, both involving verbal justifications of why spellings are correct/incorrect, strategy use and word pattern similarity. Results for both tasks supported an implicit level of spelling characterized by the ability to correctly recognize/produce words but the inability to explain operational strategies or generalize knowledge. Explicit levels and multiple representations were also in evidence across the two tasks. Implications for cognitive mechanisms underlying spelling development are discussed.
[Psychological theory and implicit sociology.].
Sévigny, R
1983-01-01
This text is based on the hypothesis that every theory on the psychology of personality must inevitably, in one manner or another, have a sociological referent, that is to say, it must refer to a body of knowledge which deals with a diversity of social contexts and their relations to individuals. According to this working hypothesis, such a sociology is implicit. This text then discusses a group of theoretical approaches in an effort to verify this hypothesis. This approach allows the extrication of diverse forms or diverse expressions of this implicit sociology within this context several currents are rapidly explored : psychoanalysis, behaviorism, gestalt, classical theory of needs. The author also comments on the approach, inspired by oriental techniques or philosophies, which employs the notion of myth to deepen self awareness. Finally, from the same perspective, he comments at greater length on the work of Carl Rogers, highlighting the diverse form of implicit sociology. In addition to Carl Rogers, this text refers to Freud, Jung, Adler, Reich, Perls, Goodman, Skinner as well as to Ginette Paris and various analysts of Taoism. In conclusion, the author indicates the significance of his analysis from double viewpoint of psychological theory and practice.
NASA Astrophysics Data System (ADS)
Ha, Sanghyun; You, Donghyun
2015-11-01
Utility of the computational power of Graphics Processing Units (GPUs) is elaborated for solutions of both incompressible and compressible Navier-Stokes equations. A semi-implicit ADI finite-volume method for integration of the incompressible and compressible Navier-Stokes equations, which are discretized on a structured arbitrary grid, is parallelized for GPU computations using CUDA (Compute Unified Device Architecture). In the semi-implicit ADI finite-volume method, the nonlinear convection terms and the linear diffusion terms are integrated in time using a combination of an explicit scheme and an ADI scheme. Inversion of multiple tri-diagonal matrices is found to be the major challenge in GPU computations of the present method. Some of the algorithms for solving tri-diagonal matrices on GPUs are evaluated and optimized for GPU-acceleration of the present semi-implicit ADI computations of incompressible and compressible Navier-Stokes equations. Supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning Grant NRF-2014R1A2A1A11049599.
Diagonal queue medical image steganography with Rabin cryptosystem.
Jain, Mamta; Lenka, Saroj Kumar
2016-03-01
The main purpose of this work is to provide a novel and efficient method to the image steganography area of research in the field of biomedical, so that the security can be given to the very precious and confidential sensitive data of the patient and at the same time with the implication of the highly reliable algorithms will explode the high security to the precious brain information from the intruders. The patient information such as patient medical records with personal identification information of patients can be stored in both storage and transmission. This paper describes a novel methodology for hiding medical records like HIV reports, baby girl fetus, and patient's identity information inside their Brain disease medical image files viz. scan image or MRI image using the notion of obscurity with respect to a diagonal queue least significant bit substitution. Data structure queue plays a dynamic role in resource sharing between multiple communication parties and when secret medical data are transferred asynchronously (secret medical data not necessarily received at the same rate they were sent). Rabin cryptosystem is used for secret medical data writing, since it is computationally secure against a chosen-plaintext attack and shows the difficulty of integer factoring. The outcome of the cryptosystem is organized in various blocks and equally distributed sub-blocks. In steganography process, various Brain disease cover images are organized into various blocks of diagonal queues. The secret cipher blocks and sub-blocks are assigned dynamically to selected diagonal queues for embedding. The receiver gets four values of medical data plaintext corresponding to one ciphertext, so only authorized receiver can identify the correct medical data. Performance analysis was conducted using MSE, PSNR, maximum embedding capacity as well as by histogram analysis between various Brain disease stego and cover images.
Convergence to Diagonal Form of Block Jacobi-type Processes
NASA Astrophysics Data System (ADS)
Hari, Vjeran
2008-09-01
The main result of recent research on convergence to diagonal form of block Jacobi-type processes is presented. For this purpose, all notions needed to describe the result are introduced. In particular, elementary block transformation matrices, simple and non-simple algorithms, block pivot strategies together with the appropriate equivalence relations are defined. The general block Jacobi-type process considered here can be specialized to take the form of almost any known Jacobi-type method for solving the ordinary or the generalized matrix eigenvalue and singular value problems. The assumptions used in the result are satisfied by many concrete methods.
Dynamical dimer-dimer correlation functions from exact diagonalization
Werner, Ralph
2001-05-01
A regularization method is presented to deduce dynamic correlation functions from exact diagonalization calculations. It is applied to dimer-dimer correlation functions in quantum spin chains relevant for the description of spin-Peierls systems. Exact results for the XY model are presented. The analysis draws into doubt that the dimer-dimer correlation functions show the same scale invariance as spin-spin correlation functions. The results are applied to describe the quasielastic scattering in CuGeO{sub 3} and the hardening of the Peierls-active phonons.
Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition
Weinstein, Marvin; Auerbach, Assa; Chandra, V.Ravi; /Technion
2011-11-04
We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements. The lattice of size N is partitioned into two subclusters. At each iteration the Lanczos vector is projected into a set of n{sub svd} smaller subcluster vectors using singular value decomposition. For low entanglement entropy S{sub ee}, (satisfied by short range Hamiltonians), we expect the truncation error to vanish as exp(-n{sup 1/S{sub ee}}{sub svd}). Convergence is tested for the Heisenberg model on Kagome clusters of up to 36 sites, with no symmetries exploited, using less than 15GB of memory. Generalization to multiple partitioning is discussed.
Applications and accuracy of the parallel diagonal dominant algorithm
NASA Technical Reports Server (NTRS)
Sun, Xian-He
1993-01-01
The Parallel Diagonal Dominant (PDD) algorithm is a highly efficient, ideally scalable tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is introduced. Then the algorithm is extended to solve periodic tridiagonal systems. A variant, the reduced PDD algorithm, is also proposed. Accuracy analysis is provided for a class of tridiagonal systems, the symmetric, and anti-symmetric Toeplitz tridiagonal systems. Implementation results show that the analysis gives a good bound on the relative error, and the algorithm is a good candidate for the emerging massively parallel machines.
Performance Theory of Diagonal Conducting Wall MHD Accelerators
NASA Technical Reports Server (NTRS)
Litchford, R. J.
2003-01-01
The theoretical performance of diagonal conducting wall crossed field accelerators is examined on the basis of an infinite segmentation assumption using a cross-plane averaged generalized Ohm's law for a partially ionized gas, including ion slip. The desired accelerator performance relationships are derived from the cross-plane averaged Ohm's law by imposing appropriate configuration and loading constraints. A current dependent effective voltage drop model is also incorporated to account for cold-wall boundary layer effects including gasdynamic variations, discharge constriction, and electrode falls. Definition of dimensionless electric fields and current densities lead to the construction of graphical performance diagrams, which further illuminate the rudimentary behavior of crossed field accelerator operation.
Anharmonicity and NLO responses: an exact diagonalization study
NASA Astrophysics Data System (ADS)
Freo, Luca Del; Painelli, Anna
2001-04-01
We present the exact numerical diagonalization of the Mulliken donor-acceptor (DA) dimer with Holstein coupling. The resulting eigenstates are introduced in sum-over-states expressions of static optical susceptibilities. The careful partitioning of the sum, and the comparison with spectral properties give important clues on the role of electron-phonon (e-ph) coupling. Anharmonicity does not appreciably affect vibrational spectra, nor linear electronic spectra, and is irrelevant for the static linear polarizability. By contrast, huge anharmonic contributions to hyperpolarizabilities are found: the harmonic approximation is unreliable for the calculation of non-linear responses, even for systems where it hardly affects linear optical spectra.
Diagonal-Axes Stage for Pointing an Optical Communications Transceiver
NASA Technical Reports Server (NTRS)
Regehr, Martin W.; Garkanian, Vachik
2011-01-01
Traditional azimuth-elevation ("az-el") stages are used to point a variety of devices ranging from large optical telescopes to tank guns. Such a stage typically has an elevation stage having a horizontal axis mounted on an azimuth stage with a vertical axis. Both stages are often motorized. Optical communications transceivers often require two-axis motorized control, as when the communications link is between a ground station and an aircraft or satellite. In such applications, the traditional azimuth-elevation stage has two important drawbacks: a gimbal lock exclusion zone at zenith and susceptibility to pointing errors caused by backlash. Az-el stages in which the azimuth stage cannot rotate a full 360deg have the additional drawback of an azimuth exclusion zone. The diagonal-axes stage described here mitigates or eliminates all of these problems. Instead of one vertical axis and one horizontal axis, a diagonal-axes stage has two horizontal axes, both oriented at 45 to the trajectory of the target. For example, a ground station located on the equator tracking a satellite with an equatorial orbit would have one axis parallel to northeast and southwest, and the other axis parallel to northwest and southeast. The diagonal-axes stage is considerably less vulnerable to backlash. If it is correctly oriented, its axes rotate in only one direction during an overhead pass by a satellite. As a result, the effects of backlash may be inherently eliminated. If the gravity-induced torque on either axis changes during the pass, then backlash may become important during the part of the pass where the gravity torque, instead of opposing the motion of the stage, pushes the stage in the direction of motion. This can result in the loss of gear-to-gear contact in one or more stages of the gear reduction mechanism. In this case, a preload spring used to eliminate backlash need only be sufficiently strong to overcome the gravity torque, i.e. it need not overcome friction in the gear
Neutrino beam constraints on flavor-diagonal Lorentz violation
NASA Astrophysics Data System (ADS)
Altschul, Brett
2013-05-01
Breaking of isotropy and Lorentz boost invariance in the dynamics of second-generation leptons would lead to direction-dependent changes in the lifetimes of charged pions. This would make the intensity of a neutrino beam produced via pion decay a function of the beam orientation. The experimental signature of this phenomenon—sidereal variations in the event rate at a downstream neutrino detector—has already been studied, in searches for Lorentz-violating neutrino oscillations. Existing analyses of MINOS near detector data can be used to constrain the flavor-diagonal Lorentz violation coefficients affecting muon neutrino speeds at roughly the 10-5 level.
The Dynamics of Some Iterative Implicit Schemes
NASA Technical Reports Server (NTRS)
Yee, H. C.; Sweby, P. K.
1994-01-01
The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations is analyzed using the theory of dynamical systems. With the aid of parallel Connection Machines (CM-2 and CM-5), the associated bifurcation diagrams as a function of the time step, and the complex behavior of the associated 'numerical basins of attraction' of these iterative implicit schemes are revealed and compared. Studies showed that all of the four implicit LMMs exhibit a drastic distortion and segmentation but less shrinkage of the basin of attraction of the true solution than standard explicit methods. The numerical basins of attraction of a noniterative implicit procedure mimic more closely the basins of attraction of the differential equations than the iterative implicit procedures for the four implicit LMMs.
Permuting sparse rectangular matrices into block-diagonal form
Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.
2002-12-09
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.
An implicit Smooth Particle Hydrodynamic code
Knapp, Charles E.
2000-05-01
An implicit version of the Smooth Particle Hydrodynamic (SPH) code SPHINX has been written and is working. In conjunction with the SPHINX code the new implicit code models fluids and solids under a wide range of conditions. SPH codes are Lagrangian, meshless and use particles to model the fluids and solids. The implicit code makes use of the Krylov iterative techniques for solving large linear-systems and a Newton-Raphson method for non-linear corrections. It uses numerical derivatives to construct the Jacobian matrix. It uses sparse techniques to save on memory storage and to reduce the amount of computation. It is believed that this is the first implicit SPH code to use Newton-Krylov techniques, and is also the first implicit SPH code to model solids. A description of SPH and the techniques used in the implicit code are presented. Then, the results of a number of tests cases are discussed, which include a shock tube problem, a Rayleigh-Taylor problem, a breaking dam problem, and a single jet of gas problem. The results are shown to be in very good agreement with analytic solutions, experimental results, and the explicit SPHINX code. In the case of the single jet of gas case it has been demonstrated that the implicit code can do a problem in much shorter time than the explicit code. The problem was, however, very unphysical, but it does demonstrate the potential of the implicit code. It is a first step toward a useful implicit SPH code.
O'Shea, Brian; Watson, Derrick G; Brown, Gordon D A
2016-02-01
How can implicit attitudes best be measured? The Implicit Relational Assessment Procedure (IRAP), unlike the Implicit Association Test (IAT), claims to measure absolute, not just relative, implicit attitudes. In the IRAP, participants make congruent (Fat Person-Active: false; Fat Person-Unhealthy: true) or incongruent (Fat Person-Active: true; Fat Person-Unhealthy: false) responses in different blocks of trials. IRAP experiments have reported positive or neutral implicit attitudes (e.g., neutral attitudes toward fat people) in cases in which negative attitudes are normally found on explicit or other implicit measures. It was hypothesized that these results might reflect a positive framing bias (PFB) that occurs when participants complete the IRAP. Implicit attitudes toward categories with varying prior associations (nonwords, social systems, flowers and insects, thin and fat people) were measured. Three conditions (standard, positive framing, and negative framing) were used to measure whether framing influenced estimates of implicit attitudes. It was found that IRAP scores were influenced by how the task was framed to the participants, that the framing effect was modulated by the strength of prior stimulus associations, and that a default PFB led to an overestimation of positive implicit attitudes when measured by the IRAP. Overall, the findings question the validity of the IRAP as a tool for the measurement of absolute implicit attitudes. A new tool (Simple Implicit Procedure:SIP) for measuring absolute, not just relative, implicit attitudes is proposed. (PsycINFO Database Record
Using Implicit Measures to Highlight Science Teachers' Implicit Theories of Intelligence
ERIC Educational Resources Information Center
Mascret, Nicolas; Roussel, Peggy; Cury, François
2015-01-01
Using an innovative method, a Single-Target Implicit Association Test (ST-IAT) was created to explore the implicit theories of intelligence among science and liberal arts teachers and their relationships with their gender. The results showed that for science teachers--especially for male teachers--there was a negative implicit association between…
Lin, W.L.; Carlson, K.D.; Chen, C.J. |
1999-05-01
In this study, a diagonal Cartesian method for thermal analysis is developed for simulation of conjugate heat transfer over complex boundaries. This method uses diagonal line segments in addition to Cartesian coordinates. The velocity fields are also modeled using the diagonal Cartesian method. The transport equations are discretized with the finite analytic (FA) method. The current work is validated by simulating a rotated lid-driven cavity flow with conjugate heat transfer, and accurate results are obtained.
Implicit bias, awareness and imperfect cognitions.
Holroyd, Jules
2015-05-01
Are individuals responsible for behaviour that is implicitly biased? Implicitly biased actions are those which manifest the distorting influence of implicit associations. That they express these 'implicit' features of our cognitive and motivational make up has been appealed to in support of the claim that, because individuals lack the relevant awareness of their morally problematic discriminatory behaviour, they are not responsible for behaving in ways that manifest implicit bias. However, the claim that such influences are implicit is, in fact, not straightforwardly related to the claim that individuals lack awareness of the morally problematic dimensions of their behaviour. Nor is it clear that lack of awareness does absolve from responsibility. This may depend on whether individuals culpably fail to know something that they should know. I propose that an answer to this question, in turn, depends on whether other imperfect cognitions are implicated in any lack of the relevant kind of awareness. In this paper I clarify our understanding of 'implicitly biased actions' and then argue that there are three different dimensions of awareness that might be at issue in the claim that individuals lack awareness of implicit bias. Having identified the relevant sense of awareness I argue that only one of these senses is defensibly incorporated into a condition for responsibility, rejecting recent arguments from Washington & Kelly for an 'externalist' epistemic condition. Having identified what individuals should - and can - know about their implicitly biased actions, I turn to the question of whether failures to know this are culpable. This brings us to consider the role of implicit biases in relation to other imperfect cognitions. I conclude that responsibility for implicitly biased actions may depend on answers to further questions about their relationship to other imperfect cognitions.
A Semi-Implicit, Three-Dimensional Model for Estuarine Circulation
Smith, Peter E.
2006-01-01
A semi-implicit, finite-difference method for the numerical solution of the three-dimensional equations for circulation in estuaries is presented and tested. The method uses a three-time-level, leapfrog-trapezoidal scheme that is essentially second-order accurate in the spatial and temporal numerical approximations. The three-time-level scheme is shown to be preferred over a two-time-level scheme, especially for problems with strong nonlinearities. The stability of the semi-implicit scheme is free from any time-step limitation related to the terms describing vertical diffusion and the propagation of the surface gravity waves. The scheme does not rely on any form of vertical/horizontal mode-splitting to treat the vertical diffusion implicitly. At each time step, the numerical method uses a double-sweep method to transform a large number of small tridiagonal equation systems and then uses the preconditioned conjugate-gradient method to solve a single, large, five-diagonal equation system for the water surface elevation. The governing equations for the multi-level scheme are prepared in a conservative form by integrating them over the height of each horizontal layer. The layer-integrated volumetric transports replace velocities as the dependent variables so that the depth-integrated continuity equation that is used in the solution for the water surface elevation is linear. Volumetric transports are computed explicitly from the momentum equations. The resulting method is mass conservative, efficient, and numerically accurate.
Why Explicit Knowledge Cannot Become Implicit Knowledge
ERIC Educational Resources Information Center
VanPatten, Bill
2016-01-01
In this essay, I review one of the conclusions in Lindseth (2016) published in "Foreign Language Annals." That conclusion suggests that explicit learning and practice (what she called form-focused instruction) somehow help the development of implicit knowledge (or might even become implicit knowledge). I argue for a different…
Implicit and Explicit Exercise and Sedentary Identity
ERIC Educational Resources Information Center
Berry, Tanya R.; Strachan, Shaelyn M.
2012-01-01
We examined the relationship between implicit and explicit "exerciser" and "sedentary" self-identity when activated by stereotypes. Undergraduate participants (N = 141) wrote essays about university students who either liked to exercise or engage in sedentary activities. This was followed by an implicit identity task and an explicit measure of…
Psychometric Intelligence Dissociates Implicit and Explicit Learning
ERIC Educational Resources Information Center
Gebauer, Guido F.; Mackintosh, Nicholas J.
2007-01-01
The hypothesis that performance on implicit learning tasks is unrelated to psychometric intelligence was examined in a sample of 605 German pupils. Performance in artificial grammar learning, process control, and serial learning did not correlate with various measures of intelligence when participants were given standard implicit instructions.…
Implicit and Explicit Learning of Languages.
ERIC Educational Resources Information Center
McDermott, James E.
1999-01-01
Discusses theoretical and practical issues connected with implicit and explicit learning of languages. Explicit learning is knowledge expressed in the form of rules or definitions; implicit knowledge can be inferred to exist because of observed performance but cannot be clearly described. Hypothesizes why explicit learning can lead to implicit…
Implicit and Explicit Instruction of Spelling Rules
ERIC Educational Resources Information Center
Kemper, M. J.; Verhoeven, L.; Bosman, A. M. T.
2012-01-01
The study aimed to compare the differential effectiveness of explicit and implicit instruction of two Dutch spelling rules. Students with and without spelling disabilities were instructed a spelling rule either implicitly or explicitly in two experiments. Effects were tested in a pretest-intervention-posttest control group design. Experiment 1…
Implicit Relational Effects in Associative Recognition
ERIC Educational Resources Information Center
Algarabel, S.; Pitarque, A.; Combita, L. M.; Rodriguez, L. A.
2013-01-01
We study the contribution of implicit relatedness to associative recognition in two experiments. In the first experiment, we showed an implicit improvement in recognition when the stimulus elements of each word pair shared common letters and they were unpaired at test. Moreover, when asked to study the stimuli under divided attention, recollection…
Evidence for Implicit Learning in Syntactic Comprehension
ERIC Educational Resources Information Center
Fine, Alex B.; Jaeger, T. Florian
2013-01-01
This study provides evidence for implicit learning in syntactic comprehension. By reanalyzing data from a syntactic priming experiment (Thothathiri & Snedeker, 2008), we find that the error signal associated with a syntactic prime influences comprehenders' subsequent syntactic expectations. This follows directly from error-based implicit learning…
Understanding Implicit Bias: What Educators Should Know
ERIC Educational Resources Information Center
Staats, Cheryl
2016-01-01
The desire to ensure the best for children is precisely why educators should become aware of the concept of implicit bias: the attitudes or stereotypes that affect our understanding, actions, and decisions in an unconscious manner. Operating outside of our conscious awareness, implicit biases are pervasive, and they can challenge even the most…
Reducing memory cost of exact diagonalization using singular value decomposition.
Weinstein, Marvin; Auerbach, Assa; Chandra, V Ravi
2011-11-01
We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, without restricting to variational ansatzes. The lattice of size N is partitioned into two subclusters. At each iteration the Lanczos vector is projected into two sets of n(svd) smaller subcluster vectors using singular value decomposition. For low entanglement entropy S(ee), (satisfied by short-range Hamiltonians), the truncation error is expected to vanish as exp(-n(svd)(1/S(ee))). Convergence is tested for the Heisenberg model on Kagomé clusters of 24, 30, and 36 sites, with no lattice symmetries exploited, using less than 15 GB of dynamical memory. Generalization of the Lanczos-SVD algorithm to multiple partitioning is discussed, and comparisons to other techniques are given.
Exact Diagonalization of Heisenberg SU(N) models.
Nataf, Pierre; Mila, Frédéric
2014-09-19
Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labeled by the set of standard Young tableaux in which the matrix of the Heisenberg SU(N) model (the quantum permutation of N-color objects) takes an explicit and extremely simple form. Since the relative dimension of the full Hilbert space to that of the singlet space on n sites increases very fast with N, this formulation allows us to extend exact diagonalizations of finite clusters to much larger values of N than accessible so far. Using this method, we show that, on the square lattice, there is long-range color order for SU(5), spontaneous dimerization for SU(8), and evidence in favor of a quantum liquid for SU(10).
Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition
NASA Astrophysics Data System (ADS)
Weinstein, Marvin; Chandra, Ravi; Auerbach, Assa
2012-02-01
We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements. In contrast to variational approaches and most implementations of DMRG, Lanczos rotations towards the ground state do not involve incremental minimizations, (e.g. sweeping procedures) which may get stuck in false local minima. The lattice of size N is partitioned into two subclusters. At each iteration the rotating Lanczos vector is compressed into two sets of nsvd small subcluster vectors using singular value decomposition. For low entanglement entropy See, (satisfied by short range Hamiltonians), the truncation error is bounded by (-nsvd^1/See). Convergence is tested for the Heisenberg model on Kagom'e clusters of 24, 30 and 36 sites, with no lattice symmetries exploited, using less than 15GB of dynamical memory. Generalization of the Lanczos-SVD algorithm to multiple partitioning is discussed, and comparisons to other techniques are given. Reference: arXiv:1105.0007
Diagonal composite order in a two-channel Kondo lattice.
Hoshino, Shintaro; Otsuki, Junya; Kuramoto, Yoshio
2011-12-09
A novel type of symmetry breaking is reported for the two-channel Kondo lattice where conduction electrons have spin and orbital (channel) degrees of freedom. Using the continuous-time quantum Monte Carlo and the dynamical mean-field theory, a spontaneous breaking of the orbital symmetry is observed. The tiny breakdown of orbital occupation number, however, vanishes if the conduction electrons have the particle-hole symmetry. The proper order parameter instead is identified as a composite quantity representing the orbital-selective Kondo effect. The single-particle spectrum of the selected orbital shows insulating property, while the other orbital behaves as a Fermi liquid. This composite order is the first example of odd-frequency order other than off-diagonal order (superconductivity), and is a candidate of hidden order in f-electron systems.
Performance Theory of Diagonal Conducting Wall Magnetohydrodynamic Accelerators
NASA Technical Reports Server (NTRS)
Litchford, R. J.
2004-01-01
The theoretical performance of diagonal conducting wall crossed-field accelerators is examined on the basis of an infinite segmentation assumption using a cross-plane averaged generalized Ohm s law for a partially ionized gas, including ion slip. The desired accelerator performance relationships are derived from the cross-plane averaged Ohm s law by imposing appropriate configuration and loading constraints. A current-dependent effective voltage drop model is also incorporated to account for cold-wall boundary layer effects, including gasdynamic variations, discharge constriction, and electrode falls. Definition of dimensionless electric fields and current densities leads to the construction of graphical performance diagrams, which further illuminate the rudimentary behavior of crossed-field accelerator operation.
Diagnosis of Interaction-driven Topological Phase via Exact Diagonalization
NASA Astrophysics Data System (ADS)
Wu, Han-Qing; He, Yuan-Yao; Fang, Chen; Meng, Zi Yang; Lu, Zhong-Yi
2016-08-01
We propose a general scheme for diagnosing interaction-driven topological phases in the weak interaction regime using exact diagonalization (ED). The scheme comprises the analysis of eigenvalues of the point-group operators for the many-body eigenstates and the correlation functions for physical observables to extract the symmetries of the order parameters and the topological numbers of the underlying ground states at the thermodynamic limit from a relatively small size system afforded by ED. As a concrete example, we investigate the interaction effects on the half-filled spinless fermions on the checkerboard lattice with a quadratic band crossing point. Numerical results support the existence of a spontaneous quantum anomalous Hall phase purely driven by a nearest-neighbor weak repulsive interaction, separated from a nematic Mott insulator phase at strong repulsive interaction by a first-order phase transition.
Diagonal ordering operation technique applied to Morse oscillator
Popov, Dušan; Dong, Shi-Hai; Popov, Miodrag
2015-11-15
We generalize the technique called as the integration within a normally ordered product (IWOP) of operators referring to the creation and annihilation operators of the harmonic oscillator coherent states to a new operatorial approach, i.e. the diagonal ordering operation technique (DOOT) about the calculations connected with the normally ordered product of generalized creation and annihilation operators that generate the generalized hypergeometric coherent states. We apply this technique to the coherent states of the Morse oscillator including the mixed (thermal) state case and get the well-known results achieved by other methods in the corresponding coherent state representation. Also, in the last section we construct the coherent states for the continuous dynamics of the Morse oscillator by using two new methods: the discrete–continuous limit, respectively by solving a finite difference equation. Finally, we construct the coherent states corresponding to the whole Morse spectrum (discrete plus continuous) and demonstrate their properties according the Klauder’s prescriptions.
Diagnosis of Interaction-driven Topological Phase via Exact Diagonalization.
Wu, Han-Qing; He, Yuan-Yao; Fang, Chen; Meng, Zi Yang; Lu, Zhong-Yi
2016-08-05
We propose a general scheme for diagnosing interaction-driven topological phases in the weak interaction regime using exact diagonalization (ED). The scheme comprises the analysis of eigenvalues of the point-group operators for the many-body eigenstates and the correlation functions for physical observables to extract the symmetries of the order parameters and the topological numbers of the underlying ground states at the thermodynamic limit from a relatively small size system afforded by ED. As a concrete example, we investigate the interaction effects on the half-filled spinless fermions on the checkerboard lattice with a quadratic band crossing point. Numerical results support the existence of a spontaneous quantum anomalous Hall phase purely driven by a nearest-neighbor weak repulsive interaction, separated from a nematic Mott insulator phase at strong repulsive interaction by a first-order phase transition.
Quantum transport in chains with noisy off-diagonal couplings.
Pereverzev, Andrey; Bittner, Eric R
2005-12-22
We present a model for conductivity and energy diffusion in a linear chain described by a quadratic Hamiltonian with Gaussian noise. We show that when the correlation matrix is diagonal, the noise-averaged Liouville-von Neumann equation governing the time evolution of the system reduces to the [Lindblad, Commun. Math. Phys. 48, 119 (1976)] equation with Hermitian Lindblad operators. We show that the noise-averaged density matrix for the system expectation values of the energy density and the number density satisfies discrete versions of the heat and diffusion equations. Transport coefficients are given in terms of model Hamiltonian parameters. We discuss conditions on the Hamiltonian under which the noise-averaged expectation value of the total energy remains constant. For chains placed between two heat reservoirs, the gradient of the energy density along the chain is linear.
Eye movements during mental time travel follow a diagonal line.
Hartmann, Matthias; Martarelli, Corinna S; Mast, Fred W; Stocker, Kurt
2014-11-01
Recent research showed that past events are associated with the back and left side, whereas future events are associated with the front and right side of space. These spatial-temporal associations have an impact on our sensorimotor system: thinking about one's past and future leads to subtle body sways in the sagittal dimension of space (Miles, Nind, & Macrae, 2010). In this study we investigated whether mental time travel leads to sensorimotor correlates in the horizontal dimension of space. Participants were asked to mentally displace themselves into the past or future while measuring their spontaneous eye movements on a blank screen. Eye gaze was directed more rightward and upward when thinking about the future than when thinking about the past. Our results provide further insight into the spatial nature of temporal thoughts, and show that not only body, but also eye movements follow a (diagonal) "time line" during mental time travel.
Implicit measures: A normative analysis and review.
De Houwer, Jan; Teige-Mocigemba, Sarah; Spruyt, Adriaan; Moors, Agnes
2009-05-01
Implicit measures can be defined as outcomes of measurement procedures that are caused in an automatic manner by psychological attributes. To establish that a measurement outcome is an implicit measure, one should examine (a) whether the outcome is causally produced by the psychological attribute it was designed to measure, (b) the nature of the processes by which the attribute causes the outcome, and (c) whether these processes operate automatically. This normative analysis provides a heuristic framework for organizing past and future research on implicit measures. The authors illustrate the heuristic function of their framework by using it to review past research on the 2 implicit measures that are currently most popular: effects in implicit association tests and affective priming tasks. (PsycINFO Database Record (c) 2009 APA, all rights reserved).
Implicit restart Lanczos as an eigensolver
NASA Astrophysics Data System (ADS)
Rajaie Khorasani, Reza; Dumont, Randall S.
2009-03-01
This paper investigates the efficiency of the implicit restart Lanczos and simple (without reorthogonalization) Lanczos algorithms, as eigensolvers for large scale computations in molecular and chemical physics. Using the cardioid billiard and the hydrogen cyanide/hydrogen isocyanide (HCN/HNC) molecule as model systems we demonstrate superior efficiency of implicit restart Lanczos compared to the simple Lanczos algorithm. A modified implementation of implicit restart Lanczos is also presented which works with a smaller Krylov space—with associated savings in memory—and can handle larger basis sets than the usual implicit restart Lanczos. It also enables getting all eigenpairs of a matrix, or all eigenvalues below a threshold (where the number of such is not known before hand), which is more difficult with the usual implicit restart algorithm.
Implicit social cognition: from measures to mechanisms.
Nosek, Brian A; Hawkins, Carlee Beth; Frazier, Rebecca S
2011-04-01
Most human cognition occurs outside conscious awareness or conscious control. Some of these implicit processes influence social perception, judgment and action. The past 15 years of research in implicit social cognition can be characterized as the Age of Measurement because of a proliferation of measurement methods and research evidence demonstrating their practical value for predicting human behavior. Implicit measures assess constructs that are distinct, but related, to self-report assessments, and predict variation in behavior that is not accounted for by those explicit measures. The present state of knowledge provides a foundation for the next age of implicit social cognition: clarification of the mechanisms underlying implicit measurement and how the measured constructs influence behavior.
Implicit Social Biases in People with Autism
Birmingham, Elina; Stanley, Damian; Nair, Remya; Adolphs, Ralph
2015-01-01
Implicit social biases are ubiquitous and are known to influence social behavior. A core diagnostic criterion of Autism Spectrum Disorder (ASD) is abnormal social behavior. Here we investigated the extent to which individuals with ASD might show a specific attenuation of implicit social biases, using the Implicit Association Test (IAT) across Social (gender, race) and Nonsocial (flowers/insect, shoes) categories. High-functioning adults with ASD showed intact but reduced IAT effects relative to healthy controls. Importantly, we observed no selective attenuation of implicit social (vs. nonsocial) biases in our ASD population. To extend these results, we collected data from a large online sample of the general population, and explored correlations between autistic traits and IAT effects. No associations were found between autistic traits and IAT effects for any of the categories tested in our online sample. Taken together, these results suggest that implicit social biases, as measured by the IAT, are largely intact in ASD. PMID:26386014
Implicit sequence learning with competing explicit cues.
Jiménez, L; Méndez, C
2001-05-01
Previous research has shown that the expression of implicit sequence learning is eliminated in a choice reaction time task when an explicit cue allows participants to accurately predict the next stimulus (Cleeremans, 1997), but that two contingencies predicting the same outcome can be learned and expressed simultaneously when both of them remain implicit (Jiménez & Méndez, 1999). Two experiments tested the hypothesis that it is the deliberate use of explicit knowledge that produces the inhibitory effects over the expression of implicit sequence learning. However, the results of these experiments do not support this hypothesis, rather showing that implicit learning is acquired and expressed regardless of the influence of explicit knowledge. These results are interpreted as reinforcing the thesis about the automatic nature of both the acquisition and the expression of implicit sequence learning. The contradictory results reported by Cleeremans are attributed to a floor effect derived from the use of a special type of explicit cue.
GRIM: General Relativistic Implicit Magnetohydrodynamics
NASA Astrophysics Data System (ADS)
Chandra, Mani; Foucart, Francois; Gammie, Charles F.
2017-02-01
GRIM (General Relativistic Implicit Magnetohydrodynamics) evolves a covariant extended magnetohydrodynamics model derived by treating non-ideal effects as a perturbation of ideal magnetohydrodynamics. Non-ideal effects are modeled through heat conduction along magnetic field lines and a difference between the pressure parallel and perpendicular to the field lines. The model relies on an effective collisionality in the disc from wave-particle scattering and velocity-space (mirror and firehose) instabilities. GRIM, which runs on CPUs as well as on GPUs, combines time evolution and primitive variable inversion needed for conservative schemes into a single step using only the residuals of the governing equations as inputs. This enables the code to be physics agnostic as well as flexible regarding time-stepping schemes.
Parallel Implicit Algorithms for CFD
NASA Technical Reports Server (NTRS)
Keyes, David E.
1998-01-01
The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.
Scroggins, W Anthony; Mackie, Diane M; Allen, Thomas J; Sherman, Jeffrey W
2016-02-01
In three experiments, we used a novel Implicit Association Test procedure to investigate the impact of group memberships on implicit bias and implicit group boundaries. Results from Experiment 1 indicated that categorizing targets using a shared category reduced implicit bias by increasing the extent to which positivity was associated with Blacks. Results from Experiment 2 revealed that shared group membership, but not mere positivity of a group membership, was necessary to reduce implicit bias. Quadruple process model analyses indicated that changes in implicit bias caused by shared group membership are due to changes in the way that targets are evaluated, not to changes in the regulation of evaluative bias. Results from Experiment 3 showed that categorizing Black targets into shared group memberships expanded implicit group boundaries.
Diagonalization and Jordan Normal Form--Motivation through "Maple"[R
ERIC Educational Resources Information Center
Glaister, P.
2009-01-01
Following an introduction to the diagonalization of matrices, one of the more difficult topics for students to grasp in linear algebra is the concept of Jordan normal form. In this note, we show how the important notions of diagonalization and Jordan normal form can be introduced and developed through the use of the computer algebra package…
Implicit training of nonnative speech stimuli.
Vlahou, Eleni L; Protopapas, Athanassios; Seitz, Aaron R
2012-05-01
Learning nonnative speech contrasts in adulthood has proven difficult. Standard training methods have achieved moderate effects using explicit instructions and performance feedback. In this study, the authors question preexisting assumptions by demonstrating a superiority of implicit training procedures. They trained 3 groups of Greek adults on a difficult Hindi contrast (a) explicitly, with feedback (Experiment 1), or (b) implicitly, unaware of the phoneme distinctions, with (Experiment 2) or without (Experiment 3) feedback. Stimuli were natural recordings of consonant-vowel syllables with retroflex and dental unvoiced stops by a native Hindi speaker. On each trial, participants heard pairs of tokens from both categories and had to identify the retroflex sounds (explicit condition) or the sounds differing in intensity (implicit condition). Unbeknownst to participants, in the implicit conditions, target sounds were always retroflex, and distractor sounds were always dental. Post-training identification and discrimination tests showed improved performance of all groups, compared with a baseline of untrained Greek listeners. Learning was most robust for implicit training without feedback. It remains to be investigated whether implicitly trained skills can generalize to linguistically relevant phonetic categories when appropriate variability is introduced. These findings challenge traditional accounts on the role of feedback in phonetic training and highlight the importance of implicit, reward-based mechanisms.
Early LLNL Application Scaling Results on BlueGene/L
Cook, A W; Greenough, J A; Gygi, F; Streitz, F H; Kubota, A; Bulatov, V V; Louis, S
2004-11-01
Miranda is a high order hydrodynamics code for computing fluid instabilities and turbulent mixing. It employs FFTs and band-diagonal matrix solvers for computing spectrally-accurate derivatives, combined with high-order integration methods for time advancement; e.g., fourth-order Runge-Kutta. Fluid properties, i.e., viscosity, diffusivity and thermal conductivity, are computed from kinetic theory. The code contains solvers for both compressible and incompressible flows. It has been used primarily for studying Rayleigh-Taylor (R-T) and Richtmyer-Meshkov (R-M) instabilities, which occur in supernovae and Inertial Confinement Fusion (ICF).
A transient FETI methodology for large-scale parallel implicit computations in structural mechanics
NASA Technical Reports Server (NTRS)
Farhat, Charbel; Crivelli, Luis; Roux, Francois-Xavier
1992-01-01
Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.
NASA Technical Reports Server (NTRS)
Farhat, Charbel; Crivelli, Luis
1993-01-01
Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.
Parallelizing alternating direction implicit solver on GPUs
Technology Transfer Automated Retrieval System (TEKTRAN)
We present a parallel Alternating Direction Implicit (ADI) solver on GPUs. Our implementation significantly improves existing implementations in two aspects. First, we address the scalability issue of existing Parallel Cyclic Reduction (PCR) implementations by eliminating their hardware resource con...
Implicit learning and acquisition of music.
Rohrmeier, Martin; Rebuschat, Patrick
2012-10-01
Implicit learning is a core process for the acquisition of a complex, rule-based environment from mere interaction, such as motor action, skill acquisition, or language. A body of evidence suggests that implicit knowledge governs music acquisition and perception in nonmusicians and musicians, and that both expert and nonexpert participants acquire complex melodic, harmonic, and other features from mere exposure. While current findings and computational modeling largely support the learning of chunks, some results indicate learning of more complex structures. Despite the body of evidence, more research is required to support the cross-cultural validity of implicit learning and to show that core and more complex music theoretical features are acquired implicitly.
Psychometric intelligence dissociates implicit and explicit learning.
Gebauer, Guido F; Mackintosh, Nicholas J
2007-01-01
The hypothesis that performance on implicit learning tasks is unrelated to psychometric intelligence was examined in a sample of 605 German pupils. Performance in artificial grammar learning, process control, and serial learning did not correlate with various measures of intelligence when participants were given standard implicit instructions. Under an explicit rule discovery instruction, however, a significant relationship between performance on the learning tasks and intelligence appeared. This finding provides support for Reber's hypothesis that implicit learning, in contrast to explicit learning, is independent of intelligence, and confirms thereby the distinction between the 2 modes of learning. However, because there were virtually no correlations among the 3 learning tasks, the assumption of a unitary ability of implicit learning was not supported.
Kim, Kyungjoo; Parks, Michael L.; Perego, Mauro; Trask, Nathanial; Pan, Wenxiao
2016-11-09
ISPH code is developed to solve multi-physics meso-scale flow problems using implicit SPH method. In particular, the code can provides solutions for incompressible, multi phase flow and electro-kinetic flows
Significance of matrix diagonalization in modelling inelastic electron scattering.
Lee, Z; Hambach, R; Kaiser, U; Rose, H
2016-11-21
Electron scattering is always applied as one of the routines to investigate nanostructures. Nowadays the development of hardware offers more and more prospect for this technique. For example imaging nanostructures with inelastic scattered electrons may allow to produce component-sensitive images with atomic resolution. Modelling inelastic electron scattering is therefore essential for interpreting these images. The main obstacle to study inelastic scattering problem is its complexity. During inelastic scattering, incident electrons entangle with objects, and the description of this process involves a multidimensional array. Since the simulation usually involves fourdimensional Fourier transforms, the computation is highly inefficient. In this work we have offered one solution to handle the multidimensional problem. By transforming a high dimensional array into twodimensional array, we are able to perform matrix diagonalization and approximate the original multidimensional array with its twodimensional eigenvectors. Our procedure reduces the complicated multidimensional problem to a twodimensional problem. In addition, it minimizes the number of twodimensional problems. This method is very useful for studying multiple inelastic scattering.
Improvement of child survival in Mexico: the diagonal approach.
Sepúlveda, Jaime; Bustreo, Flavia; Tapia, Roberto; Rivera, Juan; Lozano, Rafael; Oláiz, Gustavo; Partida, Virgilio; García-García, Lourdes; Valdespino, José Luis
2006-12-02
Public health interventions aimed at children in Mexico have placed the country among the seven countries on track to achieve the goal of child mortality reduction by 2015. We analysed census data, mortality registries, the nominal registry of children, national nutrition surveys, and explored temporal association and biological plausibility to explain the reduction of child, infant, and neonatal mortality rates. During the past 25 years, child mortality rates declined from 64 to 23 per 1000 livebirths. A dramatic decline in diarrhoea mortality rates was recorded. Polio, diphtheria, and measles were eliminated. Nutritional status of children improved significantly for wasting, stunting, and underweight. A selection of highly cost-effective interventions bridging clinics and homes, what we called the diagonal approach, were central to this progress. Although a causal link to the reduction of child mortality was not possible to establish, we saw evidence of temporal association and biological plausibility to the high level of coverage of public health interventions, as well as significant association to the investments in women education, social protection, water, and sanitation. Leadership and continuity of public health policies, along with investments on institutions and human resources strengthening, were also among the reasons for these achievements.
Power take-off analysis for diagonally connected MHD channels
Pan, Y C; Doss, E D
1980-01-01
The electrical loading of the power take-off region of diagonally connected MHD channels is investigated by a two-dimensional model. The study examines the loading schemes typical of those proposed for the U-25 and U-25 Bypass channels. The model is applicable for the following four cases: (1) connection with diodes only, (2) connection with diodes and equal resistors, (3) connection with diodes and variable resistances to obtain a given current distribution, and (4) connection with diodes and variable resistors under changing load. The analysis is applicable for the power take-off regions of single or multiple-output systems. The general behaviors of the current and the potential distributions in all four cases are discussed. The analytical results are in good agreement with the experimental data. It is found possible to design the electrical circuit of the channel in the take-off region so as to achieve a fairly even load current output under changing total load current.
Metrology target design (MTD) solution for diagonally orientated DRAM layer
NASA Astrophysics Data System (ADS)
Lee, Myungjun; Smith, Mark D.; Adel, Michael E.; Chen, Chia-Hung; Huang, Chin-Chang; Huang, Hao-Lun; Tsai, Hsueh-Jen; Wang, I.-Lin; Huang, Jen-Chou; Chin, Jo-Lan; Chou, Kuo-Yao; Lan, Yuan-Ku; Lung, Hsien-Yen; Yang, Jui-Chin; Itzkovich, Tal; Huang, Healthy; Abramovitz, Yaniv; Song, Jinyan; Dror, Chen; Cheng, Harvey; Levy, Ady
2016-03-01
We present a novel metrology target design framework using the scanner exit pupil wavefront analysis together with Zernike sensitivity analysis (ZSA) based on the Monte-Carlo technique. The proposed method enables the design of robust metrology targets that maximize target process window (PW) while minimizing placement error discrepancies with device features in the presence of spatial and temporal variation of the aberration characteristics of an exposure tool. Knowing the limitations of lithography systems, design constraints, and detailed lithography information including illumination, mask type, etc., we can successfully design an optimal metrology target. We have validated our new metrology target design (MTD) method for one of the challenging DRAM active layer consisting of diagonal line and space patterns illuminated by a rotated extreme dipole source. We find that an optimal MTD target gives the maximized PW and the strong device correlation, resulting in the dramatic improvement of overall overlay performance. The proposed target design framework is completely general and can be used to optimize targets for different lithography conditions. The results from our analysis are both physically sensible and in good agreement with experimental results.
Microscopic diagonal entropy and its connection to basic thermodynamic relations
Polkovnikov, Anatoli
2011-02-15
We define a diagonal entropy (d-entropy) for an arbitrary Hamiltonian system as S{sub d}=-{Sigma}{sub n{rho}nn}ln{rho}{sub nn} with the sum taken over the basis of instantaneous energy states. In equilibrium this entropy coincides with the conventional von Neumann entropy S{sub n} = -Tr{rho} ln {rho}. However, in contrast to S{sub n}, the d-entropy is not conserved in time in closed Hamiltonian systems. If the system is initially in stationary state then in accord with the second law of thermodynamics the d-entropy can only increase or stay the same. We also show that the d-entropy can be expressed through the energy distribution function and thus it is measurable, at least in principle. Under very generic assumptions of the locality of the Hamiltonian and non-integrability the d-entropy becomes a unique function of the average energy in large systems and automatically satisfies the fundamental thermodynamic relation. This relation reduces to the first law of thermodynamics for quasi-static processes. The d-entropy is also automatically conserved for adiabatic processes. We illustrate our results with explicit examples and show that S{sub d} behaves consistently with expectations from thermodynamics.
Implicit attitudes in sexuality: gender differences.
Geer, James H; Robertson, Gloria G
2005-12-01
This study examined the role of gender in both implicit and explicit attitudes toward sexuality. Implicit attitudes are judgments or evaluations of social objects that are automatically activated, often without the individual's conscious awareness of the causation. In contrast, explicit attitudes are judgments or evaluations that are well established in awareness. As described in Oliver and Hyde's (1993) meta-analysis of self-report (explicit) data, women report greater negative attitudes toward sexuality than do men. In the current study, we used the Sexual Opinion Survey (SOS) developed by Fisher, Byrne, White, and Kelley (1988) to index explicit attitudes and the Implicit Association Test (IAT) developed by Greenwald, McGhee, and Schwartz (1998) to index implicit attitudes. Research has demonstrated that the IAT reveals attitudes that participants may be reluctant to express. Independent variables examined were participant gender, social acceptability of sexual words, and order of associated evaluations in the IAT (switching from positive to negative evaluations or the reverse). The IAT data revealed a significant Order x Gender interaction that showed that women had more negative implicit attitudes toward sexuality than did men. There was also a significant Order x Acceptability interaction, indicating that implicit attitudes were more strongly revealed when the sexual words used in the IAT were more socially unacceptable. As expected, on the SOS, women had more negative explicit attitudes toward sexuality. There was no significant correlation between explicit and implicit attitudes. These data suggest that at both automatic (implicit) and controlled (explicit) levels of attitudes, women harbor more negative feelings toward sex than do men.
Implicit measures of association in psychopathology research.
Roefs, Anne; Huijding, Jorg; Smulders, Fren T Y; MacLeod, Colin M; de Jong, Peter J; Wiers, Reinout W; Jansen, Anita T M
2011-01-01
Studies obtaining implicit measures of associations in Diagnostic and Statistical Manual of Mental Disorders (4th ed., Text Revision; American Psychiatric Association, 2000) Axis I psychopathology are organized into three categories: (a) studies comparing groups having a disorder with controls, (b) experimental validity studies, and (c) incremental and predictive validity studies. In the first category, implicit measures of disorder-relevant associations were consistent with explicit beliefs for some disorders (e.g., specific phobia), but for other disorders evidence was either mixed (e.g., panic disorder) or inconsistent with explicit beliefs (e.g., pain disorder). For substance use disorders and overeating, expected positive and unexpected negative associations with craved substances were found consistently. Contrary to expectation, implicit measures of self-esteem were consistently positive for patients with depressive disorder, social phobia, and body dysmorphic disorder. In the second category, short-term manipulations of disorder-relevant states generally affected implicit measures as expected. Therapeutic interventions affected implicit measures for one type of specific phobia, social phobia, and panic disorder, but not for alcohol use disorders or obesity. In the third category, implicit measures had predictive value for certain psychopathological behaviors, sometimes moderated by the availability of cognitive resources (e.g., for alcohol and food, only when cognitive resources were limited). The strengths of implicit measures include (a) converging evidence for dysfunctional beliefs regarding certain disorders and consistent new insights for other disorders and (b) prediction of some psychopathological behaviors that explicit measures cannot explain. Weaknesses include (a) that findings were inconsistent for some disorders, raising doubts about the validity of the measures, and (b) that understanding of the concept "implicit" is incomplete.
Implicit Association Tests of Attitudes toward Persons with Disabilities
ERIC Educational Resources Information Center
Thomas, Adrian; Vaughn, Edwin D.; Doyle, Andrea; Bubb, Robert
2014-01-01
The authors assessed 3 of the currently available implicit association tests designed to measure attitudes toward persons with disabilities. The Revised Multiple Disability Implicit Association Test, the Implicit Association Test for Attitudes Toward Athletes With Disabilities, and the Disability Attitude Implicit Association Test were related to…
Gifted Students' Implicit Beliefs about Intelligence and Giftedness
ERIC Educational Resources Information Center
Makel, Matthew C.; Snyder, Kate E.; Thomas, Chandler; Malone, Patrick S.; Putallaz, Martha
2015-01-01
Growing attention is being paid to individuals' implicit beliefs about the nature of intelligence. However, implicit beliefs about giftedness are currently underexamined. In the current study, we examined academically gifted adolescents' implicit beliefs about both intelligence and giftedness. Overall, participants' implicit beliefs about…
Retroactive interference effects in implicit memory.
Eakin, Deborah K; Smith, Robert
2012-09-01
One source of evidence for separate explicit and implicit memory systems is that explicit but not implicit memory is impacted by interference (e.g., Graf & Schacter, 1987). The present experiment examined whether retroactive interference (RI) effects could be obtained in implicit memory when a strong test of RI was used. People studied an original list of word pairs (e.g., COTTON-PRIZE) using the typical RI paradigm. During the interpolated phase, participants studied either interference pairs for which the same cue was re-paired with a different target (e.g., COTTON-PRINT) or novel pairs (e.g., HOST-VASE). RI was tested with the modified opposition cued recall test (Eakin, Schreiber, & Sergent-Marshall, 2003). The original-list cue was presented along with the beginning stem of its target (e.g., COTTON-PRI-) and a hint (e.g., not PRINT). RI effects were obtained for explicit and implicit memory. Taken together with prior research finding proactive interference effects in implicit memory, the findings indicate that implicit memory is not immune from retroactive interference.
NASA Astrophysics Data System (ADS)
Zahr, M. J.; Persson, P.-O.
2016-12-01
The fully discrete adjoint equations and the corresponding adjoint method are derived for a globally high-order accurate discretization of conservation laws on parametrized, deforming domains. The conservation law on the deforming domain is transformed into one on a fixed reference domain by the introduction of a time-dependent mapping that encapsulates the domain deformation and parametrization, resulting in an Arbitrary Lagrangian-Eulerian form of the governing equations. A high-order discontinuous Galerkin method is used to discretize the transformed equation in space and a high-order diagonally implicit Runge-Kutta scheme is used for the temporal discretization. Quantities of interest that take the form of space-time integrals are discretized in a solver-consistent manner. The corresponding fully discrete adjoint method is used to compute exact gradients of quantities of interest along the manifold of solutions of the fully discrete conservation law. These quantities of interest and their gradients are used in the context of gradient-based PDE-constrained optimization. The adjoint method is used to solve two optimal shape and control problems governed by the isentropic, compressible Navier-Stokes equations. The first optimization problem seeks the energetically optimal trajectory of a 2D airfoil given a required initial and final spatial position. The optimization solver, driven by gradients computed via the adjoint method, reduced the total energy required to complete the specified mission nearly an order of magnitude. The second optimization problem seeks the energetically optimal flapping motion and time-morphed geometry of a 2D airfoil given an equality constraint on the x-directed impulse generated on the airfoil. The optimization solver satisfied the impulse constraint to greater than 8 digits of accuracy and reduced the required energy between a factor of 2 and 10, depending on the value of the impulse constraint, as compared to the nominal configuration.
Lanczos diagonalizations of the 1-D Peierls-Hubbard model
Loh, E.Y.; Campbell, D.K.; Gammel, J.T.
1989-01-01
In studies of interacting electrons in reduced dimensions'' one is trapped between the Scylla of exponential growth of the number of states in any exact many-body basis and the Charybdis of the failure of mean-field theories to capture adequately the effects of interactions. In the present article we focus on one technique -- the Lanczos method -- which, at least in the case of the 1-D Peierls-Hubbard model, appears to allow us to sail the narrow channel between these two hazards. In contrast to Quantum Monte Carlo methods, which circumvent the exponential growth of states by statistical techniques and importance sampling, the Lanczos approach attacks this problem head-on by diagonalizing the full Hamiltonian. Given the restrictions of present computers, this approach is thus limited to studying finite clusters of roughly 12--14 sites. Fortunately, in one dimension, such clusters are usually sufficient for extracting many of the properties of the infinite system provided that one makes full use of the ability to vary the boundary conditions. In this article we shall apply the Lanczos methodology and novel phase randomization'' techniques to study the 1-D Peierls-Hubbard model, with particular emphasis on the optical absorption properties, including the spectrum of absorptions as a function of photon energy. Despite the discreteness of the eigenstates in our finite clusters, we are able to obtain optical spectra that, in cases where independent tests can be made, agree well with the known exact results for the infinite system. Thus we feel that this combination of techniques represents an important and viable means of studying many interesting novel materials involving strongly correlated electrons. 26 refs., 6 figs.
Pediatric Extracorporeal Life Support Using a Third Generation Diagonal Pump.
Speth, Marlene; Münch, Frank; Purbojo, Ariawan; Glöckler, Martin; Toka, Okan; Cesnjevar, Robert A; Rüffer, André
2016-01-01
This study reports a single-centre experience of the Medos Deltastream diagonal-pump (DP3) for extracorporeal cardiac, pulmonary, or combined support in a single-center pediatric cohort. Twenty-seven consecutive patients with 28 runs of the DP3 between January 2013 and June 2014 were included for analysis. Median patient age, weight, and duration of support were 278 days (range: 0 days-14.2 years), 7.2 kg (range: 2.5-39 kg), and 8 days (range: 2-69 days). Midline sternotomy (n = 20, 71.4%) or cervical approaches (n = 8, 28.6%) were used for cannulation. The DP3 was employed for either veno-arterial extracorporeal life support (ECLS, n = 16), veno-venous extracorporeal membrane oxygenation (ECMO, n = 5), or ventricular assist devices (right ventricular assist device [RVAD], n = 1; left ventricular assist device [LVAD], n = 1; and univentricular assist device [UNIVAD], n = 5). Three patients initially supported with ECLS were switched to UNIVAD and one patient with UNIVAD was changed to ECLS. Required flow for neonates (n = 8) ranged between 0.2 and 0.75 L/min. Irreversible pump damage occurred in one patient during deairing after air block. Successful weaning, 30 day and hospital survival were 89.3% (n = 25), 85.7% (n = 24), and 71.4% (n = 20). All patients on UNIVAD, who did not require further extracorporeal respiratory assist, survived. In conclusion, the DP3 can be used for individual patient demands and adapted to their most suitable method of support. Meticulous flow adjustments render this pump highly effective for extracorporeal support particularly in pediatric patients.
ERIC Educational Resources Information Center
Power, Patricia; Barnes-Holmes, Dermot; Barnes-Holmes, Yvonne; Stewart, Ian
2009-01-01
The Implicit Relational Assessment Procedure (IRAP) was designed to examine implicit beliefs or attitudes. In Experiment 1, response latencies obtained from Irish participants on the IRAP showed a strong preference for Irish over Scottish and American over African. In contrast, responses to explicit Likert measures diverged from the IRAP…
How explicit and implicit test instructions in an implicit learning task affect performance.
Witt, Arnaud; Puspitawati, Ira; Vinter, Annie
2013-01-01
Typically developing children aged 5 to 8 years were exposed to artificial grammar learning. Following an implicit exposure phase, half of the participants received neutral instructions at test while the other half received instructions making a direct, explicit reference to the training phase. We first aimed to assess whether implicit learning operated in the two test conditions. We then evaluated the differential impact of age on learning performances as a function of test instructions. The results showed that performance did not vary as a function of age in the implicit instructions condition, while age effects emerged when explicit instructions were employed at test. However, performance was affected differently by age and the instructions given at test, depending on whether the implicit learning of short or long units was assessed. These results suggest that the claim that the implicit learning process is independent of age needs to be revised.
Localization in band random matrix models with and without increasing diagonal elements.
Wang, Wen-ge
2002-06-01
It is shown that localization of eigenfunctions in the Wigner band random matrix model with increasing diagonal elements can be related to localization in a band random matrix model with random diagonal elements. The relation is obtained by making use of a result of a generalization of Brillouin-Wigner perturbation theory, which shows that reduced Hamiltonian matrices with relatively small dimensions can be introduced for nonperturbative parts of eigenfunctions, and by employing intermediate basis states, which can improve the method of the reduced Hamiltonian matrix. The latter model deviates from the standard band random matrix model mainly in two aspects: (i) the root mean square of diagonal elements is larger than that of off-diagonal elements within the band, and (ii) statistical distributions of the matrix elements are close to the Lévy distribution in their central parts, except in the high top regions.
16. DIAGONAL VIEW TO NORTHWEST OF 1895 ENGINE/PUMP HOUSE SHOWING ...
16. DIAGONAL VIEW TO NORTHWEST OF 1895 ENGINE/PUMP HOUSE SHOWING REPLACEMENT DIESEL ENGINE LOCATIONS AND ASSOCIATED COOLING EQUIPMENT WITH PIPING - Deer Island Pumping Station, Boston, Suffolk County, MA
A Summary of Design Formulas for Beams Having Thin Webs in Diagonal Tension
NASA Technical Reports Server (NTRS)
Kuhn, Paul
1933-01-01
This report presents an explanation of the fundamental principles and a summary of the essential formulas for the design of diagonal-tension field beams, i.e. beams with very thin webs, as developed by Professor Wagner of Germany.
An upwind-biased, point-implicit relaxation algorithm for viscous, compressible perfect-gas flows
NASA Technical Reports Server (NTRS)
Gnoffo, Peter A.
1990-01-01
An upwind-biased, point-implicit relaxation algorithm for obtaining the numerical solution to the governing equations for three-dimensional, viscous, compressible, perfect-gas flows is described. The algorithm is derived using a finite-volume formulation in which the inviscid components of flux across cell walls are described with Roe's averaging and Harten's entropy fix with second-order corrections based on Yee's Symmetric Total Variation Diminishing scheme. Viscous terms are discretized using central differences. The relaxation strategy is well suited for computers employing either vector or parallel architectures. It is also well suited to the numerical solution of the governing equations on unstructured grids. Because of the point-implicit relaxation strategy, the algorithm remains stable at large Courant numbers without the necessity of solving large, block tri-diagonal systems. Convergence rates and grid refinement studies are conducted for Mach 5 flow through an inlet with a 10 deg compression ramp and Mach 14 flow over a 15 deg ramp. Predictions for pressure distributions, surface heating, and aerodynamics coefficients compare well with experiment data for Mach 10 flow over a blunt body.
NASA Technical Reports Server (NTRS)
Rosenbaum, J. S.
1976-01-01
If a system of ordinary differential equations represents a property conserving system that can be expressed linearly (e.g., conservation of mass), it is then desirable that the numerical integration method used conserve the same quantity. It is shown that both linear multistep methods and Runge-Kutta methods are 'conservative' and that Newton-type methods used to solve the implicit equations preserve the inherent conservation of the numerical method. It is further shown that a method used by several authors is not conservative.
Accuracy of schemes for the Euler equations with non-uniform meshes
NASA Technical Reports Server (NTRS)
Turkel, E.; Yaniv, S.; Landau, U.
1985-01-01
The effect of non-uniform grids on the solution of the Euler equations is analyzed. A Runge-Kutta type scheme based on a finite volume formulation is considered. It is shown that for arbitrary grids the scheme can be inconsistent even though it is second-order accurate for uniform grids. An improvement is suggested which leads to at least first-order accuracy for general grids. Test cases are presented in both two- and three-space dimensions. Applications to finite difference and implicit algorithms are also given.
NASA Technical Reports Server (NTRS)
Jentink, Thomas Neil; Usab, William J., Jr.
1990-01-01
An explicit, Multigrid algorithm was written to solve the Euler and Navier-Stokes equations with special consideration given to the coarse mesh boundary conditions. These are formulated in a manner consistent with the interior solution, utilizing forcing terms to prevent coarse-mesh truncation error from affecting the fine-mesh solution. A 4-Stage Hybrid Runge-Kutta Scheme is used to advance the solution in time, and Multigrid convergence is further enhanced by using local time-stepping and implicit residual smoothing. Details of the algorithm are presented along with a description of Jameson's standard Multigrid method and a new approach to formulating the Multigrid equations.
Convergence speeding up in the calculation of the viscous flow about an airfoil
NASA Technical Reports Server (NTRS)
Radespiel, R.; Rossow, C.
1988-01-01
A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.
Characteristic-based algorithms for flows in thermo-chemical nonequilibrium
NASA Technical Reports Server (NTRS)
Walters, Robert W.; Cinnella, Pasquale; Slack, David C.; Halt, David
1990-01-01
A generalized finite-rate chemistry algorithm with Steger-Warming, Van Leer, and Roe characteristic-based flux splittings is presented in three-dimensional generalized coordinates for the Navier-Stokes equations. Attention is placed on convergence to steady-state solutions with fully coupled chemistry. Time integration schemes including explicit m-stage Runge-Kutta, implicit approximate-factorization, relaxation and LU decomposition are investigated and compared in terms of residual reduction per unit of CPU time. Practical issues such as code vectorization and memory usage on modern supercomputers are discussed.
Speeding up Newton-type iterations for stiff problems
NASA Astrophysics Data System (ADS)
Gonzalez-Pinto, S.; Rojas-Bello, R.
2005-09-01
Iterative schemes based on the Cooper and Butcher iteration [5] are considered, in order to implement highly implicit Runge-Kutta methods on stiff problems. By introducing two appropriate parameters in the scheme, a new iteration making use of the last two iterates, is proposed. Specific schemes of this type for the Gauss, Radau IA-IIA and Lobatto IIIA-B-C processes are developed. It is also shown that in many situations the new iteration presents a faster convergence than the original.
Propulsion-related flowfields using the preconditioned Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Venkateswaran, S.; Weiss, J. M.; Merkle, C. L.; Choi, Y.-H.
1992-01-01
A previous time-derivative preconditioning procedure for solving the Navier-Stokes is extended to the chemical species equations. The scheme is implemented using both the implicit ADI and the explicit Runge-Kutta algorithms. A new definition for time-step is proposed to enable grid-independent convergence. Several examples of both reacting and non-reacting propulsion-related flowfields are considered. In all cases, convergence that is superior to conventional methods is demonstrated. Accuracy is verified using the example of a backward facing step. These results demonstrate that preconditioning can enhance the capability of density-based methods over a wide range of Mach and Reynolds numbers.
A Fast Method for Solving a Class of Tri-Diagonal Linear Systems
It is proved that the diagonals of the LU decomposition of the coefficient matrix rapidly converge to full floating - point precision. It is also proved...that the computed LU decomposition converges when floating - point arithmetic is used and that the limits of the LU diagonals using floating point are...roughly within machine precision of the limits using real arithmetic. This fact is exploited to reduce the number of floating - point operations required
Taking correlations in GPS least squares adjustments into account with a diagonal covariance matrix
NASA Astrophysics Data System (ADS)
Kermarrec, Gaël; Schön, Steffen
2016-09-01
Based on the results of Luati and Proietti (Ann Inst Stat Math 63:673-686, 2011) on an equivalence for a certain class of polynomial regressions between the diagonally weighted least squares (DWLS) and the generalized least squares (GLS) estimator, an alternative way to take correlations into account thanks to a diagonal covariance matrix is presented. The equivalent covariance matrix is much easier to compute than a diagonalization of the covariance matrix via eigenvalue decomposition which also implies a change of the least squares equations. This condensed matrix, for use in the least squares adjustment, can be seen as a diagonal or reduced version of the original matrix, its elements being simply the sums of the rows elements of the weighting matrix. The least squares results obtained with the equivalent diagonal matrices and those given by the fully populated covariance matrix are mathematically strictly equivalent for the mean estimator in terms of estimate and its a priori cofactor matrix. It is shown that this equivalence can be empirically extended to further classes of design matrices such as those used in GPS positioning (single point positioning, precise point positioning or relative positioning with double differences). Applying this new model to simulated time series of correlated observations, a significant reduction of the coordinate differences compared with the solutions computed with the commonly used diagonal elevation-dependent model was reached for the GPS relative positioning with double differences, single point positioning as well as precise point positioning cases. The estimate differences between the equivalent and classical model with fully populated covariance matrix were below the mm for all simulated GPS cases and below the sub-mm for the relative positioning with double differences. These results were confirmed by analyzing real data. Consequently, the equivalent diagonal covariance matrices, compared with the often used elevation
In Vivo Imaging Reveals Composite Coding for Diagonal Motion in the Drosophila Visual System
Zhou, Wei; Chang, Jin
2016-01-01
Understanding information coding is important for resolving the functions of visual neural circuits. The motion vision system is a classic model for studying information coding as it contains a concise and complete information-processing circuit. In Drosophila, the axon terminals of motion-detection neurons (T4 and T5) project to the lobula plate, which comprises four regions that respond to the four cardinal directions of motion. The lobula plate thus represents a topographic map on a transverse plane. This enables us to study the coding of diagonal motion by investigating its response pattern. By using in vivo two-photon calcium imaging, we found that the axon terminals of T4 and T5 cells in the lobula plate were activated during diagonal motion. Further experiments showed that the response to diagonal motion is distributed over the following two regions compared to the cardinal directions of motion—a diagonal motion selective response region and a non-selective response region—which overlap with the response regions of the two vector-correlated cardinal directions of motion. Interestingly, the sizes of the non-selective response regions are linearly correlated with the angle of the diagonal motion. These results revealed that the Drosophila visual system employs a composite coding for diagonal motion that includes both independent coding and vector decomposition coding. PMID:27695103
Précis of implicit nationalism.
Hassin, Ran R; Ferguson, Melissa J; Kardosh, Rasha; Porter, Shanette C; Carter, Travis J; Dudareva, Veronika
2009-06-01
While the study of nationalism has received much attention throughout the social sciences and humanities, the experimental investigation of it lags behind. In this paper we review recent advances in the examination of implicit nationalism. In the first set of experiments we survey, the Palestinian, Israeli, Italian, and Russian flags were primed (or not, in the control conditions) and their effects on political thought and behavior were tested. In the second set the American or the Israeli flag was primed (or not) and prejudice toward African-Americans or Palestinians (respectively) was examined. The results of all experiments suggest that the implicit activation of national cues has far-reaching implications on political thought and behavior as well as on attitudes toward minorities. Under the assumption that the image of national flags is associated in memory with national ideologies, these results suggest that national ideologies can be implicitly pursued in a way that significantly affects our thoughts and behaviors.
Emotion and Implicit Timing: The Arousal Effect
Droit-Volet, Sylvie; Berthon, Mickaël
2017-01-01
This study tested the effects of emotion on implicit time judgment. The participants did not receive any overt temporal instructions. They were simply trained to respond as quickly as possible after a response signal, which was separated from a warning signal by a reference temporal interval. In the testing phase, the inter-signal interval was shorter, equal or longer than the reference interval and was filled by emotional pictures (EP) of different arousal levels: high, moderate, and low. The results showed a U-shaped curve of reaction time plotted against the interval duration, indicating an implicit processing of time. However, this RT-curve was shifted toward the left, with a significantly lower peak time for the high-arousal than for the low-arousal EP. This emotional time distortion in an implicit timing task suggests an automatic effect of emotion on the internal clock rate. PMID:28261125
State-Based Implicit Coordination and Applications
NASA Technical Reports Server (NTRS)
Narkawicz, Anthony J.; Munoz, Cesar A.
2011-01-01
In air traffic management, pairwise coordination is the ability to achieve separation requirements when conflicting aircraft simultaneously maneuver to solve a conflict. Resolution algorithms are implicitly coordinated if they provide coordinated resolution maneuvers to conflicting aircraft when only surveillance data, e.g., position and velocity vectors, is periodically broadcast by the aircraft. This paper proposes an abstract framework for reasoning about state-based implicit coordination. The framework consists of a formalized mathematical development that enables and simplifies the design and verification of implicitly coordinated state-based resolution algorithms. The use of the framework is illustrated with several examples of algorithms and formal proofs of their coordination properties. The work presented here supports the safety case for a distributed self-separation air traffic management concept where different aircraft may use different conflict resolution algorithms and be assured that separation will be maintained.
Implicit solvent methods for free energy estimation
Decherchi, Sergio; Masetti, Matteo; Vyalov, Ivan; Rocchia, Walter
2014-01-01
Solvation is a fundamental contribution in many biological processes and especially in molecular binding. Its estimation can be performed by means of several computational approaches. The aim of this review is to give an overview of existing theories and methods to estimate solvent effects giving a specific focus on the category of implicit solvent models and their use in Molecular Dynamics. In many of these models, the solvent is considered as a continuum homogenous medium, while the solute can be represented at the atomic detail and at different levels of theory. Despite their degree of approximation, implicit methods are still widely employed due to their trade-off between accuracy and efficiency. Their derivation is rooted in the statistical mechanics and integral equations disciplines, some of the related details being provided here. Finally, methods that combine implicit solvent models and molecular dynamics simulation, are briefly described. PMID:25193298
Testosterone abolishes implicit subordination in social anxiety.
Terburg, David; Syal, Supriya; Rosenberger, Lisa A; Heany, Sarah J; Stein, Dan J; Honk, Jack van
2016-10-01
Neuro-evolutionary theories describe social anxiety as habitual subordinate tendencies acquired through a recursive cycle of social defeat and submissive reactions. If so, the steroid hormone testosterone might be of therapeutic value, as testosterone is a main force behind implicit dominance drive in many species including humans. We combined these two theories to investigate whether the tendency to submit to the dominance of others is an implicit mechanism in social anxiety (Study-1), and whether this can be relieved through testosterone administration (Study-2). Using interactive eye-tracking we demonstrate that socially anxious humans more rapidly avert gaze from subliminal angry eye contact (Study-1). We replicate this effect of implicit subordination in social anxiety in an independent sample, which is subsequently completely abolished after a single placebo-controlled sublingual testosterone administration (Study-2). These findings provide crucial evidence for hormonal and behavioral treatment strategies that specifically target mechanisms of dominance and subordination in social anxiety.
Brain Networks of Explicit and Implicit Learning
Yang, Jing; Li, Ping
2012-01-01
Are explicit versus implicit learning mechanisms reflected in the brain as distinct neural structures, as previous research indicates, or are they distinguished by brain networks that involve overlapping systems with differential connectivity? In this functional MRI study we examined the neural correlates of explicit and implicit learning of artificial grammar sequences. Using effective connectivity analyses we found that brain networks of different connectivity underlie the two types of learning: while both processes involve activation in a set of cortical and subcortical structures, explicit learners engage a network that uses the insula as a key mediator whereas implicit learners evoke a direct frontal-striatal network. Individual differences in working memory also differentially impact the two types of sequence learning. PMID:22952624
Convergence Acceleration for Multistage Time-Stepping Schemes
NASA Technical Reports Server (NTRS)
Swanson, R. C.; Turkel, Eli L.; Rossow, C-C; Vasta, V. N.
2006-01-01
The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 could be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. Numerical dissipation operators (based on the Roe scheme, a matrix formulation, and the CUSP scheme) as well as the number of RK stages are considered in evaluating the RK/implicit scheme. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. In two dimensions, turbulent flows over an airfoil at subsonic and transonic conditions are computed. The effects of mesh cell aspect ratio on convergence are investigated for Reynolds numbers between 5.7 x 10(exp 6) and 100.0 x 10(exp 6). Results are also obtained for a transonic wing flow. For both 2-D and 3-D problems, the computational time of a well-tuned standard RK scheme is reduced at least a factor of four.
Processing implicit control: evidence from reading times
McCourt, Michael; Green, Jeffrey J.; Lau, Ellen; Williams, Alexander
2015-01-01
Sentences such as “The ship was sunk to collect the insurance” exhibit an unusual form of anaphora, implicit control, where neither anaphor nor antecedent is audible. The non-finite reason clause has an understood subject, PRO, that is anaphoric; here it may be understood as naming the agent of the event of the host clause. Yet since the host is a short passive, this agent is realized by no audible dependent. The putative antecedent to PRO is therefore implicit, which it normally cannot be. What sorts of representations subserve the comprehension of this dependency? Here we present four self-paced reading time studies directed at this question. Previous work showed no processing cost for implicit vs. explicit control, and took this to support the view that PRO is linked syntactically to a silent argument in the passive. We challenge this conclusion by reporting that we also find no processing cost for remote implicit control, as in: “The ship was sunk. The reason was to collect the insurance.” Here the dependency crosses two independent sentences, and so cannot, we argue, be mediated by syntax. Our Experiments 1–4 examined the processing of both implicit (short passive) and explicit (active or long passive) control in both local and remote configurations. Experiments 3 and 4 added either “3 days ago” or “just in order” to the local conditions, to control for the distance between the passive and infinitival verbs, and for the predictability of the reason clause, respectively. We replicate the finding that implicit control does not impose an additional processing cost. But critically we show that remote control does not impose a processing cost either. Reading times at the reason clause were never slower when control was remote. In fact they were always faster. Thus, efficient processing of local implicit control cannot show that implicit control is mediated by syntax; nor, in turn, that there is a silent but grammatically active argument in
The influence of complexes on implicit learning.
Shin, Yong-Wook; Lee, Joong-Sun; Han, Oh-Su; Rhi, Bou-Yong
2005-04-01
A century ago, Jung looked into the unconscious through complexes by using word association tests. Jung wrote, 'modern psychology with its investigation of complexes has opened up a psychic taboo area riddled with hopes and fears', and complexes remain an unexplored taboo area of research. In the present study, we have investigated the influence of complexes on unconscious cognitive processing, in particular on implicit learning. We have found that complexes shown to disturb conscious cognitive processing in fact enhanced the attention of the subjects and their performance on an implicit learning task. These results suggest that complexes are not just abstractions, but have various actual influences on both conscious and unconscious processing.
Measurement of off-diagonal transport coefficients in two-phase flow in porous media.
Ramakrishnan, T S; Goode, P A
2015-07-01
The prevalent description of low capillary number two-phase flow in porous media relies on the independence of phase transport. An extended Darcy's law with a saturation dependent effective permeability is used for each phase. The driving force for each phase is given by its pressure gradient and the body force. This diagonally dominant form neglects momentum transfer from one phase to the other. Numerical and analytical modeling in regular geometries have however shown that while this approximation is simple and acceptable in some cases, many practical problems require inclusion of momentum transfer across the interface. Its inclusion leads to a generalized form of extended Darcy's law in which both the diagonal relative permeabilities and the off-diagonal terms depend not only on saturation but also on the viscosity ratio. Analogous to application of thermodynamics to dynamical systems, any of the extended forms of Darcy's law assumes quasi-static interfaces of fluids for describing displacement problems. Despite the importance of the permeability coefficients in oil recovery, soil moisture transport, contaminant removal, etc., direct measurements to infer the magnitude of the off-diagonal coefficients have been lacking. The published data based on cocurrent and countercurrent displacement experiments are necessarily indirect. In this paper, we propose a null experiment to measure the off-diagonal term directly. For a given non-wetting phase pressure-gradient, the null method is based on measuring a counter pressure drop in the wetting phase required to maintain a zero flux. The ratio of the off-diagonal coefficient to the wetting phase diagonal coefficient (relative permeability) may then be determined. The apparatus is described in detail, along with the results obtained. We demonstrate the validity of the experimental results and conclude the paper by comparing experimental data to numerical simulation.
Adapting implicit methods to parallel processors
Reeves, L.; McMillin, B.; Okunbor, D.; Riggins, D.
1994-12-31
When numerically solving many types of partial differential equations, it is advantageous to use implicit methods because of their better stability and more flexible parameter choice, (e.g. larger time steps). However, since implicit methods usually require simultaneous knowledge of the entire computational domain, these methods axe difficult to implement directly on distributed memory parallel processors. This leads to infrequent use of implicit methods on parallel/distributed systems. The usual implementation of implicit methods is inefficient due to the nature of parallel systems where it is common to take the computational domain and distribute the grid points over the processors so as to maintain a relatively even workload per processor. This creates a problem at the locations in the domain where adjacent points are not on the same processor. In order for the values at these points to be calculated, messages have to be exchanged between the corresponding processors. Without special adaptation, this will result in idle processors during part of the computation, and as the number of idle processors increases, the lower the effective speed improvement by using a parallel processor.
Recollective performance advantages for implicit memory tasks.
Sheldon, Signy A M; Moscovitch, Morris
2010-10-01
A commonly held assumption is that processes underlying explicit and implicit memory are distinct. Recent evidence, however, suggests that they may interact more than previously believed. Using the remember-know procedure the current study examines the relation between recollection, a process thought to be exclusive to explicit memory, and performance on two implicit memory tasks, lexical decision and word stem completion. We found that, for both implicit tasks, words that were recollected were associated with greater priming effects than were words given a subsequent familiarity rating or words that had been studied but were not recognised (misses). Broadly, our results suggest that non-voluntary processes underlying explicit memory also benefit priming, a measure of implicit memory. More specifically, given that this benefit was due to a particular aspect of explicit memory (recollection), these results are consistent with some strength models of memory and with Moscovitch's (2008) proposal that recollection is a two-stage process, one rapid and unconscious and the other more effortful and conscious.
Development of Implicit and Explicit Category Learning
ERIC Educational Resources Information Center
Huang-Pollock, Cynthia L.; Maddox, W. Todd; Karalunas, Sarah L.
2011-01-01
We present two studies that examined developmental differences in the implicit and explicit acquisition of category knowledge. College-attending adults consistently outperformed school-age children on two separate information-integration paradigms due to children's more frequent use of an explicit rule-based strategy. Accuracy rates were also…
Implicit Social Scaling from an Institutional Perspective
ERIC Educational Resources Information Center
D'Epifanio, Giulio
2009-01-01
The methodological question concerns constructing a cardinal social index, in order to assess performances of social agents, taking into account implicit political judgments. Based on the formal structure of a Choquet's expected utility, index construction demands quantification of levels of a meaningful ordinal indicator of overall performance.…
Crosslinguistic Differences in Implicit Language Learning
ERIC Educational Resources Information Center
Leung, Janny H. C.; Williams, John N.
2014-01-01
We report three experiments that explore the effect of prior linguistic knowledge on implicit language learning. Native speakers of English from the United Kingdom and native speakers of Cantonese from Hong Kong participated in experiments that involved different learning materials. In Experiment 1, both participant groups showed evidence of…
On stiffly stable implicit linear multistep methods.
NASA Technical Reports Server (NTRS)
Cooke, C. H.
1972-01-01
The motivation to increase the step size with no degradation of numerical accuracy and stability has led to the discovery of particular members of the class of stiffly stable implicit linear multistep algorithms. Sufficient conditions for a consistent linear multistep method to be stiffly stable are given. These conditions involve properties of the stability mapping from the extended complex plane onto itself.
Thinking Styles in Implicit and Explicit Learning
ERIC Educational Resources Information Center
Xie, Qiuzhi; Gao, Xiangping; King, Ronnel B.
2013-01-01
This study investigated whether individual differences in thinking styles influence explicit and implicit learning. Eighty-seven university students in China participated in this study. Results indicated that performance in the explicit learning condition was positively associated with Type I thinking styles (i.e. legislative and liberal styles)…
Strategic Game Moves Mediate Implicit Science Learning
ERIC Educational Resources Information Center
Rowe, Elizabeth; Baker, Ryan S.; Asbell-Clarke, Jodi
2015-01-01
Educational games have the potential to be innovative forms of learning assessment, by allowing us to not just study their knowledge but the process that takes students to that knowledge. This paper examines the mediating role of players' moves in digital games on changes in their pre-post classroom measures of implicit science learning. We…
Implicit theories and ability emotional intelligence.
Cabello, Rosario; Fernández-Berrocal, Pablo
2015-01-01
Previous research has shown that people differ in their implicit theories about the essential characteristics of intelligence and emotions. Some people believe these characteristics to be predetermined and immutable (entity theorists), whereas others believe that these characteristics can be changed through learning and behavior training (incremental theorists). The present study provides evidence that in healthy adults (N = 688), implicit beliefs about emotions and emotional intelligence (EI) may influence performance on the ability-based Mayer-Salovey-Caruso Emotional Intelligence Test (MSCEIT). Adults in our sample with incremental theories about emotions and EI scored higher on the MSCEIT than entity theorists, with implicit theories about EI showing a stronger relationship to scores than theories about emotions. Although our participants perceived both emotion and EI as malleable, they viewed emotions as more malleable than EI. Women and young adults in general were more likely to be incremental theorists than men and older adults. Furthermore, we found that emotion and EI theories mediated the relationship of gender and age with ability EI. Our findings suggest that people's implicit theories about EI may influence their emotional abilities, which may have important consequences for personal and professional EI training.
Implicit theories and ability emotional intelligence
Cabello, Rosario; Fernández-Berrocal, Pablo
2015-01-01
Previous research has shown that people differ in their implicit theories about the essential characteristics of intelligence and emotions. Some people believe these characteristics to be predetermined and immutable (entity theorists), whereas others believe that these characteristics can be changed through learning and behavior training (incremental theorists). The present study provides evidence that in healthy adults (N = 688), implicit beliefs about emotions and emotional intelligence (EI) may influence performance on the ability-based Mayer-Salovey-Caruso Emotional Intelligence Test (MSCEIT). Adults in our sample with incremental theories about emotions and EI scored higher on the MSCEIT than entity theorists, with implicit theories about EI showing a stronger relationship to scores than theories about emotions. Although our participants perceived both emotion and EI as malleable, they viewed emotions as more malleable than EI. Women and young adults in general were more likely to be incremental theorists than men and older adults. Furthermore, we found that emotion and EI theories mediated the relationship of gender and age with ability EI. Our findings suggest that people’s implicit theories about EI may influence their emotional abilities, which may have important consequences for personal and professional EI training. PMID:26052309
Implicit Theories about Everyday Problem Solving.
ERIC Educational Resources Information Center
Herbert, Margaret E.; Dionne, Jean-Paul
Mental models or implicit theories held by adults about everyday problem solving were studied. Research questions were posed to 12 male and 12 female adults, aged 25 to 60 years, from a wide range of educational and occupational orientations. Subjects were interviewed in pairs. Verbal Protocol Analysis was used to analyze the data from two…
Identifying, Quantifying, Extracting and Enhancing Implicit Parallelism
ERIC Educational Resources Information Center
Agarwal, Mayank
2009-01-01
The shift of the microprocessor industry towards multicore architectures has placed a huge burden on the programmers by requiring explicit parallelization for performance. Implicit Parallelization is an alternative that could ease the burden on programmers by parallelizing applications "under the covers" while maintaining sequential semantics…
Implicit Training of Nonnative Speech Stimuli
ERIC Educational Resources Information Center
Vlahou, Eleni L.; Protopapas, Athanassios; Seitz, Aaron R.
2012-01-01
Learning nonnative speech contrasts in adulthood has proven difficult. Standard training methods have achieved moderate effects using explicit instructions and performance feedback. In this study, the authors question preexisting assumptions by demonstrating a superiority of implicit training procedures. They trained 3 groups of Greek adults on a…
Implicit Assumptions in High Potentials Recruitment
ERIC Educational Resources Information Center
Posthumus, Jan; Bozer, Gil; Santora, Joseph C.
2016-01-01
Purpose: Professionals of human resources (HR) use different criteria in practice than they verbalize. Thus, the aim of this research was to identify the implicit criteria used for the selection of high-potential employees in recruitment and development settings in the pharmaceutical industry. Design/methodology/approach: A semi-structured…
Implicit variational principle for contact Hamiltonian systems
NASA Astrophysics Data System (ADS)
Wang, Kaizhi; Wang, Lin; Yan, Jun
2017-02-01
We establish an implicit variational principle for the contact Hamiltonian systems generated by the Hamiltonian H(x, u, p) with respect to the contact 1-form α =\\text{d}u-p\\text{d}x under Tonelli and Lipschitz continuity conditions.
Implicit Learning of Semantic Preferences of Verbs
ERIC Educational Resources Information Center
Paciorek, Albertyna; Williams, John N.
2015-01-01
Previous studies of semantic implicit learning in language have only examined learning grammatical form-meaning connections in which learning could have been supported by prior linguistic knowledge. In this study we target the domain of verb meaning, specifically semantic preferences regarding novel verbs (e.g., the preference for a novel verb to…
Implicit Measures of Association in Psychopathology Research
ERIC Educational Resources Information Center
Roefs, Anne; Huijding, Jorg; Smulders, Fren T. Y.; MacLeod, Colin M.; de Jong, Peter J.; Wiers, Reinout W.; Jansen, Anita T. M.
2011-01-01
Validity;Measures (Individuals);Studies obtaining implicit measures of associations in "Diagnostic and Statistical Manual of Mental Disorders" (4th ed., Text Revision; American Psychiatric Association, 2000) Axis I psychopathology are organized into three categories: (a) studies comparing groups having a disorder with controls, (b) experimental…
Implicit Reading in Chinese Pure Alexia
ERIC Educational Resources Information Center
Shan, Chunlei; Zhu, Renjing; Xu, Mingwei; Luo, Benyan; Weng, Xuchu
2010-01-01
A number of recent studies have shown that some patients with pure alexia display evidence of implicit access to lexical and semantic information about words that they cannot read explicitly. This phenomenon has not been investigated systematically in Chinese patients. We report here a case study of a Chinese patient who met the criteria for pure…
Three-dimensional implicit lambda methods
NASA Technical Reports Server (NTRS)
Napolitano, M.; Dadone, A.
1983-01-01
This paper derives the three dimensional lambda-formulation equations for a general orthogonal curvilinear coordinate system and provides various block-explicit and block-implicit methods for solving them, numerically. Three model problems, characterized by subsonic, supersonic and transonic flow conditions, are used to assess the reliability and compare the efficiency of the proposed methods.
Implicit emotion regulation affects outcome evaluation.
Yang, Qiwei; Tang, Ping; Gu, Ruolei; Luo, Wenbo; Luo, Yue-jia
2015-06-01
Efficient implicit emotion regulation processes, which run without awareness, are important for human well-being. In this study, to investigate the influence of implicit emotion regulation on psychological and electrophysiological responses to gains and losses, participants were required to select between two Chinese four-character idioms to match the meaning of the third one before they performed a monetary gambling task. According to whether their meanings were related to emotion regulation, the idioms fell into two categories. Event-related potentials and self-rating emotional experiences to outcome feedback were recorded during the task. Priming emotion regulation reduced subjective emotional experience to both gains and losses and the amplitudes of the feedback-related negativity, while the P3 component was not influenced. According to these results, we suggest that the application of implicit emotion regulation effectively modulated the subjective emotional experience and the motivational salience of current outcomes without the cost of cognitive resources. This study implicates the potential significance of implicit emotion regulation in decision-making processes.
The single category implicit association test as a measure of implicit social cognition.
Karpinski, Andrew; Steinman, Ross B
2006-07-01
The Single Category Implicit Association Test (SC-IAT) is a modification of the Implicit Association Test that measures the strength of evaluative associations with a single attitude object. Across 3 different attitude domains--soda brand preferences, self-esteem, and racial attitudes--the authors found evidence that the SC-IAT is internally consistent and makes unique contributions in the ability to understand implicit social cognition. In a 4th study, the authors investigated the susceptibility of the SC-IAT to faking or self-presentational concerns. Once participants with high error rates were removed, no significant self-presentation effect was observed. These results provide initial evidence for the reliability and validity of the SC-IAT as an individual difference measure of implicit social cognition.
Questioning Children: Interactional Evidence of Implicit Bias in Medical Interviews
ERIC Educational Resources Information Center
Stivers, Tanya; Majid, Asifa
2007-01-01
Social psychologists have shown experimentally that implicit race bias can influence an individual's behavior. Implicit bias has been suggested to be more subtle and less subject to cognitive control than more explicit forms of racial prejudice. Little is known about how implicit bias is manifest in naturally occurring social interaction. This…
Implicit Referential Meaning with Reference to English Arabic Translation
ERIC Educational Resources Information Center
Al-Zughoul, Basem
2014-01-01
The purpose of this study is to investigate how English implicit referential meaning is translated into Arabic by analyzing sentences containing implicit referential meanings found in the novel "Harry Potter and the Prisoner of Azkaban". The analysis shows that the translation of English implicit referential meaning into Arabic can be…
Implicit Statistical Learning and Language Skills in Bilingual Children
ERIC Educational Resources Information Center
Yim, Dongsun; Rudoy, John
2013-01-01
Purpose: Implicit statistical learning in 2 nonlinguistic domains (visual and auditory) was used to investigate (a) whether linguistic experience influences the underlying learning mechanism and (b) whether there are modality constraints in predicting implicit statistical learning with age and language skills. Method: Implicit statistical learning…
Constraints on Implicit Learning of Grammatical Form-Meaning Connections
ERIC Educational Resources Information Center
Leung, Janny H. C.; Williams, John N.
2012-01-01
Although there is good evidence for implicit learning of associations between forms, little work has investigated implicit learning of form-meaning connections, and the findings are somewhat contradictory. Two experiments were carried out using a novel reaction time methodology to investigate implicit learning of grammatical form-meaning…
Snagowski, Jan; Wegmann, Elisa; Pekal, Jaro; Laier, Christian; Brand, Matthias
2015-10-01
Recent studies show similarities between cybersex addiction and substance dependencies and argue to classify cybersex addiction as a behavioral addiction. In substance dependency, implicit associations are known to play a crucial role, and such implicit associations have not been studied in cybersex addiction, so far. In this experimental study, 128 heterosexual male participants completed an Implicit Association Test (IAT; Greenwald, McGhee, & Schwartz, 1998) modified with pornographic pictures. Further, problematic sexual behavior, sensitivity towards sexual excitation, tendencies towards cybersex addiction, and subjective craving due to watching pornographic pictures were assessed. Results show positive relationships between implicit associations of pornographic pictures with positive emotions and tendencies towards cybersex addiction, problematic sexual behavior, sensitivity towards sexual excitation as well as subjective craving. Moreover, a moderated regression analysis revealed that individuals who reported high subjective craving and showed positive implicit associations of pornographic pictures with positive emotions, particularly tended towards cybersex addiction. The findings suggest a potential role of positive implicit associations with pornographic pictures in the development and maintenance of cybersex addiction. Moreover, the results of the current study are comparable to findings from substance dependency research and emphasize analogies between cybersex addiction and substance dependencies or other behavioral addictions.
Hamm, L.L.; Van Brunt, V.
1982-08-01
A comparison of implicit Runge-Kutta and orthogonal collocation methods is made for the numerical solution to the ordinary differential equation which describes the high-pressure vapor-liquid equilibria of a binary system. The systems of interest are limited to binary solubility systems where one of the components is supercritical and exists as a noncondensable gas in the pure state. Of the two methods - implicit Runge-Kuta and orthogonal collocation - this paper attempts to present some preliminary but not necessarily conclusive results that the implicit Runge-Kutta method is superior for the solution to the ordinary differential equation utilized in the thermodynamic consistency testing of binary solubility systems. Due to the extreme nonlinearity of thermodynamic properties in the region near the critical locus, an extended cubic spline fitting technique is devised for correlating the P-x data. The least-squares criterion is employed in smoothing the experimental data. Even though the derivation is presented specifically for the correlation of P-x data, the technique could easily be applied to any thermodynamic data by changing the endpoint requirements. The volumetric behavior of the systems must be given or predicted in order to perform thermodynamic consistency tests. A general procedure is developed for predicting the volumetric behavior required and some indication as to the expected limit of accuracy is given.
ERIC Educational Resources Information Center
Hughes, Sean; Barnes-Holmes, Dermot
2011-01-01
Research increasingly supports the Implicit Relational Assessment Procedure (IRAP) as a measure capable of providing a sensitive index of preexisting implicit attitudes and cognitions. The current study constitutes the first attempt to determine if the IRAP is also sensitive to implicit attitudes engineered through either direct relational…
Multi-subject Manifold Alignment of Functional Network Structures via Joint Diagonalization.
Nenning, Karl-Heinz; Kollndorfer, Kathrin; Schöpf, Veronika; Prayer, Daniela; Langs, Georg
2015-01-01
Functional magnetic resonance imaging group studies rely on the ability to establish correspondence across individuals. This enables location specific comparison of functional brain characteristics. Registration is often based on morphology and does not take variability of functional localization into account. This can lead to a loss of specificity, or confounds when studying diseases. In this paper we propose multi-subject functional registration by manifold alignment via coupled joint diagonalization. The functional network structure of each subject is encoded in a diffusion map, where functional relationships are decoupled from spatial position. Two-step manifold alignment estimates initial correspondences between functionally equivalent regions. Then, coupled joint diagonalization establishes common eigenbases across all individuals, and refines the functional correspondences. We evaluate our approach on fMRI data acquired during a language paradigm. Experiments demonstrate the benefits in matching accuracy achieved by coupled joint diagonalization compared to previously proposed functional alignment approaches, or alignment based on structural correspondences.
186 K Operation of Terahertz Quantum-Cascade Lasers Based on a Diagonal Design
NASA Technical Reports Server (NTRS)
Kumar, Sushil; Hu, Qing; Reno, John L.
2009-01-01
Resonant-phonon terahertz quantum-cascade lasers operating up to a heat-sink temperature of 186 K are demonstrated. This record temperature performance is achieved based on a diagonal design, with the objective to increase the upper-state lifetime and therefore the gain at elevated temperatures. The increased diagonality also lowers the operating current densities by limiting the flow of parasitic leakage current. Quantitatively, the diagonality is characterized by a radiative oscillator strength that is smaller by a factor of two from the least of any previously published designs. At the lasing frequency of 3.9 THz, 63 mW of peak optical power was measured at 5 K, and approximately 5 mW could still be detected at 180 K.
Phase-context decomposition of diagonal unitaries for higher-dimensional systems
NASA Astrophysics Data System (ADS)
Beer, Kerstin; Dziemba, Friederike Anna
2016-05-01
We generalize the efficient decomposition method for phase-sparse diagonal operators of J. Welch et al. [Quantum Info. Comput. 16, 87 (2016)] to qudit systems. The phase-context-aware method focuses on cascaded entanglers, whose decomposition into multicontrolled inc gates can be optimized by the choice of a proper signed base-d representation for the natural numbers. While the gate count of the best-known decomposition method for general diagonal operators on qubit systems scales with O (2n) , the circuits synthesized by the Welch algorithm for diagonal operators with k distinct phases are upper-bounded by O (n2k ) , which is generalized to O (d n2k ) for the qudit case in this paper.
Bias-Corrected Diagonal Discriminant Rules for High-Dimensional Classification
Huang, Song; Tong, Tiejun; Zhao, Hongyu
2011-01-01
Summary Diagonal discriminant rules have been successfully used for high-dimensional classification problems, but suffer from the serious drawback of biased discriminant scores. In this paper, we propose improved diagonal discriminant rules with bias-corrected discriminant scores for high-dimensional classification. We show that the proposed discriminant scores dominate the standard ones under the quadratic loss function. Analytical results on why the bias-corrected rules can potentially improve the predication accuracy are also provided. Finally, we demonstrate the improvement of the proposed rules over the original ones through extensive simulation studies and real case studies. PMID:20222939
Disorder and interaction in 2D: exact diagonalization study of the Anderson-Hubbard-Mott model.
Kotlyar, R; Das Sarma, S
2001-03-12
We investigate, by numerically calculating the charge stiffness, the effects of random diagonal disorder and electron-electron interaction on the nature of the ground state in the 2D Hubbard model through the finite-size exact diagonalization technique. By comparing with the corresponding 1D Hubbard model results and by using heuristic arguments we conclude that it is unlikely that there is a 2D metal-insulator quantum phase transition, although the effect of interaction in some range of parameters is to substantially enhance the noninteracting charge stiffness.
Boundary energy of the open XXX chain with a non-diagonal boundary term
NASA Astrophysics Data System (ADS)
Nepomechie, Rafael I.; Wang, Chunguang
2014-01-01
We analyze the ground state of the open spin-1/2 isotropic quantum spin chain with a non-diagonal boundary term using a recently proposed Bethe ansatz solution. As the coefficient of the non-diagonal boundary term tends to zero, the Bethe roots split evenly into two sets: those that remain finite, and those that become infinite. We argue that the former satisfy conventional Bethe equations, while the latter satisfy a generalization of the Richardson-Gaudin equations. We derive an expression for the leading correction to the boundary energy in terms of the boundary parameters.
Carlson, K.D.; Lin, W.L.; Chen, C.J. |
1999-05-01
Part 1 of this study discusses the diagonal Cartesian method for temperature analysis. The application of this method to the analysis of flow and conjugate heat transfer in a compact heat exchanger is given in Part 2. In addition to a regular (i.e., Cartesian-oriented) fin arrangement, two complex fin arrangements are modeled using the diagonal Cartesian method. The pressure drop and heat transfer characteristics of the different configurations are compared. It is found that enhanced heat transfer and reduced pressure drop can be obtained with the modified fin arrangements for this compact heat exchanger.
Jiang, Tongsong; Jiang, Ziwu; Zhang, Zhaozhong
2015-08-15
In the study of the relation between complexified classical and non-Hermitian quantum mechanics, physicists found that there are links to quaternionic and split quaternionic mechanics, and this leads to the possibility of employing algebraic techniques of split quaternions to tackle some problems in complexified classical and quantum mechanics. This paper, by means of real representation of a split quaternion matrix, studies the problem of diagonalization of a split quaternion matrix and gives algebraic techniques for diagonalization of split quaternion matrices in split quaternionic mechanics.
Exact solution of the trigonometric SU(3) spin chain with generic off-diagonal boundary reflections
NASA Astrophysics Data System (ADS)
Li, Guang-Liang; Cao, Junpeng; Hao, Kun; Wen, Fakai; Yang, Wen-Li; Shi, Kangjie
2016-09-01
The nested off-diagonal Bethe ansatz is generalized to study the quantum spin chain associated with the SUq (3)R-matrix and generic integrable non-diagonal boundary conditions. By using the fusion technique, certain closed operator identities among the fused transfer matrices at the inhomogeneous points are derived. The corresponding asymptotic behaviors of the transfer matrices and their values at some special points are given in detail. Based on the functional analysis, a nested inhomogeneous T-Q relations and Bethe ansatz equations of the system are obtained. These results can be naturally generalized to cases related to the SUq (n) algebra.
Guehne, Otfried; Jungnitsch, Bastian; Moroder, Tobias; Weinstein, Yaakov S.
2011-11-15
The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum-information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit Y-shaped graph, and for a family of graph states with an arbitrary number of qubits.
Offline consolidation in implicit sequence learning.
Meier, Beat; Cock, Josephine
2014-08-01
The goal of this study was to investigate offline memory consolidation with regard to general motor skill learning and implicit sequence-specific learning. We trained young adults on a serial reaction time task with a retention interval of either 24 h (Experiment 1) or 1 week (Experiment 2) between two sessions. We manipulated sequence complexity (deterministic vs probabilistic) and motor responses (unimanual or vs bimanual). We found no evidence of offline memory consolidation for sequence-specific learning with either interval (in the sense of no deterioration over the interval but no further improvement either). However, we did find evidence of offline enhancement of general motor skill learning with both intervals, independent of kind of sequence or kind of response. These results suggest that general motor skill learning, but not sequence-specific learning, appears to be enhanced during offline intervals in implicit sequence learning.
How implicit is visual statistical learning?
Bertels, Julie; Franco, Ana; Destrebecqz, Arnaud
2012-09-01
In visual statistical learning, participants learn the statistical regularities present in a sequence of visual shapes. A recent study (Kim, Seitz, Feenstra, & Shams, 2009) suggests that visual statistical learning occurs implicitly, as it is not accompanied by conscious awareness of these regularities. However, that interpretation of the data depends on 2 unwarranted assumptions concerning the nature and sensitivity of the tasks used to measure learning. In a replication of this study, we used a 4-choice completion task as a direct measure of learning, in addition to an indirect measure consisting of a rapid serial visual presentation task. Moreover, binary confidence judgments were recorded after each completion trial. This way, we measured systematically the extent to which sequence knowledge was available to consciousness. Supporting the notion that the role of unconscious knowledge was overestimated in Kim et al.'s study, our results reveal that participants' performance cannot be exclusively accounted for by implicit knowledge.
Machine Understanding of Human Implicit Intention
2013-05-18
Cognitive Neurodynamics , Hokkaido, Japan, June 2011, Hokkaido, Japan (Plenary Talk) - Soo-Young Lee, Implicit Intention Recognition and Hierarchical...subject’s response with the accuracy of about 80% by SVM. 15. SUBJECT TERMS Brain Science and Engineering; Cognitive Neuroscience; Human-Computer...oscillations have been related to a variety of functions such as perception, cognition , sleep, etc. For a long time, researchers have found the sensory and
Toward a meaningful metric of implicit prejudice.
Blanton, Hart; Jaccard, James; Strauts, Erin; Mitchell, Gregory; Tetlock, Philip E
2015-09-01
[Correction Notice: An Erratum for this article was reported in Vol 100(5) of Journal of Applied Psychology (see record 2015-40760-001). there are errors in some of the values listed in Table 6 that do not alter any of the conclusions or substantive statements in the original article. The corrected portion of Table 6 is in the correction. The positive intercepts in this table represent the estimated IAT score when the criterion has a value of zero (suggesting attitudinal neutrality), except in the equation examining voter preference in Greenwald et al. (2009), where the intercept estimated the IAT score of Obama voters.] The modal distribution of the Implicit Association Test (IAT) is commonly interpreted as showing high levels of implicit prejudice among Americans. These interpretations have fueled calls for changes in organizational and legal practices, but such applications are problematic because the IAT is scored on an arbitrary psychological metric. The present research was designed to make the IAT metric less arbitrary by determining the scores on IAT measures that are associated with observable racial or ethnic bias. By reexamining data from published studies, we found evidence that the IAT metric is "right biased," such that individuals who are behaviorally neutral tend to have positive IAT scores. Current scoring conventions fail to take into account these dynamics and can lead to faulty inferences about the prevalence of implicit prejudice.
Benchmarking the Multidimensional Stellar Implicit Code MUSIC
NASA Astrophysics Data System (ADS)
Goffrey, T.; Pratt, J.; Viallet, M.; Baraffe, I.; Popov, M. V.; Walder, R.; Folini, D.; Geroux, C.; Constantino, T.
2017-03-01
We present the results of a numerical benchmark study for the MUltidimensional Stellar Implicit Code (MUSIC) based on widely applicable two- and three-dimensional compressible hydrodynamics problems relevant to stellar interiors. MUSIC is an implicit large eddy simulation code that uses implicit time integration, implemented as a Jacobian-free Newton Krylov method. A physics based preconditioning technique which can be adjusted to target varying physics is used to improve the performance of the solver. The problems used for this benchmark study include the Rayleigh-Taylor and Kelvin-Helmholtz instabilities, and the decay of the Taylor-Green vortex. Additionally we show a test of hydrostatic equilibrium, in a stellar environment which is dominated by radiative effects. In this setting the flexibility of the preconditioning technique is demonstrated. This work aims to bridge the gap between the hydrodynamic test problems typically used during development of numerical methods and the complex flows of stellar interiors. A series of multidimensional tests were performed and analysed. Each of these test cases was analysed with a simple, scalar diagnostic, with the aim of enabling direct code comparisons. As the tests performed do not have analytic solutions, we verify MUSIC by comparing it to established codes including ATHENA and the PENCIL code. MUSIC is able to both reproduce behaviour from established and widely-used codes as well as results expected from theoretical predictions. This benchmarking study concludes a series of papers describing the development of the MUSIC code and provides confidence in future applications.
Implicit constitutive relations for nonlinear magnetoelastic bodies
Bustamante, R.; Rajagopal, K. R.
2015-01-01
Implicit constitutive relations that characterize the response of elastic bodies have greatly enhanced the arsenal available at the disposal of the analyst working in the field of elasticity. This class of models were recently extended to describe electroelastic bodies by the present authors. In this paper, we extend the development of implicit constitutive relations to describe the behaviour of elastic bodies that respond to magnetic stimuli. The models that are developed provide a rational way to describe phenomena that have hitherto not been adequately described by the classical models that are in place. After developing implicit constitutive relations for magnetoelastic bodies undergoing large deformations, we consider the linearization of the models within the context of small displacement gradients. We then use the linearized model to describe experimentally observed phenomena which the classical linearized magnetoelastic models are incapable of doing. We also solve several boundary value problems within the context of the models that are developed: extension and shear of a slab, and radial inflation and extension of a cylinder. PMID:25792968
Implicit constitutive relations for nonlinear magnetoelastic bodies.
Bustamante, R; Rajagopal, K R
2015-03-08
Implicit constitutive relations that characterize the response of elastic bodies have greatly enhanced the arsenal available at the disposal of the analyst working in the field of elasticity. This class of models were recently extended to describe electroelastic bodies by the present authors. In this paper, we extend the development of implicit constitutive relations to describe the behaviour of elastic bodies that respond to magnetic stimuli. The models that are developed provide a rational way to describe phenomena that have hitherto not been adequately described by the classical models that are in place. After developing implicit constitutive relations for magnetoelastic bodies undergoing large deformations, we consider the linearization of the models within the context of small displacement gradients. We then use the linearized model to describe experimentally observed phenomena which the classical linearized magnetoelastic models are incapable of doing. We also solve several boundary value problems within the context of the models that are developed: extension and shear of a slab, and radial inflation and extension of a cylinder.
Implicit Shape Parameterization for Kansei Design Methodology
NASA Astrophysics Data System (ADS)
Nordgren, Andreas Kjell; Aoyama, Hideki
Implicit shape parameterization for Kansei design is a procedure that use 3D-models, or concepts, to span a shape space for surfaces in the automotive field. A low-dimensional, yet accurate shape descriptor was found by Principal Component Analysis of an ensemble of point-clouds, which were extracted from mesh-based surfaces modeled in a CAD-program. A theoretical background of the procedure is given along with step-by-step instructions for the required data-processing. The results show that complex surfaces can be described very efficiently, and encode design features by an implicit approach that does not rely on error-prone explicit parameterizations. This provides a very intuitive way to explore shapes for a designer, because various design features can simply be introduced by adding new concepts to the ensemble. Complex shapes have been difficult to analyze with Kansei methods due to the large number of parameters involved, but implicit parameterization of design features provides a low-dimensional shape descriptor for efficient data collection, model-building and analysis of emotional content in 3D-surfaces.
A unified discontinuous Galerkin framework for time integration.
Zhao, Shan; Wei, G W
2014-05-15
We introduce a new discontinuous Galerkin approach for time integration. On the basis of the method of weighted residual, numerical quadratures are employed in the finite element time discretization to account for general nonlinear ordinary differential equations. Many different conditions, including explicit, implicit, and symplectic conditions, are enforced for the test functions in the variational analysis to obtain desirable features of the resulting time-stepping scheme. The proposed discontinuous Galerkin approach provides a unified framework to derive various time-stepping schemes, such as low-order one-step methods, Runge-Kutta methods, and multistep methods. On the basis of the proposed framework, several explicit Runge-Kutta methods of different orders are constructed. The derivation of symplectic Runge-Kutta methods has also been realized. The proposed framework allows the optimization of new schemes in terms of several characteristics, such as accuracy, sparseness, and stability. The accuracy optimization is performed on the basis of an analytical form of the error estimation function for a linear test initial value problem. Schemes with higher formal order of accuracy are found to provide more accurate solutions. We have also explored the optimization potential of sparseness, which is related to the general compressive sensing in signal/imaging processing. Two critical dimensions of the stability region, that is, maximal intervals along the imaginary and negative real axes, are employed as the criteria for stability optimization. This gives the largest Courant-Friedrichs-Lewy time steps in solving hyperbolic and parabolic partial differential equations, respectively. Numerical experiments are conducted to validate the optimized time-stepping schemes.
NASA Astrophysics Data System (ADS)
Savard, B.; Xuan, Y.; Bobbitt, B.; Blanquart, G.
2015-08-01
A semi-implicit preconditioned iterative method is proposed for the time-integration of the stiff chemistry in simulations of unsteady reacting flows, such as turbulent flames, using detailed chemical kinetic mechanisms. Emphasis is placed on the simultaneous treatment of convection, diffusion, and chemistry, without using operator splitting techniques. The preconditioner corresponds to an approximation of the diagonal of the chemical Jacobian. Upon convergence of the sub-iterations, the fully-implicit, second-order time-accurate, Crank-Nicolson formulation is recovered. Performance of the proposed method is tested theoretically and numerically on one-dimensional laminar and three-dimensional high Karlovitz turbulent premixed n-heptane/air flames. The species lifetimes contained in the diagonal preconditioner are found to capture all critical small chemical timescales, such that the largest stable time step size for the simulation of the turbulent flame with the proposed method is limited by the convective CFL, rather than chemistry. The theoretical and numerical stability limits are in good agreement and are independent of the number of sub-iterations. The results indicate that the overall procedure is second-order accurate in time, free of lagging errors, and the cost per iteration is similar to that of an explicit time integration. The theoretical analysis is extended to a wide range of flames (premixed and non-premixed), unburnt conditions, fuels, and chemical mechanisms. In all cases, the proposed method is found (theoretically) to be stable and to provide good convergence rate for the sub-iterations up to a time step size larger than 1 μs. This makes the proposed method ideal for the simulation of turbulent flames.
Positive Definiteness via Off-Diagonal Scaling of a Symmetric Indefinite Matrix
ERIC Educational Resources Information Center
Bentler, Peter M.; Yuan, Ke-Hai
2011-01-01
Indefinite symmetric matrices that are estimates of positive-definite population matrices occur in a variety of contexts such as correlation matrices computed from pairwise present missing data and multinormal based methods for discretized variables. This note describes a methodology for scaling selected off-diagonal rows and columns of such a…
Caprio, M. A.
2011-06-15
Detailed quantitative predictions are obtained for phonon and multiphonon excitations in well-deformed rotor nuclei within the geometric framework, by exact numerical diagonalization of the Bohr Hamiltonian in an SO(5) basis. Dynamical {gamma} deformation is found to significantly influence the predictions through its coupling to the rotational motion. Basic signatures for the onset of rigid triaxial deformation are also obtained.
Mahomed, Ozayr Haroon; Asmall, Shaidah; Freeman, Melvyn
2014-11-01
The integrated chronic disease management model provides a systematic framework for creating a fundamental change in the orientation of the health system. This model adopts a diagonal approach to health system strengthening by establishing a service-linked base to training, supervision, and the opportunity to try out, assess, and implement integrated interventions.
ERIC Educational Resources Information Center
Yildiz Ulus, Aysegul
2013-01-01
This paper examines experimental and algorithmic contributions of advanced calculators (graphing and computer algebra system, CAS) in teaching the concept of "diagonalization," one of the key topics in Linear Algebra courses taught at the undergraduate level. Specifically, the proposed hypothesis of this study is to assess the effective…
NASA Astrophysics Data System (ADS)
Cao, Shancheng; Ouyang, Huajiang
2017-01-01
The structural characteristic deflection shapes (CDS’s) such as mode shapes and operational deflection shapes are highly sensitive to structural damage in beam- or plate-type structures. Nevertheless, they are vulnerable to measurement noise and could result in unacceptable identification errors. In order to increase the accuracy and noise robustness of damage identification based on CDS’s using vibration responses of random excitation, joint approximate diagonalization (JAD) technique and gapped smoothing method (GSM) are combined to form a sensitive and robust damage index (DI), which can simultaneously detect the existence of damage and localize its position. In addition, it is possible to apply this approach to damage identification of structures under ambient excitation. First, JAD method which is an essential technique of blind source separation is investigated to simultaneously diagonalize a set of power spectral density matrices corresponding to frequencies near a certain natural frequency to estimate a joint unitary diagonalizer. The columns of this joint diagonalizer contain dominant CDS’s. With the identified dominant CDS’s around different natural frequencies, GSM is used to extract damage features and a robust damage identification index is then proposed. Numerical and experimental examples of beams with cracks are used to verify the validity and noise robustness of JAD based CDS estimation and the proposed DI. Furthermore, damage identification using dominant CDS’s estimated by JAD method is demonstrated to be more accurate and noise robust than by the commonly used singular value decomposition method.
The effects of pelvic diagonal movements and resistance on the lumbar multifidus
Lee, Ji-Yeon; Lee, Dong-Yeop; Hong, Ji-Heon; Yu, Jae-Ho; Kim, Jin Seop
2017-01-01
[Purpose] The purpose of this study was to compare the effects of pelvic diagonal movements, made with and without resistance, on the thickness of lumbar multifidus muscles. [Subjects and Methods] Participants in this study were healthy subjects who had no musculoskeletal disorders or lumbar-related pain. Participants were positioned on their side and instructed to lie with their hip flexor at 40 degrees. Ultrasonography was used for measurement, and the values of two calculations were averaged. [Results] The thickness of ipsilateral lumbar multifidus muscles showed a significant difference following the exercise of pelvic diagonal movements. The results of anterior elevation movements and posterior depression movements also demonstrated significant difference. There was no significant difference in lumbar multifidus muscles thickness between movements made with and without resistance. [Conclusion] These findings suggest that pelvic diagonal movements can be an effective method to promote muscular activation of the ipsilateral multifidus. Furthermore, researchers have concluded that resistance is not required during pelvic diagonal movements to selectively activate the core muscles. PMID:28356650
NASA Astrophysics Data System (ADS)
Pietracaprina, F.; Gogolin, C.; Goold, J.
2017-03-01
The diagonal ensemble is the infinite time average of a quantum state following unitary dynamics in systems without degeneracies. In analogy to the time average of a classical phase-space dynamics, it is intimately related to the ergodic properties of the quantum system giving information on the spreading of the initial state in the eigenstates of the Hamiltonian. In this work we apply a concept from quantum information, known as total correlations, to the diagonal ensemble. Forming an upper bound on the multipartite entanglement, it quantifies the combination of both classical and quantum correlations in a mixed state. We generalize the total correlations of the diagonal ensemble to more general α -Renyi entropies and focus on the cases α =1 and α =2 with further numerical extensions in mind. Here we show that the total correlations of the diagonal ensemble is a generic indicator of ergodicity breaking, displaying a subextensive behavior when the system is ergodic. We demonstrate this by investigating its scaling in a range of spin chain models focusing not only on the cases of integrability breaking but also emphasize its role in understanding the transition from an ergodic to a many-body localized phase in systems with disorder or quasiperiodicity.
A diagonalization algorithm revisited and applied to the nuclear shell model
NASA Astrophysics Data System (ADS)
Bianco, D.; Andreozzi, F.; Lo Iudice, N.; Porrino, A.; Knapp, F.
2011-02-01
An importance sampling iterative algorithm for diagonalizing large matrices is upgraded and adopted for large scale nuclear shell model calculations using a spin uncoupled basis. Its numerical implementation shows that the iterative procedure converges rapidly to the exact eigensolutions achieving an effective drastic cut of the sizes of the Hamiltonian matrix. Communicated by Professor A Covello
Second Stiefel-Whitney class and spin structures on flat manifolds of diagonal type
NASA Astrophysics Data System (ADS)
Console, Sergio; Rossetti, Juan Pablo; Miatello, Roberto J.
2011-07-01
In this note, using previous works of Miatello and Podestá and of the authors, we provide simple, explicit combinatorial conditions for the existence of a spin structure on a diagonal flat manifold. We show in an elementary way that the above conditions are equivalent to the vanishing of the second Stiefel-Whitney class.
Relation between Feynman cycles and off-diagonal long-range order.
Ueltschi, Daniel
2006-10-27
The usual order parameter for Bose-Einstein condensation involves the off-diagonal correlation function of Penrose and Onsager, but an alternative is Feynman's notion of infinite cycles. We present a formula that relates both order parameters. We discuss its validity with the help of rigorous results and heuristic arguments. The conclusion is that infinite cycles do not always represent the Bose condensate.
Youdas, James W; Adams, Kady E; Bertucci, John E; Brooks, Koel J; Steiner, Meghan M; Hollman, John H
2015-01-01
The aim of this study was to simultaneously quantify electromyographic (EMG) activation levels (% maximum voluntary isometric contraction [MVIC]) within the gluteus medius muscles on both moving and stance limbs across the performance of four proprioceptive neuromuscular facilitation (PNF) spiral-diagonal patterns in standing using resistance provided by elastic tubing. Differential EMG activity was recorded from the gluteus medius muscle of 26 healthy participants. EMG signals were collected with surface electrodes at a sampling frequency of 1000 Hz during three consecutive repetitions of each spiral-diagonal movement pattern. Significant differences existed among the four-spiral-diagonal movement patterns (F3,75 = 19.8; p < 0.001). The diagonal two flexion [D2F] pattern produced significantly more gluteus medius muscle recruitment (50 SD 29.3% MVIC) than any of the other three patterns and the diagonal one extension [D1E] (39 SD 37% MVIC) and diagonal two extension [D2E] (35 SD 29% MVIC) patterns generated more gluteus medius muscle recruitment than diagonal one flexion [D1F] (22 SD 21% MVIC). From a clinical efficiency standpoint, a fitness professional using the spiral-diagonal movement pattern of D2F and elastic tubing with an average peak tension of about 9% body mass may be able to concurrently strengthen the gluteus medius muscle on both stance and moving lower limbs.
ERIC Educational Resources Information Center
Hathout, Leith
2007-01-01
Counting the number of internal intersection points made by the diagonals of irregular convex polygons where no three diagonals are concurrent is an interesting problem in discrete mathematics. This paper uses an iterative approach to develop a summation relation which tallies the total number of intersections, and shows that this total can be…
Who owns implicit attitudes? Testing a metacognitive perspective.
Cooley, Erin; Payne, B Keith; Loersch, Chris; Lei, Ryan
2015-01-01
Metacognitive inferences about ownership for one's implicit attitudes have the power to turn implicit bias into explicit prejudice. In Study 1, participants were assigned to construe their implicit attitudes toward gay men as belonging to themselves (owned) or as unrelated to the self (disowned). Construing one's implicit responses as owned led to greater implicit-explicit attitude correspondence. In Study 2, we measured ownership for implicit attitudes as well as self-esteem. We predicted that ownership inferences would dictate explicit attitudes to the degree that people had positive views of the self. Indeed, higher ownership for implicit bias was associated with greater implicit-explicit attitude correspondence, and this effect was driven by participants high in self-esteem. Finally, in Study 3, we manipulated inferences of ownership and measured self-esteem. Metacognitions of ownership affected implicit-explicit attitude correspondence but only among those with relatively high self-esteem. We conclude that subjective inferences about implicit bias affect explicit prejudice.
NASA Astrophysics Data System (ADS)
Montero, Pedro J.; Cordero-Carrión, Isabel
2012-06-01
Brown [Phys. Rev. DPRVDAQ1550-7998 79, 104029 (2009)] has recently introduced a covariant formulation of the BSSN equations which is well suited for curvilinear coordinate systems. This is particularly desirable as many astrophysical phenomena are symmetric with respect to the rotation axis or are such that curvilinear coordinates adapt better to their geometry. However, the singularities associated with such coordinate systems are known to lead to numerical instabilities unless special care is taken (e.g., regularization at the origin). Cordero-Carrión will present a rigorous derivation of partially implicit Runge-Kutta methods in forthcoming papers, with the aim of treating numerically the stiff source terms in wavelike equations that may appear as a result of the choice of the coordinate system. We have developed a numerical code solving the BSSN equations in spherical symmetry and the general relativistic hydrodynamic equations written in flux-conservative form. A key feature of the code is that it uses a second-order partially implicit Runge-Kutta method to integrate the evolution equations. We perform and discuss a number of tests to assess the accuracy and expected convergence of the code—namely a pure gauge wave, the evolution of a single black hole, the evolution of a spherical relativistic star in equilibrium, and the gravitational collapse of a spherical relativistic star leading to the formation of a black hole. We obtain stable evolutions of regular spacetimes without the need for any regularization algorithm at the origin.
NASA Astrophysics Data System (ADS)
Baumgarte, Thomas W.; Montero, Pedro J.; Cordero-Carrión, Isabel; Müller, Ewald
2013-02-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 Baumgarte-Shapiro-Shibata-Nakamura equations, Montero and Cordero-Carrión recently demonstrated that such a regularization is not necessary when a partially implicit Runge-Kutta method is used for the time evolution of the gravitational fields. Here we report on an implementation of the Baumgarte-Shapiro-Shibata-Nakamura equations in spherical polar coordinates without any symmetry assumptions. Using a partially implicit Runge-Kutta method we obtain stable simulations in three spatial dimensions without the need to regularize the origin or the axis. We perform and discuss a number of tests to assess the stability, accuracy and convergence of the code, namely weak gravitational waves, “hydro-without-hydro” evolutions of spherical and rotating relativistic stars in equilibrium, and single black holes.
An h-adaptive local discontinuous Galerkin method for the Navier-Stokes-Korteweg equations
NASA Astrophysics Data System (ADS)
Tian, Lulu; Xu, Yan; Kuerten, J. G. M.; van der Vegt, J. J. W.
2016-08-01
In this article, we develop a mesh adaptation algorithm for a local discontinuous Galerkin (LDG) discretization of the (non)-isothermal Navier-Stokes-Korteweg (NSK) equations modeling liquid-vapor flows with phase change. This work is a continuation of our previous research, where we proposed LDG discretizations for the (non)-isothermal NSK equations with a time-implicit Runge-Kutta method. To save computing time and to capture the thin interfaces more accurately, we extend the LDG discretization with a mesh adaptation method. Given the current adapted mesh, a criterion for selecting candidate elements for refinement and coarsening is adopted based on the locally largest value of the density gradient. A strategy to refine and coarsen the candidate elements is then provided. We emphasize that the adaptive LDG discretization is relatively simple and does not require additional stabilization. The use of a locally refined mesh in combination with an implicit Runge-Kutta time method is, however, non-trivial, but results in an efficient time integration method for the NSK equations. Computations, including cases with solid wall boundaries, are provided to demonstrate the accuracy, efficiency and capabilities of the adaptive LDG discretizations.
Implicit and explicit learning in individuals with agrammatic aphasia.
Schuchard, Julia; Thompson, Cynthia K
2014-06-01
Implicit learning is a process of acquiring knowledge that occurs without conscious awareness of learning, whereas explicit learning involves the use of overt strategies. To date, research related to implicit learning following stroke has been largely restricted to the motor domain and has rarely addressed implications for language. The present study investigated implicit and explicit learning of an auditory word sequence in 10 individuals with stroke-induced agrammatic aphasia and 18 healthy age-matched participants using an adaptation of the Serial Reaction Time task. Individuals with aphasia showed significant learning under implicit, but not explicit, conditions, whereas age-matched participants learned under both conditions. These results suggest significant implicit learning ability in agrammatic aphasia. Furthermore, results of an auditory sentence span task indicated working memory deficits in individuals with agrammatic aphasia, which are discussed in relation to explicit and implicit learning processes.
Implicit social cognition: attitudes, self-esteem, and stereotypes.
Greenwald, A G; Banaji, M R
1995-01-01
Social behavior is ordinarily treated as being under conscious (if not always thoughtful) control. However, considerable evidence now supports the view that social behavior often operates in an implicit or unconscious fashion. The identifying feature of implicit cognition is that past experience influences judgment in a fashion not introspectively known by the actor. The present conclusion--that attitudes, self-esteem, and stereotypes have important implicit modes of operation--extends both the construct validity and predictive usefulness of these major theoretical constructs of social psychology. Methodologically, this review calls for increased use of indirect measures--which are imperative in studies of implicit cognition. The theorized ordinariness of implicit stereotyping is consistent with recent findings of discrimination by people who explicitly disavow prejudice. The finding that implicit cognitive effects are often reduced by focusing judges' attention on their judgment task provides a basis for evaluating applications (such as affirmative action) aimed at reducing such unintended discrimination.
Implicitly learned suppression of irrelevant spatial locations.
Leber, Andrew B; Gwinn, Rachael E; Hong, Yoolim; O'Toole, Ryan J
2016-12-01
How do we ignore a salient, irrelevant stimulus whose location is predictable? A variety of studies using instructional manipulations have shown that participants possess the capacity to exert location-based suppression. However, for the visual search challenges we face in daily life, we are not often provided explicit instructions and are unlikely to consciously deliberate on what our best strategy might be. Instead, we might rely on our past experience-in the form of implicit learning-to exert strategic control. In this paper, we tested whether implicit learning could drive spatial suppression. In Experiment 1, participants searched displays in which one location contained a target, while another contained a salient distractor. An arrow cue pointed to the target location with 70 % validity. Also, unbeknownst to the participants, the same arrow cue predicted the distractor location with 70 % validity. Results showed facilitated RTs to the predicted target location, confirming target enhancement. Critically, distractor interference was reduced at the predicted distractor location, revealing that participants used spatial suppression. Further, we found that participants had no explicit knowledge of the cue-distractor contingencies, confirming that the learning was implicit. In Experiment 2, to seek further evidence for suppression, we modified the task to include occasional masked probes following the arrow cue; we found worse probe identification accuracy at the predicted distractor location than control locations, providing converging evidence that observers spatially suppressed the predicted distractor locations. These results reveal an ecologically desirable mechanism of suppression, which functions without the need for conscious knowledge or externally guided instructions.
Neural Patterns of the Implicit Association Test
Healy, Graham F.; Boran, Lorraine; Smeaton, Alan F.
2015-01-01
The Implicit Association Test (IAT) is a reaction time based categorization task that measures the differential associative strength between bipolar targets and evaluative attribute concepts as an approach to indexing implicit beliefs or biases. An open question exists as to what exactly the IAT measures, and here EEG (Electroencephalography) has been used to investigate the time course of ERPs (Event-related Potential) indices and implicated brain regions in the IAT. IAT-EEG research identifies a number of early (250–450 ms) negative ERPs indexing early-(pre-response) processing stages of the IAT. ERP activity in this time range is known to index processes related to cognitive control and semantic processing. A central focus of these efforts has been to use IAT-ERPs to delineate the implicit and explicit factors contributing to measured IAT effects. Increasing evidence indicates that cognitive control (and related top-down modulation of attention/perceptual processing) may be components in the effective measurement of IAT effects, as factors such as physical setting or task instruction can change an IAT measurement. In this study we further implicate the role of proactive cognitive control and top-down modulation of attention/perceptual processing in the IAT-EEG. We find statistically significant relationships between D-score (a reaction-time based measure of the IAT-effect) and early ERP-time windows, indicating where more rapid word categorizations driving the IAT effect are present, they are at least partly explainable by neural activity not significantly correlated with the IAT measurement itself. Using LORETA, we identify a number of brain regions driving these ERP-IAT relationships notably involving left-temporal, insular, cingulate, medial frontal and parietal cortex in time regions corresponding to the N2- and P3-related activity. The identified brain regions involved with reduced reaction times on congruent blocks coincide with those of previous studies
Predicting film genres with implicit ideals.
Olney, Andrew McGregor
2012-01-01
We present a new approach to defining film genre based on implicit ideals. When viewers rate the likability of a film, they indirectly express their ideal of what a film should be. Across six studies we investigate the category structure that emerges from likability ratings and the category structure that emerges from the features of film. We further compare these data-driven category structures with human annotated film genres. We conclude that film genres are structured more around ideals than around features of film. This finding lends experimental support to the notion that film genres are set of shifting, fuzzy, and highly contextualized psychological categories.
Predicting Film Genres with Implicit Ideals
Olney, Andrew McGregor
2013-01-01
We present a new approach to defining film genre based on implicit ideals. When viewers rate the likability of a film, they indirectly express their ideal of what a film should be. Across six studies we investigate the category structure that emerges from likability ratings and the category structure that emerges from the features of film. We further compare these data-driven category structures with human annotated film genres. We conclude that film genres are structured more around ideals than around features of film. This finding lends experimental support to the notion that film genres are set of shifting, fuzzy, and highly contextualized psychological categories. PMID:23423823
Extraction of implicit information in biosignals.
Lu, W; Xia, L
1997-12-01
The first part of this paper explains the meaning of implicit information in biosignals. Image reconstruction from projections and ECG inverse problem are two typical examples. In the second part the limitation of conventional ECG inverse problem study is discussed, that is, the excitation propagation process that was not included in inverse study. In the third part a new approach to ECG inverse problem studies is introduced. To verify the new method, we used this method to localize the ventricular preexcitation site with simulated body surface potentials of WPW syndrome. The experimental results show that the inversely recovered preexcitation sites are in close agreement with the true preexcitation site.
Implicit Degenerate Evolution Equations and Applications.
1980-07-01
implicit evolution equations divides historically into three cases. The first and certainly the easiest is where 9 0 A - is Lipschitz or monotone in...on all V, and its Yoshida pproximation A - )’I(I - J,), a monotone Lipschitz function defined on all V. For u e V we have AA(u) e A(JA(u)). We denote...a) (u (t) + (v (t)) + BAlu t)) - f(t) dt (3.2.b) vXlt) e AluAlt) t e (0,T] Since (I + A) - 1 and BX are both Lipschitz continuous from V to V, (3.2
Disentangling Rheumatoid Arthritis Patients’ Implicit and Explicit Attitudes toward Methotrexate
Linn, Annemiek J.; Vandeberg, Lisa; Wennekers, Annemarie M.; Vervloet, Marcia; van Dijk, Liset; van den Bemt, Bart J. F.
2016-01-01
Medication non-adherence is a major public health problem that has been termed an ‘invisible epidemic.’ Non-adherence is not only associated with negative clinical consequences but can also result in substantial healthcare costs. Up to now, effective adherence interventions are scarce and a more comprehensive model of adherence determinants is required to target the determinants for not taking the medication as prescribed. Current approaches only included explicit attitudes such as self-reported evaluations of medication as determinants, neglecting the role of associative processes that shape implicit attitudes. Implicit processes can predict daily behavior more accurately than explicit attitudes. Our aim is to assess explicit and implicit attitudes toward medication and explore the relation with beliefs, adherence and clinical (laboratory) outcomes in chronically ill patients. Fifty two Rheumatic Arthritis (RA) patients’ attitudes toward Methotrexate (MTX) were explicitly (self-reported) and implicitly (Single-Category Implicit Association Test) assessed and related to the Beliefs about Medicine Questionnaire, the Compliance Questionnaire on Rheumatology and laboratory parameters [Erythrocyte Sedimentation Rate (ESR), C-Reactive Protein (CRP)]. Results show that explicit attitudes were positive and health-related. Implicit attitudes were, however, negative and sickness-related. Half of the patients displayed explicitly positive but implicitly negative attitudes. Explicit attitudes were positively related to ESR. A positive relationship between implicit attitudes and disease duration was observed. In this study, we have obtained evidence suggesting that the measurement of implicit attitudes and associations provides different information than explicit, self-reported attitudes toward medication. Since patients’ implicit attitudes deviated from explicit attitudes, we can conclude that the relationship between implicit attitudes and medication adherence is
On Existence and Uniqueness Results for Nonsmooth Implicit Differential Equations
NASA Astrophysics Data System (ADS)
You, Xiong; Wu, Xinyuan; Chen, Zhaoxia; Yang, Hongli; Fang, Yonglei
2008-09-01
The classical implicit function theorem gives conditions that the function is Fréchet differentiable and the derivative is surjective. In this short article they are generalized to conditions of Lipschitz and monotone type. The newly obtained implicit function theorems are used to derive two sets of sufficient conditions for the existence and uniqueness of solutions to the initial value problems of nonsmooth implicit differential equations.
GPU accelerating technique for rendering implicitly represented vasculatures.
Hong, Qingqi; Wang, Beizhan; Li, Qingde; Li, Yan; Wu, Qingqiang
2014-01-01
With the flooding datasets of medical Computed Tomography (CT) and Magnetic Resonance Imaging (MRI), implicit modeling techniques are increasingly applied to reconstruct the human organs, especially the vasculature. However, displaying implicitly represented geometric objects arises heavy computational burden. In this study, a Graphics Processing Unit (GPU) accelerating technique was developed for high performance rendering of implicitly represented objects, especially the vasculatures. The experimental results suggested that the rendering performance was greatly enhanced via exploiting the advantages of modern GPUs.
Applications of implicit restarting in optimization and control Dan Sorensen
Sorensen, D.
1996-12-31
Implicit restarting is a technique for combining the implicitly shifted QR mechanism with a k-step Arnoldi or Lanczos factorization to obtain a truncated form of the implicitly shifted QR-iteration suitable for large scale eigenvalue problems. The software package ARPACK based upon this technique has been successfully used to solve large scale symmetric and nonsymmetric (generalized) eigenvalue problems arising from a variety of applications.
The Effects of Implicit Instruction on Implicit and Explicit Knowledge Development
ERIC Educational Resources Information Center
Godfroid, Aline
2016-01-01
This study extends the evidence for implicit second language (L2) learning, which comes largely from (semi-)artificial language research, to German. Upper-intermediate L2 German learners were flooded with spoken exemplars of a difficult morphological structure, namely strong, vowel-changing verbs. Toward the end of exposure, the mandatory vowel…
Measuring Implicit Attitudes of 4-Year-Olds: The Preschool Implicit Association Test
ERIC Educational Resources Information Center
Cvencek, Dario; Greenwald, Anthony G.; Meltzoff, Andrew N.
2011-01-01
The Preschool Implicit Association Test (PSIAT) is an adaptation of an established social cognition measure (IAT) for use with preschool children. Two studies with 4-year-olds found that the PSIAT was effective in evaluating (a) attitudes toward commonly liked objects ("flowers"="good") and (b) gender attitudes ("girl"="good" or "boy"="good"). The…
Ames, Susan L.; Grenard, Jerry L.; Stacy, Alan W.; Xiao, Lin; He, Qinghua; Wong, Savio W.; Xue, Gui; Wiers, Reinout W.; Bechara, Antoine
2013-01-01
This research evaluated the neural correlates of implicit associative memory processes (habit-based processes) through the imaging (fMRI) of a marijuana Implicit Association Test. Drug-related associative memory effects have been shown to consistently predict level of drug use. To observe differences in neural activity of associative memory effects, this study compared 13 heavy marijuana users and 15 non-using controls, ranging in age from 18 to 25, during performance of a marijuana Implicit Association Test (IAT). Group by condition interactions in the putamen, caudate, and right inferior frontal gyrus were observed. Relative to non-users, marijuana users showed greater bilateral activity in the dorsal striatum (caudate and putamen) during compatible trials focused on perceived positive outcomes of use. Alternatively, relative to the marijuana-using group, the non-users showed greater activity in the right inferior frontal gyrus during incompatible trials, which require more effortful processing of information. Further, relative to fixation, heavy users showed bilateral activity in the caudate and putamen, hippocampus and some frontal regions during compatible trials and no significant activity during incompatible trials. The non-using group showed greater activity in frontal regions during incompatible trials relative to fixation and no significant activity during compatible trials. These findings are consistent with a dual process framework of appetitive behaviors proposing that (1) implicit associations underlying habit are mediated through neural circuitry dependent on the striatum, and (2) deliberative/controlled behaviors are mediated through circuitry more dependent on the prefrontal cortex. PMID:24029699
Implicit fear and effort-related cardiac response.
Chatelain, Mathieu; Gendolla, Guido H E
2015-10-01
Based on the Implicit-Affect-Primes-Effort (IAPE) model (Gendolla, 2012, 2015), two experiments tested the impact of fear primes on effort-related cardiac response. The main dependent variable was reactivity of cardiac pre-ejection period (PEP) during the performance of cognitive tasks. The IAPE model predicts that activation of implicit fear and sadness results in stronger PEP responses during task performance than activation of implicit happiness or anger. To test this, Experiment 1 exposed participants to masked facial expressions of fear, anger, or happiness while they performed a cognitive "parity task". As expected, PEP responses in the implicit fear condition were stronger than in both the implicit anger and happiness conditions. Experiment 2 conceptually replicated the implicit fear effect and revealed, as expected, stronger PEP responses for implicit fear and sadness than implicit anger during a "mental concentration" task. The findings provide the first evidence for the systematic impact of implicit fear on effort-related cardiac response and complete the existing evidence for the IAPE model.
Implicit schemes and parallel computing in unstructured grid CFD
NASA Technical Reports Server (NTRS)
Venkatakrishnam, V.
1995-01-01
The development of implicit schemes for obtaining steady state solutions to the Euler and Navier-Stokes equations on unstructured grids is outlined. Applications are presented that compare the convergence characteristics of various implicit methods. Next, the development of explicit and implicit schemes to compute unsteady flows on unstructured grids is discussed. Next, the issues involved in parallelizing finite volume schemes on unstructured meshes in an MIMD (multiple instruction/multiple data stream) fashion are outlined. Techniques for partitioning unstructured grids among processors and for extracting parallelism in explicit and implicit solvers are discussed. Finally, some dynamic load balancing ideas, which are useful in adaptive transient computations, are presented.
Implicit TVD schemes for hyperbolic conservation laws in curvilinear coordinates
NASA Technical Reports Server (NTRS)
Yee, H. C.; Harten, A.
1985-01-01
The Harten (1983, 1984) total variation-diminishing (TVD) schemes, constituting a one-parameter explicit and implicit, second-order-accurate family, have the property of not generating spurious oscillations when applied to one-dimensional, nonlinear scalar hyperbolic conservation laws and constant coefficient hyperbolic systems. These methods are presently extended to the multidimensional hyperbolic conservation laws in curvilinear coordinates. Means by which to linearize the implicit operator and solution strategies, in order to improve the computation efficiency of the implicit algorithm, are discussed. Numerical experiments with steady state airfoil calculations indicate that the proposed linearized implicit TVD schemes are accurate and robust.
Context effects in auditory implicit memory.
Besken, Miri; Mulligan, Neil W
2010-10-01
The context effect in implicit memory is the finding that presentation of words in meaningful context reduces or eliminates repetition priming compared to words presented in isolation. Virtually all of the research on the context effect has been conducted in the visual modality but preliminary results raise the question of whether context effects are less likely in auditory priming. Context effects in the auditory modality were systematically examined in five experiments using the auditory implicit tests of word-fragment and word-stem completion. The first three experiments revealed the classical context effect in auditory priming: Words heard in isolation produced substantial priming, whereas there was little priming for the words heard in meaningful passages. Experiments 4 and 5 revealed that a meaningful context is not required for the context effect to be obtained: Words presented in an unrelated audio stream produced less priming than words presented individually and no more priming than words presented in meaningful passages. Although context effects are often explained in terms of the transfer-appropriate processing (TAP) framework, the present results are better explained by Masson and MacLeod's (2000) reduced-individuation hypothesis.
An Implicit Characteristic Based Method for Electromagnetics
NASA Technical Reports Server (NTRS)
Beggs, John H.; Briley, W. Roger
2001-01-01
An implicit characteristic-based approach for numerical solution of Maxwell's time-dependent curl equations in flux conservative form is introduced. This method combines a characteristic based finite difference spatial approximation with an implicit lower-upper approximate factorization (LU/AF) time integration scheme. This approach is advantageous for three-dimensional applications because the characteristic differencing enables a two-factor approximate factorization that retains its unconditional stability in three space dimensions, and it does not require solution of tridiagonal systems. Results are given both for a Fourier analysis of stability, damping and dispersion properties, and for one-dimensional model problems involving propagation and scattering for free space and dielectric materials using both uniform and nonuniform grids. The explicit Finite Difference Time Domain Method (FDTD) algorithm is used as a convenient reference algorithm for comparison. The one-dimensional results indicate that for low frequency problems on a highly resolved uniform or nonuniform grid, this LU/AF algorithm can produce accurate solutions at Courant numbers significantly greater than one, with a corresponding improvement in efficiency for simulating a given period of time. This approach appears promising for development of dispersion optimized LU/AF schemes for three dimensional applications.
Eye Movements in Implicit Artificial Grammar Learning.
Silva, Susana; Inácio, Filomena; Folia, Vasiliki; Petersson, Karl Magnus
2017-03-13
Artificial grammar learning (AGL) has been probed with forced-choice behavioral tests (active tests). Recent attempts to probe the outcomes of learning (implicitly acquired knowledge) with eye-movement responses (passive tests) have shown null results. However, these latter studies have not tested for sensitivity effects, for example, increased eye movements on a printed violation. In this study, we tested for sensitivity effects in AGL tests with (Experiment 1) and without (Experiment 2) concurrent active tests (preference- and grammaticality classification) in an eye-tracking experiment. Eye movements discriminated between sequence types in passive tests and more so in active tests. The eye-movement profile did not differ between preference and grammaticality classification, and it resembled sensitivity effects commonly observed in natural syntax processing. Our findings show that the outcomes of implicit structured sequence learning can be characterized in eye tracking. More specifically, whole trial measures (dwell time, number of fixations) showed robust AGL effects, whereas first-pass measures (first-fixation duration) did not. Furthermore, our findings strengthen the link between artificial and natural syntax processing, and they shed light on the factors that determine performance differences in preference and grammaticality classification tests. (PsycINFO Database Record
On state representations of nonlinear implicit systems
NASA Astrophysics Data System (ADS)
Pereira da Silva, Paulo Sergio; Batista, Simone
2010-03-01
This work considers a semi-implicit system Δ, that is, a pair (S, y), where S is an explicit system described by a state representation ? , where x(t) ∈ ℝ n and u(t) ∈ ℝ m , which is subject to a set of algebraic constraints y(t) = h(t, x(t), u(t)) = 0, where y(t) ∈ ℝ l . An input candidate is a set of functions v = (v 1, …, v s ), which may depend on time t, on x, and on u and its derivatives up to a finite order. The problem of finding a (local) proper state representation ż = g(t, z, v) with input v for the implicit system Δ is studied in this article. The main result shows necessary and sufficient conditions for the solution of this problem, under mild assumptions on the class of admissible state representations of Δ. These solvability conditions rely on an integrability test that is computed from the explicit system S. The approach of this article is the infinite-dimensional differential geometric setting of Fliess, Lévine, Martin, and Rouchon (1999) ('A Lie-Bäcklund Approach to Equivalence and Flatness of Nonlinear Systems', IEEE Transactions on Automatic Control, 44(5), (922-937)).
2015-01-01
We report acquisition of diagonal-compensated protein structural restraints from four-dimensional solid-state NMR spectra on extensively deuterated and 1H back-exchanged proteins. To achieve this, we use homonuclear 1H–1H correlations with diagonal suppression and nonuniform sampling (NUS). Suppression of the diagonal allows the accurate identification of cross-peaks which are otherwise obscured by the strong autocorrelation or whose intensity is biased due to partial overlap with the diagonal. The approach results in unambiguous spectral interpretation and relatively few but reliable restraints for structure calculation. In addition, the diagonal suppression produces a spectrum with low dynamic range for which ultrasparse NUS data sets can be readily reconstructed, allowing straightforward application of NUS with only 2% sampling density with the advantage of more heavily sampling time-domain regions of high signal intensity. The method is demonstrated here for two proteins, α-spectrin SH3 microcrystals and hydrophobin functional amyloids. For the case of SH3, suppression of the diagonal results in facilitated identification of unambiguous restraints and improvement of the quality of the calculated structural ensemble compared to nondiagonal-suppressed 4D spectra. For the only partly assigned hydrophobin rodlets, the structure is yet unknown. Applied to this protein of biological significance with large inhomogeneous broadening, the method allows identification of unambiguous crosspeaks that are otherwise obscured by the diagonal. PMID:24988008
Suslow, Thomas; Lindner, Christian; Kugel, Harald; Egloff, Boris; Schmukle, Stefan C
2014-08-30
There is evidence from research based on self-report personality measures that schizophrenia patients tend to be lower in extraversion and higher in neuroticism than healthy individuals. Self-report personality measures assess aspects of the explicit self-concept. The Implicit Association Test (IAT) has been developed to assess aspects of implicit cognition such as implicit attitudes and implicit personality traits. The present study was conducted to investigate the applicability and reliability of the IAT in schizophrenia patients and test whether they differ from healthy individuals on implicitly measured extraversion and neuroticism. The IAT and the NEO-FFI were administered as implicit and explicit measures of extraversion and neuroticism to 34 schizophrenia patients and 45 healthy subjects. For all IAT scores satisfactory to good reliabilities were observed in the patient sample. In both study groups, IAT scores were not related to NEO-FFI scores. Schizophrenia patients were lower in implicit and explicit extraversion and higher in implicit and explicit neuroticism than healthy individuals. Our data show that the IAT can be reliably applied to schizophrenia patients and suggest that they differ from healthy individuals not only in their conscious representation but also in their implicit representation of the self with regard to neuroticism and extraversion-related characteristics.
Green, James A; Hohmann, Cynthia; Lister, Kelsi; Albertyn, Riani; Bradshaw, Renee; Johnson, Christine
2016-06-01
This study examined associations between anticipated future health behaviour and participants' attitudes. Three Implicit Association Tests were developed to assess safety, efficacy and overall attitude. They were used to examine preference associations between conventional versus complementary and alternative medicine among 186 participants. A structural equation model suggested only a single implicit association, rather than three separate domains. However, this single implicit association predicted additional variance in anticipated future use of complementary and alternative medicine beyond explicit. Implicit measures should give further insight into motivation for complementary and alternative medicine use.
Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan
2016-09-09
In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.
Diagonalization of Arm Kinematics by the Use of Bi-Articular Muscles
NASA Astrophysics Data System (ADS)
Mitsuda, Takashi; Kawamura, Sadao; Uemura, Mitsunori; Sekimoto, Masahiro
Mapping from visual information to motor commands is an important issue in the study of voluntary arm movement. The joint kinematics of a human-like planar arm, which is generally described as a nonlinear function in a Cartesian coordinate system, can be approximately linearized in a head-centered polar coordinate system. This study shows that the mapping from the muscle lengths to the hand position in a head-centered polar coordinate system can also be approximately linearized. In addition, this study proposes a diagonalization of the kinematics that involves adjusting the moment arms of the muscles; in this diagonalization, the muscle lengths of two bi-articular muscles are proportional to the distance and direction from the head.
Cai, Yunfeng; Bai, Zhaojun; Pask, John E.; Sukumar, N.
2013-12-15
The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing a nonorthogonal basis for ab initio electronic structure calculations. We propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative diagonalization of such eigenvalue problems. In partition-of-unity finite-element (PUFE) pseudopotential density-functional calculations, employing a nonorthogonal basis, we show that the hybrid preconditioned block steepest descent method is a cost-effective eigensolver, outperforming current state-of-the-art global preconditioning schemes, and comparably efficient for the ill-conditioned generalized eigenvalue problems produced by PUFE as the locally optimal block preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.
Gong, Xiao-Feng; Wang, Ke; Lin, Qiu-Hua; Liu, Zhi-Wen; Xu, You-Gen
2012-01-01
Joint estimation of direction-of-arrival (DOA) and polarization with electromagnetic vector-sensors (EMVS) is considered in the framework of complex-valued non-orthogonal joint diagonalization (CNJD). Two new CNJD algorithms are presented, which propose to tackle the high dimensional optimization problem in CNJD via a sequence of simple sub-optimization problems, by using LU or LQ decompositions of the target matrices as well as the Jacobi-type scheme. Furthermore, based on the above CNJD algorithms we present a novel strategy to exploit the multi-dimensional structure present in the second-order statistics of EMVS outputs for simultaneous DOA and polarization estimation. Simulations are provided to compare the proposed strategy with existing tensorial or joint diagonalization based methods. PMID:22737015
NASA Astrophysics Data System (ADS)
Li, Yifan; Liang, Xihui; Zuo, Ming J.
2017-02-01
This paper presents a novel signal processing scheme, diagonal slice spectrum assisted optimal scale morphological filter (DSS-OSMF), for rolling element fault diagnosis. In this scheme, the concept of quadratic frequency coupling (QFC) is firstly defined and the ability of diagonal slice spectrum (DSS) in detection QFC is derived. The DSS-OSMF possesses the merits of depressing noise and detecting QFC. It can remove fault independent frequency components and give a clear representation of fault symptoms. A simulated vibration signal and experimental vibration signals collected from a bearing test rig are employed to evaluate the effectiveness of the proposed method. Results show that the proposed method has a superior performance in extracting fault features of defective rolling element bearing. In addition, comparisons are performed between a multi-scale morphological filter (MMF) and a DSS-OSMF. DSS-OSMF outperforms MMF in detection of an outer race fault and a rolling element fault of a rolling element bearing.
Diagonalization and Many-Body Localization for a Disordered Quantum Spin Chain.
Imbrie, John Z
2016-07-08
We consider a weakly interacting quantum spin chain with random local interactions. We prove that many-body localization follows from a physically reasonable assumption that limits the extent of level attraction in the statistics of eigenvalues. In a Kolmogorov-Arnold-Moser-style construction, a sequence of local unitary transformations is used to diagonalize the Hamiltonian by deforming the initial tensor-product basis into a complete set of exact many-body eigenfunctions.
Modeling animal-vehicle collisions using diagonal inflated bivariate Poisson regression.
Lao, Yunteng; Wu, Yao-Jan; Corey, Jonathan; Wang, Yinhai
2011-01-01
Two types of animal-vehicle collision (AVC) data are commonly adopted for AVC-related risk analysis research: reported AVC data and carcass removal data. One issue with these two data sets is that they were found to have significant discrepancies by previous studies. In order to model these two types of data together and provide a better understanding of highway AVCs, this study adopts a diagonal inflated bivariate Poisson regression method, an inflated version of bivariate Poisson regression model, to fit the reported AVC and carcass removal data sets collected in Washington State during 2002-2006. The diagonal inflated bivariate Poisson model not only can model paired data with correlation, but also handle under- or over-dispersed data sets as well. Compared with three other types of models, double Poisson, bivariate Poisson, and zero-inflated double Poisson, the diagonal inflated bivariate Poisson model demonstrates its capability of fitting two data sets with remarkable overlapping portions resulting from the same stochastic process. Therefore, the diagonal inflated bivariate Poisson model provides researchers a new approach to investigating AVCs from a different perspective involving the three distribution parameters (λ(1), λ(2) and λ(3)). The modeling results show the impacts of traffic elements, geometric design and geographic characteristics on the occurrences of both reported AVC and carcass removal data. It is found that the increase of some associated factors, such as speed limit, annual average daily traffic, and shoulder width, will increase the numbers of reported AVCs and carcass removals. Conversely, the presence of some geometric factors, such as rolling and mountainous terrain, will decrease the number of reported AVCs.
The R-matrix of quantum doubles of Nichols algebras of diagonal type
Angiono, Iván
2015-02-15
Let H be the quantum double of a Nichols algebra of diagonal type. We compute the R-matrix of 3-tuples of modules for general finite-dimensional highest weight modules over H. We also calculate a multiplicative formula for the universal R-matrix when H is finite dimensional. We show the unicity of a PBW basis (or a Lusztig-type Poincaré-Birkhoff-Witt basis) with a given convex order.
Workshop report on large-scale matrix diagonalization methods in chemistry theory institute
Bischof, C.H.; Shepard, R.L.; Huss-Lederman, S.
1996-10-01
The Large-Scale Matrix Diagonalization Methods in Chemistry theory institute brought together 41 computational chemists and numerical analysts. The goal was to understand the needs of the computational chemistry community in problems that utilize matrix diagonalization techniques. This was accomplished by reviewing the current state of the art and looking toward future directions in matrix diagonalization techniques. This institute occurred about 20 years after a related meeting of similar size. During those 20 years the Davidson method continued to dominate the problem of finding a few extremal eigenvalues for many computational chemistry problems. Work on non-diagonally dominant and non-Hermitian problems as well as parallel computing has also brought new methods to bear. The changes and similarities in problems and methods over the past two decades offered an interesting viewpoint for the success in this area. One important area covered by the talks was overviews of the source and nature of the chemistry problems. The numerical analysts were uniformly grateful for the efforts to convey a better understanding of the problems and issues faced in computational chemistry. An important outcome was an understanding of the wide range of eigenproblems encountered in computational chemistry. The workshop covered problems involving self- consistent-field (SCF), configuration interaction (CI), intramolecular vibrational relaxation (IVR), and scattering problems. In atomic structure calculations using the Hartree-Fock method (SCF), the symmetric matrices can range from order hundreds to thousands. These matrices often include large clusters of eigenvalues which can be as much as 25% of the spectrum. However, if Cl methods are also used, the matrix size can be between 10{sup 4} and 10{sup 9} where only one or a few extremal eigenvalues and eigenvectors are needed. Working with very large matrices has lead to the development of
Iterative diagonalization in augmented plane wave based methods in electronic structure calculations
Blaha, P.; Laskowski, R.; Schwarz, K.
2010-01-20
Due to the increased computer power and advanced algorithms, quantum mechanical calculations based on Density Functional Theory are more and more widely used to solve real materials science problems. In this context large nonlinear generalized eigenvalue problems must be solved repeatedly to calculate the electronic ground state of a solid or molecule. Due to the nonlinear nature of this problem, an iterative solution of the eigenvalue problem can be more efficient provided it does not disturb the convergence of the self-consistent-field problem. The blocked Davidson method is one of the widely used and efficient schemes for that purpose, but its performance depends critically on the preconditioning, i.e. the procedure to improve the search space for an accurate solution. For more diagonally dominated problems, which appear typically for plane wave based pseudopotential calculations, the inverse of the diagonal of (H - ES) is used. However, for the more efficient 'augmented plane wave + local-orbitals' basis set this preconditioning is not sufficient due to large off-diagonal terms caused by the local orbitals. We propose a new preconditioner based on the inverse of (H - {lambda}S) and demonstrate its efficiency for real applications using both, a sequential and a parallel implementation of this algorithm into our WIEN2k code.
Polaron dynamics with off-diagonal coupling: beyond the Ehrenfest approximation.
Huang, Zhongkai; Wang, Lu; Wu, Changqin; Chen, Lipeng; Grossmann, Frank; Zhao, Yang
2017-01-04
Treated traditionally by the Ehrenfest approximation, the dynamics of a one-dimensional molecular crystal model with off-diagonal exciton-phonon coupling is investigated in this work using the Dirac-Frenkel time-dependent variational principle with the multi-D2Ansatz. It is shown that the Ehrenfest method is equivalent to our variational method with the single D2Ansatz, and with the multi-D2Ansatz, the accuracy of our simulated dynamics is significantly enhanced in comparison with the semi-classical Ehrenfest dynamics. The multi-D2Ansatz is able to capture numerically accurate exciton momentum probability and help clarify the relation between the exciton momentum redistribution and the exciton energy relaxation. The results demonstrate that the exciton momentum distributions in the steady state are determined by a combination of the transfer integral and the off-diagonal coupling strength, independent of the excitonic initial conditions. We also probe the effect of the transfer integral and the off-diagonal coupling on exciton transport in both real and reciprocal space representations. Finally, the variational method with importance sampling is employed to investigate temperature effects on exciton transport using the multi-D2Ansatz, and it is demonstrated that the variational approach is valid in both low and high temperature regimes.
Vidanović, Ivana; Bogojević, Aleksandar; Belić, Aleksandar
2009-12-01
We analyze the method for calculation of properties of nonrelativistic quantum systems based on exact diagonalization of space-discretized short-time evolution operators. In this paper we present a detailed analysis of the errors associated with space discretization. Approaches using direct diagonalization of real-space discretized Hamiltonians lead to polynomial errors in discretization spacing Delta . Here we show that the method based on the diagonalization of the short-time evolution operators leads to substantially smaller discretization errors, vanishing exponentially with 1/Delta(2). As a result, the presented calculation scheme is particularly well suited for numerical studies of few-body quantum systems. The analytically derived discretization errors estimates are numerically shown to hold for several models. In the follow up paper [I. Vidanović, A. Bogojević, A. Balaz, and A. Belić, Phys. Rev. E 80, 066706 (2009)] we present and analyze substantial improvements that result from the merger of this approach with the recently introduced effective-action scheme for high-precision calculation of short-time propagation.
Enhanced beam-steering-based diagonal beamforming algorithm for binaural hearing support devices.
Lee, Jun Chang; Nam, Kyoung Won; Cho, Kyeongwon; Lee, Sangmin; Kim, Dongwook; Hong, Sung Hwa; Jang, Dong Pyo; Kim, In Young
2014-07-01
In order to improve speech intelligibility for hearing-impaired people in various listening situations, it is necessary to diversify the possible focusing directions of a beamformer. In a previous report, the concept of binaural beam-steering that can focus a beamformer in diagonal directions was applied to a binaural hearing aid; however, in the previously proposed protocol, the effective frequency range for consistent diagonal beam-steering was limited to the 200-750 Hz range, which is far narrower than that of normal speech signals (200-4000 Hz). In this study, we proposed a modified binaural diagonal beam-steering technique that can reduce the focusing-direction deviations at high input frequencies up to 4000 Hz by introducing a new correction factor to the original protocol that can reduce the differences in gradient between the signal and the noise components at frequencies up to 4000 Hz. In simulation tests, the focusing effect of the proposed algorithm was more consistent than conventional algorithms. The deviations between the target and the focusing directions were reduced 27% in the left device and 6% in the right device with 45° steering at a 4000 Hz input signal, and were reduced 3% in the left device and 25% in the right device with 135° steering. On the basis of the experimental results, we believe that the proposed algorithm has the potential to help hearing-impaired people in various listening situations.
A study of non-diagonal models for image white balance
NASA Astrophysics Data System (ADS)
Huang, Ching-Chun; Huang, De-Kai
2013-02-01
White balance is an algorithm proposed to mimic the color constancy mechanism of human perception. However, as shown by its name, current white balance algorithms only promise to correct the color shift of gray tones to correct positions; for other color values, white balance algorithms process them as gray tones and therefore produce undesired color biases. To improve the color prediction of white balance algorithms, in this paper, we propose a 3-parameter nondiagonal model, named as PCA-CLSE, for white balance. Unlike many previous researches which use the von Kries diagonal model for color prediction, we proposed applying a non-diagonal model for color correction which aimed to minimize the color biases while keeping the balance of white color. In our method, to reduce the color biases, we proposed a PCA-based training method to gain extra information for analysis and built a mapping model between illumination and non-diagonal transformation matrices. While a color-biased image is given, we could estimate the illumination and dynamically determine the illumination-dependent transformation matrix to correct the color-biased image. Our evaluation shows that the proposed PCA-CLSE model can efficiently reduce the color biases.
Thermalization away from integrability and the role of operator off-diagonal elements.
Konstantinidis, N P
2015-05-01
We investigate the rate of thermalization of local operators in the one-dimensional anisotropic antiferromagnetic Heisenberg model with next-nearest neighbor interactions that break integrability. This is done by calculating the scaling of the difference of the diagonal and canonical thermal ensemble values as a function of system size, and by directly calculating the time evolution of the expectation values of the operators with the Chebyshev polynomial expansion. Spatial and spin symmetry is exploited and the Hamiltonian is divided into subsectors according to their symmetry. The rate of thermalization depends on the proximity to the integrable limit. When integrability is weakly broken thermalization is slow, and becomes faster the stronger the next-nearest neighbor interaction is. Three different regimes for the rate of thermalization with respect to the strength of the integrability breaking parameter are identified. These are shown to be directly connected with the relative strength of the low and higher energy difference off-diagonal operator matrix elements in the symmetry eigenbasis of the Hamiltonian. Close to the integrable limit the off-diagonal matrix elements peak at higher energies and high-frequency fluctuations are important and slow down thermalization. Away from the integrable limit a strong low-energy peak gradually develops that takes over the higher frequency fluctuations and leads to quicker thermalization.
Fluency Does Not Express Implicit Knowledge of Artificial Grammars
ERIC Educational Resources Information Center
Scott, Ryan B.; Dienes, Zoltan
2010-01-01
It is commonly held that implicit knowledge expresses itself as fluency. A perceptual clarification task was used to examine the relationship between perceptual processing fluency, subjective familiarity, and grammaticality judgments in a task frequently used to produce implicit knowledge, artificial grammar learning (AGL). Four experiments…
Implicit Approach-Avoidance Associations for Craved Food Cues
ERIC Educational Resources Information Center
Kemps, Eva; Tiggemann, Marika; Martin, Rachel; Elliott, Mecia
2013-01-01
Implicit approach associations are well documented for substances such as alcohol, tobacco, and illicit drugs. This study reports two experiments designed to establish and modify such associations specifically in the food craving domain. Experiment 1 used a pictorial implicit association task to examine approach-avoidance associations with…
The Existence of Implicit Racial Bias in Nursing Faculty
ERIC Educational Resources Information Center
Fitzsimmons, Kathleen A.
2009-01-01
This study examined the existence of implicit racial bias in nursing faculty using the Implicit Association Test (IAT). It was conducted within a critical race theory framework where race was seen as a permanent, pervasive, and systemic condition, not an individual process. The study was fueled by data showing continued disparate academic and…
Explicit versus Implicit Questioning: Inviting All Children to Think Mathematically
ERIC Educational Resources Information Center
Parks, Amy Noelle
2010-01-01
Background/Context: Open-ended, or implicit, questioning has been described as central to reform teaching in mathematics. However, concerns about equity have caused some researchers to question whether this kind of teaching is productive for all children. Purpose: This study explores the role that implicit and explicit questions played in…
Qualitative Differences between Implicit and Explicit Sequence Learning
ERIC Educational Resources Information Center
Jimenez, Luis; Vaquero, Joaquin M. M.; Lupianez, Juan
2006-01-01
Four experiments investigate the differences between implicit and explicit sequence learning concerning their resilience to structural and superficial task changes. A superficial change that embedded the SRT task in the context of a selection task, while maintaining the sequence, did selectively hinder the expression of implicit learning. In…
Preservice and Inservice Teachers' Implicit Theories of Intelligence
ERIC Educational Resources Information Center
Jones, Brett D.; Bryant, Lauren H.; Snyder, Jennifer Dee; Malone, David
2012-01-01
Implicit theories of intelligence (i.e., individuals' beliefs about the nature of intelligence, such as whether it is fixed or changeable) are important because they are related to individuals' behaviors and their beliefs in other areas (Sternberg, 2000). Implicit theories of intelligence are especially important in educational settings because…
Using Multidimensional Scaling to Explore Biases in Implicit Job Theories.
ERIC Educational Resources Information Center
McNelis, Kathleen
The mention of a job title can trigger descriptive and evaluative associations, suggesting that people possess shared job knowledge. This study focused on the concept of implicit job theory and explored the nature of implicit theories to understand the types of information people rely on when they think about jobs and the biases that might exist.…
Implicit Motives and Men’s Perceived Constraint in Fatherhood
Ruppen, Jessica; Waldvogel, Patricia; Ehlert, Ulrike
2016-01-01
Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers’ perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers’ life satisfaction. Participants were fathers with biological children (N = 276). They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction. PMID:27933023
Measuring Explicit and Implicit Knowledge: A Psychometric Study in SLA
ERIC Educational Resources Information Center
Ebadi, Mandana Rohollahzadeh; Abedalaziz, Nabeel; Saad, Mohd Rashid Mohd
2015-01-01
Lack of valid means of measuring explicit and implicit knowledge in acquisition of second language is a concern issue in investigations of explicit and implicit learning. This paper endeavors to validate the use of four tests (i.e., Untimed Judgment Grammatical Test, UJGT; Test of Metalinguistic Knowledge, TMK; Elicited Oral Imitation Test, EOIT;…
Explicit- and Implicit Bullying Attitudes in Relation to Bullying Behavior
ERIC Educational Resources Information Center
van Goethem, Anne A. J.; Scholte, Ron H. J.; Wiers, Reinout W.
2010-01-01
The main aim of this study was to examine whether an assessment of implicit bullying attitudes could add to the prediction of bullying behavior after controlling for explicit bullying attitudes. Primary school children (112 boys and 125 girls, M age = 11 years, 5 months) completed two newly developed measures of implicit bullying attitudes (a…
Implicit and Explicit Learning in Individuals with Agrammatic Aphasia
ERIC Educational Resources Information Center
Schuchard, Julia; Thompson, Cynthia K.
2014-01-01
Implicit learning is a process of acquiring knowledge that occurs without conscious awareness of learning, whereas explicit learning involves the use of overt strategies. To date, research related to implicit learning following stroke has been largely restricted to the motor domain and has rarely addressed implications for language. The present…
The Ms. Stereotype Revisited: Implicit and Explicit Facets
ERIC Educational Resources Information Center
Malcolmson, Kelly A.; Sinclair, Lisa
2007-01-01
Implicit and explicit stereotypes toward the title Ms. were examined. Participants read a short description of a target person whose title of address varied (Ms., Mrs., Miss, Mr.). They then rated the person on agentic and communal traits and completed an Implicit Association Test. Replicating earlier research (Dion, 1987), at an explicit level,…
Implicit and Explicit Knowledge in Second Language Acquisition
ERIC Educational Resources Information Center
Rebuschat, Patrick; Williams, John N.
2012-01-01
Language development is frequently characterized as a process where learning proceeds implicitly, that is, incidentally and in absence of awareness of what was learned. This article reports the results of two experiments that investigated whether second language acquisition can also result in implicit knowledge. Adult learners were trained on an…
Teaching about Implicit Prejudices and Stereotypes: A Pedagogical Demonstration
ERIC Educational Resources Information Center
Adams, Virgil H., III; Devos, Thierry; Rivera, Luis M.; Smith, Heather; Vega, Luis A.
2014-01-01
Social psychology instructors from five distinct state universities in California examined the effect of incorporating the implicit association test (IAT) in a teaching module on students' perceived knowledge of implicit biases and motivation to control prejudice. Students (N = 258) completed a knowledge survey on prejudice, stereotypes, and…
Implicit Race/Ethnic Prejudice in Mexican Americans
ERIC Educational Resources Information Center
Garza, Christelle Fabiola; Gasquoine, Philip Gerard
2013-01-01
Implicit race/ethnic prejudice was assessed using Spanish- and English-language versions of an Implicit Association Test that used Hispanic/Anglo first names and pleasant/unpleasant words as stimuli. This test was administered to a consecutive sample of Mexican American adults residing in the Rio Grande Valley region of Texas of whom about…
Measuring Implicit and Explicit Attitudes toward Foreign-Accented Speech
ERIC Educational Resources Information Center
Pantos, Andrew J.
2010-01-01
The purpose of this research was to investigate the nature of listeners' attitudes toward foreign-accented speech and the manner in which those attitudes are formed. This study measured 165 participants' implicit and explicit attitudes toward US- and foreign-accented audio stimuli. Implicit attitudes were measured with an audio Implicit…
Implicit and Explicit Recasts in L2 Oral French Interaction
ERIC Educational Resources Information Center
Erlam, Rosemary; Loewen, Shawn
2010-01-01
This laboratory-based study of second- and third-year American university students learning French examines the effectiveness of implicit and explicit corrective feedback on noun-adjective agreement errors. The treatment consisted of one hour of interactive tasks. Implicit feedback was operationalized as a single recast with interrogative…
The nondiscriminating heart: lovingkindness meditation training decreases implicit intergroup bias.
Kang, Yoona; Gray, Jeremy R; Dovidio, John F
2014-06-01
Although meditation is increasingly accepted as having personal benefits, less is known about the broader impact of meditation on social and intergroup relations. We tested the effect of lovingkindness meditation training on improving implicit attitudes toward members of 2 stigmatized social outgroups: Blacks and homeless people. Healthy non-Black, nonhomeless adults (N = 101) were randomly assigned to 1 of 3 conditions: 6-week lovingkindness practice, 6-week lovingkindness discussion (a closely matched active control), or waitlist control. Decreases in implicit bias against stigmatized outgroups (as measured by Implicit Association Test) were observed only in the lovingkindness practice condition. Reduced psychological stress mediated the effect of lovingkindness practice on implicit bias against homeless people, but it did not mediate the reduced bias against Black people. These results suggest that lovingkindness meditation can improve automatically activated, implicit attitudes toward stigmatized social groups and that this effect occurs through distinctive mechanisms for different stigmatized social groups.
The time course of explicit and implicit categorization.
Smith, J David; Zakrzewski, Alexandria C; Herberger, Eric R; Boomer, Joseph; Roeder, Jessica L; Ashby, F Gregory; Church, Barbara A
2015-10-01
Contemporary theory in cognitive neuroscience distinguishes, among the processes and utilities that serve categorization, explicit and implicit systems of category learning that learn, respectively, category rules by active hypothesis testing or adaptive behaviors by association and reinforcement. Little is known about the time course of categorization within these systems. Accordingly, the present experiments contrasted tasks that fostered explicit categorization (because they had a one-dimensional, rule-based solution) or implicit categorization (because they had a two-dimensional, information-integration solution). In Experiment 1, participants learned categories under unspeeded or speeded conditions. In Experiment 2, they applied previously trained category knowledge under unspeeded or speeded conditions. Speeded conditions selectively impaired implicit category learning and implicit mature categorization. These results illuminate the processing dynamics of explicit/implicit categorization.
Implicit Riemann solvers for the Pn equations.
Mehlhorn, Thomas Alan; McClarren, Ryan; Brunner, Thomas A.; Holloway, James Paul
2005-03-01
The spherical harmonics (P{sub n}) approximation to the transport equation for time dependent problems has previously been treated using Riemann solvers and explicit time integration. Here we present an implicit time integration method for the P n equations using Riemann solvers. Both first-order and high-resolution spatial discretization schemes are detailed. One facet of the high-resolution scheme is that a system of nonlinear equations must be solved at each time step. This nonlinearity is the result of slope reconstruction techniques necessary to avoid the introduction of artifical extrema in the numerical solution. Results are presented that show auspicious agreement with analytical solutions using time steps well beyond the CFL limit.
Linearized Implicit Numerical Method for Burgers' Equation
NASA Astrophysics Data System (ADS)
Mukundan, Vijitha; Awasthi, Ashish
2016-12-01
In this work, a novel numerical scheme based on method of lines (MOL) is proposed to solve the nonlinear time dependent Burgers' equation. The Burgers' equation is semi discretized in spatial direction by using MOL to yield system of nonlinear ordinary differential equations in time. The resulting system of nonlinear differential equations is integrated by an implicit finite difference method. We have not used Cole-Hopf transformation which gives less accurate solution for very small values of kinematic viscosity. Also, we have not considered nonlinear solvers that are computationally costlier and take more running time.In the proposed scheme nonlinearity is tackled by Taylor series and the use of fully discretized scheme is easy and practical. The proposed method is unconditionally stable in the linear sense. Furthermore, efficiency of the proposed scheme is demonstrated using three test problems.
Domain decomposition for implicit solvation models.
Cancès, Eric; Maday, Yvon; Stamm, Benjamin
2013-08-07
This article is the first of a series of papers dealing with domain decomposition algorithms for implicit solvent models. We show that, in the framework of the COSMO model, with van der Waals molecular cavities and classical charge distributions, the electrostatic energy contribution to the solvation energy, usually computed by solving an integral equation on the whole surface of the molecular cavity, can be computed more efficiently by using an integral equation formulation of Schwarz's domain decomposition method for boundary value problems. In addition, the so-obtained potential energy surface is smooth, which is a critical property to perform geometry optimization and molecular dynamics simulations. The purpose of this first article is to detail the methodology, set up the theoretical foundations of the approach, and study the accuracies and convergence rates of the resulting algorithms. The full efficiency of the method and its applicability to large molecular systems of biological interest is demonstrated elsewhere.
Implicit familiarity processing in congenital prosopagnosia.
Avidan, Galia; Behrmann, Marlene
2008-03-01
A particularly interesting and somewhat puzzling finding in the face-processing literature is that, despite the absence of overt recognition of most faces, many patients with acquired prosopagnosia (AP) exhibit evidence of intact covert face recognition of the very same faces. This phenomenon has important implications for the understanding of the mechanism underlying AP and, by extension, the mechanism underlying normal face processing. Here, we set out to examine whether individuals with congenital prosopagnosia (CP) exhibit a similar dissociation between overt and covert face recognition. We first confirmed that all six of our CP individuals were significantly impaired in face recognition in comparison with controls. Participants then completed a matching task with both famous and unknown faces in which they decided whether two consecutive images have the same identity or not. Critically, the level of face familiarity was orthogonal to the task at hand and this enabled us to examine whether the familiarity of a face enhanced identity matching, a finding which would implicate implicit face processing. As expected, the CP individuals were slower and less accurate than the control participants. More importantly, like the controls, the CP individuals were faster and more accurate at matching famous compared with unknown faces. Also, for both groups, matching performance on unrecognized famous faces fell at an intermediate level between performance on explicitly recognized famous faces and faces which are unknown. These results provide the first solid evidence for the existence of implicit familiarity processing in CP and suggest that, despite the marked impairment in explicit face recognition, these individuals still have some familiarity representation which manifests in the form of covert recognition. We discuss possible models to account for the apparent dissociation of overt and covert face processing in CPR.
Implicit phonological priming during visual word recognition.
Wilson, Lisa B; Tregellas, Jason R; Slason, Erin; Pasko, Bryce E; Rojas, Donald C
2011-03-15
Phonology is a lower-level structural aspect of language involving the sounds of a language and their organization in that language. Numerous behavioral studies utilizing priming, which refers to an increased sensitivity to a stimulus following prior experience with that or a related stimulus, have provided evidence for the role of phonology in visual word recognition. However, most language studies utilizing priming in conjunction with functional magnetic resonance imaging (fMRI) have focused on lexical-semantic aspects of language processing. The aim of the present study was to investigate the neurobiological substrates of the automatic, implicit stages of phonological processing. While undergoing fMRI, eighteen individuals performed a lexical decision task (LDT) on prime-target pairs including word-word homophone and pseudoword-word pseudohomophone pairs with a prime presentation below perceptual threshold. Whole-brain analyses revealed several cortical regions exhibiting hemodynamic response suppression due to phonological priming including bilateral superior temporal gyri (STG), middle temporal gyri (MTG), and angular gyri (AG) with additional region of interest (ROI) analyses revealing response suppression in the left lateralized supramarginal gyrus (SMG). Homophone and pseudohomophone priming also resulted in different patterns of hemodynamic responses relative to one another. These results suggest that phonological processing plays a key role in visual word recognition. Furthermore, enhanced hemodynamic responses for unrelated stimuli relative to primed stimuli were observed in midline cortical regions corresponding to the default-mode network (DMN) suggesting that DMN activity can be modulated by task requirements within the context of an implicit task.
Dawes, Richard; Carrington, Tucker
2006-02-07
In this paper we improve the product simultaneous diagonalization (SD) basis method we previously proposed [J. Chem. Phys. 122, 134101 (2005)] and applied to solve the Schrodinger equation for the motion of nuclei on a potential surface. The improved method is tested using coupled complicated Hamiltonians with as many as 16 coordinates for which we can easily find numerically exact solutions. In a basis of sorted products of one-dimensional (1D) SD functions the Hamiltonian matrix is nearly diagonal. The localization of the 1D SD functions for coordinate qc depends on a parameter we denote alphac. In this paper we present a trace minimization scheme for choosing alphac to nearly block diagonalize the Hamiltonian matrix. Near-block diagonality makes it possible to truncate the matrix without degrading the accuracy of the lowest energy levels. We show that in the sorted product SD basis perturbation theory works extremely well. The trace minimization scheme is general and easy to implement.
2007-11-02
Evaluation of the Precision Imaging Corporation 21si 4 x 3 Aspect Ratio , 21-Inch Diagonal Monochrome Monitor Contract Number Grant Number Program...25 II.10. Pixel Aspect Ratio ..................................................................................... 26 II.11. Screen Size (Viewable
Evaluation of the Sun Microsystems 365-1352-01 16 x 10 Aspect Ratio, 24-Inch Diagonal Color Monitor
2007-11-02
System Tonal Transfer at center screen as a function of input counts. Sun Microsystems 365-1352-01, 24-Inch, 16:10 Aspect Ratio , Color CRT Monitor...for the Image Analyst and Cartographer applications. Evaluation of the Sun Microsystems 365-1352-01 16 x 10 Aspect Ratio , 24-Inch Diagonal Color Monitor...16 x 10 Aspect Ratio , 24-Inch Diagonal Color Monitor Contract Number Grant Number Program Element Number Author(s) Project Number Task Number Work
NASA Astrophysics Data System (ADS)
Schneiders, Lennart; Günther, Claudia; Meinke, Matthias; Schröder, Wolfgang
2016-04-01
A Cartesian cut-cell method for viscous flows interacting with freely moving boundaries is presented. The method enables a sharp resolution of the embedded boundaries and strictly conserves mass, momentum, and energy. A new explicit Runge-Kutta scheme (PC-RK) is introduced by which the overall computational time is reduced by a factor of up to 2.5. The new scheme is a predictor-corrector type reformulation of a popular class of Runge-Kutta methods which substantially reduces the computational effort for tracking the moving boundaries and subsequently reinitializing the solver impairing neither stability nor accuracy. The structural motion is computed by an implicit scheme with good stability properties due to a strong-coupling strategy and the conservative discretization of the flow solver at the material interfaces. A new formulation for the treatment of small cut cells is proposed with high accuracy and robustness for arbitrary geometries based on a weighted Taylor-series approach solved via singular-value decomposition. The efficiency and the accuracy of the new method are demonstrated for several three-dimensional cases of laminar and turbulent particulate flow. It is shown that the new method remains fully conservative even for large displacements of the boundaries leading to a fast convergence of the fluid-solid coupling while spurious force oscillations inherent to this class of methods are effectively suppressed. The results substantiate the good stability and accuracy properties of the scheme even on relatively coarse meshes.
Special function of nestin(+) neurons in the medial septum-diagonal band of Broca in adult rats.
Zhao, Yuhong; Guo, Kaihua; Li, Dongpei; Yuan, Qunfang; Yao, Zhibin
2014-02-01
Nestin(+) neurons have been shown to express choline acetyltransferase (ChAT) in the medial septum-diagonal band of Broca in adult rats. This study explored the projection of nestin(+) neurons to the olfactory bulb and the time course of nestin(+) neurons in the medial septum-diagonal band of Broca in adult rats during injury recovery after olfactory nerve transection. This study observed that all nestin(+) neurons were double-labeled with ChAT in the medial septum-diagonal band of Broca. Approximately 53.6% of nestin(+) neurons were projected to the olfactory bulb and co-labeled with fast blue. A large number of nestin(+) neurons were not present in each region of the medial septum-diagonal band of Broca. Nestin(+) neurons in the medial septum and vertical limb of the diagonal band of Broca showed obvious compensatory function. The number of nestin(+) neurons decreased to a minimum later than nestin(-)/ChAT(+) neurons in the medial septum-diagonal band of Broca. The results suggest that nestin(+) cholinergic neurons may have a closer connection to olfactory bulb neurons. Nestin(+) cholinergic neurons may have a stronger tolerance to injury than Nestin(-)/ChAT(+) neurons. The difference between nestin(+) and nestin(-)/ChAT(+) neurons during the recovery process requires further investigations.
Marini, Maddalena; Sriram, Natarajan; Schnabel, Konrad; Maliszewski, Norbert; Devos, Thierry; Ekehammar, Bo; Wiers, Reinout; HuaJian, Cai; Somogyi, Mónika; Shiomura, Kimihiro; Schnall, Simone; Neto, Félix; Bar-Anan, Yoav; Vianello, Michelangelo; Ayala, Alfonso; Dorantes, Gabriel; Park, Jaihyun; Kesebir, Selin; Pereira, Antonio; Tulbure, Bogdan; Ortner, Tuulia; Stepanikova, Irena; Greenwald, Anthony G; Nosek, Brian A
2013-01-01
Although a greater degree of personal obesity is associated with weaker negativity toward overweight people on both explicit (i.e., self-report) and implicit (i.e., indirect behavioral) measures, overweight people still prefer thin people on average. We investigated whether the national and cultural context - particularly the national prevalence of obesity - predicts attitudes toward overweight people independent of personal identity and weight status. Data were collected from a total sample of 338,121 citizens from 71 nations in 22 different languages on the Project Implicit website (https://implicit.harvard.edu/) between May 2006 and October 2010. We investigated the relationship of the explicit and implicit weight bias with the obesity both at the individual (i.e., across individuals) and national (i.e., across nations) level. Explicit weight bias was assessed with self-reported preference between overweight and thin people; implicit weight bias was measured with the Implicit Association Test (IAT). The national estimates of explicit and implicit weight bias were obtained by averaging the individual scores for each nation. Obesity at the individual level was defined as Body Mass Index (BMI) scores, whereas obesity at the national level was defined as three national weight indicators (national BMI, national percentage of overweight and underweight people) obtained from publicly available databases. Across individuals, greater degree of obesity was associated with weaker implicit negativity toward overweight people compared to thin people. Across nations, in contrast, a greater degree of national obesity was associated with stronger implicit negativity toward overweight people compared to thin people. This result indicates a different relationship between obesity and implicit weight bias at the individual and national levels.
Marini, Maddalena; Sriram, Natarajan; Schnabel, Konrad; Maliszewski, Norbert; Devos, Thierry; Ekehammar, Bo; Wiers, Reinout; HuaJian, Cai; Somogyi, Mónika; Shiomura, Kimihiro; Schnall, Simone; Neto, Félix; Bar-Anan, Yoav; Vianello, Michelangelo; Ayala, Alfonso; Dorantes, Gabriel; Park, Jaihyun; Kesebir, Selin; Pereira, Antonio; Tulbure, Bogdan; Ortner, Tuulia; Stepanikova, Irena; Greenwald, Anthony G.; Nosek, Brian A.
2013-01-01
Although a greater degree of personal obesity is associated with weaker negativity toward overweight people on both explicit (i.e., self-report) and implicit (i.e., indirect behavioral) measures, overweight people still prefer thin people on average. We investigated whether the national and cultural context – particularly the national prevalence of obesity – predicts attitudes toward overweight people independent of personal identity and weight status. Data were collected from a total sample of 338,121 citizens from 71 nations in 22 different languages on the Project Implicit website (https://implicit.harvard.edu/) between May 2006 and October 2010. We investigated the relationship of the explicit and implicit weight bias with the obesity both at the individual (i.e., across individuals) and national (i.e., across nations) level. Explicit weight bias was assessed with self-reported preference between overweight and thin people; implicit weight bias was measured with the Implicit Association Test (IAT). The national estimates of explicit and implicit weight bias were obtained by averaging the individual scores for each nation. Obesity at the individual level was defined as Body Mass Index (BMI) scores, whereas obesity at the national level was defined as three national weight indicators (national BMI, national percentage of overweight and underweight people) obtained from publicly available databases. Across individuals, greater degree of obesity was associated with weaker implicit negativity toward overweight people compared to thin people. Across nations, in contrast, a greater degree of national obesity was associated with stronger implicit negativity toward overweight people compared to thin people. This result indicates a different relationship between obesity and implicit weight bias at the individual and national levels. PMID:24358291
Implicit negotiation beliefs and performance: experimental and longitudinal evidence.
Kray, Laura J; Haselhuhn, Michael P
2007-07-01
The authors argue that implicit negotiation beliefs, which speak to the expected malleability of negotiating ability, affect performance in dyadic negotiations. They expected negotiators who believe negotiating attributes are malleable (incremental theorists) to outperform negotiators who believe negotiating attributes are fixed (entity theorists). In Study 1, they gathered evidence of convergent and discriminant validity for the implicit negotiation belief construct. In Study 2, they examined the impact of implicit beliefs on the achievement goals that negotiators pursue. In Study 3, they explored the causal role of implicit beliefs on negotiation performance by manipulating negotiators' implicit beliefs within dyads. They also identified perceived ability as a moderator of the link between implicit negotiation beliefs and performance. In Study 4, they measured negotiators' beliefs in a classroom setting and examined how these beliefs affected negotiation performance and overall performance in the course 15 weeks later. Across all performance measures, incremental theorists outperformed entity theorists. Consistent with the authors' hypotheses, incremental theorists captured more of the bargaining surplus and were more integrative than their entity theorist counterparts, suggesting implicit theories are important determinants of how negotiators perform. Implications and future directions are discussed.
The modulation of implicit magnitude on time estimates.
Ma, Qingxia; Yang, Zhen; Zhang, Zhijie
2012-01-01
Studies in time and quantity have shown that explicit magnitude (e.g. Arabic numerals, luminance, or size) modulates time estimates with smaller magnitude biasing the judgment of time towards underestimation and larger magnitude towards overestimation. However, few studies have examined the effect of implicit magnitude on time estimates. The current study used a duration estimation task to investigate the effects of implicit magnitude on time estimation in three experiments. During the duration estimation task, the target words named objects of various lengths (Experiment 1), weights (Experiment 2) and volumes (Experiment 3) were presented on the screen and participants were asked to reproduce the amount of time the words remained on the screen via button presses. Results indicated that the time estimates were modulated by the implicit magnitude of the word's referent with words named objects of smaller magnitude (shorter, lighter, or smaller) being judged to last a shorter time, and words named objects of greater magnitude (longer, heavier, or bigger) being judged to last a longer time. These findings were consistent with previous studies examining the effect of implicit spatial length on time estimates. More importantly, current results extended the implicit magnitude of length to the implicit magnitude of weight and volume and demonstrated a functional interaction between time and implicit magnitude in all three aspects of quantity, suggesting a common generalized magnitude system. These results provided new evidence to support a theory of magnitude (ATOM).
Implicit and Explicit Attitudes Toward Sex and Romance in Asexuals.
Bulmer, Maria; Izuma, Keise
2017-03-31
Despite the recent surge of interest in sexuality, asexuality has remained relatively underresearched. Distinct from abstinence or chastity, asexuality refers to a lack of sexual attraction toward others. Past research suggests asexuals have negative attitudes toward sex, though no research has examined implicit attitudes. While preliminary evidence suggests that many asexuals are interested in engaging in romantic relationships, these attitudes have yet to be examined thoroughly, implicitly, or compared with a control group. This study investigated explicit and implicit attitudes toward sex and romance in a group of asexuals (N = 18, age M = 21.11) and a group of controls (N = 27, age M = 21.81), using the Asexuality Identification Scale (AIS), the Triangular Love Scale (TLS), semantic differentials, an Implicit Association Task (IAT), and two Single Category IATs. It was found that asexuals exhibited more negative explicit and implicit attitudes toward sex, as well as more negative explicit attitudes toward romance, relative to controls. There was no significant difference between groups on implicit romantic attitudes. Moreover, aromantic asexuals demonstrated significantly more negative explicit attitudes toward romance than romantic asexuals, though there was no significant difference between groups on implicit measures. Explanations and implications of these findings are discussed.
The effect of midazolam on implicit memory tests.
Hirshman, E; Passannante, A; Henzler, A
1999-12-01
Substantial empirical evidence exists suggesting that there are distinct forms of explicit and implicit memory. However, methodological problems have hampered attempts to identify the nature of the information processing underlying these forms of memory. These problems include the contamination of performance on implicit memory tests by explicit memory processes, as well as a host of difficulties inherent in correlational approaches that involve amnesiac subjects. In this paper we attempt to explore whether midazolam, a benzodiazepine used in surgical anesthesia, might be useful for studying implicit memory. Specifically, we attempt to determine whether midazolam produces selective effects on explicit, as opposed to implicit, memory. We focus on midazolam because of prior studies demonstrating that benzodiazepines do not affect implicit memory and because its rapid pharmacokinetics ensure that sedative effects are minimized when testing occurs at relatively short retention intervals. The results of an experiment using free recall, fragment completion and perceptual identification tests suggest that midazolam diminishes memory in implicit and explicit memory tests, although the diminution is proportionally larger in explicit memory. These results constrain the inferences that may be drawn when midazolam is used to explore implicit memory.
Implicit beliefs about ideal body image predict body image dissatisfaction
Heider, Niclas; Spruyt, Adriaan; De Houwer, Jan
2015-01-01
We examined whether implicit measures of actual and ideal body image can be used to predict body dissatisfaction in young female adults. Participants completed two Implicit Relational Assessment Procedures (IRAPs) to examine their implicit beliefs concerning actual (e.g., I am thin) and desired ideal body image (e.g., I want to be thin). Body dissatisfaction was examined via self-report questionnaires and rating scales. As expected, differences in body dissatisfaction exerted a differential influence on the two IRAP scores. Specifically, the implicit belief that one is thin was lower in participants who exhibited a high degree of body dissatisfaction than in participants who exhibited a low degree of body dissatisfaction. In contrast, the implicit desire to be thin (i.e., thin ideal body image) was stronger in participants who exhibited a high level of body dissatisfaction than in participants who were less dissatisfied with their body. Adding further weight to the idea that both IRAP measures captured different underlying constructs, we also observed that they correlated differently with body mass index, explicit body dissatisfaction, and explicit measures of actual and ideal body image. More generally, these findings underscore the advantage of using implicit measures that incorporate relational information relative to implicit measures that allow for an assessment of associative relations only. PMID:26500567
Implicit race attitudes predict trustworthiness judgments and economic trust decisions
Stanley, Damian A.; Sokol-Hessner, Peter; Banaji, Mahzarin R.; Phelps, Elizabeth A.
2011-01-01
Trust lies at the heart of every social interaction. Each day we face decisions in which we must accurately assess another individual's trustworthiness or risk suffering very real consequences. In a global marketplace of increasing heterogeneity with respect to nationality, race, and multiple other social categories, it is of great value to understand how implicitly held attitudes about group membership may support or undermine social trust and thereby implicitly shape the decisions we make. Recent behavioral and neuroimaging work suggests that a common mechanism may underlie the expression of implicit race bias and evaluations of trustworthiness, although no direct evidence of a connection exists. In two behavioral studies, we investigated the relationship between implicit race attitude (as measured by the Implicit Association Test) and social trust. We demonstrate that race disparity in both an individual's explicit evaluations of trustworthiness and, more crucially, his or her economic decisions to trust is predicted by that person's bias in implicit race attitude. Importantly, this relationship is robust and is independent of the individual's bias in explicit race attitude. These data demonstrate that the extent to which an individual invests in and trusts others with different racial backgrounds is related to the magnitude of that individual's implicit race bias. The core dimension of social trust can be shaped, to some degree, by attitudes that reside outside conscious awareness and intention. PMID:21518877
Robust Multivariable Controller Design via Implicit Model-Following Methods.
1983-12-01
HD-Ri38 309 ROBUST MULTIVARIABLE CONTROLLER DESIGN VIA IMPLICIT 1/4 MODEL-FOLLOWING METHODS(U) AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL...aaS. a%. 1 .111 I Q~ 18 0 ROBUST MULTIVARIABLE CONTROLLER DESIGN -~ :VIA IMPLICIT MODEL-FOLLOWING METHODS ’.% THESIS , AFIT/GE/EE/83D-48 William G... CONTROLLER DESIGN VIA IMPLICIT MODEL-FOLLOWING METHODS THESIS AFIT/GE/EE/83D-48 William G. Miller Capt USAF ,. Approved for pubi release; distribution
On the Convergence of an Implicitly Restarted Arnoldi Method
Lehoucq, Richard B.
1999-07-12
We show that Sorensen's [35] implicitly restarted Arnoldi method (including its block extension) is simultaneous iteration with an implicit projection step to accelerate convergence to the invariant subspace of interest. By using the geometric convergence theory for simultaneous iteration due to Watkins and Elsner [43], we prove that an implicitly restarted Arnoldi method can achieve a super-linear rate of convergence to the dominant invariant subspace of a matrix. Moreover, we show how an IRAM computes a nested sequence of approximations for the partial Schur decomposition associated with the dominant invariant subspace of a matrix.
Fidelity of the diagonal ensemble signals the many-body localization transition.
Hu, Taotao; Xue, Kang; Li, Xiaodan; Zhang, Yan; Ren, Hang
2016-11-01
In this work, we use exact matrix diagonalization to explore the many-body localization (MBL) transition in a random-field Heisenberg chain. We demonstrate that the fidelity and fidelity susceptibility can be utilized to characterize the interaction-driven many-body localization transition in this closed spin system which is in agreement with previous analytical and numerical results [S. Garnerone, N. T. Jacobson, S. Haas, and P. Zanardi, Phys. Rev. Lett. 102, 057205 (2009)PRLTAO0031-900710.1103/PhysRevLett.102.057205; P. Zanardi and N. Paunkovic, Phys. Rev. E 74, 031123 (2006)PLEEE81539-375510.1103/PhysRevE.74.031123]. In particular, instead of ground-state fidelity, we test the fidelity between two diagonal ensembles related by a small parameter perturbation δh, it is special that here the parameter perturbation δh_{i} for each site are random variables like h_{i}. It shows that fidelity of the diagonal ensemble develop a pronounced drop at the transition. We utilize fidelity to estimate the critical disorder strength h_{c} for different system size, we get h_{c}∈ [2.5,3.9] and get a power-law decay with an exponent of roughly -1.49(2) for system size N, and can extrapolate h_{c}^{inf} of the infinite system is about 2.07 which all agree with a recent work by Huse and Pal, in which the MBL transition in the same model was predicted to be hc [2,4]. We also estimate the scaling of maximum of averaged fidelity susceptibility as a function of system size N, it shows a power law increase with an exponent of about 5.05(1).
Tunneling splitting in double-proton transfer: Direct diagonalization results for porphycene
Smedarchina, Zorka; Siebrand, Willem; Fernández-Ramos, Antonio
2014-11-07
Zero-point and excited level splittings due to double-proton tunneling are calculated for porphycene and the results are compared with experiment. The calculation makes use of a multidimensional imaginary-mode Hamiltonian, diagonalized directly by an effective reduction of its dimensionality. Porphycene has a complex potential energy surface with nine stationary configurations that allow a variety of tunneling paths, many of which include classically accessible regions. A symmetry-based approach is used to show that the zero-point level, although located above the cis minimum, corresponds to concerted tunneling along a direct trans − trans path; a corresponding cis − cis path is predicted at higher energy. This supports the conclusion of a previous paper [Z. Smedarchina, W. Siebrand, and A. Fernández-Ramos, J. Chem. Phys. 127, 174513 (2007)] based on the instanton approach to a model Hamiltonian of correlated double-proton transfer. A multidimensional tunneling Hamiltonian is then generated, based on a double-minimum potential along the coordinate of concerted proton motion, which is newly evaluated at the RI-CC2/cc-pVTZ level of theory. To make it suitable for diagonalization, its dimensionality is reduced by treating fast weakly coupled modes in the adiabatic approximation. This results in a coordinate-dependent mass of tunneling, which is included in a unique Hermitian form into the kinetic energy operator. The reduced Hamiltonian contains three symmetric and one antisymmetric mode coupled to the tunneling mode and is diagonalized by a modified Jacobi-Davidson algorithm implemented in the Jadamilu software for sparse matrices. The results are in satisfactory agreement with the observed splitting of the zero-point level and several vibrational fundamentals after a partial reassignment, imposed by recently derived selection rules. They also agree well with instanton calculations based on the same Hamiltonian.
Fidelity of the diagonal ensemble signals the many-body localization transition
NASA Astrophysics Data System (ADS)
Hu, Taotao; Xue, Kang; Li, Xiaodan; Zhang, Yan; Ren, Hang
2016-11-01
In this work, we use exact matrix diagonalization to explore the many-body localization (MBL) transition in a random-field Heisenberg chain. We demonstrate that the fidelity and fidelity susceptibility can be utilized to characterize the interaction-driven many-body localization transition in this closed spin system which is in agreement with previous analytical and numerical results [S. Garnerone, N. T. Jacobson, S. Haas, and P. Zanardi, Phys. Rev. Lett. 102, 057205 (2009), 10.1103/PhysRevLett.102.057205; P. Zanardi and N. Paunkovic, Phys. Rev. E 74, 031123 (2006), 10.1103/PhysRevE.74.031123]. In particular, instead of ground-state fidelity, we test the fidelity between two diagonal ensembles related by a small parameter perturbation δ h , it is special that here the parameter perturbation δ hi for each site are random variables like hi. It shows that fidelity of the diagonal ensemble develop a pronounced drop at the transition. We utilize fidelity to estimate the critical disorder strength hc for different system size, we get hc∈ [2.5,3.9] and get a power-law decay with an exponent of roughly -1.49 (2 ) for system size N , and can extrapolate hcinf of the infinite system is about 2.07 which all agree with a recent work by Huse and Pal, in which the MBL transition in the same model was predicted to be hc [2,4]. We also estimate the scaling of maximum of averaged fidelity susceptibility as a function of system size N , it shows a power law increase with an exponent of about 5.05(1).
Off-diagonal deformations of Kerr metrics and black ellipsoids in heterotic supergravity
NASA Astrophysics Data System (ADS)
Vacaru, Sergiu I.; Irwin, Klee
2017-01-01
Geometric methods for constructing exact solutions of equations of motion with first order α ^' } corrections to the heterotic supergravity action implying a nontrivial Yang-Mills sector and six-dimensional, 6-d, almost-Kähler internal spaces are studied. In 10-d spacetimes, general parametrizations for generic off-diagonal metrics, nonlinear and linear connections, and matter sources, when the equations of motion decouple in very general forms are considered. This allows us to construct a variety of exact solutions when the coefficients of fundamental geometric/physical objects depend on all higher-dimensional spacetime coordinates via corresponding classes of generating and integration functions, generalized effective sources and integration constants. Such generalized solutions are determined by generic off-diagonal metrics and nonlinear and/or linear connections; in particular, as configurations which are warped/compactified to lower dimensions and for Levi-Civita connections. The corresponding metrics can have (non-) Killing and/or Lie algebra symmetries and/or describe (1+2)-d and/or (1+3)-d domain wall configurations, with possible warping nearly almost-Kähler manifolds, with gravitational and gauge instantons for nonlinear vacuum configurations and effective polarizations of cosmological and interaction constants encoding string gravity effects. A series of examples of exact solutions describing generic off-diagonal supergravity modifications to black hole/ellipsoid and solitonic configurations are provided and analyzed. We prove that it is possible to reproduce the Kerr and other type black solutions in general relativity (with certain types of string corrections) in the 4-d case and to generalize the solutions to non-vacuum configurations in (super-) gravity/string theories.
Tunneling splitting in double-proton transfer: Direct diagonalization results for porphycene
NASA Astrophysics Data System (ADS)
Smedarchina, Zorka; Siebrand, Willem; Fernández-Ramos, Antonio
2014-11-01
Zero-point and excited level splittings due to double-proton tunneling are calculated for porphycene and the results are compared with experiment. The calculation makes use of a multidimensional imaginary-mode Hamiltonian, diagonalized directly by an effective reduction of its dimensionality. Porphycene has a complex potential energy surface with nine stationary configurations that allow a variety of tunneling paths, many of which include classically accessible regions. A symmetry-based approach is used to show that the zero-point level, although located above the cis minimum, corresponds to concerted tunneling along a direct trans - trans path; a corresponding cis - cis path is predicted at higher energy. This supports the conclusion of a previous paper [Z. Smedarchina, W. Siebrand, and A. Fernández-Ramos, J. Chem. Phys. 127, 174513 (2007)] based on the instanton approach to a model Hamiltonian of correlated double-proton transfer. A multidimensional tunneling Hamiltonian is then generated, based on a double-minimum potential along the coordinate of concerted proton motion, which is newly evaluated at the RI-CC2/cc-pVTZ level of theory. To make it suitable for diagonalization, its dimensionality is reduced by treating fast weakly coupled modes in the adiabatic approximation. This results in a coordinate-dependent mass of tunneling, which is included in a unique Hermitian form into the kinetic energy operator. The reduced Hamiltonian contains three symmetric and one antisymmetric mode coupled to the tunneling mode and is diagonalized by a modified Jacobi-Davidson algorithm implemented in the Jadamilu software for sparse matrices. The results are in satisfactory agreement with the observed splitting of the zero-point level and several vibrational fundamentals after a partial reassignment, imposed by recently derived selection rules. They also agree well with instanton calculations based on the same Hamiltonian.
Sato, Shuichi; Kawamura, Seiji; Kokeyama, Keiko; Kawazoe, Fumiko; Somiya, Kentaro
2007-04-15
Next generation gravitational wave antennas employ resonant sideband extraction (RSE) interferometers with Fabry-Perot cavities in the arms as an optical configuration. In order to realize stable, robust control of the detector system, it is a key issue to extract appropriate control signals for longitudinal degrees of freedom of the complex coupled-cavity system. In this paper, a novel length sensing and control scheme is proposed for the tuned RSE interferometer that is both simple and efficient. The sensing matrix can be well diagonalized, owing to a simple allocation of two rf modulations and to a macroscopic displacement of the cavity mirrors, which cause a detuning of the rf modulation sidebands.
Bilayer quantum hall systems at filling factor nu = 2: An exact diagonalization study
Schliemann; MacDonald
2000-05-08
We present an exact diagonalization study of bilayer quantum Hall systems at filling factor nu = 2 in the spherical geometry. We find the high-Zeeman-coupling phase boundary of the broken symmetry canted antiferromagnet is given exactly by previous Hartree-Fock mean-field theories, but that the state's stability at weak Zeeman coupling has been qualitatively overestimated. In the absence of interlayer tunneling, degeneracies occur between total spin multiplets due to the Hamiltonian's invariance under independent spin rotations in top and bottom two-dimensional electron layers.
Retrieve the Bethe states of quantum integrable models solved via the off-diagonal Bethe Ansatz
NASA Astrophysics Data System (ADS)
Zhang, Xin; Li, Yuan-Yuan; Cao, Junpeng; Yang, Wen-Li; Shi, Kangjie; Wang, Yupeng
2015-05-01
Based on the inhomogeneous T-Q relation constructed via the off-diagonal Bethe Ansatz, a systematic method for retrieving the Bethe-type eigenstates of integrable models without obvious reference state is developed by employing certain orthogonal basis of the Hilbert space. With the XXZ spin torus model and the open XXX spin- \\frac{1}{2} chain as examples, we show that for a given inhomogeneous T-Q relation and the associated Bethe Ansatz equations, the constructed Bethe-type eigenstate has a well-defined homogeneous limit.
A novel diagonal-current injection VCSEL design proposed for nitride lasers
NASA Astrophysics Data System (ADS)
Mackowiak, P.; Sarzala, R. P.; Nakwaski, W.
2001-07-01
An advanced three-dimensional optical-electrical model has been used for nitride lasers to design a novel vertical-cavity surface-emitting laser (VCSEL) configuration with a diagonal-current injection (DCI) mechanism. The design has been optimized for the lowest room-temperature (RT) lasing threshold which has been found to be similar to RT thresholds of advanced arsenide and phosphide VCSELs. The DCI nitride VCSEL demonstrates very promising anticipated RT threshold characteristics. Its optical structure is very selective: the fundamental mode exhibits distinctly the lowest threshold. In addition, the lasing threshold has been found to be exponentially proportional to the barrier width.
Design and analysis of a novel chaotic diagonal recurrent neural network
NASA Astrophysics Data System (ADS)
Wang, Libiao; Meng, Zhuo; Sun, Yize; Guo, Lei; Zhou, Mingxing
2015-09-01
A chaotic neural network model with logistic mapping is proposed to improve the performance of the conventional diagonal recurrent neural network. The network shows rich dynamic behaviors that contribute to escaping from a local minimum to reach the global minimum easily. Then, a simple parameter modulated chaos controller is adopted to enhance convergence speed of the network. Furthermore, an adaptive learning algorithm with the robust adaptive dead zone vector is designed to improve the generalization performance of the network, and weights convergence for the network with the adaptive dead zone vectors is proved in the sense of Lyapunov functions. Finally, the numerical simulation is carried out to demonstrate the correctness of the theory.
NASA Astrophysics Data System (ADS)
Sato, Shuichi; Kawamura, Seiji; Kokeyama, Keiko; Kawazoe, Fumiko; Somiya, Kentaro
2007-04-01
Next generation gravitational wave antennas employ resonant sideband extraction (RSE) interferometers with Fabry-Perot cavities in the arms as an optical configuration. In order to realize stable, robust control of the detector system, it is a key issue to extract appropriate control signals for longitudinal degrees of freedom of the complex coupled-cavity system. In this paper, a novel length sensing and control scheme is proposed for the tuned RSE interferometer that is both simple and efficient. The sensing matrix can be well diagonalized, owing to a simple allocation of two rf modulations and to a macroscopic displacement of the cavity mirrors, which cause a detuning of the rf modulation sidebands.
A stereoscopic diagonal inverter (SDI) for wide-angle vitreous surgery.
Spitznas, M; Reiner, J
1987-01-01
All known methods of wide-angle observation of the fundus deliver an inverted image. To overcome these difficulties a stereoscopic diagonal inverter (SDI) was developed, which serves as an accessory to the operating microscope. This device permits the microscopic image to be vertically inverted and laterally reversed, while retaining full stereopsis, and thus makes wide-angle observation devices such as the Rodenstock Panfundoscope contact lens (150 degrees) and a modified version of the binocular indirect ophthalmoscope (70 degrees-90 degrees) usable in vitreous microsurgery.
Suppression of spectral anomalies in SSFP-NMR signal by the Krylov Basis Diagonalization Method
NASA Astrophysics Data System (ADS)
Moraes, Tiago Bueno; Santos, Poliana Macedo; Magon, Claudio Jose; Colnago, Luiz Alberto
2014-06-01
Krylov Basis Diagonalization Method (KBDM) is a numerical procedure used to fit time domain signals as a sum of exponentially damped sinusoids. In this work KBDM is used as an alternative spectral analysis tool, complimentary to Fourier transform. We report results obtained from 13C Nuclear Magnetic Resonance (NMR) by Steady State Free Precession (SSFP) measurements in brucine, C23H26N2O4. Results lead to the conclusion that the KBDM can be successfully applied, mainly because it is not influenced by truncation or phase anomalies, as observed in the Fourier transform spectra.
CSI Helsinki: Swli in Forensic Science: Comparing Toolmarks of Diagonal Cutting Pliers
NASA Astrophysics Data System (ADS)
Ahvenainen, P.; Kassamakov, I.; Hanhijärvi, K.; Aaltonen, J.; Lehto, S.; Reinikainen, T.; Hæggström, E.
2010-02-01
Scanning White Light Interferometry provides sub-micron depth resolution and is therefore an ideal data acquisition method for forensic toolmark comparison in which such resolution is required. We imaged toolmarks made on ten copper wires with a preselected part of the jaws of a pair of diagonal cutting pliers. The common pattern found in the surface depth profiles comparison indicated a common source. The application of white light interferometry provides a quantitative method for forensic toolmark study through high-resolution 3D profiles.
Perturbation expansion for a one-dimensional Anderson model with off-diagonal disorder
NASA Astrophysics Data System (ADS)
Bovier, Anton
1989-09-01
The weak disorder expansion for a random Schrödinger equation with off-diagonal disorder in one dimension is studied. The invariant measure, the density of states, and the Lyapunov exponent are computed. The most interesting feature in this model appears at the band center, where the differentiated density of states diverges, while the Lyapunov exponent vanishes. The invariant measure approaches an atomic measure concentrated on zero and infinity. The results extend previous work of Markos to all orders of perturbation theory.
NASA Technical Reports Server (NTRS)
Beggs, John H.; Briley, W. Roger
2001-01-01
There has been some recent work to develop two and three-dimensional alternating direction implicit (ADI) FDTD schemes. These ADI schemes are based upon the original ADI concept developed by Peaceman and Rachford and Douglas and Gunn, which is a popular solution method in Computational Fluid Dynamics (CFD). These ADI schemes work well and they require solution of a tridiagonal system of equations. A new approach proposed in this paper applies a LU/AF approximate factorization technique from CFD to Maxwell s equations in flux conservative form for one space dimension. The result is a scheme that will retain its unconditional stability in three space dimensions, but does not require the solution of tridiagonal systems. The theory for this new algorithm is outlined in a one-dimensional context for clarity. An extension to two and threedimensional cases is discussed. Results of Fourier analysis are discussed for both stability and dispersion/damping properties of the algorithm. Results are presented for a one-dimensional model problem, and the explicit FDTD algorithm is chosen as a convenient reference for comparison.
Four decades of implicit Monte Carlo
Wollaber, Allan B.
2016-02-23
In 1971, Fleck and Cummings derived a system of equations to enable robust Monte Carlo simulations of time-dependent, thermal radiative transfer problems. Denoted the “Implicit Monte Carlo” (IMC) equations, their solution remains the de facto standard of high-fidelity radiative transfer simulations. Over the course of 44 years, their numerical properties have become better understood, and accuracy enhancements, novel acceleration methods, and variance reduction techniques have been suggested. In this review, we rederive the IMC equations—explicitly highlighting assumptions as they are made—and outfit the equations with a Monte Carlo interpretation. We put the IMC equations in context with other approximate forms of the radiative transfer equations and present a new demonstration of their equivalence to another well-used linearization solved with deterministic transport methods for frequency-independent problems. We discuss physical and numerical limitations of the IMC equations for asymptotically small time steps, stability characteristics and the potential of maximum principle violations for large time steps, and solution behaviors in an asymptotically thick diffusive limit. We provide a new stability analysis for opacities with general monomial dependence on temperature. Here, we consider spatial accuracy limitations of the IMC equations and discussion acceleration and variance reduction techniques.
Four decades of implicit Monte Carlo
Wollaber, Allan B.
2016-02-23
In 1971, Fleck and Cummings derived a system of equations to enable robust Monte Carlo simulations of time-dependent, thermal radiative transfer problems. Denoted the “Implicit Monte Carlo” (IMC) equations, their solution remains the de facto standard of high-fidelity radiative transfer simulations. Over the course of 44 years, their numerical properties have become better understood, and accuracy enhancements, novel acceleration methods, and variance reduction techniques have been suggested. In this review, we rederive the IMC equations—explicitly highlighting assumptions as they are made—and outfit the equations with a Monte Carlo interpretation. We put the IMC equations in context with other approximate formsmore » of the radiative transfer equations and present a new demonstration of their equivalence to another well-used linearization solved with deterministic transport methods for frequency-independent problems. We discuss physical and numerical limitations of the IMC equations for asymptotically small time steps, stability characteristics and the potential of maximum principle violations for large time steps, and solution behaviors in an asymptotically thick diffusive limit. We provide a new stability analysis for opacities with general monomial dependence on temperature. Here, we consider spatial accuracy limitations of the IMC equations and discussion acceleration and variance reduction techniques.« less
NASA Technical Reports Server (NTRS)
Rudy, D. H.; Morris, D. J.
1976-01-01
An uncoupled time asymptotic alternating direction implicit method for solving the Navier-Stokes equations was tested on two laminar parallel mixing flows. A constant total temperature was assumed in order to eliminate the need to solve the full energy equation; consequently, static temperature was evaluated by using algebraic relationship. For the mixing of two supersonic streams at a Reynolds number of 1,000, convergent solutions were obtained for a time step 5 times the maximum allowable size for an explicit method. The solution diverged for a time step 10 times the explicit limit. Improved convergence was obtained when upwind differencing was used for convective terms. Larger time steps were not possible with either upwind differencing or the diagonally dominant scheme. Artificial viscosity was added to the continuity equation in order to eliminate divergence for the mixing of a subsonic stream with a supersonic stream at a Reynolds number of 1,000.
The rules of implicit evaluation by race, religion, and age.
Axt, Jordan R; Ebersole, Charles R; Nosek, Brian A
2014-09-01
The social world is stratified. Social hierarchies are known but often disavowed as anachronisms or unjust. Nonetheless, hierarchies may persist in social memory. In three studies (total N > 200,000), we found evidence of social hierarchies in implicit evaluation by race, religion, and age. Participants implicitly evaluated their own racial group most positively and the remaining racial groups in accordance with the following hierarchy: Whites > Asians > Blacks > Hispanics. Similarly, participants implicitly evaluated their own religion most positively and the remaining religions in accordance with the following hierarchy: Christianity > Judaism > Hinduism or Buddhism > Islam. In a final study, participants of all ages implicitly evaluated age groups following this rule: children > young adults > middle-age adults > older adults. These results suggest that the rules of social evaluation are pervasively embedded in culture and mind.
Skepticism: Genuine unbelief or implicit beliefs in the supernatural?
Lindeman, Marjaana; Svedholm-Häkkinen, Annika M; Riekki, Tapani
2016-05-01
We examined whether skeptics hold implicit supernatural beliefs or implicit cognitive underpinnings of the beliefs. In study 1 (N=57), participants read a biological or a religious story about death. The story content had no effect on skeptics' (or believers') afterlife beliefs. Study 2 examined the relationships between religious and non-religious paranormal beliefs and implicit views about whether supernatural and religious phenomena are imaginary or real (n1=33, n2=31). The less supernatural beliefs were endorsed the easier it was to connect "supernatural" with "imaginary". Study 3 (N=63) investigated whether participants' supernatural beliefs and ontological confusions differ between speeded and non-speeded response conditions. Only non-analytical skeptics' ontological confusions increased in speeded conditions. The results indicate that skeptics overall do not hold implicit supernatural beliefs, but that non-analytically thinking skeptics may, under supporting conditions, be prone to biases that predispose to supernatural beliefs.
"Implicit action": Understanding discourse management in modeling instruction
NASA Astrophysics Data System (ADS)
Durden, Jared; Brewe, Eric; Kramer, Laird
2012-02-01
We present "Implicit Action", a discourse management tool, through a qualitative video analysis of a Florida International University Modeling Instruction Introductory Physics I class. Implicit Action in Modeling Instruction is where instructors deliberately create intellectual space in which students ideally see value and need for the construction of new classroom norms and tools that are productive in developing a learning community. This space is created by the implications expressed through the instructors' deliberate actions. Discourse Management is a technique to moderate student discourse in Modeling Instruction classes at the university level that was initially described by Desbien [1]. Implicit Action is one of 9 Modeling Discourse Management tools that we have identified. By means of qualitative analysis we illustrate the effectiveness of Implicit Action in implementing the Modeling Theory of Instruction.
Moderators of the Relationship between Implicit and Explicit Evaluation
Nosek, Brian A.
2005-01-01
Automatic and controlled modes of evaluation sometimes provide conflicting reports of the quality of social objects. This paper presents evidence for four moderators of the relationship between automatic (implicit) and controlled (explicit) evaluations. Implicit and explicit preferences were measured for a variety of object pairs using a large sample. The average correlation was r = .36, and 52 of the 57 object pairs showed a significant positive correlation. Results of multilevel modeling analyses suggested that: (a) implicit and explicit preferences are related, (b) the relationship varies as a function of the objects assessed, and (c) at least four variables moderate the relationship – self-presentation, evaluative strength, dimensionality, and distinctiveness. The variables moderated implicit-explicit correspondence across individuals and accounted for much of the observed variation across content domains. The resulting model of the relationship between automatic and controlled evaluative processes is grounded in personal experience with the targets of evaluation. PMID:16316292
Implicit Cognition and Addiction: A Tool for Explaining Paradoxical Behavior
Stacy, Alan W.; Wiers, Reinout W.
2012-01-01
Research on implicit cognition and addiction has expanded greatly during the past decade. This research area provides new ways to understand why people engage in behaviors that they know are harmful or counterproductive in the long run. Implicit cognition takes a different view from traditional cognitive approaches to addiction by assuming that behavior is often not a result of a reflective decision that takes into account the pros and cons known by the individual. Instead of a cognitive algebra integrating many cognitions relevant to choice, implicit cognition assumes that the influential cognitions are the ones that are spontaneously activated during critical decision points. This selective review highlights many of the consistent findings supporting predictive effects of implicit cognition on substance use and abuse in adolescents and adults; reveals a recent integration with dual-process models; outlines the rapid evolution of different measurement tools; and introduces new routes for intervention. PMID:20192786
Explicit and Implicit Emotion Regulation: A Dual-Process Framework
Gyurak, Anett; Gross, James J.; Etkin, Amit
2012-01-01
It is widely acknowledged that emotions can be regulated in an astonishing variety of ways. Most research to date has focused on explicit (effortful) forms of emotion regulation. However, there is growing research interest in implicit (automatic) forms of emotion regulation. To organize emerging findings, we present a dual-process framework that integrates explicit and implicit forms of emotion regulation, and argue that both forms of regulation are necessary for well-being. In the first section of this review, we provide a broad overview of the construct of emotion regulation, with an emphasis on explicit and implicit processes. In the second section, we focus on explicit emotion regulation, considering both neural mechanisms that are associated with these processes and their experiential and physiological consequences. In the third section, we turn to several forms of implicit emotion regulation, and integrate the burgeoning literature in this area. We conclude by outlining open questions and areas for future research. PMID:21432682
Implicit Methods for the Magnetohydrodynamic Description of Magnetically Confined Plasmas
Jardin, S C
2010-09-28
Implicit algorithms are essential for predicting the slow growth and saturation of global instabilities in today’s magnetically confined fusion plasma experiments. Present day algorithms for obtaining implicit solutions to the magnetohydrodynamic (MHD) equations for highly magnetized plasma have their roots in algorithms used in the 1960s and 1970s. However, today’s computers and modern linear and non-linear solver techniques make practical much more comprehensive implicit algorithms than were previously possible. Combining these advanced implicit algorithms with highly accurate spatial representations of the vector fields describing the plasma flow and magnetic fields and with improved methods of calculating anisotropic thermal conduction now makes possible simulations of fusion experiments using realistic values of plasma parameters and actual configuration geometry.
Analysis of implicit second-order upwind-biased stencils
NASA Technical Reports Server (NTRS)
Roberts, Thomas W.; Warren, Gary P.
1993-01-01
Truncation error and stability properties of several implicit upwind schemes for the two-dimensional Euler equations are examined. The schemes use linear data reconstruction methods to achieve second-order flux integrations where the implicit Jacobian operators are first order. The stability properties of the schemes are examined by a Von Neumann analysis of the linearized, constant-coefficient Euler equations. The choice of the data reconstruction method used to evaluate the flux integral has a dramatic effect on the convergence properties of the implicit solution method. In particular, the typical one-dimensional data reconstruction methods used with structured grids exhibit poor convergence properties compared to the unstructured grid method considered. Of the schemes examined, the one with the superior convergence properties is well-suited for both unstructured and structured grids, which has important implications for the design of implicit methods.
Implicit learning of arithmetic regularities is facilitated by proximal contrast.
Prather, Richard W
2012-01-01
Natural number arithmetic is a simple, powerful and important symbolic system. Despite intense focus on learning in cognitive development and educational research many adults have weak knowledge of the system. In current study participants learn arithmetic principles via an implicit learning paradigm. Participants learn not by solving arithmetic equations, but through viewing and evaluating example equations, similar to the implicit learning of artificial grammars. We expand this to the symbolic arithmetic system. Specifically we find that exposure to principle-inconsistent examples facilitates the acquisition of arithmetic principle knowledge if the equations are presented to the learning in a temporally proximate fashion. The results expand on research of the implicit learning of regularities and suggest that contrasting cases, show to facilitate explicit arithmetic learning, is also relevant to implicit learning of arithmetic.
How Do Self-Attributed and Implicit Motives Differ?
ERIC Educational Resources Information Center
McClelland, David C.; And Others
1989-01-01
Implicit motives generally sustain behavior over time because of the pleasure derived from the activities; self-attributed motives predict immediate responses because of social incentives in a structured situation. Implications of these distinctions are discussed. (SLD)
Contour-Based Surface Reconstruction using MPU Implicit Models.
Braude, Ilya; Marker, Jeffrey; Museth, Ken; Nissanov, Jonathan; Breen, David
2007-03-01
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that make up the contours as points in ℝ(3) and employs Multi-level Partition of Unity (MPU) implicit models to create a surface that approximately fits to the 3D points. Since MPU implicit models additionally require surface normal information at each point, an algorithm that estimates normals from the contour data is also described. Contour data frequently contains noise from the scanning and delineation process. MPU implicit models provide a superior approach to the problem of contour-based surface reconstruction, especially in the presence of noise, because they are based on adaptive implicit functions that locally approximate the points within a controllable error bound. We demonstrate the effectiveness of our technique with a number of example datasets, providing images and error statistics generated from our results.
Implicit cognition and substance use: a meta-analysis.
Rooke, Sally E; Hine, Donald W; Thorsteinsson, Einar B
2008-10-01
A meta-analysis of 89 effect sizes based on the responses of 19,930 participants was conducted to estimate the magnitude of the relationship between substance-related implicit cognitions and the use of legal and illegal substances. The analysis produced a weighted average effect size of r=.31. Moderation analyses revealed significant heterogeneity in effect sizes related to facet of implicit cognition, measurement strategy, sample composition, and substance type. The largest effect sizes were found in studies that assessed implicit semantic associations, employed word association measures, and focused on marijuana use. The findings suggest that implicit cognition is a reliable predictor of substance use, although effect sizes vary as a function of several methodological factors.
Implicit Learning Abilities Predict Treatment Response in Autism Spectrum Disorders
2015-09-01
for Autism Spectrum Disorder (ASD), but almost half of the children do not make significant gains. Implicit learning skills are integral to...significant gains. Implicit associative learning skills are integral to behavioral interventions in ASD and fundamental to the acquisition of social...communication and language abilities. Yet there is inconsistency in the literature as to whether individuals with ASD have difficulties with such learning
Implicit learning of fifth- and sixth-order sequential probabilities.
Remillard, Gilbert
2010-10-01
Serial reaction time (SRT) task studies have established that people can implicitly learn sequential contingencies as complex as fourth-order probabilities. The present study examined people's ability to learn fifth-order (Experiment 1) and sixth-order (Experiment 2) probabilities. Remarkably, people learned fifth- and sixth-order probabilities. This suggests that the implicit sequence learning mechanism can operate over a range of at least seven sequence elements.
Implicit Theories and Offender Representativeness in Judgments About Sexual Crime.
Harper, Craig A; Bartels, Ross M
2016-07-01
Implicit theories structure the way people understand and respond to various human actions. Typically, people believe attributes are either fixed (entitists) or malleable (incrementalists). The present study aimed to examine (a) whether attitudes toward sexual offenders differ depending upon one's implicit theory about human nature and sexual offenders, and (b) whether implicit theories are associated with judgments made about different types of child abusers. A sample of 252 community participants was recruited. Their attitudes, implicit theories, and political orientation were assessed via self-report. One of three vignettes describing an incidence of child sexual abuse was then presented. The cases were identical except the perpetrator was either an adult male, an adult female, or a male juvenile. Participants then made judgments about the offender's deserved sentence and moral character. Entitists (across both domains) held more negative attitudes than incrementalists, although the magnitude of the difference was greatest when examining implicit theories about sexual offenders. Compared with those with an incremental theory of sexual offenders, entity theorists judged sexual offending to be more (a) indicative of the perpetrator's moral character and (b) deserving of punishment. However, scores were greater toward the adult male relative to the adult female and juvenile. The findings suggest that implicit theories about sexual offenders are domain specific. They also indicate that judgments made by those with an entity theory (about sexual offenders) are affected by whether a case is representative of a stereotypical sexual offender. Implications of the findings are discussed, along with limitations and future research.
Integrating Implicit Induction Proofs into Certified Proof Environments
NASA Astrophysics Data System (ADS)
Stratulat, Sorin
We give evidence of the direct integration and automated checking of implicit induction-based proofs inside certified reasoning environments, as that provided by the Coq proof assistant. This is the first step of a long term project focused on 1) mechanically certifying implicit induction proofs generated by automated provers like Spike, and 2) narrowing the gap between automated and interactive proof techniques inside proof assistants such that multiple induction steps can be executed completely automatically and mutual induction can be treated more conveniently. Contrary to the current approaches of reconstructing implicit induction proofs into scripts based on explicit induction tactics that integrate the usual proof assistants, our checking methodology is simpler and fits better for automation. The underlying implicit induction principles are separated and validated independently from the proof scripts that consist in a bunch of one-to-one translations of implicit induction proof steps. The translated steps can be checked independently, too, so the validation process fits well for parallelisation and for the management of large proof scripts. Moreover, our approach is more general; any kind of implicit induction proof can be considered because the limitations imposed by the proof reconstruction techniques no longer exist. An implementation that integrates automatic translators for generating fully checkable Coq scripts from Spike proofs is reported.
Factors influencing university students' explicit and implicit sexual double standards.
Sakaluk, John K; Milhausen, Robin R
2012-01-01
Quantitative research has resulted in inconsistent evidence for the existence of a sexual double standard, leading Crawford and Popp ( 2003 ) to issue a call for methodological innovation. The implicit association test (IAT; Greenwald, McGhee, & Schwartz, 1998 ) is a measure that may provide a means to examine the double standard without the contamination of the demand characteristics and social desirability biases that plague self-report research (Marks & Fraley, 2005 ). The purpose of this study was to examine the factors influencing explicit and implicit double standards, and to examine the relationship between these explicit and implicit double standards, and levels of socially desirable responding. One hundred and three university students completed a sexual double standard IAT, an explicit measure of the double standard, and measures of socially desirable responding. Hierarchical regression analysis indicated that levels of socially desirable responding were not related to implicit or explicit double standards. Men endorsed a stronger explicit traditional double standard than women, whereas for implicit sexual standards, men demonstrated a relatively gender-neutral evaluation and women demonstrated a strong reverse double standard. These results suggest the existence of a complex double standard, and indicate that more research of sexual attitudes should include implicit measures.
Implicit sequence learning in ring-tailed lemurs (Lemur catta).
Drucker, Caroline B; Baghdoyan, Talia; Brannon, Elizabeth M
2016-01-01
Implicit learning involves picking up information from the environment without explicit instruction or conscious awareness of the learning process. In nonhuman animals, conscious awareness is impossible to assess, so we define implicit learning as occurring when animals acquire information beyond what is required for successful task performance. While implicit learning has been documented in some nonhuman species, it has not been explored in prosimian primates. Here we ask whether ring-tailed lemurs (Lemur catta) learn sequential information implicitly. We tested lemurs in a modified version of the serial reaction time task on a touch screen computer. Lemurs were required to respond to any picture within a 2 × 2 grid of pictures immediately after its surrounding border flickered. Over 20 training sessions, both the locations and the identities of the images remained constant and response times gradually decreased. Subsequently, the locations and/or the identities of the images were disrupted. Response times indicated that the lemurs had learned the physical location sequence required in original training but did not learn the identity of the images. Our results reveal that ring-tailed lemurs can implicitly learn spatial sequences, and raise questions about which scenarios and evolutionary pressures give rise to perceptual versus motor-implicit sequence learning.
Neural Manifestations of Implicit Self-Esteem: An ERP Study
Wu, Lili; Cai, Huajian; Gu, Ruolei; Luo, Yu L. L.; Zhang, Jianxin; Yang, Jing; Shi, Yuanyuan; Ding, Lei
2014-01-01
Behavioral research has established that humans implicitly tend to hold a positive view toward themselves. In this study, we employed the event-related potential (ERP) technique to explore neural manifestations of positive implicit self-esteem using the Go/Nogo association task (GNAT). Participants generated a response (Go) or withheld a response (Nogo) to self or others words and good or bad attributes. Behavioral data showed that participants responded faster to the self paired with good than the self paired with bad, whereas the opposite proved true for others, reflecting the positive nature of implicit self-esteem. ERP results showed an augmented N200 over the frontal areas in Nogo responses relative to Go responses. Moreover, the positive implicit self-positivity bias delayed the onset time of the N200 wave difference between Nogo and Go trials, suggesting that positive implicit self-esteem is manifested on neural activity about 270 ms after the presentation of self-relevant stimuli. These findings provide neural evidence for the positivity and automaticity of implicit self-esteem. PMID:25006966
Do children with developmental dyslexia have an implicit learning deficit?
Vicari, S; Finzi, A; Menghini, D; Marotta, L; Baldi, S; Petrosini, L
2005-01-01
Objective: The purpose of this study was to investigate the effects of specific types of tasks on the efficiency of implicit procedural learning in the presence of developmental dyslexia (DD). Methods: Sixteen children with DD (mean (SD) age 11.6 (1.4) years) and 16 matched normal reader controls (mean age 11.4 (1.9) years) were administered two tests (the Serial Reaction Time test and the Mirror Drawing test) in which implicit knowledge was gradually acquired across multiple trials. Although both tests analyse implicit learning abilities, they tap different competencies. The Serial Reaction Time test requires the development of sequential learning and little (if any) procedural learning, whereas the Mirror Drawing test involves fast and repetitive processing of visuospatial stimuli but no acquisition of sequences. Results: The children with DD were impaired on both implicit learning tasks, suggesting that the learning deficit observed in dyslexia does not depend on the material to be learned (with or without motor sequence of response action) but on the implicit nature of the learning that characterises the tasks. Conclusion: Individuals with DD have impaired implicit procedural learning. PMID:16170083
Forces and mechanical energy fluctuations during diagonal stride roller skiing; running on wheels?
Kehler, Alyse L; Hajkova, Eliska; Holmberg, Hans-Christer; Kram, Rodger
2014-11-01
Mechanical energy can be conserved during terrestrial locomotion in two ways: the inverted pendulum mechanism for walking and the spring-mass mechanism for running. Here, we investigated whether diagonal stride cross-country roller skiing (DIA) utilizes similar mechanisms. Based on previous studies, we hypothesized that running and DIA would share similar phase relationships and magnitudes of kinetic energy (KE), and gravitational potential energy (GPE) fluctuations, indicating elastic energy storage and return, as if roller skiing is like 'running on wheels'. Experienced skiers (N=9) walked and ran at 1.25 and 3 m s(-1), respectively, and roller skied with DIA at both speeds on a level dual-belt treadmill that recorded perpendicular and parallel forces. We calculated the KE and GPE of the center of mass from the force recordings. As expected, the KE and GPE fluctuated with an out-of-phase pattern during walking and an in-phase pattern during running. Unlike walking, during DIA, the KE and GPE fluctuations were in phase, as they are in running. However, during the glide phase, KE was dissipated as frictional heat and could not be stored elastically in the tendons, as in running. Elastic energy storage and return epitomize running and thus we reject our hypothesis. Diagonal stride cross-country skiing is a biomechanically unique movement that only superficially resembles walking or running.
Organization of the Hilbert space for exact diagonalization of Hubbard model
NASA Astrophysics Data System (ADS)
Sharma, Medha; Ahsan, M. A. H.
2015-08-01
We present an alternative scheme to the widely used method of representing the basis of one-band Hubbard model through the relation I =I↑ +2MI↓ given by Lin and Gubernatis (1993), where I↑, I↓ and I are the integer equivalents of binary representations of occupation patterns of spin up, spin down and both spin up and spin down electrons respectively, with M being the number of sites. We compute and store only I↑ or I↓ at a time to generate the full Hamiltonian matrix. The non-diagonal part of the Hamiltonian matrix given as I↓ ⊗H↑ ⊕H↓ ⊗I↑ is generated using a bottom-up approach by computing the small matrices H↑ (spin up hopping Hamiltonian) and H↓ (spin down hopping Hamiltonian) and then forming the tensor product with respective identity matrices I↓ and I↑, thereby saving significant computation time and memory. We find that the total CPU time to generate the non-diagonal part of the Hamiltonian matrix using the new one spin configuration basis scheme is reduced by about an order of magnitude as compared to the two spin configuration basis scheme. The present scheme is shown to be inherently parallelizable. Its application to translationally invariant systems, computation of Green's functions and in impurity solver part of DMFT procedure is discussed and its extension to other models is also pointed out.
Kondo physics of the Anderson impurity model by distributional exact diagonalization
NASA Astrophysics Data System (ADS)
Motahari, S.; Requist, R.; Jacob, D.
2016-12-01
The distributional exact diagonalization (DED) scheme is applied to the description of Kondo physics in the Anderson impurity model. DED maps Anderson's problem of an interacting impurity level coupled to an infinite bath onto an ensemble of finite Anderson models, each of which can be solved by exact diagonalization. An approximation to the self-energy of the original infinite model is then obtained from the ensemble-averaged self-energy. Using Friedel's sum rule, we show that the particle number constraint, a central ingredient of the DED scheme, ultimately imposes Fermi liquid behavior on the ensemble-averaged self-energy, and thus is essential for the description of Kondo physics within DED. Using the numerical renormalization group (NRG) method as a benchmark, we show that DED yields excellent spectra, both inside and outside the Kondo regime for a moderate number of bath sites. Only for very strong correlations (U /Γ ≫10 ) does the number of bath sites needed to achieve good quantitative agreement become too large to be computationally feasible.