Results for “Accelerated convergence” — Page 10

NASA NTRS1995

A General Method for Solving Systems of Non-Linear Equations

The method of steepest descent is modified so that accelerated convergence is achieved near a root. It is assumed that the function of interest can be approximated near a root by a quadratic form. An eigenvector of the quadratic form is found by evaluating the function and its gradient at an arbitrary point and another suitably selected point. The terminal point of the eigenvector is chosen to lie on the line segment joining the two points. The terminal point found lies on an axis of the quadratic form. The selection of a suitable step size at this point leads directly to the root in the direction of steepest descent in a single step. Newton's root finding method not infrequently diverges if the starting point is far from the root. However, the current method in these regions merely reverts to the method of steepest descent with an adaptive step size. The current method's performance should match that of the Levenberg-Marquardt root finding method since they both share the ability to converge from a starting point far from the root and both exhibit quadratic convergence near a root. The Levenberg-Marquardt method requires storage for coefficients of linear equations. The current method which does not require the solution of linear equations requires more time for additional function and gradient evaluations. The classic trade off of time for space separates the two methods.

Nachtsheim, Philip R.↗

NASA NTRS2005

Matching Multistage Schemes to Viscous Flow

Multistage, explicit time stepping can be tailored to accelerate convergence for scalar advection-diffusion problems by using optimized multistage coefficients that vary with the local cell Reynolds number. And, when combined with local preconditioning, variable-coefficient multistage schemes for computational fluid dynamics codes can also provide an order of magnitude faster convergence, relative to standard, fixed-coefficient schemes, for the Navier-Stokes system of equations.

Kleb, William L.↗

NASA NTRS2007

URANS Application with CFL3D

This case was run using CFL3D, a multi-zone Reynolds-averaged Navier-Stokes code developed at NASA Langley [1]. It solves the thin-layer form of the Navier-Stokes equations in each of the (selected) coordinate directions. It can use 1-to-1, patched, or overset grids, and employs local time step scaling, grid sequencing, and multigrid to accelerate convergence to steady state. In time-accurate mode, CFL3D has the option to employ dual-time stepping with subiterations and multigrid, and it achieves second order temporal accuracy. CFL3D is a finite volume method. It uses third-order upwind-biased spatial differencing on the convective and pressure terms, and second-order differencing on the viscous terms; it is globally second-order spatially accurate. The flux difference-splitting (FDS) method of Roe is employed to obtain fluxes at the cell faces. It is advanced in time with an implicit three-factor approximate factorization method.

Rumsey, C. L.↗

NASA NTRS2007

RANS and URANS Application with CFL3D

This case was run using CFL3D, a multi-zone Reynolds-averaged Navier-Stokes code developed at NASA Langley [1]. It solves the thin-layer form of the Navier-Stokes equations in each of the (selected) coordinate directions. It can use 1-to-1, patched, or overset grids, and employs local time step scaling, grid sequencing, and multigrid to accelerate convergence to steady state. In time-accurate mode, CFL3D has the option to employ dual-time stepping with subiterations and multigrid, and it achieves second order temporal accuracy. CFL3D is a finite volume method. It uses third-order upwind-biased spatial differencing on the convective and pressure terms, and second-order differencing on the viscous terms; it is globally second-order spatially accurate. The flux difference-splitting (FDS) method of Roe is employed to obtain fluxes at the cell faces. It is advanced in time with an implicit three-factor approximate factorization method.

Rumsey, C. L.↗

NASA NTRS1993

Imer-product array processor for retrieval of stored images represented by bipolar binary (+1,-1) pixels using partial input trinary pixels represented by (+1,-1)

An inner-product array processor is provided with thresholding of the inner product during each iteration to make more significant the inner product employed in estimating a vector to be used as the input vector for the next iteration. While stored vectors and estimated vectors are represented in bipolar binary (1,-1), only those elements of an initial partial input vector that are believed to be common with those of a stored vector are represented in bipolar binary; the remaining elements of a partial input vector are set to 0. This mode of representation, in which the known elements of a partial input vector are in bipolar binary form and the remaining elements are set equal to 0, is referred to as trinary representation. The initial inner products corresponding to the partial input vector will then be equal to the number of known elements. Inner-product thresholding is applied to accelerate convergence and to avoid convergence to a negative input product.

Liu, Hua-Kuang↗

NASA NTRS2006

Loci-STREAM Version 0.9

Loci-STREAM is an evolving computational fluid dynamics (CFD) software tool for simulating possibly chemically reacting, possibly unsteady flows in diverse settings, including rocket engines, turbomachines, oil refineries, etc. Loci-STREAM implements a pressure- based flow-solving algorithm that utilizes unstructured grids. (The benefit of low memory usage by pressure-based algorithms is well recognized by experts in the field.) The algorithm is robust for flows at all speeds from zero to hypersonic. The flexibility of arbitrary polyhedral grids enables accurate, efficient simulation of flows in complex geometries, including those of plume-impingement problems. The present version - Loci-STREAM version 0.9 - includes an interface with the Portable, Extensible Toolkit for Scientific Computation (PETSc) library for access to enhanced linear-equation-solving programs therein that accelerate convergence toward a solution. The name "Loci" reflects the creation of this software within the Loci computational framework, which was developed at Mississippi State University for the primary purpose of simplifying the writing of complex multidisciplinary application programs to run in distributed-memory computing environments including clusters of personal computers. Loci has been designed to relieve application programmers of the details of programming for distributed-memory computers.

Wright, Jeffrey↗

NASA NTRS2015

Improved Convergence and Robustness of USM3D Solutions on Mixed Element Grids (Invited)

Several improvements to the mixed-element USM3D discretization and defect-correction schemes have been made. A new methodology for nonlinear iterations, called the Hierarchical Adaptive Nonlinear Iteration Scheme (HANIS), has been developed and implemented. It provides two additional hierarchies around a simple and approximate preconditioner of USM3D. The hierarchies are a matrix-free linear solver for the exact linearization of Reynolds-averaged Navier Stokes (RANS) equations and a nonlinear control of the solution update. Two variants of the new methodology are assessed on four benchmark cases, namely, a zero-pressure gradient flat plate, a bump-in-channel configuration, the NACA 0012 airfoil, and a NASA Common Research Model configuration. The new methodology provides a convergence acceleration factor of 1.4 to 13 over the baseline solver technology.

Pandya, Mohagna J.↗

NASA NTRS2016

Improved Convergence and Robustness of USM3D Solutions on Mixed-Element Grids

Several improvements to the mixed-elementUSM3Ddiscretization and defect-correction schemes have been made. A new methodology for nonlinear iterations, called the Hierarchical Adaptive Nonlinear Iteration Method, has been developed and implemented. The Hierarchical Adaptive Nonlinear Iteration Method provides two additional hierarchies around a simple and approximate preconditioner of USM3D. The hierarchies are a matrix-free linear solver for the exact linearization of Reynolds-averaged Navier-Stokes equations and a nonlinear control of the solution update. Two variants of the Hierarchical Adaptive Nonlinear Iteration Method are assessed on four benchmark cases, namely, a zero-pressure-gradient flat plate, a bump-in-channel configuration, the NACA 0012 airfoil, and a NASA Common Research Model configuration. The new methodology provides a convergence acceleration factor of 1.4 to 13 over the preconditioner-alone method representing the baseline solver technology.

Pandya, Mohagna J.↗

NASA NTRS2016

Improved Convergence and Robustness of USM3D Solutions on Mixed-Element Grids

Several improvements to the mixed-element USM3D discretization and defect-correction schemes have been made. A new methodology for nonlinear iterations, called the Hierarchical Adaptive Nonlinear Iteration Method, has been developed and implemented. The Hierarchical Adaptive Nonlinear Iteration Method provides two additional hierarchies around a simple and approximate preconditioner of USM3D. The hierarchies are a matrix-free linear solver for the exact linearization of Reynolds-averaged Navier-Stokes equations and a nonlinear control of the solution update. Two variants of the Hierarchical Adaptive Nonlinear Iteration Method are assessed on four benchmark cases, namely, a zero-pressure-gradient flat plate, a bump-in-channel configuration, the NACA 0012 airfoil, and a NASA Common Research Model configuration. The new methodology provides a convergence acceleration factor of 1.4 to 13 over the preconditioner-alone method representing the baseline solver technology.

Pandya, Mohagna J.↗

NASA NTRS2018

Study of Laminar-Turbulent Transition Modeled by Amplification Factor Transport Within the LAVA Solver

The Amplification Factor Transport (AFT) transition model proposed by Coder and Maughmer is implemented in the unstructured and curvilinear Reynolds-Averaged Navier-Stokes (RANS) solvers of the Launch Ascent and Vehicle Aerodynamics (LAVA) platform. It is coupled to the Spalart-Allmaras (SA) turbulence model through a modified intermittency variable. As part of the model verification and validation phase, laminar-turbulent transition is studied over 2D flat plates, wind turbine and general aviation airfoils, as well as a 3D inclined prolate spheroid and the JAXA Standard Model (JSM). This work will analyze the sensitivity of the results to grid refinement, grid paradigm, flow conditions and numerical schemes. The numerical efficiency of the unstructured and curvilinear solvers will be compared and convergence acceleration techniques will be explored to address a broad range of aerodynamics applications.

Denison, M. F.↗

NASA NTRS1979

Finite-field Calculations of Molecular Polarizabilities Using Field-Induced Polarization Functions: Second- and Third-order Perturbation Correlation Corrections to the Coupled Hartree-Fock Polarizability of H2O

Ordinary Rayleigh-Schroudinger perturbation theory with Moller-Plesset (RSMP) partitioning is used to calculate second- and third-order correlation corrections to the CHF polarizability and dipole moment of the water molecule by a finite-field procedure. Pade approximants are found to be useful in accelerating the convergence of the property perturbation expansions. Field-induced polarization functions suitable for polarizability calculations are determined. The average polarizability calculated, neglecting vibrational averaging, with Dunning's (9s5p/4s-4s2p/2s) contracted GTO basis set augmented by field-induced lslp2d/lp polarization functions is within 3 per cent of the experimental result. Correlation corrections to the dipole moment and polarizability of the water molecule calculated by the finite-field RSMP and single + double excitation CI(SDCI) methods for the same basis set are found to be in close agreement. The RSMP approach has the advantages of being size-consistent and of being capable of greater efficiency than the SCDI method. Comparative calculations carried out using Epstein-Nesbet partitioning show that through third order RSEN correlation perturbation expansions for the dipole moment and polarizability are less rapidly convergent than RSMP expansions. However, reasonable accord with RSMP results can be achieved by using Pade approximants to accelerate the convergence of RSEN energy perturbation expansions. The convergence of RSMP property correlation expansions based on the zeroth-order uncoupled-Hartree-Fock (UCHF) and coupled-Hartree-Fock (CHF) approximations are compared through third order. Whereas the CHF + RSMP expansions are for practical purposes fully converged, the UCHF + RSMP expansions are not adequately converged.

Langhoff, S. R.↗

NASA NTRS1985

Algorithms for the Euler and Navier-Stokes equations for supercomputers

The steady state Euler and Navier-Stokes equations are considered for both compressible and incompressible flow. Methods are found for accelerating the convergence to a steady state. This acceleration is based on preconditioning the system so that it is no longer time consistent. In order that the acceleration technique be scheme-independent, this preconditioning is done at the differential equation level. Applications are presented for very slow flows and also for the incompressible equations.

Turkel, E.↗

NASA NTRS1985

Algorithms for the Euler and Navier-Stokes equations for supercomputers

The steady state Euler and Navier-Stokes equations are considered for both compressible and incompressible flow. Methods are found for accelerating the convergence to a steady state. This acceleration is based on preconditioning the system so that it is no longer time consistent. In order that the acceleration technique be scheme-independent, this preconditioning is done at the differential equation level. Applications are presented for very slow flows and also for the incompressible equations.

Turkel, E.↗

NASA NTRS1999

New echocardiographic windows for quantitative determination of aortic regurgitation volume using color Doppler flow convergence and vena contracta

Color Doppler images of aortic regurgitation (AR) flow acceleration, flow convergence (FC), and the vena contracta (VC) have been reported to be useful for evaluating severity of AR. However, clinical application of these methods has been limited because of the difficulty in clearly imaging the FC and VC. This study aimed to explore new windows for imaging the FC and VC to evaluate AR volumes in patients and to validate this in animals with chronic AR. Forty patients with AR and 17 hemodynamic states in 4 sheep with strictly quantified AR volumes were evaluated. A Toshiba SSH 380A with a 3.75-MHz transducer was used to image the FC and VC. After routine echo Doppler imaging, patients were repositioned in the right lateral decubitus position, and the FC and VC were imaged from high right parasternal windows. In only 15 of the 40 patients was it possible to image clearly and measure accurately the FC and VC from conventional (left decubitus) apical or parasternal views. In contrast, 31 of 40 patients had clearly imaged FC regions and VCs using the new windows. In patients, AR volumes derived from the FC and VC methods combined with continuous velocity agreed well with each other (r = 0.97, mean difference = -7.9 ml +/- 9.9 ml/beat). In chronic animal model studies, AR volumes derived from both the VC and the FC agreed well with the electromagnetically derived AR volumes (r = 0.92, mean difference = -1.3 +/- 4.0 ml/beat). By imaging from high right parasternal windows in the right decubitus position, complementary use of the FC and VC methods can provide clinically valuable information about AR volumes.

NASA Discipline Cardiopulmonary↗

NASA NTRS1991

Spectrum transformation for divergent iterations

Certain spectrum transformation techniques are described that can be used to transform a diverging iteration into a converging one. Two techniques are considered called spectrum scaling and spectrum enveloping and how to obtain the optimum values of the transformation parameters is discussed. Numerical examples are given to show how this technique can be used to transform diverging iterations into converging ones; this technique can also be used to accelerate the convergence of otherwise convergent iterations.

Gupta, Murli M.↗

NASA NTRS1985

Efficient self-consistent viscous-inviscid solutions for unsteady transonic flow

An improved method is presented for coupling a boundary layer code with an unsteady inviscid transonic computer code in a quasi-steady fashion. At each fixed time step, the boundary layer and inviscid equations are successively solved until the process converges. An explicit coupling of the equations is described which greatly accelerates the convergence process. Computer times for converged viscous-inviscid solutions are about 1.8 times the comparable inviscid values. Comparison of the results obtained with experimental data on three airfoils are presented. These comparisons demonstrate that the explicitly coupled viscous-inviscid solutions can provide efficient predictions of pressure distributions and lift for unsteady two-dimensional transonic flow.

Howlett, J. T.↗

NASA NTRS1985

Efficient self-consistent viscous-inviscid solutions for unsteady transonic flow

An improved method is presented for coupling a boundary layer code with an unsteady inviscid transonic computer code in a quasi-steady fashion. At each fixed time step, the boundary layer and inviscid equations are successively solved until the process converges. An explicit coupling of the equations is described which greatly accelerates the convergence process. Computer times for converged viscous-inviscid solutions are about 1.8 times the comparable inviscid values. Comparison of the results obtained with experimental data on three airfoils are presented. These comparisons demonstrate that the explicitly coupled viscous-inviscid solutions can provide efficient predictions of pressure distributions and lift for unsteady two-dimensional transonic flows.

Howlett, J. T.↗

NASA NTRS1983

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗