Search NASA⌕ Search

SEARCH · Search NASA

Results for “Preconditioning”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 73 records · Page 4

Force field preconditioned ab initio structure relaxation method

We present a general method to accelerate ab initio atomic structural relaxations. In this method, the conjugate gradient ab initio relaxation is preconditioned by a force field relaxation. This force field is constructed on-the-flight with the information of the ab initio forces and the current atomic configuration. At each ab initio relaxation step, the so-constructed force field is used to prerelax the system, with the relaxation direction as the preconditioned direction for the ab initio conjugated gradient method. The force field model and its parameters are rather general making this method applicable for a wide range of systems commonly used in material simulations. We report more than 80 different systems have been tested representing different cases in material simulations. Across the board, we find accelerations mostly over a factor of 2 and for some large systems with a factor of 6 ~ 9 . There is no case where the relaxation becomes worse. The code and lib for this method are provided, which can be used as a plugin in a standard ab initio atomic relaxation code.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗

A preconditioned formulation of the Cauchy-Riemann equations

A preconditioning of the Cauchy-Riemann equations which results in a second-order system is described. This system is shown to have a unique solution if the boundary conditions are chosen carefully. This choice of boundary condition enables the solution of the first-order system to be retrieved. A numerical solution of the preconditioned equations is obtained by the multigrid method.

Phillips, T. N.↗

Preconditioned methods for solving the incompressible and low speed compressible equations

Acceleration methods are presented for solving the steady state incompressible equations. These systems are preconditioned by introducing artificial time derivatives which allow for a faster convergence to the steady state. The compressible equations in conservation form with slow flow are also considered. Two arbitrary functions, alpha and beta, are introduced in the general preconditioning. An analysis of this system is presented and an optimal value for beta is determined given a constant, alpha. It is further shown that the resultant incompressible equations form a symmetric hyperbolic system and so are well posed. Several generalizations to the compressible equations are presented which generalize previous results.

Turkel, E.↗

Preconditioned methods for solving the incompressible and low speed compressible equations

The introduction of artificial time derivatives which permit faster convergence to the steady state is used to precondition steady state incompressible equation-solving acceleration methods. An optimal value is obtained for beta, given constant alpha, where alpha and beta are arbitrary functions in the general preconditioning stage. A symmetric hyperbolic system is formed by the resulting incompressible equations. Compressible equations in conservation form with slow flow are also considered.

Turkel, Eli↗

Fourier analysis of finite element preconditioned collocation schemes

The spectrum of the iteration operator of some finite element preconditioned Fourier collocation schemes is investigated. The first part of the paper analyses one-dimensional elliptic and hyperbolic model problems and the advection-diffusion equation. Analytical expressions of the eigenvalues are obtained with use of symbolic computation. The second part of the paper considers the set of one-dimensional differential equations resulting from Fourier analysis (in the tranverse direction) of the 2-D Stokes problem. All results agree with previous conclusions on the numerical efficiency of finite element preconditioning schemes.

Deville, Michel O.↗

Preconditioning matrices for the pseudospectral approximation of first-order operators

The behavior of the eigenvalues of preconditioning matrices for the pseudospectral approximation to the derivative operator has been analyzed in one and two dimensions. The one-dimensional analysis resulted in real and positive eigenvalues for the selected tridiagonal matrices. In the two-dimensional analysis, the eigenvalues of the selected block-diagonal matrices behaved well, but the preconditioner is full and therefore not suitable for applications. The Richardson scheme has been applied in the unpreconditioned as well as the preconditioned version to find the solution of the model problem.

Funaro, D.↗

Preconditioned upwind methods to solve 3-D incompressible Navier-Stokes equations for viscous flows

A computational method for calculating low-speed viscous flowfields is developed. The method uses the implicit upwind-relaxation finite-difference algorithm with a nonsingular eigensystem to solve the preconditioned, three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. The technique of local time stepping is incorporated to accelerate the rate of convergence to a steady-state solution. An extensive study of optimizing the preconditioned system is carried out for two viscous flow problems. Computed results are compared with analytical solutions and experimental data.

Hsu, C.-H.↗

Preconditioning for stratospheric sudden warmings - Sensitivity studies with a numerical model

The phenomenon of preconditioning for sudden stratospheric warming events is investigated using a 3D primitive equation model adapted from the model used by Rose and Brasseur (1989). In order to identify the conditions that make the flow preconditioned, the model was initialized alternately with observed and with artificially constructed 'hybrid' stratospheric flow patterns. Two observed warmings were investigated, February 1979 and February 1989. The artificially constructed hybrid flow fields used upper-level winds (above 10 mb) from one period and lower-level winds (below 10 mb) from another. The results of model simulations indicate that the flow in the lower and middle stratosphere is capable of serving as a predictor of the potential for a major sudden warming, with the occurrence of a warming depending only on the lower-level winds.

Smith, Anne K.↗

Propulsion-related flowfields using the preconditioned Navier-Stokes equations

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.

Venkateswaran, S.↗

Shape reanalysis and sensitivities utilizing preconditioned iterative boundary solvers

The computational advantages associated with the utilization of preconditined iterative equation solvers are quantified for the reanalysis of perturbed shapes using continuum structural boundary element analysis (BEA). Both single- and multi-zone three-dimensional problems are examined. Significant reductions in computer time are obtained by making use of previously computed solution vectors and preconditioners in subsequent analyses. The effectiveness of this technique is demonstrated for the computation of shape response sensitivities required in shape optimization. Computer times and accuracies achieved using the preconditioned iterative solvers are compared with those obtained via direct solvers and implicit differentiation of the boundary integral equations. It is concluded that this approach employing preconditioned iterative equation solvers in reanalysis and sensitivity analysis can be competitive with if not superior to those involving direct solvers.

Guru Prasad, K.↗

Preconditioned domain decomposition scheme for three-dimensional aerodynamic sensitivity analysis

A preconditioned domain decomposition scheme is introduced for the solution of the 3D aerodynamic sensitivity equation. This scheme uses the iterative GMRES procedure to solve the effective sensitivity equation of the boundary-interface cells in the sensitivity analysis domain-decomposition scheme. Excluding the dense matrices and the effect of cross terms between boundary-interfaces is found to produce an efficient preconditioning matrix.

Eleshaky, Mohammed E.↗

The multigrid preconditioned conjugate gradient method

A multigrid preconditioned conjugate gradient method (MGCG method), which uses the multigrid method as a preconditioner of the PCG method, is proposed. The multigrid method has inherent high parallelism and improves convergence of long wavelength components, which is important in iterative methods. By using this method as a preconditioner of the PCG method, an efficient method with high parallelism and fast convergence is obtained. First, it is considered a necessary condition of the multigrid preconditioner in order to satisfy requirements of a preconditioner of the PCG method. Next numerical experiments show a behavior of the MGCG method and that the MGCG method is superior to both the ICCG method and the multigrid method in point of fast convergence and high parallelism. This fast convergence is understood in terms of the eigenvalue analysis of the preconditioned matrix. From this observation of the multigrid preconditioner, it is realized that the MGCG method converges in very few iterations and the multigrid preconditioner is a desirable preconditioner of the conjugate gradient method.

Tatebe, Osamu↗

Preconditioning electromyographic data for an upper extremity model using neural networks

A back propagation neural network has been employed to precondition the electromyographic signal (EMG) that drives a computational model of the human upper extremity. This model is used to determine the complex relationship between EMG and muscle activation, and generates an optimal muscle activation scheme that simulates the actual activation. While the experimental and model predicted results of the ballistic muscle movement are very similar, the activation function between the start and the finish is not. This neural network preconditions the signal in an attempt to more closely model the actual activation function over the entire course of the muscle movement.

Roberson, D. J.↗

A Note on Substructuring Preconditioning for Nonconforming Finite Element Approximations of Second Order Elliptic Problems

In this paper an algebraic substructuring preconditioner is considered for nonconforming finite element approximations of second order elliptic problems in 3D domains with a piecewise constant diffusion coefficient. Using a substructuring idea and a block Gauss elimination, part of the unknowns is eliminated and the Schur complement obtained is preconditioned by a spectrally equivalent very sparse matrix. In the case of quasiuniform tetrahedral mesh an appropriate algebraic multigrid solver can be used to solve the problem with this matrix. Explicit estimates of condition numbers and implementation algorithms are established for the constructed preconditioner. It is shown that the condition number of the preconditioned matrix does not depend on either the mesh step size or the jump of the coefficient. Finally, numerical experiments are presented to illustrate the theory being developed.

Maliassov, Serguei↗

Preconditioning Operators on Unstructured Grids

We consider systems of mesh equations that approximate elliptic boundary value problems on arbitrary (unstructured) quasi-uniform triangulations and propose a method for constructing optimal preconditioning operators. The method is based upon two approaches: (1) the fictitious space method, i.e., the reduction of the original problem to a problem in an auxiliary (fictitious) space, and (2) the multilevel decomposition method, i.e., the construction of preconditioners by decomposing functions on hierarchical meshes. The convergence rate of the corresponding iterative process with the preconditioner obtained is independent of the mesh step. The preconditioner has an optimal computational cost: the number of arithmetic operations required for its implementation is proportional to the number of unknowns in the problem. The construction of the preconditioning operators for three dimensional problems can be done in the same way.

Nepomnyaschikh, S. V.↗

Preserving Symmetry in Preconditioned Krylov Subspace Methods

We consider the problem of solving a linear system Ax = b when A is nearly symmetric and when the system is preconditioned by a symmetric positive definite matrix M. In the symmetric case, one can recover symmetry by using M-inner products in the conjugate gradient (CG) algorithm. This idea can also be used in the nonsymmetric case, and near symmetry can be preserved similarly. Like CG, the new algorithms are mathematically equivalent to split preconditioning, but do not require M to be factored. Better robustness in a specific sense can also be observed. When combined with truncated versions of iterative methods, tests show that this is more effective than the common practice of forfeiting near-symmetry altogether.

Chan, Tony F.↗

Preconditioning the Helmholtz Equation for Rigid Ducts

An innovative hyperbolic preconditioning technique is developed for the numerical solution of the Helmholtz equation which governs acoustic propagation in ducts. Two pseudo-time parameters are used to produce an explicit iterative finite difference scheme. This scheme eliminates the large matrix storage requirements normally associated with numerical solutions to the Helmholtz equation. The solution procedure is very fast when compared to other transient and steady methods. Optimization and an error analysis of the preconditioning factors are present. For validation, the method is applied to sound propagation in a 2D semi-infinite hard wall duct.

Baumeister, Kenneth J.↗