Assessment of Linear Finite-Difference Poisson-Boltzmann Solvers

PubMed Central

Wang, Jun; Luo, Ray

2009-01-01

CPU time and memory usage are two vital issues that any numerical solvers for the Poisson-Boltzmann equation have to face in biomolecular applications. In this study we systematically analyzed the CPU time and memory usage of five commonly used finite-difference solvers with a large and diversified set of biomolecular structures. Our comparative analysis shows that modified incomplete Cholesky conjugate gradient and geometric multigrid are the most efficient in the diversified test set. For the two efficient solvers, our test shows that their CPU times increase approximately linearly with the numbers of grids. Their CPU times also increase almost linearly with the negative logarithm of the convergence criterion at very similar rate. Our comparison further shows that geometric multigrid performs better in the large set of tested biomolecules. However, modified incomplete Cholesky conjugate gradient is superior to geometric multigrid in molecular dynamics simulations of tested molecules. We also investigated other significant components in numerical solutions of the Poisson-Boltzmann equation. It turns out that the time-limiting step is the free boundary condition setup for the linear systems for the selected proteins if the electrostatic focusing is not used. Thus, development of future numerical solvers for the Poisson-Boltzmann equation should balance all aspects of the numerical procedures in realistic biomolecular applications. PMID:20063271

An efficient nonlinear finite-difference approach in the computational modeling of the dynamics of a nonlinear diffusion-reaction equation in microbial ecology.

PubMed

Macías-Díaz, J E; Macías, Siegfried; Medina-Ramírez, I E

2013-12-01

In this manuscript, we present a computational model to approximate the solutions of a partial differential equation which describes the growth dynamics of microbial films. The numerical technique reported in this work is an explicit, nonlinear finite-difference methodology which is computationally implemented using Newton's method. Our scheme is compared numerically against an implicit, linear finite-difference discretization of the same partial differential equation, whose computer coding requires an implementation of the stabilized bi-conjugate gradient method. Our numerical results evince that the nonlinear approach results in a more efficient approximation to the solutions of the biofilm model considered, and demands less computer memory. Moreover, the positivity of initial profiles is preserved in the practice by the nonlinear scheme proposed. Copyright © 2013 Elsevier Ltd. All rights reserved.

Development and applications of algorithms for calculating the transonic flow about harmonically oscillating wings

NASA Technical Reports Server (NTRS)

Ehlers, F. E.; Weatherill, W. H.; Yip, E. L.

1984-01-01

A finite difference method to solve the unsteady transonic flow about harmonically oscillating wings was investigated. The procedure is based on separating the velocity potential into steady and unsteady parts and linearizing the resulting unsteady differential equation for small disturbances. The differential equation for the unsteady velocity potential is linear with spatially varying coefficients and with the time variable eliminated by assuming harmonic motion. An alternating direction implicit procedure was investigated, and a pilot program was developed for both two and three dimensional wings. This program provides a relatively efficient relaxation solution without previously encountered solution instability problems. Pressure distributions for two rectangular wings are calculated. Conjugate gradient techniques were developed for the asymmetric, indefinite problem. The conjugate gradient procedure is evaluated for applications to the unsteady transonic problem. Different equations for the alternating direction procedure are derived using a coordinate transformation for swept and tapered wing planforms. Pressure distributions for swept, untaped wings of vanishing thickness are correlated with linear results for sweep angles up to 45 degrees.

A combined finite element-boundary element formulation for solution of two-dimensional problems via CGFFT

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Jin, Jian-Ming; Volakis, John L.

1990-01-01

A method for the computation of electromagnetic scattering from arbitrary two-dimensional bodies is presented. The method combines the finite element and boundary element methods leading to a system for solution via the conjugate gradient Fast Fourier Transform (FFT) algorithm. Two forms of boundaries aimed at reducing the storage requirement of the boundary integral are investigated. It is shown that the boundary integral becomes convolutional when a circular enclosure is chosen, resulting in reduced storage requirement when the system is solved via the conjugate gradient FFT method. The same holds for the ogival enclosure, except that some of the boundary integrals are not convolutional and must be carefully treated to maintain O(N) memory requirement. Results for several circular and ogival structures are presented and shown to be in excellent agreement with those obtained by traditional methods.

Frequency-domain beamformers using conjugate gradient techniques for speech enhancement.

PubMed

Zhao, Shengkui; Jones, Douglas L; Khoo, Suiyang; Man, Zhihong

2014-09-01

A multiple-iteration constrained conjugate gradient (MICCG) algorithm and a single-iteration constrained conjugate gradient (SICCG) algorithm are proposed to realize the widely used frequency-domain minimum-variance-distortionless-response (MVDR) beamformers and the resulting algorithms are applied to speech enhancement. The algorithms are derived based on the Lagrange method and the conjugate gradient techniques. The implementations of the algorithms avoid any form of explicit or implicit autocorrelation matrix inversion. Theoretical analysis establishes formal convergence of the algorithms. Specifically, the MICCG algorithm is developed based on a block adaptation approach and it generates a finite sequence of estimates that converge to the MVDR solution. For limited data records, the estimates of the MICCG algorithm are better than the conventional estimators and equivalent to the auxiliary vector algorithms. The SICCG algorithm is developed based on a continuous adaptation approach with a sample-by-sample updating procedure and the estimates asymptotically converge to the MVDR solution. An illustrative example using synthetic data from a uniform linear array is studied and an evaluation on real data recorded by an acoustic vector sensor array is demonstrated. Performance of the MICCG algorithm and the SICCG algorithm are compared with the state-of-the-art approaches.

MODFLOW-2000, The U.S. Geological Survey Modular Ground-Water Model -- GMG Linear Equation Solver Package Documentation

USGS Publications Warehouse

Wilson, John D.; Naff, Richard L.

2004-01-01

A geometric multigrid solver (GMG), based in the preconditioned conjugate gradient algorithm, has been developed for solving systems of equations resulting from applying the cell-centered finite difference algorithm to flow in porous media. This solver has been adapted to the U.S. Geological Survey ground-water flow model MODFLOW-2000. The documentation herein is a description of the solver and the adaptation to MODFLOW-2000.

A combined finite element-boundary integral formulation for solution of two-dimensional scattering problems via CGFFT. [Conjugate Gradient Fast Fourier Transformation

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Volakis, John L.; Jin, Jian-Ming

1990-01-01

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary-integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principal advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Conjugate gradient determination of optimal plane changes for a class of three-impulse transfers between noncoplanar circular orbits

NASA Technical Reports Server (NTRS)

Burrows, R. R.

1972-01-01

A particular type of three-impulse transfer between two circular orbits is analyzed. The possibility of three plane changes is recognized, and the problem is to optimally distribute these plane changes to minimize the sum of the individual impulses. Numerical difficulties and their solution are discussed. Numerical results obtained from a conjugate gradient technique are presented for both the case where the individual plane changes are unconstrained and for the case where they are constrained. Possibly not unexpectedly, multiple minima are found. The techniques presented could be extended to the finite burn case, but primarily the contents are addressed to preliminary mission design and vehicle sizing.

A feasibility study of a 3-D finite element solution scheme for aeroengine duct acoustics

NASA Technical Reports Server (NTRS)

Abrahamson, A. L.

1980-01-01

The advantage from development of a 3-D model of aeroengine duct acoustics is the ability to analyze axial and circumferential liner segmentation simultaneously. The feasibility of a 3-D duct acoustics model was investigated using Galerkin or least squares element formulations combined with Gaussian elimination, successive over-relaxation, or conjugate gradient solution algorithms on conventional scalar computers and on a vector machine. A least squares element formulation combined with a conjugate gradient solver on a CDC Star vector computer initially appeared to have great promise, but severe difficulties were encountered with matrix ill-conditioning. These difficulties in conditioning rendered this technique impractical for realistic problems.

Gradient-Based Aerodynamic Shape Optimization Using ADI Method for Large-Scale Problems

NASA Technical Reports Server (NTRS)

Pandya, Mohagna J.; Baysal, Oktay

1997-01-01

A gradient-based shape optimization methodology, that is intended for practical three-dimensional aerodynamic applications, has been developed. It is based on the quasi-analytical sensitivities. The flow analysis is rendered by a fully implicit, finite volume formulation of the Euler equations.The aerodynamic sensitivity equation is solved using the alternating-direction-implicit (ADI) algorithm for memory efficiency. A flexible wing geometry model, that is based on surface parameterization and platform schedules, is utilized. The present methodology and its components have been tested via several comparisons. Initially, the flow analysis for for a wing is compared with those obtained using an unfactored, preconditioned conjugate gradient approach (PCG), and an extensively validated CFD code. Then, the sensitivities computed with the present method have been compared with those obtained using the finite-difference and the PCG approaches. Effects of grid refinement and convergence tolerance on the analysis and shape optimization have been explored. Finally the new procedure has been demonstrated in the design of a cranked arrow wing at Mach 2.4. Despite the expected increase in the computational time, the results indicate that shape optimization, which require large numbers of grid points can be resolved with a gradient-based approach.

A new finite element and finite difference hybrid method for computing electrostatics of ionic solvated biomolecule

NASA Astrophysics Data System (ADS)

Ying, Jinyong; Xie, Dexuan

2015-10-01

The Poisson-Boltzmann equation (PBE) is one widely-used implicit solvent continuum model for calculating electrostatics of ionic solvated biomolecule. In this paper, a new finite element and finite difference hybrid method is presented to solve PBE efficiently based on a special seven-overlapped box partition with one central box containing the solute region and surrounded by six neighboring boxes. In particular, an efficient finite element solver is applied to the central box while a fast preconditioned conjugate gradient method using a multigrid V-cycle preconditioning is constructed for solving a system of finite difference equations defined on a uniform mesh of each neighboring box. Moreover, the PBE domain, the box partition, and an interface fitted tetrahedral mesh of the central box can be generated adaptively for a given PQR file of a biomolecule. This new hybrid PBE solver is programmed in C, Fortran, and Python as a software tool for predicting electrostatics of a biomolecule in a symmetric 1:1 ionic solvent. Numerical results on two test models with analytical solutions and 12 proteins validate this new software tool, and demonstrate its high performance in terms of CPU time and memory usage.

Conjugate gradient and cross-correlation based least-square reverse time migration and its application

NASA Astrophysics Data System (ADS)

Sun, Xiao-Dong; Ge, Zhong-Hui; Li, Zhen-Chun

2017-09-01

Although conventional reverse time migration can be perfectly applied to structural imaging it lacks the capability of enabling detailed delineation of a lithological reservoir due to irregular illumination. To obtain reliable reflectivity of the subsurface it is necessary to solve the imaging problem using inversion. The least-square reverse time migration (LSRTM) (also known as linearized reflectivity inversion) aims to obtain relatively high-resolution amplitude preserving imaging by including the inverse of the Hessian matrix. In practice, the conjugate gradient algorithm is proven to be an efficient iterative method for enabling use of LSRTM. The velocity gradient can be derived from a cross-correlation between observed data and simulated data, making LSRTM independent of wavelet signature and thus more robust in practice. Tests on synthetic and marine data show that LSRTM has good potential for use in reservoir description and four-dimensional (4D) seismic images compared to traditional RTM and Fourier finite difference (FFD) migration. This paper investigates the first order approximation of LSRTM, which is also known as the linear Born approximation. However, for more complex geological structures a higher order approximation should be considered to improve imaging quality.

A finite element: Boundary integral method for electromagnetic scattering. Ph.D. Thesis Technical Report, Feb. - Sep. 1992

NASA Technical Reports Server (NTRS)

Collins, J. D.; Volakis, John L.

1992-01-01

A method that combines the finite element and boundary integral techniques for the numerical solution of electromagnetic scattering problems is presented. The finite element method is well known for requiring a low order storage and for its capability to model inhomogeneous structures. Of particular emphasis in this work is the reduction of the storage requirement by terminating the finite element mesh on a boundary in a fashion which renders the boundary integrals in convolutional form. The fast Fourier transform is then used to evaluate these integrals in a conjugate gradient solver, without a need to generate the actual matrix. This method has a marked advantage over traditional integral equation approaches with respect to the storage requirement of highly inhomogeneous structures. Rectangular, circular, and ogival mesh termination boundaries are examined for two-dimensional scattering. In the case of axially symmetric structures, the boundary integral matrix storage is reduced by exploiting matrix symmetries and solving the resulting system via the conjugate gradient method. In each case several results are presented for various scatterers aimed at validating the method and providing an assessment of its capabilities. Important in methods incorporating boundary integral equations is the issue of internal resonance. A method is implemented for their removal, and is shown to be effective in the two-dimensional and three-dimensional applications.

Inversion of Robin coefficient by a spectral stochastic finite element approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jin Bangti; Zou Jun

2008-03-01

This paper investigates a variational approach to the nonlinear stochastic inverse problem of probabilistically calibrating the Robin coefficient from boundary measurements for the steady-state heat conduction. The problem is formulated into an optimization problem, and mathematical properties relevant to its numerical computations are investigated. The spectral stochastic finite element method using polynomial chaos is utilized for the discretization of the optimization problem, and its convergence is analyzed. The nonlinear conjugate gradient method is derived for the optimization system. Numerical results for several two-dimensional problems are presented to illustrate the accuracy and efficiency of the stochastic finite element method.

Use of the preconditioned conjugate gradient algorithm as a generic solver for mixed-model equations in animal breeding applications.

PubMed

Tsuruta, S; Misztal, I; Strandén, I

2001-05-01

Utility of the preconditioned conjugate gradient algorithm with a diagonal preconditioner for solving mixed-model equations in animal breeding applications was evaluated with 16 test problems. The problems included single- and multiple-trait analyses, with data on beef, dairy, and swine ranging from small examples to national data sets. Multiple-trait models considered low and high genetic correlations. Convergence was based on relative differences between left- and right-hand sides. The ordering of equations was fixed effects followed by random effects, with no special ordering within random effects. The preconditioned conjugate gradient program implemented with double precision converged for all models. However, when implemented in single precision, the preconditioned conjugate gradient algorithm did not converge for seven large models. The preconditioned conjugate gradient and successive overrelaxation algorithms were subsequently compared for 13 of the test problems. The preconditioned conjugate gradient algorithm was easy to implement with the iteration on data for general models. However, successive overrelaxation requires specific programming for each set of models. On average, the preconditioned conjugate gradient algorithm converged in three times fewer rounds of iteration than successive overrelaxation. With straightforward implementations, programs using the preconditioned conjugate gradient algorithm may be two or more times faster than those using successive overrelaxation. However, programs using the preconditioned conjugate gradient algorithm would use more memory than would comparable implementations using successive overrelaxation. Extensive optimization of either algorithm can influence rankings. The preconditioned conjugate gradient implemented with iteration on data, a diagonal preconditioner, and in double precision may be the algorithm of choice for solving mixed-model equations when sufficient memory is available and ease of implementation is essential.

A 3D finite-difference BiCG iterative solver with the Fourier-Jacobi preconditioner for the anisotropic EIT/EEG forward problem.

PubMed

Turovets, Sergei; Volkov, Vasily; Zherdetsky, Aleksej; Prakonina, Alena; Malony, Allen D

2014-01-01

The Electrical Impedance Tomography (EIT) and electroencephalography (EEG) forward problems in anisotropic inhomogeneous media like the human head belongs to the class of the three-dimensional boundary value problems for elliptic equations with mixed derivatives. We introduce and explore the performance of several new promising numerical techniques, which seem to be more suitable for solving these problems. The proposed numerical schemes combine the fictitious domain approach together with the finite-difference method and the optimally preconditioned Conjugate Gradient- (CG-) type iterative method for treatment of the discrete model. The numerical scheme includes the standard operations of summation and multiplication of sparse matrices and vector, as well as FFT, making it easy to implement and eligible for the effective parallel implementation. Some typical use cases for the EIT/EEG problems are considered demonstrating high efficiency of the proposed numerical technique.

2.5D complex resistivity modeling and inversion using unstructured grids

NASA Astrophysics Data System (ADS)

Xu, Kaijun; Sun, Jie

2016-04-01

The characteristic of complex resistivity on rock and ore has been recognized by people for a long time. Generally we have used the Cole-Cole Model(CCM) to describe complex resistivity. It has been proved that the electrical anomaly of geologic body can be quantitative estimated by CCM parameters such as direct resistivity(ρ0), chargeability(m), time constant(τ) and frequency dependence(c). Thus it is very important to obtain the complex parameters of geologic body. It is difficult to approximate complex structures and terrain using traditional rectangular grid. In order to enhance the numerical accuracy and rationality of modeling and inversion, we use an adaptive finite-element algorithm for forward modeling of the frequency-domain 2.5D complex resistivity and implement the conjugate gradient algorithm in the inversion of 2.5D complex resistivity. An adaptive finite element method is applied for solving the 2.5D complex resistivity forward modeling of horizontal electric dipole source. First of all, the CCM is introduced into the Maxwell's equations to calculate the complex resistivity electromagnetic fields. Next, the pseudo delta function is used to distribute electric dipole source. Then the electromagnetic fields can be expressed in terms of the primary fields caused by layered structure and the secondary fields caused by inhomogeneities anomalous conductivity. At last, we calculated the electromagnetic fields response of complex geoelectric structures such as anticline, syncline, fault. The modeling results show that adaptive finite-element methods can automatically improve mesh generation and simulate complex geoelectric models using unstructured grids. The 2.5D complex resistivity invertion is implemented based the conjugate gradient algorithm.The conjugate gradient algorithm doesn't need to compute the sensitivity matrix but directly computes the sensitivity matrix or its transpose multiplying vector. In addition, the inversion target zones are segmented with fine grids and the background zones are segmented with big grid, the method can reduce the grid amounts of inversion, it is very helpful to improve the computational efficiency. The inversion results verify the validity and stability of conjugate gradient inversion algorithm. The results of theoretical calculation indicate that the modeling and inversion of 2.5D complex resistivity using unstructured grids are feasible. Using unstructured grids can improve the accuracy of modeling, but the large number of grids inversion is extremely time-consuming, so the parallel computation for the inversion is necessary. Acknowledgments: We thank to the support of the National Natural Science Foundation of China(41304094).

Fast optimal wavefront reconstruction for multi-conjugate adaptive optics using the Fourier domain preconditioned conjugate gradient algorithm.

PubMed

Vogel, Curtis R; Yang, Qiang

2006-08-21

We present two different implementations of the Fourier domain preconditioned conjugate gradient algorithm (FD-PCG) to efficiently solve the large structured linear systems that arise in optimal volume turbulence estimation, or tomography, for multi-conjugate adaptive optics (MCAO). We describe how to deal with several critical technical issues, including the cone coordinate transformation problem and sensor subaperture grid spacing. We also extend the FD-PCG approach to handle the deformable mirror fitting problem for MCAO.

Application of augmented-Lagrangian methods in meteorology: Comparison of different conjugate-gradient codes for large-scale minimization

NASA Technical Reports Server (NTRS)

Navon, I. M.

1984-01-01

A Lagrange multiplier method using techniques developed by Bertsekas (1982) was applied to solving the problem of enforcing simultaneous conservation of the nonlinear integral invariants of the shallow water equations on a limited area domain. This application of nonlinear constrained optimization is of the large dimensional type and the conjugate gradient method was found to be the only computationally viable method for the unconstrained minimization. Several conjugate-gradient codes were tested and compared for increasing accuracy requirements. Robustness and computational efficiency were the principal criteria.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suryanarayana, Phanish, E-mail: phanish.suryanarayana@ce.gatech.edu; Phanish, Deepa

We present an Augmented Lagrangian formulation and its real-space implementation for non-periodic Orbital-Free Density Functional Theory (OF-DFT) calculations. In particular, we rewrite the constrained minimization problem of OF-DFT as a sequence of minimization problems without any constraint, thereby making it amenable to powerful unconstrained optimization algorithms. Further, we develop a parallel implementation of this approach for the Thomas–Fermi–von Weizsacker (TFW) kinetic energy functional in the framework of higher-order finite-differences and the conjugate gradient method. With this implementation, we establish that the Augmented Lagrangian approach is highly competitive compared to the penalty and Lagrange multiplier methods. Additionally, we show that higher-ordermore » finite-differences represent a computationally efficient discretization for performing OF-DFT simulations. Overall, we demonstrate that the proposed formulation and implementation are both efficient and robust by studying selected examples, including systems consisting of thousands of atoms. We validate the accuracy of the computed energies and forces by comparing them with those obtained by existing plane-wave methods.« less

Total variation superiorized conjugate gradient method for image reconstruction

NASA Astrophysics Data System (ADS)

Zibetti, Marcelo V. W.; Lin, Chuan; Herman, Gabor T.

2018-03-01

The conjugate gradient (CG) method is commonly used for the relatively-rapid solution of least squares problems. In image reconstruction, the problem can be ill-posed and also contaminated by noise; due to this, approaches such as regularization should be utilized. Total variation (TV) is a useful regularization penalty, frequently utilized in image reconstruction for generating images with sharp edges. When a non-quadratic norm is selected for regularization, as is the case for TV, then it is no longer possible to use CG. Non-linear CG is an alternative, but it does not share the efficiency that CG shows with least squares and methods such as fast iterative shrinkage-thresholding algorithms (FISTA) are preferred for problems with TV norm. A different approach to including prior information is superiorization. In this paper it is shown that the conjugate gradient method can be superiorized. Five different CG variants are proposed, including preconditioned CG. The CG methods superiorized by the total variation norm are presented and their performance in image reconstruction is demonstrated. It is illustrated that some of the proposed variants of the superiorized CG method can produce reconstructions of superior quality to those produced by FISTA and in less computational time, due to the speed of the original CG for least squares problems. In the Appendix we examine the behavior of one of the superiorized CG methods (we call it S-CG); one of its input parameters is a positive number ɛ. It is proved that, for any given ɛ that is greater than the half-squared-residual for the least squares solution, S-CG terminates in a finite number of steps with an output for which the half-squared-residual is less than or equal to ɛ. Importantly, it is also the case that the output will have a lower value of TV than what would be provided by unsuperiorized CG for the same value ɛ of the half-squared residual.

Convergence Rates of Finite Difference Stochastic Approximation Algorithms

DTIC Science & Technology

2016-06-01

dfferences as gradient approximations. It is shown that the convergence of these algorithms can be accelerated by controlling the implementation of the...descent algorithm, under various updating schemes using finite dfferences as gradient approximations. It is shown that the convergence of these...the Kiefer-Wolfowitz algorithm and the mirror descent algorithm, under various updating schemes using finite differences as gradient approximations. It

A penalized linear and nonlinear combined conjugate gradient method for the reconstruction of fluorescence molecular tomography.

PubMed

Shang, Shang; Bai, Jing; Song, Xiaolei; Wang, Hongkai; Lau, Jaclyn

2007-01-01

Conjugate gradient method is verified to be efficient for nonlinear optimization problems of large-dimension data. In this paper, a penalized linear and nonlinear combined conjugate gradient method for the reconstruction of fluorescence molecular tomography (FMT) is presented. The algorithm combines the linear conjugate gradient method and the nonlinear conjugate gradient method together based on a restart strategy, in order to take advantage of the two kinds of conjugate gradient methods and compensate for the disadvantages. A quadratic penalty method is adopted to gain a nonnegative constraint and reduce the illposedness of the problem. Simulation studies show that the presented algorithm is accurate, stable, and fast. It has a better performance than the conventional conjugate gradient-based reconstruction algorithms. It offers an effective approach to reconstruct fluorochrome information for FMT.

SAGRAD: A Program for Neural Network Training with Simulated Annealing and the Conjugate Gradient Method.

PubMed

Bernal, Javier; Torres-Jimenez, Jose

2015-01-01

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller's algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller's algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller's algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data.

Finite-temperature stress calculations in atomic models using moments of position.

PubMed

Parthasarathy, Ranganathan; Misra, Anil; Ouyang, Lizhi

2018-07-04

Continuum modeling of finite temperature mechanical behavior of atomic systems requires refined description of atomic motions. In this paper, we identify additional kinematical quantities that are relevant for a more accurate continuum description as the system is subjected to step-wise loading. The presented formalism avoids the necessity for atomic trajectory mapping with deformation, provides the definitions of the kinematic variables and their conjugates in real space, and simplifies local work conjugacy. The total work done on an atom under deformation is decomposed into the work corresponding to changing its equilibrium position and work corresponding to changing its second moment about equilibrium position. Correspondingly, we define two kinematic variables: a deformation gradient tensor and a vibration tensor, and derive their stress conjugates, termed here as static and vibration stresses, respectively. The proposed approach is validated using MD simulation in NVT ensembles for fcc aluminum subjected to uniaxial extension. The observed evolution of second moments in the MD simulation with macroscopic deformation is not directly related to the transformation of atomic trajectories through the deformation gradient using generator functions. However, it is noteworthy that deformation leads to a change in the second moment of the trajectories. Correspondingly, the vibration part of the Piola stress becomes particularly significant at high temperature and high tensile strain as the crystal approaches the softening limit. In contrast to the eigenvectors of the deformation gradient, the eigenvectors of the vibration tensor show strong spatial heterogeneity in the vicinity of softening. More importantly, the elliptic distribution of local atomic density transitions to a dumbbell shape, before significant non-affinity in equilibrium positions has occurred.

Finite-temperature stress calculations in atomic models using moments of position

NASA Astrophysics Data System (ADS)

Parthasarathy, Ranganathan; Misra, Anil; Ouyang, Lizhi

2018-07-01

Continuum modeling of finite temperature mechanical behavior of atomic systems requires refined description of atomic motions. In this paper, we identify additional kinematical quantities that are relevant for a more accurate continuum description as the system is subjected to step-wise loading. The presented formalism avoids the necessity for atomic trajectory mapping with deformation, provides the definitions of the kinematic variables and their conjugates in real space, and simplifies local work conjugacy. The total work done on an atom under deformation is decomposed into the work corresponding to changing its equilibrium position and work corresponding to changing its second moment about equilibrium position. Correspondingly, we define two kinematic variables: a deformation gradient tensor and a vibration tensor, and derive their stress conjugates, termed here as static and vibration stresses, respectively. The proposed approach is validated using MD simulation in NVT ensembles for fcc aluminum subjected to uniaxial extension. The observed evolution of second moments in the MD simulation with macroscopic deformation is not directly related to the transformation of atomic trajectories through the deformation gradient using generator functions. However, it is noteworthy that deformation leads to a change in the second moment of the trajectories. Correspondingly, the vibration part of the Piola stress becomes particularly significant at high temperature and high tensile strain as the crystal approaches the softening limit. In contrast to the eigenvectors of the deformation gradient, the eigenvectors of the vibration tensor show strong spatial heterogeneity in the vicinity of softening. More importantly, the elliptic distribution of local atomic density transitions to a dumbbell shape, before significant non-affinity in equilibrium positions has occurred.

Scattering and radiation analysis of three-dimensional cavity arrays via a hybrid finite element method

NASA Technical Reports Server (NTRS)

Jin, Jian-Ming; Volakis, John L.

1992-01-01

A hybrid numerical technique is presented for a characterization of the scattering and radiation properties of three-dimensional cavity arrays recessed in a ground plane. The technique combines the finite element and boundary integral methods and invokes Floquet's representation to formulate a system of equations for the fields at the apertures and those inside the cavities. The system is solved via the conjugate gradient method in conjunction with the Fast Fourier Transform (FFT) thus achieving an O(N) storage requirement. By virtue of the finite element method, the proposed technique is applicable to periodic arrays comprised of cavities having arbitrary shape and filled with inhomogeneous dielectrics. Several numerical results are presented, along with new measured data, which demonstrate the validity, efficiency, and capability of the technique.

Generalized conjugate-gradient methods for the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1991-01-01

A generalized conjugate-gradient method is used to solve the two-dimensional, compressible Navier-Stokes equations of fluid flow. The equations are discretized with an implicit, upwind finite-volume formulation. Preconditioning techniques are incorporated into the new solver to accelerate convergence of the overall iterative method. The superiority of the new solver is demonstrated by comparisons with a conventional line Gauss-Siedel Relaxation solver. Computational test results for transonic flow (trailing edge flow in a transonic turbine cascade) and hypersonic flow (M = 6.0 shock-on-shock phenoena on a cylindrical leading edge) are presented. When applied to the transonic cascade case, the new solver is 4.4 times faster in terms of number of iterations and 3.1 times faster in terms of CPU time than the Relaxation solver. For the hypersonic shock case, the new solver is 3.0 times faster in terms of number of iterations and 2.2 times faster in terms of CPU time than the Relaxation solver.

User's Guide for ENSAERO_FE Parallel Finite Element Solver

NASA Technical Reports Server (NTRS)

Eldred, Lloyd B.; Guruswamy, Guru P.

1999-01-01

A high fidelity parallel static structural analysis capability is created and interfaced to the multidisciplinary analysis package ENSAERO-MPI of Ames Research Center. This new module replaces ENSAERO's lower fidelity simple finite element and modal modules. Full aircraft structures may be more accurately modeled using the new finite element capability. Parallel computation is performed by breaking the full structure into multiple substructures. This approach is conceptually similar to ENSAERO's multizonal fluid analysis capability. The new substructure code is used to solve the structural finite element equations for each substructure in parallel. NASTRANKOSMIC is utilized as a front end for this code. Its full library of elements can be used to create an accurate and realistic aircraft model. It is used to create the stiffness matrices for each substructure. The new parallel code then uses an iterative preconditioned conjugate gradient method to solve the global structural equations for the substructure boundary nodes.

SAGRAD: A Program for Neural Network Training with Simulated Annealing and the Conjugate Gradient Method

PubMed Central

Bernal, Javier; Torres-Jimenez, Jose

2015-01-01

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller’s scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller’s algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller’s algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller’s algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data. PMID:26958442

Least-squares solution of incompressible Navier-Stokes equations with the p-version of finite elements

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Sonnad, Vijay

1991-01-01

A p-version of the least squares finite element method, based on the velocity-pressure-vorticity formulation, is developed for solving steady state incompressible viscous flow problems. The resulting system of symmetric and positive definite linear equations can be solved satisfactorily with the conjugate gradient method. In conjunction with the use of rapid operator application which avoids the formation of either element of global matrices, it is possible to achieve a highly compact and efficient solution scheme for the incompressible Navier-Stokes equations. Numerical results are presented for two-dimensional flow over a backward facing step. The effectiveness of simple outflow boundary conditions is also demonstrated.

Experiments with conjugate gradient algorithms for homotopy curve tracking

NASA Technical Reports Server (NTRS)

Irani, Kashmira M.; Ribbens, Calvin J.; Watson, Layne T.; Kamat, Manohar P.; Walker, Homer F.

1991-01-01

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Double diffusive conjugate heat transfer: Part I

NASA Astrophysics Data System (ADS)

Azeem, Soudagar, Manzoor Elahi M.

2018-05-01

The present work is undertaken to investigate the effect of solid wall being placed at left of square cavity filled with porous medium. The presence of a solid wall in the porous medium turns the situation into a conjugate heat transfer problem. The boundary conditions are such that the left vertical surface is maintained at highest temperature and concentration whereas right vertical surface at lowest temperature and concentration in the medium. The top and bottom surfaces are adiabatic. The additional conduction equation along with the regular momentum and energy equations of porous medium are solved in an iterative manner with the help of finite element method. It is seen that the heat and mass transfer rate is lesser due to smaller thermal and concentration gradients.

Dai-Kou type conjugate gradient methods with a line search only using gradient.

PubMed

Huang, Yuanyuan; Liu, Changhe

2017-01-01

In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical tests and comparisons with the PRP+ conjugate gradient method only using gradient show that the methods are efficient.

Approximate error conjugation gradient minimization methods

DOEpatents

Kallman, Jeffrey S

2013-05-21

In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

Efficient conjugate gradient algorithms for computation of the manipulator forward dynamics

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheid, Robert E.

1989-01-01

The applicability of conjugate gradient algorithms for computation of the manipulator forward dynamics is investigated. The redundancies in the previously proposed conjugate gradient algorithm are analyzed. A new version is developed which, by avoiding these redundancies, achieves a significantly greater efficiency. A preconditioned conjugate gradient algorithm is also presented. A diagonal matrix whose elements are the diagonal elements of the inertia matrix is proposed as the preconditioner. In order to increase the computational efficiency, an algorithm is developed which exploits the synergism between the computation of the diagonal elements of the inertia matrix and that required by the conjugate gradient algorithm.

MHOST: An efficient finite element program for inelastic analysis of solids and structures

NASA Technical Reports Server (NTRS)

Nakazawa, S.

1988-01-01

An efficient finite element program for 3-D inelastic analysis of gas turbine hot section components was constructed and validated. A novel mixed iterative solution strategy is derived from the augmented Hu-Washizu variational principle in order to nodally interpolate coordinates, displacements, deformation, strains, stresses and material properties. A series of increasingly sophisticated material models incorporated in MHOST include elasticity, secant plasticity, infinitesimal and finite deformation plasticity, creep and unified viscoplastic constitutive model proposed by Walker. A library of high performance elements is built into this computer program utilizing the concepts of selective reduced integrations and independent strain interpolations. A family of efficient solution algorithms is implemented in MHOST for linear and nonlinear equation solution including the classical Newton-Raphson, modified, quasi and secant Newton methods with optional line search and the conjugate gradient method.

Electromagnetic characterization of conformal antennas

NASA Technical Reports Server (NTRS)

Volakis, John L.; Kempel, Leo C.; Alexanian, Angelos; Jin, J. M.; Yu, C. L.; Woo, Alex C.

1992-01-01

The ultimate objective of this project is to develop a new technique which permits an accurate simulation of microstrip patch antennas or arrays with various feed, superstrate and/or substrate configurations residing in a recessed cavity whose aperture is planar, cylindrical or otherwise conformed to the substructure. The technique combines the finite element and boundary integral methods to formulate a system suitable for solution via the conjugate gradient method in conjunction with the fast Fourier transform. The final code is intended to compute both scattering and radiation patterns of the structure with an affordable memory demand. With upgraded capabilities, the four included papers examined the radar cross section (RCS), input impedance, gain, and resonant frequency of several rectangular configurations using different loading and substrate/superstrate configurations.

Finite-frequency tomography using adjoint methods-Methodology and examples using membrane surface waves

NASA Astrophysics Data System (ADS)

Tape, Carl; Liu, Qinya; Tromp, Jeroen

2007-03-01

We employ adjoint methods in a series of synthetic seismic tomography experiments to recover surface wave phase-speed models of southern California. Our approach involves computing the Fréchet derivative for tomographic inversions via the interaction between a forward wavefield, propagating from the source to the receivers, and an `adjoint' wavefield, propagating from the receivers back to the source. The forward wavefield is computed using a 2-D spectral-element method (SEM) and a phase-speed model for southern California. A `target' phase-speed model is used to generate the `data' at the receivers. We specify an objective or misfit function that defines a measure of misfit between data and synthetics. For a given receiver, the remaining differences between data and synthetics are time-reversed and used as the source of the adjoint wavefield. For each earthquake, the interaction between the regular and adjoint wavefields is used to construct finite-frequency sensitivity kernels, which we call event kernels. An event kernel may be thought of as a weighted sum of phase-specific (e.g. P) banana-doughnut kernels, with weights determined by the measurements. The overall sensitivity is simply the sum of event kernels, which defines the misfit kernel. The misfit kernel is multiplied by convenient orthonormal basis functions that are embedded in the SEM code, resulting in the gradient of the misfit function, that is, the Fréchet derivative. A non-linear conjugate gradient algorithm is used to iteratively improve the model while reducing the misfit function. We illustrate the construction of the gradient and the minimization algorithm, and consider various tomographic experiments, including source inversions, structural inversions and joint source-structure inversions. Finally, we draw connections between classical Hessian-based tomography and gradient-based adjoint tomography.

Momentum-weighted conjugate gradient descent algorithm for gradient coil optimization.

PubMed

Lu, Hanbing; Jesmanowicz, Andrzej; Li, Shi-Jiang; Hyde, James S

2004-01-01

MRI gradient coil design is a type of nonlinear constrained optimization. A practical problem in transverse gradient coil design using the conjugate gradient descent (CGD) method is that wire elements move at different rates along orthogonal directions (r, phi, z), and tend to cross, breaking the constraints. A momentum-weighted conjugate gradient descent (MW-CGD) method is presented to overcome this problem. This method takes advantage of the efficiency of the CGD method combined with momentum weighting, which is also an intrinsic property of the Levenberg-Marquardt algorithm, to adjust step sizes along the three orthogonal directions. A water-cooled, 12.8 cm inner diameter, three axis torque-balanced gradient coil for rat imaging was developed based on this method, with an efficiency of 2.13, 2.08, and 4.12 mT.m(-1).A(-1) along X, Y, and Z, respectively. Experimental data demonstrate that this method can improve efficiency by 40% and field uniformity by 27%. This method has also been applied to the design of a gradient coil for the human brain, employing remote current return paths. The benefits of this design include improved gradient field uniformity and efficiency, with a shorter length than gradient coil designs using coaxial return paths. Copyright 2003 Wiley-Liss, Inc.

Documentation of a numerical code for the simulation of variable density ground-water flow in three dimensions

USGS Publications Warehouse

Kuiper, L.K.

1985-01-01

A numerical code is documented for the simulation of variable density time dependent groundwater flow in three dimensions. The groundwater density, although variable with distance, is assumed to be constant in time. The Integrated Finite Difference grid elements in the code follow the geologic strata in the modeled area. If appropriate, the determination of hydraulic head in confining beds can be deleted to decrease computation time. The strongly implicit procedure (SIP), successive over-relaxation (SOR), and eight different preconditioned conjugate gradient (PCG) methods are used to solve the approximating equations. The use of the computer program that performs the calculations in the numerical code is emphasized. Detailed instructions are given for using the computer program, including input data formats. An example simulation and the Fortran listing of the program are included. (USGS)

Minimizing inner product data dependencies in conjugate gradient iteration

NASA Technical Reports Server (NTRS)

Vanrosendale, J.

1983-01-01

The amount of concurrency available in conjugate gradient iteration is limited by the summations required in the inner product computations. The inner product of two vectors of length N requires time c log(N), if N or more processors are available. This paper describes an algebraic restructuring of the conjugate gradient algorithm which minimizes data dependencies due to inner product calculations. After an initial start up, the new algorithm can perform a conjugate gradient iteration in time c*log(log(N)).

Optimization of non-linear gradient in hydrophobic interaction chromatography for the analytical characterization of antibody-drug conjugates.

PubMed

Bobály, Balázs; Randazzo, Giuseppe Marco; Rudaz, Serge; Guillarme, Davy; Fekete, Szabolcs

2017-01-20

The goal of this work was to evaluate the potential of non-linear gradients in hydrophobic interaction chromatography (HIC), to improve the separation between the different homologous species (drug-to-antibody, DAR) of commercial antibody-drug conjugates (ADC). The selectivities between Brentuximab Vedotin species were measured using three different gradient profiles, namely linear, power function based and logarithmic ones. The logarithmic gradient provides the most equidistant retention distribution for the DAR species and offers the best overall separation of cysteine linked ADC in HIC. Another important advantage of the logarithmic gradient, is its peak focusing effect for the DAR0 species, which is particularly useful to improve the quantitation limit of DAR0. Finally, the logarithmic behavior of DAR species of ADC in HIC was modelled using two different approaches, based on i) the linear solvent strength theory (LSS) and two scouting linear gradients and ii) a new derived equation and two logarithmic scouting gradients. In both cases, the retention predictions were excellent and systematically below 3% compared to the experimental values. Copyright © 2016 Elsevier B.V. All rights reserved.

An Advanced One-Dimensional Finite Element Model for Incompressible Thermally Expandable Flow

DOE PAGES

Hu, Rui

2017-03-27

Here, this paper provides an overview of a new one-dimensional finite element flow model for incompressible but thermally expandable flow. The flow model was developed for use in system analysis tools for whole-plant safety analysis of sodium fast reactors. Although the pressure-based formulation was implemented, the use of integral equations in the conservative form ensured the conservation laws of the fluid. A stabilization scheme based on streamline-upwind/Petrov-Galerkin and pressure-stabilizing/Petrov-Galerkin formulations is also introduced. The flow model and its implementation have been verified by many test problems, including density wave propagation, steep gradient problems, discharging between tanks, and the conjugate heatmore » transfer in a heat exchanger.« less

An Advanced One-Dimensional Finite Element Model for Incompressible Thermally Expandable Flow

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hu, Rui

Here, this paper provides an overview of a new one-dimensional finite element flow model for incompressible but thermally expandable flow. The flow model was developed for use in system analysis tools for whole-plant safety analysis of sodium fast reactors. Although the pressure-based formulation was implemented, the use of integral equations in the conservative form ensured the conservation laws of the fluid. A stabilization scheme based on streamline-upwind/Petrov-Galerkin and pressure-stabilizing/Petrov-Galerkin formulations is also introduced. The flow model and its implementation have been verified by many test problems, including density wave propagation, steep gradient problems, discharging between tanks, and the conjugate heatmore » transfer in a heat exchanger.« less

Preconditioned conjugate residual methods for the solution of spectral equations

NASA Technical Reports Server (NTRS)

Wong, Y. S.; Zang, T. A.; Hussaini, M. Y.

1986-01-01

Conjugate residual methods for the solution of spectral equations are described. An inexact finite-difference operator is introduced as a preconditioner in the iterative procedures. Application of these techniques is limited to problems for which the symmetric part of the coefficient matrix is positive definite. Although the spectral equation is a very ill-conditioned and full matrix problem, the computational effort of the present iterative methods for solving such a system is comparable to that for the sparse matrix equations obtained from the application of either finite-difference or finite-element methods to the same problems. Numerical experiments are shown for a self-adjoint elliptic partial differential equation with Dirichlet boundary conditions, and comparison with other solution procedures for spectral equations is presented.

A modular finite-element model (MODFE) for areal and axisymmetric ground-water-flow problems, Part 1: Model Description and User's Manual

USGS Publications Warehouse

Torak, L.J.

1993-01-01

A MODular, Finite-Element digital-computer program (MODFE) was developed to simulate steady or unsteady-state, two-dimensional or axisymmetric ground-water flow. Geometric- and hydrologic-aquifer characteristics in two spatial dimensions are represented by triangular finite elements and linear basis functions; one-dimensional finite elements and linear basis functions represent time. Finite-element matrix equations are solved by the direct symmetric-Doolittle method or the iterative modified, incomplete-Cholesky, conjugate-gradient method. Physical processes that can be represented by the model include (1) confined flow, unconfined flow (using the Dupuit approximation), or a combination of both; (2) leakage through either rigid or elastic confining beds; (3) specified recharge or discharge at points, along lines, and over areas; (4) flow across specified-flow, specified-head, or bead-dependent boundaries; (5) decrease of aquifer thickness to zero under extreme water-table decline and increase of aquifer thickness from zero as the water table rises; and (6) head-dependent fluxes from springs, drainage wells, leakage across riverbeds or confining beds combined with aquifer dewatering, and evapotranspiration. The report describes procedures for applying MODFE to ground-water-flow problems, simulation capabilities, and data preparation. Guidelines for designing the finite-element mesh and for node numbering and determining band widths are given. Tables are given that reference simulation capabilities to specific versions of MODFE. Examples of data input and model output for different versions of MODFE are provided.

A modular finite-element model (MODFE) for areal and axisymmetric ground-water-flow problems; Part 1, Model description and user's manual

USGS Publications Warehouse

Torak, Lynn J.

1992-01-01

A MODular, Finite-Element digital-computer program (MODFE) was developed to simulate steady or unsteady-state, two-dimensional or axisymmetric ground-water flow. Geometric- and hydrologic-aquifer characteristics in two spatial dimensions are represented by triangular finite elements and linear basis functions; one-dimensional finite elements and linear basis functions represent time. Finite-element matrix equations are solved by the direct symmetric-Doolittle method or the iterative modified, incomplete-Cholesky, conjugate-gradient method. Physical processes that can be represented by the model include (1) confined flow, unconfined flow (using the Dupuit approximation), or a combination of both; (2) leakage through either rigid or elastic confining beds; (3) specified recharge or discharge at points, along lines, and over areas; (4) flow across specified-flow, specified-head, or head-dependent boundaries; (5) decrease of aquifer thickness to zero under extreme water-table decline and increase of aquifer thickness from zero as the water table rises; and (6) head-dependent fluxes from springs, drainage wells, leakage across riverbeds or confining beds combined with aquifer dewatering, and evapotranspiration.The report describes procedures for applying MODFE to ground-water-flow problems, simulation capabilities, and data preparation. Guidelines for designing the finite-element mesh and for node numbering and determining band widths are given. Tables are given that reference simulation capabilities to specific versions of MODFE. Examples of data input and model output for different versions of MODFE are provided.

A new smoothing modified three-term conjugate gradient method for [Formula: see text]-norm minimization problem.

PubMed

Du, Shouqiang; Chen, Miao

2018-01-01

We consider a kind of nonsmooth optimization problems with [Formula: see text]-norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems. Using smoothing approximate techniques, this kind of nonsmooth optimization problem can be transformed into a general unconstrained optimization problem, which can be solved by the proposed smoothing modified three-term conjugate gradient method. The smoothing modified three-term conjugate gradient method is based on Polak-Ribière-Polyak conjugate gradient method. For the Polak-Ribière-Polyak conjugate gradient method has good numerical properties, the proposed method possesses the sufficient descent property without any line searches, and it is also proved to be globally convergent. Finally, the numerical experiments show the efficiency of the proposed method.

A modular finite-element model (MODFE) for areal and axisymmetric ground-water-flow problems, Part 2: Derivation of finite-element equations and comparisons with analytical solutions

USGS Publications Warehouse

Cooley, Richard L.

1992-01-01

MODFE, a modular finite-element model for simulating steady- or unsteady-state, area1 or axisymmetric flow of ground water in a heterogeneous anisotropic aquifer is documented in a three-part series of reports. In this report, part 2, the finite-element equations are derived by minimizing a functional of the difference between the true and approximate hydraulic head, which produces equations that are equivalent to those obtained by either classical variational or Galerkin techniques. Spatial finite elements are triangular with linear basis functions, and temporal finite elements are one dimensional with linear basis functions. Physical processes that can be represented by the model include (1) confined flow, unconfined flow (using the Dupuit approximation), or a combination of both; (2) leakage through either rigid or elastic confining units; (3) specified recharge or discharge at points, along lines, or areally; (4) flow across specified-flow, specified-head, or head-dependent boundaries; (5) decrease of aquifer thickness to zero under extreme water-table decline and increase of aquifer thickness from zero as the water table rises; and (6) head-dependent fluxes from springs, drainage wells, leakage across riverbeds or confining units combined with aquifer dewatering, and evapotranspiration. The matrix equations produced by the finite-element method are solved by the direct symmetric-Doolittle method or the iterative modified incomplete-Cholesky conjugate-gradient method. The direct method can be efficient for small- to medium-sized problems (less than about 500 nodes), and the iterative method is generally more efficient for larger-sized problems. Comparison of finite-element solutions with analytical solutions for five example problems demonstrates that the finite-element model can yield accurate solutions to ground-water flow problems.

Genetic algorithms for multicriteria shape optimization of induction furnace

NASA Astrophysics Data System (ADS)

Kůs, Pavel; Mach, František; Karban, Pavel; Doležel, Ivo

2012-09-01

In this contribution we deal with a multi-criteria shape optimization of an induction furnace. We want to find shape parameters of the furnace in such a way, that two different criteria are optimized. Since they cannot be optimized simultaneously, instead of one optimum we find set of partially optimal designs, so called Pareto front. We compare two different approaches to the optimization, one using nonlinear conjugate gradient method and second using variation of genetic algorithm. As can be seen from the numerical results, genetic algorithm seems to be the right choice for this problem. Solution of direct problem (coupled problem consisting of magnetic and heat field) is done using our own code Agros2D. It uses finite elements of higher order leading to fast and accurate solution of relatively complicated coupled problem. It also provides advanced scripting support, allowing us to prepare parametric model of the furnace and simply incorporate various types of optimization algorithms.

Acceleration of Linear Finite-Difference Poisson-Boltzmann Methods on Graphics Processing Units.

PubMed

Qi, Ruxi; Botello-Smith, Wesley M; Luo, Ray

2017-07-11

Electrostatic interactions play crucial roles in biophysical processes such as protein folding and molecular recognition. Poisson-Boltzmann equation (PBE)-based models have emerged as widely used in modeling these important processes. Though great efforts have been put into developing efficient PBE numerical models, challenges still remain due to the high dimensionality of typical biomolecular systems. In this study, we implemented and analyzed commonly used linear PBE solvers for the ever-improving graphics processing units (GPU) for biomolecular simulations, including both standard and preconditioned conjugate gradient (CG) solvers with several alternative preconditioners. Our implementation utilizes the standard Nvidia CUDA libraries cuSPARSE, cuBLAS, and CUSP. Extensive tests show that good numerical accuracy can be achieved given that the single precision is often used for numerical applications on GPU platforms. The optimal GPU performance was observed with the Jacobi-preconditioned CG solver, with a significant speedup over standard CG solver on CPU in our diversified test cases. Our analysis further shows that different matrix storage formats also considerably affect the efficiency of different linear PBE solvers on GPU, with the diagonal format best suited for our standard finite-difference linear systems. Further efficiency may be possible with matrix-free operations and integrated grid stencil setup specifically tailored for the banded matrices in PBE-specific linear systems.

A Block Preconditioned Conjugate Gradient-type Iterative Solver for Linear Systems in Thermal Reservoir Simulation

NASA Astrophysics Data System (ADS)

Betté, Srinivas; Diaz, Julio C.; Jines, William R.; Steihaug, Trond

1986-11-01

A preconditioned residual-norm-reducing iterative solver is described. Based on a truncated form of the generalized-conjugate-gradient method for nonsymmetric systems of linear equations, the iterative scheme is very effective for linear systems generated in reservoir simulation of thermal oil recovery processes. As a consequence of employing an adaptive implicit finite-difference scheme to solve the model equations, the number of variables per cell-block varies dynamically over the grid. The data structure allows for 5- and 9-point operators in the areal model, 5-point in the cross-sectional model, and 7- and 11-point operators in the three-dimensional model. Block-diagonal-scaling of the linear system, done prior to iteration, is found to have a significant effect on the rate of convergence. Block-incomplete-LU-decomposition (BILU) and block-symmetric-Gauss-Seidel (BSGS) methods, which result in no fill-in, are used as preconditioning procedures. A full factorization is done on the well terms, and the cells are ordered in a manner which minimizes the fill-in in the well-column due to this factorization. The convergence criterion for the linear (inner) iteration is linked to that of the nonlinear (Newton) iteration, thereby enhancing the efficiency of the computation. The algorithm, with both BILU and BSGS preconditioners, is evaluated in the context of a variety of thermal simulation problems. The solver is robust and can be used with little or no user intervention.

A numerical solution for the diffusion equation in hydrogeologic systems

USGS Publications Warehouse

Ishii, A.L.; Healy, R.W.; Striegl, Robert G.

1989-01-01

The documentation of a computer code for the numerical solution of the linear diffusion equation in one or two dimensions in Cartesian or cylindrical coordinates is presented. Applications of the program include molecular diffusion, heat conduction, and fluid flow in confined systems. The flow media may be anisotropic and heterogeneous. The model is formulated by replacing the continuous linear diffusion equation by discrete finite-difference approximations at each node in a block-centered grid. The resulting matrix equation is solved by the method of preconditioned conjugate gradients. The conjugate gradient method does not require the estimation of iteration parameters and is guaranteed convergent in the absence of rounding error. The matrixes are preconditioned to decrease the steps to convergence. The model allows the specification of any number of boundary conditions for any number of stress periods, and the output of a summary table for selected nodes showing flux and the concentration of the flux quantity for each time step. The model is written in a modular format for ease of modification. The model was verified by comparison of numerical and analytical solutions for cases of molecular diffusion, two-dimensional heat transfer, and axisymmetric radial saturated fluid flow. Application of the model to a hypothetical two-dimensional field situation of gas diffusion in the unsaturated zone is demonstrated. The input and output files are included as a check on program installation. The definition of variables, input requirements, flow chart, and program listing are included in the attachments. (USGS)

Applications of the conjugate gradient FFT method in scattering and radiation including simulations with impedance boundary conditions

NASA Technical Reports Server (NTRS)

Barkeshli, Kasra; Volakis, John L.

1991-01-01

The theoretical and computational aspects related to the application of the Conjugate Gradient FFT (CGFFT) method in computational electromagnetics are examined. The advantages of applying the CGFFT method to a class of large scale scattering and radiation problems are outlined. The main advantages of the method stem from its iterative nature which eliminates a need to form the system matrix (thus reducing the computer memory allocation requirements) and guarantees convergence to the true solution in a finite number of steps. Results are presented for various radiators and scatterers including thin cylindrical dipole antennas, thin conductive and resistive strips and plates, as well as dielectric cylinders. Solutions of integral equations derived on the basis of generalized impedance boundary conditions (GIBC) are also examined. The boundary conditions can be used to replace the profile of a material coating by an impedance sheet or insert, thus, eliminating the need to introduce unknown polarization currents within the volume of the layer. A general full wave analysis of 2-D and 3-D rectangular grooves and cavities is presented which will also serve as a reference for future work.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wannamaker, Philip E.

We have developed an algorithm for the inversion of magnetotelluric (MT) data to a 3D earth resistivity model based upon the finite element method. Hexahedral edge finite elements are implemented to accommodate discontinuities in the electric field across resistivity boundaries, and to accurately simulate topographic variations. All matrices are reduced and solved using direct solution modules which avoids ill-conditioning endemic to iterative solvers such as conjugate gradients, principally PARDISO for the finite element system and PLASMA for the parameter step estimate. Large model parameterizations can be handled by transforming the Gauss-Newton estimator to data-space form. Accuracy of the forward problemmore » and jacobians has been checked by comparison to integral equations results and by limiting asymptotes. Inverse accuracy and performance has been verified against the public Dublin Secret Test Model 2 and the well-known Mount St Helens 3D MT data set. This algorithm we believe is the most capable yet for forming 3D images of earth resistivity structure and their implications for geothermal fluids and pathways.« less

Programming Probabilistic Structural Analysis for Parallel Processing Computer

NASA Technical Reports Server (NTRS)

Sues, Robert H.; Chen, Heh-Chyun; Twisdale, Lawrence A.; Chamis, Christos C.; Murthy, Pappu L. N.

1991-01-01

The ultimate goal of this research program is to make Probabilistic Structural Analysis (PSA) computationally efficient and hence practical for the design environment by achieving large scale parallelism. The paper identifies the multiple levels of parallelism in PSA, identifies methodologies for exploiting this parallelism, describes the development of a parallel stochastic finite element code, and presents results of two example applications. It is demonstrated that speeds within five percent of those theoretically possible can be achieved. A special-purpose numerical technique, the stochastic preconditioned conjugate gradient method, is also presented and demonstrated to be extremely efficient for certain classes of PSA problems.

An historical survey of computational methods in optimal control.

NASA Technical Reports Server (NTRS)

Polak, E.

1973-01-01

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Quantifying the Energy Efficiency of Object Recognition and Optical Flow

DTIC Science & Technology

2014-03-28

other linear solvers, such as conjugate- gradient (CG), preconditioned conjugate-gradient (PCG), and red-black Gauss Seidel (RB). We have also... Seidel , and conjugate gradient solvers. We are interested in the energy it takes to get a given solution quality. In Figure 6, we plot the quality of...in terms of Joules. Conversely, our implementation of red-black Gauss Seidel proves to be very inefficient when we consider Joules instead of just

Modified conjugate gradient method for diagonalizing large matrices.

PubMed

Jie, Quanlin; Liu, Dunhuan

2003-11-01

We present an iterative method to diagonalize large matrices. The basic idea is the same as the conjugate gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroducing errors to the directions of previous gradients. Each iteration step is to find lowest eigenvector of the matrix in a subspace spanned by the current trial vector and the corresponding gradient of the Rayleigh quotient, as well as some previous trial vectors. The gradient, together with the previous trial vectors, play a similar role as the conjugate gradient of the original CG algorithm. Our numeric tests indicate that this method converges significantly faster than the original CG method. And the computational cost of one iteration step is about the same as the original CG method. It is suitable for first principle calculations.

A three-term conjugate gradient method under the strong-Wolfe line search

NASA Astrophysics Data System (ADS)

Khadijah, Wan; Rivaie, Mohd; Mamat, Mustafa

2017-08-01

Recently, numerous studies have been concerned in conjugate gradient methods for solving large-scale unconstrained optimization method. In this paper, a three-term conjugate gradient method is proposed for unconstrained optimization which always satisfies sufficient descent direction and namely as Three-Term Rivaie-Mustafa-Ismail-Leong (TTRMIL). Under standard conditions, TTRMIL method is proved to be globally convergent under strong-Wolfe line search. Finally, numerical results are provided for the purpose of comparison.

Preconditioned conjugate gradient methods for the compressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.

1990-01-01

The compressible Navier-Stokes equations are solved for a variety of two-dimensional inviscid and viscous problems by preconditioned conjugate gradient-like algorithms. Roe's flux difference splitting technique is used to discretize the inviscid fluxes. The viscous terms are discretized by using central differences. An algebraic turbulence model is also incorporated. The system of linear equations which arises out of the linearization of a fully implicit scheme is solved iteratively by the well known methods of GMRES (Generalized Minimum Residual technique) and Chebyschev iteration. Incomplete LU factorization and block diagonal factorization are used as preconditioners. The resulting algorithm is competitive with the best current schemes, but has wide applications in parallel computing and unstructured mesh computations.

Influence of two-dimensional hygrothermal gradients on interlaminar stresses near free edges

NASA Technical Reports Server (NTRS)

Farley, G. L.; Herakovich, C. T.

1977-01-01

Interlaminar stresses are determined for mechanical loading, uniform hygrothermal loading, and gradient moisture loading through implementation of a finite element computer code. Nonuniform two-dimensional hygroscopic gradients are obtained from a finite difference solution of the diffusion equation. It is shown that hygroscopic induced stresses can be larger than those resulting from mechanical and thermal loading, and that the distribution of the interlaminar normal stress may be changed significantly in the presence of a two-dimensional moisture gradient in the boundary layer of a composite laminate.

One-dimensional transient finite difference model of an operational salinity gradient solar pond

NASA Technical Reports Server (NTRS)

Hicks, Michael C.; Golding, Peter

1992-01-01

This paper describes the modeling approach used to simulate the transient behavior of a salinity gradient solar pond. A system of finite difference equations are used to generate the time dependent temperature and salinity profiles within the pond. The stability of the pond, as determined by the capacity of the resulting salinity profile to suppress thermal convection within the primary gradient region of the pond, is continually monitored and when necessary adjustments are made to the thickness of the gradient zone. Results of the model are then compared to measurements taken during two representative seasonal periods at the University of Texas at El Paso's (UTEP's) research solar pond.

Audiomagnetotelluric investigation of Snake Valley, eastern Nevada and western Utah

USGS Publications Warehouse

McPhee, Darcy K.; Pari, Keith; Baird, Frank

2009-01-01

As support for an exploratory well-drilling and hydraulic-testing program, AMT data were collected using a Geometrics Stratagem EH4 system along four profiles that extend roughly east-west from the southern Snake Range into Snake Valley. The profiles range from 3 to 5 kilometers in length, and station spacing was 200 to 400 meters. Two-dimensional inverse models were computed using the data from the transverse-electric (TE), transverse-magnetic (TM), and combined (TE+TM) mode using a conjugate gradient, finite-difference method. Interpretation of the 2-D AMT models defines several faults, some of which may influence ground-water flow in the basins, as well as identify underlying Paleozoic carbonate and clastic rocks and the thickness of basin-fill sediments. These AMT data and models, coupled with the geologic mapping and other surface geophysical methods, form the basis for identifying potential well sites and defining the subsurface structures and stratigraphy within Snake Valley.

High-performance equation solvers and their impact on finite element analysis

NASA Technical Reports Server (NTRS)

Poole, Eugene L.; Knight, Norman F., Jr.; Davis, D. Dale, Jr.

1990-01-01

The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number of operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.

High-performance equation solvers and their impact on finite element analysis

NASA Technical Reports Server (NTRS)

Poole, Eugene L.; Knight, Norman F., Jr.; Davis, D. D., Jr.

1992-01-01

The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number od operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.

The DANTE Boltzmann transport solver: An unstructured mesh, 3-D, spherical harmonics algorithm compatible with parallel computer architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

McGhee, J.M.; Roberts, R.M.; Morel, J.E.

1997-06-01

A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner formore » scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated.« less

A preconditioner for the finite element computation of incompressible, nonlinear elastic deformations

NASA Astrophysics Data System (ADS)

Whiteley, J. P.

2017-10-01

Large, incompressible elastic deformations are governed by a system of nonlinear partial differential equations. The finite element discretisation of these partial differential equations yields a system of nonlinear algebraic equations that are usually solved using Newton's method. On each iteration of Newton's method, a linear system must be solved. We exploit the structure of the Jacobian matrix to propose a preconditioner, comprising two steps. The first step is the solution of a relatively small, symmetric, positive definite linear system using the preconditioned conjugate gradient method. This is followed by a small number of multigrid V-cycles for a larger linear system. Through the use of exemplar elastic deformations, the preconditioner is demonstrated to facilitate the iterative solution of the linear systems arising. The number of GMRES iterations required has only a very weak dependence on the number of degrees of freedom of the linear systems.

A least-squares finite element method for 3D incompressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Hou, Lin-Jun; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Influence of gap states on the nonresonant second hyperpolarizabilities of conjugated organic polymers

NASA Technical Reports Server (NTRS)

Beratan, David N.

1989-01-01

The presence of conjugation and substitution defects introduces gap states in finite polyenes that are shown to influence the size and sign of the second molecular hyperpolarizability (SMH). Using a one-electron tight-binding model, the dependence of SMH on the defect-state occupancy and energy in finite polyenes is calculated. Defects can cause a significant decrease or enhancement of SMH by impeding charge delocalization or by creating partly filled bands (mimicking the one-band limit), respectively. Concomitant sign changes in SMH are predicted. Calculation results suggest strategies for designing molecules that can be either photochemically or electrochemically switched between states with considerably different SMHs.

A comparison of methods for computing the sigma-coordinate pressure gradient force for flow over sloped terrain in a hybrid theta-sigma model

NASA Technical Reports Server (NTRS)

Johnson, D. R.; Uccellini, L. W.

1983-01-01

In connection with the employment of the sigma coordinates introduced by Phillips (1957), problems can arise regarding an accurate finite-difference computation of the pressure gradient force. Over steeply sloped terrain, the calculation of the sigma-coordinate pressure gradient force involves computing the difference between two large terms of opposite sign which results in large truncation error. To reduce the truncation error, several finite-difference methods have been designed and implemented. The present investigation has the objective to provide another method of computing the sigma-coordinate pressure gradient force. Phillips' method is applied for the elimination of a hydrostatic component to a flux formulation. The new technique is compared with four other methods for computing the pressure gradient force. The work is motivated by the desire to use an isentropic and sigma-coordinate hybrid model for experiments designed to study flow near mountainous terrain.

Parallel conjugate gradient algorithms for manipulator dynamic simulation

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheld, Robert E.

1989-01-01

Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

Conjugate-Gradient Neural Networks in Classification of Multisource and Very-High-Dimensional Remote Sensing Data

NASA Technical Reports Server (NTRS)

Benediktsson, J. A.; Swain, P. H.; Ersoy, O. K.

1993-01-01

Application of neural networks to classification of remote sensing data is discussed. Conventional two-layer backpropagation is found to give good results in classification of remote sensing data but is not efficient in training. A more efficient variant, based on conjugate-gradient optimization, is used for classification of multisource remote sensing and geographic data and very-high-dimensional data. The conjugate-gradient neural networks give excellent performance in classification of multisource data, but do not compare as well with statistical methods in classification of very-high-dimentional data.

Optimization of Turbine Engine Cycle Analysis with Analytic Derivatives

NASA Technical Reports Server (NTRS)

Hearn, Tristan; Hendricks, Eric; Chin, Jeffrey; Gray, Justin; Moore, Kenneth T.

2016-01-01

A new engine cycle analysis tool, called Pycycle, was built using the OpenMDAO framework. Pycycle provides analytic derivatives allowing for an efficient use of gradient-based optimization methods on engine cycle models, without requiring the use of finite difference derivative approximation methods. To demonstrate this, a gradient-based design optimization was performed on a turbofan engine model. Results demonstrate very favorable performance compared to an optimization of an identical model using finite-difference approximated derivatives.

A finite element conjugate gradient FFT method for scattering

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Zapp, John; Hsa, Chang-Yu; Volakis, John L.

1990-01-01

An extension of a two dimensional formulation is presented for a three dimensional body of revolution. With the introduction of a Fourier expansion of the vector electric and magnetic fields, a coupled two dimensional system is generated and solved via the finite element method. An exact boundary condition is employed to terminate the mesh and the fast fourier transformation (FFT) is used to evaluate the boundary integrals for low O(n) memory demand when an iterative solution algorithm is used. By virtue of the finite element method, the algorithm is applicable to structures of arbitrary material composition. Several improvements to the two dimensional algorithm are also described. These include: (1) modifications for terminating the mesh at circular boundaries without distorting the convolutionality of the boundary integrals; (2) the development of nonproprietary mesh generation routines for two dimensional applications; (3) the development of preprocessors for interfacing SDRC IDEAS with the main algorithm; and (4) the development of post-processing algorithms based on the public domain package GRAFIC to generate two and three dimensional gray level and color field maps.

Comparison of genetic algorithms with conjugate gradient methods

NASA Technical Reports Server (NTRS)

Bosworth, J. L.; Foo, N. Y.; Zeigler, B. P.

1972-01-01

Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.

Orderings for conjugate gradient preconditionings

NASA Technical Reports Server (NTRS)

Ortega, James M.

1991-01-01

The effect of orderings on the rate of convergence of the conjugate gradient method with SSOR or incomplete Cholesky preconditioning is examined. Some results also are presented that help to explain why red/black ordering gives an inferior rate of convergence.

Large Airborne Full Tensor Gradient Data Inversion Based on a Non-Monotone Gradient Method

NASA Astrophysics Data System (ADS)

Sun, Yong; Meng, Zhaohai; Li, Fengting

2018-03-01

Following the development of gravity gradiometer instrument technology, the full tensor gravity (FTG) data can be acquired on airborne and marine platforms. Large-scale geophysical data can be obtained using these methods, making such data sets a number of the "big data" category. Therefore, a fast and effective inversion method is developed to solve the large-scale FTG data inversion problem. Many algorithms are available to accelerate the FTG data inversion, such as conjugate gradient method. However, the conventional conjugate gradient method takes a long time to complete data processing. Thus, a fast and effective iterative algorithm is necessary to improve the utilization of FTG data. Generally, inversion processing is formulated by incorporating regularizing constraints, followed by the introduction of a non-monotone gradient-descent method to accelerate the convergence rate of FTG data inversion. Compared with the conventional gradient method, the steepest descent gradient algorithm, and the conjugate gradient algorithm, there are clear advantages of the non-monotone iterative gradient-descent algorithm. Simulated and field FTG data were applied to show the application value of this new fast inversion method.

A feasible DY conjugate gradient method for linear equality constraints

NASA Astrophysics Data System (ADS)

LI, Can

2017-09-01

In this paper, we propose a feasible conjugate gradient method for solving linear equality constrained optimization problem. The method is an extension of the Dai-Yuan conjugate gradient method proposed by Dai and Yuan to linear equality constrained optimization problem. It can be applied to solve large linear equality constrained problem due to lower storage requirement. An attractive property of the method is that the generated direction is always feasible and descent direction. Under mild conditions, the global convergence of the proposed method with exact line search is established. Numerical experiments are also given which show the efficiency of the method.

Non-preconditioned conjugate gradient on cell and FPGA based hybrid supercomputer nodes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dubois, David H; Dubois, Andrew J; Boorman, Thomas M

2009-01-01

This work presents a detailed implementation of a double precision, non-preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{sup TM} in conjunction with x86 Opteron{sup TM} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

Non-preconditioned conjugate gradient on cell and FPCA-based hybrid supercomputer nodes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dubois, David H; Dubois, Andrew J; Boorman, Thomas M

2009-03-10

This work presents a detailed implementation of a double precision, Non-Preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{trademark} in conjunction with x86 Opteron{trademark} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

Comparing direct and iterative equation solvers in a large structural analysis software system

NASA Technical Reports Server (NTRS)

Poole, E. L.

1991-01-01

Two direct Choleski equation solvers and two iterative preconditioned conjugate gradient (PCG) equation solvers used in a large structural analysis software system are described. The two direct solvers are implementations of the Choleski method for variable-band matrix storage and sparse matrix storage. The two iterative PCG solvers include the Jacobi conjugate gradient method and an incomplete Choleski conjugate gradient method. The performance of the direct and iterative solvers is compared by solving several representative structural analysis problems. Some key factors affecting the performance of the iterative solvers relative to the direct solvers are identified.

A modified form of conjugate gradient method for unconstrained optimization problems

NASA Astrophysics Data System (ADS)

Ghani, Nur Hamizah Abdul; Rivaie, Mohd.; Mamat, Mustafa

2016-06-01

Conjugate gradient (CG) methods have been recognized as an interesting technique to solve optimization problems, due to the numerical efficiency, simplicity and low memory requirements. In this paper, we propose a new CG method based on the study of Rivaie et al. [7] (Comparative study of conjugate gradient coefficient for unconstrained Optimization, Aus. J. Bas. Appl. Sci. 5(2011) 947-951). Then, we show that our method satisfies sufficient descent condition and converges globally with exact line search. Numerical results show that our proposed method is efficient for given standard test problems, compare to other existing CG methods.

Gradient optimization and nonlinear control

NASA Technical Reports Server (NTRS)

Hasdorff, L.

1976-01-01

The book represents an introduction to computation in control by an iterative, gradient, numerical method, where linearity is not assumed. The general language and approach used are those of elementary functional analysis. The particular gradient method that is emphasized and used is conjugate gradient descent, a well known method exhibiting quadratic convergence while requiring very little more computation than simple steepest descent. Constraints are not dealt with directly, but rather the approach is to introduce them as penalty terms in the criterion. General conjugate gradient descent methods are developed and applied to problems in control.

MODFLOW-2005 : the U.S. Geological Survey modular ground-water model--the ground-water flow process

USGS Publications Warehouse

Harbaugh, Arlen W.

2005-01-01

This report presents MODFLOW-2005, which is a new version of the finite-difference ground-water model commonly called MODFLOW. Ground-water flow is simulated using a block-centered finite-difference approach. Layers can be simulated as confined or unconfined. Flow associated with external stresses, such as wells, areal recharge, evapotranspiration, drains, and rivers, also can be simulated. The report includes detailed explanations of physical and mathematical concepts on which the model is based, an explanation of how those concepts are incorporated in the modular structure of the computer program, instructions for using the model, and details of the computer code. The modular structure consists of a MAIN Program and a series of highly independent subroutines. The subroutines are grouped into 'packages.' Each package deals with a specific feature of the hydrologic system that is to be simulated, such as flow from rivers or flow into drains, or with a specific method of solving the set of simultaneous equations resulting from the finite-difference method. Several solution methods are incorporated, including the Preconditioned Conjugate-Gradient method. The division of the program into packages permits the user to examine specific hydrologic features of the model independently. This also facilitates development of additional capabilities because new packages can be added to the program without modifying the existing packages. The input and output systems of the computer program also are designed to permit maximum flexibility. The program is designed to allow other capabilities, such as transport and optimization, to be incorporated, but this report is limited to describing the ground-water flow capability. The program is written in Fortran 90 and will run without modification on most computers that have a Fortran 90 compiler.

Optimization Based Efficiencies in First Order Reliability Analysis

NASA Technical Reports Server (NTRS)

Peck, Jeffrey A.; Mahadevan, Sankaran

2003-01-01

This paper develops a method for updating the gradient vector of the limit state function in reliability analysis using Broyden's rank one updating technique. In problems that use commercial code as a black box, the gradient calculations are usually done using a finite difference approach, which becomes very expensive for large system models. The proposed method replaces the finite difference gradient calculations in a standard first order reliability method (FORM) with Broyden's Quasi-Newton technique. The resulting algorithm of Broyden updates within a FORM framework (BFORM) is used to run several example problems, and the results compared to standard FORM results. It is found that BFORM typically requires fewer functional evaluations that FORM to converge to the same answer.

Governing equations for electro-conjugate fluid flow

NASA Astrophysics Data System (ADS)

Hosoda, K.; Takemura, K.; Fukagata, K.; Yokota, S.; Edamura, K.

2013-12-01

An electro-conjugation fluid (ECF) is a kind of dielectric liquid, which generates a powerful flow when high DC voltage is applied with tiny electrodes. This study deals with the derivation of the governing equations for electro-conjugate fluid flow based on the Korteweg-Helmholtz (KH) equation which represents the force in dielectric liquid subjected to high DC voltage. The governing equations consist of the Gauss's law, charge conservation with charge recombination, the KH equation, the continuity equation and the incompressible Navier-Stokes equations. The KH equation consists of coulomb force, dielectric constant gradient force and electrostriction force. The governing equation gives the distribution of electric field, charge density and flow velocity. In this study, direct numerical simulation (DNS) is used in order to get these distribution at arbitrary time. Successive over-relaxation (SOR) method is used in analyzing Gauss's law and constrained interpolation pseudo-particle (CIP) method is used in analyzing charge conservation with charge recombination. The third order Runge-Kutta method and conservative second-order-accurate finite difference method is used in analyzing the Navier-Stokes equations with the KH equation. This study also deals with the measurement of ECF ow generated with a symmetrical pole electrodes pair which are made of 0.3 mm diameter piano wire. Working fluid is FF-1EHA2 which is an ECF family. The flow is observed from the both electrodes, i.e., the flow collides in between the electrodes. The governing equation successfully calculates mean flow velocity in between the collector pole electrode and the colliding region by the numerical simulation.

Parallel processors and nonlinear structural dynamics algorithms and software

NASA Technical Reports Server (NTRS)

Belytschko, Ted

1990-01-01

Techniques are discussed for the implementation and improvement of vectorization and concurrency in nonlinear explicit structural finite element codes. In explicit integration methods, the computation of the element internal force vector consumes the bulk of the computer time. The program can be efficiently vectorized by subdividing the elements into blocks and executing all computations in vector mode. The structuring of elements into blocks also provides a convenient way to implement concurrency by creating tasks which can be assigned to available processors for evaluation. The techniques were implemented in a 3-D nonlinear program with one-point quadrature shell elements. Concurrency and vectorization were first implemented in a single time step version of the program. Techniques were developed to minimize processor idle time and to select the optimal vector length. A comparison of run times between the program executed in scalar, serial mode and the fully vectorized code executed concurrently using eight processors shows speed-ups of over 25. Conjugate gradient methods for solving nonlinear algebraic equations are also readily adapted to a parallel environment. A new technique for improving convergence properties of conjugate gradients in nonlinear problems is developed in conjunction with other techniques such as diagonal scaling. A significant reduction in the number of iterations required for convergence is shown for a statically loaded rigid bar suspended by three equally spaced springs.

Conjugate gradient minimisation approach to generating holographic traps for ultracold atoms.

PubMed

Harte, Tiffany; Bruce, Graham D; Keeling, Jonathan; Cassettari, Donatella

2014-11-03

Direct minimisation of a cost function can in principle provide a versatile and highly controllable route to computational hologram generation. Here we show that the careful design of cost functions, combined with numerically efficient conjugate gradient minimisation, establishes a practical method for the generation of holograms for a wide range of target light distributions. This results in a guided optimisation process, with a crucial advantage illustrated by the ability to circumvent optical vortex formation during hologram calculation. We demonstrate the implementation of the conjugate gradient method for both discrete and continuous intensity distributions and discuss its applicability to optical trapping of ultracold atoms.

Conjugate gradient filtering of instantaneous normal modes, saddles on the energy landscape, and diffusion in liquids.

PubMed

Chowdhary, J; Keyes, T

2002-02-01

Instantaneous normal modes (INM's) are calculated during a conjugate-gradient (CG) descent of the potential energy landscape, starting from an equilibrium configuration of a liquid or crystal. A small number (approximately equal to 4) of CG steps removes all the Im-omega modes in the crystal and leaves the liquid with diffusive Im-omega which accurately represent the self-diffusion constant D. Conjugate gradient filtering appears to be a promising method, applicable to any system, of obtaining diffusive modes and facilitating INM theory of D. The relation of the CG-step dependent INM quantities to the landscape and its saddles is discussed.

Conjugate heat and mass transfer in the lattice Boltzmann equation method.

PubMed

Li, Like; Chen, Chen; Mei, Renwei; Klausner, James F

2014-04-01

An interface treatment for conjugate heat and mass transfer in the lattice Boltzmann equation method is proposed based on our previously proposed second-order accurate Dirichlet and Neumann boundary schemes. The continuity of temperature (concentration) and its flux at the interface for heat (mass) transfer is intrinsically satisfied without iterative computations, and the interfacial temperature (concentration) and their fluxes are conveniently obtained from the microscopic distribution functions without finite-difference calculations. The present treatment takes into account the local geometry of the interface so that it can be directly applied to curved interface problems such as conjugate heat and mass transfer in porous media. For straight interfaces or curved interfaces with no tangential gradient, the coupling between the interfacial fluxes along the discrete lattice velocity directions is eliminated and thus the proposed interface schemes can be greatly simplified. Several numerical tests are conducted to verify the applicability and accuracy of the proposed conjugate interface treatment, including (i) steady convection-diffusion in a channel containing two different fluids, (ii) unsteady convection-diffusion in the channel, (iii) steady heat conduction inside a circular domain with two different solid materials, and (iv) unsteady mass transfer from a spherical droplet in an extensional creeping flow. The accuracy and order of convergence of the simulated interior temperature (concentration) field, the interfacial temperature (concentration), and heat (mass) flux are examined in detail and compared with those obtained from the "half-lattice division" treatment in the literature. The present analysis and numerical results show that the half-lattice division scheme is second-order accurate only when the interface is fixed at the center of the lattice links, while the present treatment preserves second-order accuracy for arbitrary link fractions. For curved interfaces, the present treatment yields second-order accurate interior and interfacial temperatures (concentrations) and first-order accurate interfacial heat (mass) flux. An increase of order of convergence by one degree is obtained for each of these three quantities compared with the half-lattice division scheme. The surface-averaged Sherwood numbers computed in test (iv) agree well with published results.

Conjugate heat and mass transfer in the lattice Boltzmann equation method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, LK; Chen, C; Mei, RW

2014-04-22

An interface treatment for conjugate heat and mass transfer in the lattice Boltzmann equation method is proposed based on our previously proposed second-order accurate Dirichlet and Neumann boundary schemes. The continuity of temperature (concentration) and its flux at the interface for heat (mass) transfer is intrinsically satisfied without iterative computations, and the interfacial temperature (concentration) and their fluxes are conveniently obtained from the microscopic distribution functions without finite-difference calculations. The present treatment takes into account the local geometry of the interface so that it can be directly applied to curved interface problems such as conjugate heat and mass transfer inmore » porous media. For straight interfaces or curved interfaces with no tangential gradient, the coupling between the interfacial fluxes along the discrete lattice velocity directions is eliminated and thus the proposed interface schemes can be greatly simplified. Several numerical tests are conducted to verify the applicability and accuracy of the proposed conjugate interface treatment, including (i) steady convection-diffusion in a channel containing two different fluids, (ii) unsteady convection-diffusion in the channel, (iii) steady heat conduction inside a circular domain with two different solid materials, and (iv) unsteady mass transfer from a spherical droplet in an extensional creeping flow. The accuracy and order of convergence of the simulated interior temperature (concentration) field, the interfacial temperature (concentration), and heat (mass) flux are examined in detail and compared with those obtained from the "half-lattice division" treatment in the literature. The present analysis and numerical results show that the half-lattice division scheme is second-order accurate only when the interface is fixed at the center of the lattice links, while the present treatment preserves second-order accuracy for arbitrary link fractions. For curved interfaces, the present treatment yields second-order accurate interior and interfacial temperatures (concentrations) and first-order accurate interfacial heat (mass) flux. An increase of order of convergence by one degree is obtained for each of these three quantities compared with the half-lattice division scheme. The surface-averaged Sherwood numbers computed in test (iv) agree well with published results.« less

Optimization of Turbine Engine Cycle Analysis with Analytic Derivatives

NASA Technical Reports Server (NTRS)

Hearn, Tristan; Hendricks, Eric; Chin, Jeffrey; Gray, Justin; Moore, Kenneth T.

2016-01-01

A new engine cycle analysis tool, called Pycycle, was recently built using the OpenMDAO framework. This tool uses equilibrium chemistry based thermodynamics, and provides analytic derivatives. This allows for stable and efficient use of gradient-based optimization and sensitivity analysis methods on engine cycle models, without requiring the use of finite difference derivative approximation methods. To demonstrate this, a gradient-based design optimization was performed on a multi-point turbofan engine model. Results demonstrate very favorable performance compared to an optimization of an identical model using finite-difference approximated derivatives.

A combined finite element and boundary integral formulation for solution via CGFFT of 2-dimensional scattering problems

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Volakis, John L.

1989-01-01

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principle advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

River suspended sediment estimation by climatic variables implication: Comparative study among soft computing techniques

NASA Astrophysics Data System (ADS)

Kisi, Ozgur; Shiri, Jalal

2012-06-01

Estimating sediment volume carried by a river is an important issue in water resources engineering. This paper compares the accuracy of three different soft computing methods, Artificial Neural Networks (ANNs), Adaptive Neuro-Fuzzy Inference System (ANFIS), and Gene Expression Programming (GEP), in estimating daily suspended sediment concentration on rivers by using hydro-meteorological data. The daily rainfall, streamflow and suspended sediment concentration data from Eel River near Dos Rios, at California, USA are used as a case study. The comparison results indicate that the GEP model performs better than the other models in daily suspended sediment concentration estimation for the particular data sets used in this study. Levenberg-Marquardt, conjugate gradient and gradient descent training algorithms were used for the ANN models. Out of three algorithms, the Conjugate gradient algorithm was found to be better than the others.

Conjugate Gradient Algorithms For Manipulator Simulation

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheid, Robert E.

1991-01-01

Report discusses applicability of conjugate-gradient algorithms to computation of forward dynamics of robotic manipulators. Rapid computation of forward dynamics essential to teleoperation and other advanced robotic applications. Part of continuing effort to find algorithms meeting requirements for increased computational efficiency and speed. Method used for iterative solution of systems of linear equations.

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

NASA Technical Reports Server (NTRS)

Koppenhoefer, Kyle C.; Gullerud, Arne S.; Ruggieri, Claudio; Dodds, Robert H., Jr.; Healy, Brian E.

1998-01-01

This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves vectorization of the code on uni-processor hardware and enables straightforward parallel-vector processing of element blocks on multi-processor hardware.

ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine

NASA Astrophysics Data System (ADS)

Chen, Y.-M.; Koniges, A. E.; Anderson, D. V.

1989-10-01

The biconjugate gradient method (BCG) provides an attractive alternative to the usual conjugate gradient algorithms for the solution of sparse systems of linear equations with nonsymmetric and indefinite matrix operators. A preconditioned algorithm is given, whose form resembles the incomplete L-U conjugate gradient scheme (ILUCG2) previously presented. Although the BCG scheme requires the storage of two additional vectors, it converges in a significantly lesser number of iterations (often half), while the number of calculations per iteration remains essentially the same.

Two-dimensional frequency-domain acoustic full-waveform inversion with rugged topography

NASA Astrophysics Data System (ADS)

Zhang, Qian-Jiang; Dai, Shi-Kun; Chen, Long-Wei; Li, Kun; Zhao, Dong-Dong; Huang, Xing-Xing

2015-09-01

We studied finite-element-method-based two-dimensional frequency-domain acoustic FWI under rugged topography conditions. The exponential attenuation boundary condition suitable for rugged topography is proposed to solve the cutoff boundary problem as well as to consider the requirement of using the same subdivision grid in joint multifrequency inversion. The proposed method introduces the attenuation factor, and by adjusting it, acoustic waves are sufficiently attenuated in the attenuation layer to minimize the cutoff boundary effect. Based on the law of exponential attenuation, expressions for computing the attenuation factor and the thickness of attenuation layers are derived for different frequencies. In multifrequency-domain FWI, the conjugate gradient method is used to solve equations in the Gauss-Newton algorithm and thus minimize the computation cost in calculating the Hessian matrix. In addition, the effect of initial model selection and frequency combination on FWI is analyzed. Examples using numerical simulations and FWI calculations are used to verify the efficiency of the proposed method.

Navier-Stokes dynamics on a differential one-form

NASA Astrophysics Data System (ADS)

Story, Troy L.

2006-11-01

After transforming the Navier-Stokes dynamic equation into a characteristic differential one-form on an odd-dimensional differentiable manifold, exterior calculus is used to construct a pair of differential equations and tangent vector(vortex vector) characteristic of Hamiltonian geometry. A solution to the Navier-Stokes dynamic equation is then obtained by solving this pair of equations for the position x^k and the conjugate to the position bk as functions of time. The solution bk is shown to be divergence-free by contracting the differential 3-form corresponding to the divergence of the gradient of the velocity with a triple of tangent vectors, implying constraints on two of the tangent vectors for the system. Analysis of the solution bk shows it is bounded since it remains finite as | x^k | ->,, and is physically reasonable since the square of the gradient of the principal function is bounded. By contracting the characteristic differential one-form with the vortex vector, the Lagrangian is obtained.

Nonlinear transient analysis by energy minimization: A theoretical basis for the ACTION computer code. [predicting the response of a lightweight aircraft during a crash

NASA Technical Reports Server (NTRS)

Kamat, M. P.

1980-01-01

The formulation basis for establishing the static or dynamic equilibrium configurations of finite element models of structures which may behave in the nonlinear range are provided. With both geometric and time independent material nonlinearities included, the development is restricted to simple one and two dimensional finite elements which are regarded as being the basic elements for modeling full aircraft-like structures under crash conditions. Representations of a rigid link and an impenetrable contact plane are added to the deformation model so that any number of nodes of the finite element model may be connected by a rigid link or may contact the plane. Equilibrium configurations are derived as the stationary conditions of a potential function of the generalized nodal variables of the model. Minimization of the nonlinear potential function is achieved by using the best current variable metric update formula for use in unconstrained minimization. Powell's conjugate gradient algorithm, which offers very low storage requirements at some slight increase in the total number of calculations, is the other alternative algorithm to be used for extremely large scale problems.

Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches

NASA Astrophysics Data System (ADS)

Ghani, N. H. A.; Mohamed, N. S.; Zull, N.; Shoid, S.; Rivaie, M.; Mamat, M.

2017-09-01

Conjugate gradient (CG) method is one of iterative techniques prominently used in solving unconstrained optimization problems due to its simplicity, low memory storage, and good convergence analysis. This paper presents a new hybrid conjugate gradient method, named NRM1 method. The method is analyzed under the exact and inexact line searches in given conditions. Theoretically, proofs show that the NRM1 method satisfies the sufficient descent condition with both line searches. The computational result indicates that NRM1 method is capable in solving the standard unconstrained optimization problems used. On the other hand, the NRM1 method performs better under inexact line search compared with exact line search.

Efficient method to design RF pulses for parallel excitation MRI using gridding and conjugate gradient

PubMed Central

Feng, Shuo

2014-01-01

Parallel excitation (pTx) techniques with multiple transmit channels have been widely used in high field MRI imaging to shorten the RF pulse duration and/or reduce the specific absorption rate (SAR). However, the efficiency of pulse design still needs substantial improvement for practical real-time applications. In this paper, we present a detailed description of a fast pulse design method with Fourier domain gridding and a conjugate gradient method. Simulation results of the proposed method show that the proposed method can design pTx pulses at an efficiency 10 times higher than that of the conventional conjugate-gradient based method, without reducing the accuracy of the desirable excitation patterns. PMID:24834420

Efficient method to design RF pulses for parallel excitation MRI using gridding and conjugate gradient.

PubMed

Feng, Shuo; Ji, Jim

2014-04-01

Parallel excitation (pTx) techniques with multiple transmit channels have been widely used in high field MRI imaging to shorten the RF pulse duration and/or reduce the specific absorption rate (SAR). However, the efficiency of pulse design still needs substantial improvement for practical real-time applications. In this paper, we present a detailed description of a fast pulse design method with Fourier domain gridding and a conjugate gradient method. Simulation results of the proposed method show that the proposed method can design pTx pulses at an efficiency 10 times higher than that of the conventional conjugate-gradient based method, without reducing the accuracy of the desirable excitation patterns.

Algorithms for parallel and vector computations

NASA Technical Reports Server (NTRS)

Ortega, James M.

1995-01-01

This is a final report on work performed under NASA grant NAG-1-1112-FOP during the period March, 1990 through February 1995. Four major topics are covered: (1) solution of nonlinear poisson-type equations; (2) parallel reduced system conjugate gradient method; (3) orderings for conjugate gradient preconditioners, and (4) SOR as a preconditioner.

Solving large test-day models by iteration on data and preconditioned conjugate gradient.

PubMed

Lidauer, M; Strandén, I; Mäntysaari, E A; Pösö, J; Kettunen, A

1999-12-01

A preconditioned conjugate gradient method was implemented into an iteration on a program for data estimation of breeding values, and its convergence characteristics were studied. An algorithm was used as a reference in which one fixed effect was solved by Gauss-Seidel method, and other effects were solved by a second-order Jacobi method. Implementation of the preconditioned conjugate gradient required storing four vectors (size equal to number of unknowns in the mixed model equations) in random access memory and reading the data at each round of iteration. The preconditioner comprised diagonal blocks of the coefficient matrix. Comparison of algorithms was based on solutions of mixed model equations obtained by a single-trait animal model and a single-trait, random regression test-day model. Data sets for both models used milk yield records of primiparous Finnish dairy cows. Animal model data comprised 665,629 lactation milk yields and random regression test-day model data of 6,732,765 test-day milk yields. Both models included pedigree information of 1,099,622 animals. The animal model ¿random regression test-day model¿ required 122 ¿305¿ rounds of iteration to converge with the reference algorithm, but only 88 ¿149¿ were required with the preconditioned conjugate gradient. To solve the random regression test-day model with the preconditioned conjugate gradient required 237 megabytes of random access memory and took 14% of the computation time needed by the reference algorithm.

HYDROCARBON SPILL EXPOSURE ASSESSMENT MODELING

EPA Science Inventory

Hydrocarbon spills impact drinking water supplies at down gradient locations. onventional finite difference and finite element models of multiphase, multicomponent flow have extreme requirements for both computer time and site data. ite data and the intent of the modeling often d...

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

NASA Technical Reports Server (NTRS)

Freund, Roland

1989-01-01

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Conjugate-Gradient Algorithms For Dynamics Of Manipulators

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheid, Robert E.

1993-01-01

Algorithms for serial and parallel computation of forward dynamics of multiple-link robotic manipulators by conjugate-gradient method developed. Parallel algorithms have potential for speedup of computations on multiple linked, specialized processors implemented in very-large-scale integrated circuits. Such processors used to stimulate dynamics, possibly faster than in real time, for purposes of planning and control.

Three-dimensional forward modeling of DC resistivity using the aggregation-based algebraic multigrid method

NASA Astrophysics Data System (ADS)

Chen, Hui; Deng, Ju-Zhi; Yin, Min; Yin, Chang-Chun; Tang, Wen-Wu

2017-03-01

To speed up three-dimensional (3D) DC resistivity modeling, we present a new multigrid method, the aggregation-based algebraic multigrid method (AGMG). We first discretize the differential equation of the secondary potential field with mixed boundary conditions by using a seven-point finite-difference method to obtain a large sparse system of linear equations. Then, we introduce the theory behind the pairwise aggregation algorithms for AGMG and use the conjugate-gradient method with the V-cycle AGMG preconditioner (AGMG-CG) to solve the linear equations. We use typical geoelectrical models to test the proposed AGMG-CG method and compare the results with analytical solutions and the 3DDCXH algorithm for 3D DC modeling (3DDCXH). In addition, we apply the AGMG-CG method to different grid sizes and geoelectrical models and compare it to different iterative methods, such as ILU-BICGSTAB, ILU-GCR, and SSOR-CG. The AGMG-CG method yields nearly linearly decreasing errors, whereas the number of iterations increases slowly with increasing grid size. The AGMG-CG method is precise and converges fast, and thus can improve the computational efficiency in forward modeling of three-dimensional DC resistivity.

Conjugate gradient heat bath for ill-conditioned actions.

PubMed

Ceriotti, Michele; Bussi, Giovanni; Parrinello, Michele

2007-08-01

We present a method for performing sampling from a Boltzmann distribution of an ill-conditioned quadratic action. This method is based on heat-bath thermalization along a set of conjugate directions, generated via a conjugate-gradient procedure. The resulting scheme outperforms local updates for matrices with very high condition number, since it avoids the slowing down of modes with lower eigenvalue, and has some advantages over the global heat-bath approach, compared to which it is more stable and allows for more freedom in devising case-specific optimizations.

Joint design of large-tip-angle parallel RF pulses and blipped gradient trajectories.

PubMed

Cao, Zhipeng; Donahue, Manus J; Ma, Jun; Grissom, William A

2016-03-01

To design multichannel large-tip-angle kT-points and spokes radiofrequency (RF) pulses and gradient waveforms for transmit field inhomogeneity compensation in high field magnetic resonance imaging. An algorithm to design RF subpulse weights and gradient blip areas is proposed to minimize a magnitude least-squares cost function that measures the difference between realized and desired state parameters in the spin domain, and penalizes integrated RF power. The minimization problem is solved iteratively with interleaved target phase updates, RF subpulse weights updates using the conjugate gradient method with optimal control-based derivatives, and gradient blip area updates using the conjugate gradient method. Two-channel parallel transmit simulations and experiments were conducted in phantoms and human subjects at 7 T to demonstrate the method and compare it to small-tip-angle-designed pulses and circularly polarized excitations. The proposed algorithm designed more homogeneous and accurate 180° inversion and refocusing pulses than other methods. It also designed large-tip-angle pulses on multiple frequency bands with independent and joint phase relaxation. Pulses designed by the method improved specificity and contrast-to-noise ratio in a finger-tapping spin echo blood oxygen level dependent functional magnetic resonance imaging study, compared with circularly polarized mode refocusing. A joint RF and gradient waveform design algorithm was proposed and validated to improve large-tip-angle inversion and refocusing at ultrahigh field. © 2015 Wiley Periodicals, Inc.

Deconvolution of astronomical images using SOR with adaptive relaxation.

PubMed

Vorontsov, S V; Strakhov, V N; Jefferies, S M; Borelli, K J

2011-07-04

We address the potential performance of the successive overrelaxation technique (SOR) in image deconvolution, focusing our attention on the restoration of astronomical images distorted by atmospheric turbulence. SOR is the classical Gauss-Seidel iteration, supplemented with relaxation. As indicated by earlier work, the convergence properties of SOR, and its ultimate performance in the deconvolution of blurred and noisy images, can be made competitive to other iterative techniques, including conjugate gradients, by a proper choice of the relaxation parameter. The question of how to choose the relaxation parameter, however, remained open, and in the practical work one had to rely on experimentation. In this paper, using constructive (rather than exact) arguments, we suggest a simple strategy for choosing the relaxation parameter and for updating its value in consecutive iterations to optimize the performance of the SOR algorithm (and its positivity-constrained version, +SOR) at finite iteration counts. We suggest an extension of the algorithm to the notoriously difficult problem of "blind" deconvolution, where both the true object and the point-spread function have to be recovered from the blurred image. We report the results of numerical inversions with artificial and real data, where the algorithm is compared with techniques based on conjugate gradients. In all of our experiments +SOR provides the highest quality results. In addition +SOR is found to be able to detect moderately small changes in the true object between separate data frames: an important quality for multi-frame blind deconvolution where stationarity of the object is a necesessity.

Preconditioned conjugate-gradient methods for low-speed flow calculations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1993-01-01

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Preconditioned Conjugate Gradient methods for low speed flow calculations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1993-01-01

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations are integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and the convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the lower-upper (L-U)-successive symmetric over-relaxation iterative scheme is more efficient than a preconditioner based on incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional line Gauss-Seidel relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

HFEM3D

DOE Office of Scientific and Technical Information (OSTI.GOV)

Weiss, Chester J

Software solves the three-dimensional Poisson equation div(k(grad(u)) = f, by the finite element method for the case when material properties, k, are distributed over hierarchy of edges, facets and tetrahedra in the finite element mesh. Method is described in Weiss, CJ, Finite element analysis for model parameters distributed on a hierarchy of geometric simplices, Geophysics, v82, E155-167, doi:10.1190/GEO2017-0058.1 (2017). A standard finite element method for solving Poisson’s equation is augmented by including in the 3D stiffness matrix additional 2D and 1D stiffness matrices representing the contributions from material properties associated with mesh faces and edges, respectively. The resulting linear systemmore » is solved iteratively using the conjugate gradient method with Jacobi preconditioning. To minimize computer storage for program execution, the linear solver computes matrix-vector contractions element-by-element over the mesh, without explicit storage of the global stiffness matrix. Program output vtk compliant for visualization and rendering by 3rd party software. Program uses dynamic memory allocation and as such there are no hard limits on problem size outside of those imposed by the operating system and configuration on which the software is run. Dimension, N, of the finite element solution vector is constrained by the the addressable space in 32-vs-64 bit operating systems. Total storage requirements for the problem. Total working space required for the program is approximately 13*N double precision words.« less

An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package

NASA Astrophysics Data System (ADS)

Oppe, Thomas C.; Joubert, Wayne D.; Kincaid, David R.

1989-05-01

The most recent research-oriented software package developed as part of the ITPACK Project is called "NSPCG" since it contains many nonsymmetric preconditioned conjugate gradient procedures. It is designed to solve large sparse systems of linear algebraic equations by a variety of different iterative methods. One of the main purposes for the development of the package is to provide a common modular structure for research on iterative methods for nonsymmetric matrices. Another purpose for the development of the package is to investigate the suitability of several iterative methods for vector computers. Since the vectorizability of an iterative method depends greatly on the matrix structure, NSPCG allows great flexibility in the operator representation. The coefficient matrix can be passed in one of several different matrix data storage schemes. These sparse data formats allow matrices with a wide range of structures from highly structured ones such as those with all nonzeros along a relatively small number of diagonals to completely unstructured sparse matrices. Alternatively, the package allows the user to call the accelerators directly with user-supplied routines for performing certain matrix operations. In this case, one can use the data format from an application program and not be required to copy the matrix into one of the package formats. This is particularly advantageous when memory space is limited. Some of the basic preconditioners that are available are point methods such as Jacobi, Incomplete LU Decomposition and Symmetric Successive Overrelaxation as well as block and multicolor preconditioners. The user can select from a large collection of accelerators such as Conjugate Gradient (CG), Chebyshev (SI, for semi-iterative), Generalized Minimal Residual (GMRES), Biconjugate Gradient Squared (BCGS) and many others. The package is modular so that almost any accelerator can be used with almost any preconditioner.

Generating multiplex gradients of biomolecules for controlling cellular adhesion in parallel microfluidic channels.

PubMed

Didar, Tohid Fatanat; Tabrizian, Maryam

2012-11-07

Here we present a microfluidic platform to generate multiplex gradients of biomolecules within parallel microfluidic channels, in which a range of multiplex concentration gradients with different profile shapes are simultaneously produced. Nonlinear polynomial gradients were also generated using this device. The gradient generation principle is based on implementing parrallel channels with each providing a different hydrodynamic resistance. The generated biomolecule gradients were then covalently functionalized onto the microchannel surfaces. Surface gradients along the channel width were a result of covalent attachments of biomolecules to the surface, which remained functional under high shear stresses (50 dyn/cm(2)). An IgG antibody conjugated to three different fluorescence dyes (FITC, Cy5 and Cy3) was used to demonstrate the resulting multiplex concentration gradients of biomolecules. The device enabled generation of gradients with up to three different biomolecules in each channel with varying concentration profiles. We were also able to produce 2-dimensional gradients in which biomolecules were distributed along the length and width of the channel. To demonstrate the applicability of the developed design, three different multiplex concentration gradients of REDV and KRSR peptides were patterned along the width of three parallel channels and adhesion of primary human umbilical vein endothelial cell (HUVEC) in each channel was subsequently investigated using a single chip.

Application of 'steady' state finite element and transient finite difference theory to sound propagation in a variable duct - A comparison with experiment

NASA Technical Reports Server (NTRS)

Baumeister, K. J.; Eversman, W.; Astley, R. J.; White, J. W.

1981-01-01

Experimental data are presented for sound propagation in a simulated infinite hard wall duct with a large change in duct cross sectional area. The data are conveniently tabulated for further use. The 'steady' state finite element theory of Astley and Eversman (1981) and the transient finite difference theory of White (1981) are in good agreement with the data for both the axial and transverse pressure profiles and the axial phase angle. Therefore, numerical finite difference and finite element theories appear to be ideally suited for handling duct propagation problems which encounter large axial gradients in acoustic parameters. The measured energy reflection coefficient agrees with the values from the Astley-Eversman modal coupling model.

Phase-space finite elements in a least-squares solution of the transport equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Drumm, C.; Fan, W.; Pautz, S.

2013-07-01

The linear Boltzmann transport equation is solved using a least-squares finite element approximation in the space, angular and energy phase-space variables. The method is applied to both neutral particle transport and also to charged particle transport in the presence of an electric field, where the angular and energy derivative terms are handled with the energy/angular finite elements approximation, in a manner analogous to the way the spatial streaming term is handled. For multi-dimensional problems, a novel approach is used for the angular finite elements: mapping the surface of a unit sphere to a two-dimensional planar region and using a meshingmore » tool to generate a mesh. In this manner, much of the spatial finite-elements machinery can be easily adapted to handle the angular variable. The energy variable and the angular variable for one-dimensional problems make use of edge/beam elements, also building upon the spatial finite elements capabilities. The methods described here can make use of either continuous or discontinuous finite elements in space, angle and/or energy, with the use of continuous finite elements resulting in a smaller problem size and the use of discontinuous finite elements resulting in more accurate solutions for certain types of problems. The work described in this paper makes use of continuous finite elements, so that the resulting linear system is symmetric positive definite and can be solved with a highly efficient parallel preconditioned conjugate gradients algorithm. The phase-space finite elements capability has been built into the Sceptre code and applied to several test problems, including a simple one-dimensional problem with an analytic solution available, a two-dimensional problem with an isolated source term, showing how the method essentially eliminates ray effects encountered with discrete ordinates, and a simple one-dimensional charged-particle transport problem in the presence of an electric field. (authors)« less

Moving force identification based on modified preconditioned conjugate gradient method

NASA Astrophysics Data System (ADS)

Chen, Zhen; Chan, Tommy H. T.; Nguyen, Andy

2018-06-01

This paper develops a modified preconditioned conjugate gradient (M-PCG) method for moving force identification (MFI) by improving the conjugate gradient (CG) and preconditioned conjugate gradient (PCG) methods with a modified Gram-Schmidt algorithm. The method aims to obtain more accurate and more efficient identification results from the responses of bridge deck caused by vehicles passing by, which are known to be sensitive to ill-posed problems that exist in the inverse problem. A simply supported beam model with biaxial time-varying forces is used to generate numerical simulations with various analysis scenarios to assess the effectiveness of the method. Evaluation results show that regularization matrix L and number of iterations j are very important influence factors to identification accuracy and noise immunity of M-PCG. Compared with the conventional counterpart SVD embedded in the time domain method (TDM) and the standard form of CG, the M-PCG with proper regularization matrix has many advantages such as better adaptability and more robust to ill-posed problems. More importantly, it is shown that the average optimal numbers of iterations of M-PCG can be reduced by more than 70% compared with PCG and this apparently makes M-PCG a preferred choice for field MFI applications.

Thermoelastic response of metal matrix composites with large-diameter fibers subjected to thermal gradients

NASA Technical Reports Server (NTRS)

Aboudi, Jacob; Pindera, Marek-Jerzy; Arnold, Steven M.

1993-01-01

A new micromechanical theory is presented for the response of heterogeneous metal matrix composites subjected to thermal gradients. In contrast to existing micromechanical theories that utilize classical homogenization schemes in the course of calculating microscopic and macroscopic field quantities, in the present approach the actual microstructural details are explicitly coupled with the macrostructure of the composite. Examples are offered that illustrate limitations of the classical homogenization approach in predicting the response of thin-walled metal matrix composites with large-diameter fibers when subjected to thermal gradients. These examples include composites with a finite number of fibers in the thickness direction that may be uniformly or nonuniformly spaced, thus admitting so-called functionally gradient composites. The results illustrate that the classical approach of decoupling micromechanical and macromechanical analyses in the presence of a finite number of large-diameter fibers, finite dimensions of the composite, and temperature gradient may produce excessively conservative estimates for macroscopic field quantities, while both underestimating and overestimating the local fluctuations of the microscopic quantities in different regions of the composite. Also demonstrated is the usefulness of the present approach in generating favorable stress distributions in the presence of thermal gradients by appropriately tailoring the internal microstructure details of the composite.

Gradient corrections to the exchange-correlation free energy

DOE PAGES

Sjostrom, Travis; Daligault, Jerome

2014-10-07

We develop the first-order gradient correction to the exchange-correlation free energy of the homogeneous electron gas for use in finite-temperature density functional calculations. Based on this, we propose and implement a simple temperature-dependent extension for functionals beyond the local density approximation. These finite-temperature functionals show improvement over zero-temperature functionals, as compared to path-integral Monte Carlo calculations for deuterium equations of state, and perform without computational cost increase compared to zero-temperature functionals and so should be used for finite-temperature calculations. Furthermore, while the present functionals are valid at all temperatures including zero, non-negligible difference with zero-temperature functionals begins at temperatures abovemore » 10 000 K.« less

Conjugate gradient based projection - A new explicit methodology for frictional contact

NASA Technical Reports Server (NTRS)

Tamma, Kumar K.; Li, Maocheng; Sha, Desong

1993-01-01

With special attention towards the applicability to parallel computation or vectorization, a new and effective explicit approach for linear complementary formulations involving a conjugate gradient based projection methodology is proposed in this study for contact problems with Coulomb friction. The overall objectives are focussed towards providing an explicit methodology of computation for the complete contact problem with friction. In this regard, the primary idea for solving the linear complementary formulations stems from an established search direction which is projected to a feasible region determined by the non-negative constraint condition; this direction is then applied to the Fletcher-Reeves conjugate gradient method resulting in a powerful explicit methodology which possesses high accuracy, excellent convergence characteristics, fast computational speed and is relatively simple to implement for contact problems involving Coulomb friction.

Tools for Designing and Analyzing Structures

NASA Technical Reports Server (NTRS)

Luz, Paul L.

2005-01-01

Structural Design and Analysis Toolset is a collection of approximately 26 Microsoft Excel spreadsheet programs, each of which performs calculations within a different subdiscipline of structural design and analysis. These programs present input and output data in user-friendly, menu-driven formats. Although these programs cannot solve complex cases like those treated by larger finite element codes, these programs do yield quick solutions to numerous common problems more rapidly than the finite element codes, thereby making it possible to quickly perform multiple preliminary analyses - e.g., to establish approximate limits prior to detailed analyses by the larger finite element codes. These programs perform different types of calculations, as follows: 1. determination of geometric properties for a variety of standard structural components; 2. analysis of static, vibrational, and thermal- gradient loads and deflections in certain structures (mostly beams and, in the case of thermal-gradients, mirrors); 3. kinetic energies of fans; 4. detailed analysis of stress and buckling in beams, plates, columns, and a variety of shell structures; and 5. temperature dependent properties of materials, including figures of merit that characterize strength, stiffness, and deformation response to thermal gradients

Correlation of simulation/finite element analysis to the separation of intrinsically magnetic spores and red blood cells using a microfluidic magnetic deposition system.

PubMed

Sun, Jianxin; Moore, Lee; Xue, Wei; Kim, James; Zborowski, Maciej; Chalmers, Jeffrey J

2018-05-01

Magnetic separation of cells has been, and continues to be, widely used in a variety of applications, ranging from healthcare diagnostics to detection of food contamination. Typically, these technologies require cells labeled with antibody magnetic particle conjugate and a high magnetic energy gradient created in the flow containing the labeled cells (i.e., a column packed with magnetically inducible material), or dense packing of magnetic particles next to the flow cell. Such designs, while creating high magnetic energy gradients, are not amenable to easy, highly detailed, mathematic characterization. Our laboratories have been characterizing and developing analysis and separation technology that can be used on intrinsically magnetic cells or spores which are typically orders of magnitude weaker than typically immunomagnetically labeled cells. One such separation system is magnetic deposition microscopy (MDM) which not only separates cells, but deposits them in specific locations on slides for further microscopic analysis. In this study, the MDM system has been further characterized, using finite element and computational fluid mechanics software, and separation performance predicted, using a model which combines: 1) the distribution of the intrinsic magnetophoretic mobility of the cells (spores); 2) the fluid flow within the separation device; and 3) accurate maps of the values of the magnetic field (max 2.27 T), and magnetic energy gradient (max of 4.41 T 2 /mm) within the system. Guided by this model, experimental studies indicated that greater than 95% of the intrinsically magnetic Bacillus spores can be separated with the MDM system. Further, this model allows analysis of cell trajectories which can assist in the design of higher throughput systems. © 2018 Wiley Periodicals, Inc.

Improving Maritime Domain Awareness Using Neural Networks for Target of Interest Classification

DTIC Science & Technology

2015-03-01

spreading SCG scaled conjugate gradient xv THIS PAGE INTENTIONALLY LEFT BLANK xvi EXECUTIVE SUMMARY The research detailed in this thesis is a...algorithms were explored for training the neural networks: resilient backpropagation (RP) and scaled conjugate gradient backpropagation ( SCG ). The...results of the neural network training performance are presented using mean squared error convergence plots. In all implementations, the SCG learning

Numerical investigation of electron localization in polymer chains

NASA Astrophysics Data System (ADS)

Paulsson, Magnus; Stafström, Sven

1998-01-01

Using finite-size scaling, we have calculated the localization-delocalization phase diagrams for electronic wave functions in different disordered polymeric systems. The disorder considered here simulates finite polymer chain lengths, breaks in the conjugation, and disorder in an external potential. It is shown that a system of interacting chains, even at rather weak interchain interactions, allows for enough flexibility for the scattered waves to avoid dephasing and localization. Localization and the metal-insulator transition in highly conducting polymers are discussed in view of these results.

Marine Controlled-Source Electromagnetic 2D Inversion for synthetic models.

NASA Astrophysics Data System (ADS)

Liu, Y.; Li, Y.

2016-12-01

We present a 2D inverse algorithm for frequency domain marine controlled-source electromagnetic (CSEM) data, which is based on the regularized Gauss-Newton approach. As a forward solver, our parallel adaptive finite element forward modeling program is employed. It is a self-adaptive, goal-oriented grid refinement algorithm in which a finite element analysis is performed on a sequence of refined meshes. The mesh refinement process is guided by a dual error estimate weighting to bias refinement towards elements that affect the solution at the EM receiver locations. With the use of the direct solver (MUMPS), we can effectively compute the electromagnetic fields for multi-sources and parametric sensitivities. We also implement the parallel data domain decomposition approach of Key and Ovall (2011), with the goal of being able to compute accurate responses in parallel for complicated models and a full suite of data parameters typical of offshore CSEM surveys. All minimizations are carried out by using the Gauss-Newton algorithm and model perturbations at each iteration step are obtained by using the Inexact Conjugate Gradient iteration method. Synthetic test inversions are presented.

Optimization of the sources in local hyperthermia using a combined finite element-genetic algorithm method.

PubMed

Siauve, N; Nicolas, L; Vollaire, C; Marchal, C

2004-12-01

This article describes an optimization process specially designed for local and regional hyperthermia in order to achieve the desired specific absorption rate in the patient. It is based on a genetic algorithm coupled to a finite element formulation. The optimization method is applied to real human organs meshes assembled from computerized tomography scans. A 3D finite element formulation is used to calculate the electromagnetic field in the patient, achieved by radiofrequency or microwave sources. Space discretization is performed using incomplete first order edge elements. The sparse complex symmetric matrix equation is solved using a conjugate gradient solver with potential projection pre-conditionning. The formulation is validated by comparison of calculated specific absorption rate distributions in a phantom to temperature measurements. A genetic algorithm is used to optimize the specific absorption rate distribution to predict the phases and amplitudes of the sources leading to the best focalization. The objective function is defined as the specific absorption rate ratio in the tumour and healthy tissues. Several constraints, regarding the specific absorption rate in tumour and the total power in the patient, may be prescribed. Results obtained with two types of applicators (waveguides and annular phased array) are presented and show the faculties of the developed optimization process.

Imperfect coupling between northern and southern ionospheres: asymmetry in TEC anomalies before earthquakes

NASA Astrophysics Data System (ADS)

Jhuang, Hau-Kun; Ho, Yi-Ying; Lee, Lou-Chuang

2016-04-01

The northern ionosphere is coupled to the conjugate southern ionosphere through the highly conducting geomagenetic field lines. The coupling is very strong or "perfect" if the geomagnetic field lines are equipotential (the parallel electric field E||=0) and hence the perpendicular electric field (E⊥) at the conjugate sites of both ionospheres are equal. The coupling is "imperfect" if some of the geomagnetic field lines are non-equipotential (E||≠0). The field-aligned electric field E|| can be associated with electron inertia, pressure gradient and collisions appearing in the form of double layer, kinetic Alfvén waves and finite field-aligned conductivity σ||. We use the Global Ionospheric Maps (GIM) data to examine the conjugate effect of total electron content (TEC) for six significant earthquakes. The anomalous (ΔTEC)source in the source ionosphere and (ΔTEC)conjugate in the conjugate ionosphere are obtained for 85 events before the six earthquakes. The ΔTEC ratio β = (ΔTEC)conjugate / (ΔTEC)source is calculated for each anomaly. For a "perfect" coupling, β=1. There are 85 anomalous events before the six significant earthquakes, with 62 events occurring in the daytime (07-18 LT) and 23 events in the nighttime (19-06 LT). The average value of daytime (07-18 LT) TEC variations in the source ionosphere is |ΔTEC|source =20.13 TECu, while the average value in the nighttime (19-06 LT) ionosphere is |ΔTEC|source=14.43 TECu. The value of ΔTEC ratio β ranges from 0.05 (very weak coupling) to 0.98 (nearly perfect coupling) with an average of 0.52. There are 14 strong coupling cases with β ≥0.8, which take place from 11 LT to 19 LT. The daytime (07-18 LT) β average value is 0.57 and the nighttime (19-06 LT) β average is 0.37. The south-north ionosphere coupling is stronger (weaker) in the daytime (nighttime).

Nested Conjugate Gradient Algorithm with Nested Preconditioning for Non-linear Image Restoration.

PubMed

Skariah, Deepak G; Arigovindan, Muthuvel

2017-06-19

We develop a novel optimization algorithm, which we call Nested Non-Linear Conjugate Gradient algorithm (NNCG), for image restoration based on quadratic data fitting and smooth non-quadratic regularization. The algorithm is constructed as a nesting of two conjugate gradient (CG) iterations. The outer iteration is constructed as a preconditioned non-linear CG algorithm; the preconditioning is performed by the inner CG iteration that is linear. The inner CG iteration, which performs preconditioning for outer CG iteration, itself is accelerated by an another FFT based non-iterative preconditioner. We prove that the method converges to a stationary point for both convex and non-convex regularization functionals. We demonstrate experimentally that proposed method outperforms the well-known majorization-minimization method used for convex regularization, and a non-convex inertial-proximal method for non-convex regularization functional.

Realization of preconditioned Lanczos and conjugate gradient algorithms on optical linear algebra processors.

PubMed

Ghosh, A

1988-08-01

Lanczos and conjugate gradient algorithms are important in computational linear algebra. In this paper, a parallel pipelined realization of these algorithms on a ring of optical linear algebra processors is described. The flow of data is designed to minimize the idle times of the optical multiprocessor and the redundancy of computations. The effects of optical round-off errors on the solutions obtained by the optical Lanczos and conjugate gradient algorithms are analyzed, and it is shown that optical preconditioning can improve the accuracy of these algorithms substantially. Algorithms for optical preconditioning and results of numerical experiments on solving linear systems of equations arising from partial differential equations are discussed. Since the Lanczos algorithm is used mostly with sparse matrices, a folded storage scheme to represent sparse matrices on spatial light modulators is also described.

The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization.

PubMed

Yuan, Gonglin; Sheng, Zhou; Liu, Wenjie

2016-01-01

In this paper, the Hager and Zhang (HZ) conjugate gradient (CG) method and the modified HZ (MHZ) CG method are presented for large-scale nonsmooth convex minimization. Under some mild conditions, convergent results of the proposed methods are established. Numerical results show that the presented methods can be better efficiency for large-scale nonsmooth problems, and several problems are tested (with the maximum dimensions to 100,000 variables).

ONRASIA Scientific Information Bulletin. Volume 8, Number 3, July- September 1993

DTIC Science & Technology

1993-09-01

the Ninth Symposium on Preconditioned Conjugate Dr. Steven F. Ashby Gradient Methods , which he organized. Computing Sciences Department Computing...ditioned Conjugate Gradient Methods , held at Keio chines and is currently a topic of considerable University (Yokohama). During this meeting, I interest...in the United States. In Japan, on the other discussed iterative methods for linear systems with hand, this technique does not appear to be too well

Parallel Conjugate Gradient: Effects of Ordering Strategies, Programming Paradigms, and Architectural Platforms

NASA Technical Reports Server (NTRS)

Oliker, Leonid; Heber, Gerd; Biswas, Rupak

2000-01-01

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV) usually accounts for most of the floating-point operations within a CG iteration. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and SPMV using different programming paradigms and architectures. Results show that for this class of applications, ordering significantly improves overall performance, that cache reuse may be more important than reducing communication, and that it is possible to achieve message passing performance using shared memory constructs through careful data ordering and distribution. However, a multi-threaded implementation of CG on the Tera MTA does not require special ordering or partitioning to obtain high efficiency and scalability.

Trajectory optimization for an asymmetric launch vehicle. M.S. Thesis - MIT

NASA Technical Reports Server (NTRS)

Sullivan, Jeanne Marie

1990-01-01

A numerical optimization technique is used to fully automate the trajectory design process for an symmetric configuration of the proposed Advanced Launch System (ALS). The objective of the ALS trajectory design process is the maximization of the vehicle mass when it reaches the desired orbit. The trajectories used were based on a simple shape that could be described by a small set of parameters. The use of a simple trajectory model can significantly reduce the computation time required for trajectory optimization. A predictive simulation was developed to determine the on-orbit mass given an initial vehicle state, wind information, and a set of trajectory parameters. This simulation utilizes an idealized control system to speed computation by increasing the integration time step. The conjugate gradient method is used for the numerical optimization of on-orbit mass. The method requires only the evaluation of the on-orbit mass function using the predictive simulation, and the gradient of the on-orbit mass function with respect to the trajectory parameters. The gradient is approximated with finite differencing. Prelaunch trajectory designs were carried out using the optimization procedure. The predictive simulation is used in flight to redesign the trajectory to account for trajectory deviations produced by off-nominal conditions, e.g., stronger than expected head winds.

Comparison of some optimal control methods for the design of turbine blades

NASA Technical Reports Server (NTRS)

Desilva, B. M. E.; Grant, G. N. C.

1977-01-01

This paper attempts a comparative study of some numerical methods for the optimal control design of turbine blades whose vibration characteristics are approximated by Timoshenko beam idealizations with shear and incorporating simple boundary conditions. The blade was synthesized using the following methods: (1) conjugate gradient minimization of the system Hamiltonian in function space incorporating penalty function transformations, (2) projection operator methods in a function space which includes the frequencies of vibration and the control function, (3) epsilon-technique penalty function transformation resulting in a highly nonlinear programming problem, (4) finite difference discretization of the state equations again resulting in a nonlinear program, (5) second variation methods with complex state differential equations to include damping effects resulting in systems of inhomogeneous matrix Riccatti equations some of which are stiff, (6) quasi-linear methods based on iterative linearization of the state and adjoint equation. The paper includes a discussion of some substantial computational difficulties encountered in the implementation of these techniques together with a resume of work presently in progress using a differential dynamic programming approach.

Domain decomposition methods for the parallel computation of reacting flows

NASA Technical Reports Server (NTRS)

Keyes, David E.

1988-01-01

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Missing value imputation in DNA microarrays based on conjugate gradient method.

PubMed

Dorri, Fatemeh; Azmi, Paeiz; Dorri, Faezeh

2012-02-01

Analysis of gene expression profiles needs a complete matrix of gene array values; consequently, imputation methods have been suggested. In this paper, an algorithm that is based on conjugate gradient (CG) method is proposed to estimate missing values. k-nearest neighbors of the missed entry are first selected based on absolute values of their Pearson correlation coefficient. Then a subset of genes among the k-nearest neighbors is labeled as the best similar ones. CG algorithm with this subset as its input is then used to estimate the missing values. Our proposed CG based algorithm (CGimpute) is evaluated on different data sets. The results are compared with sequential local least squares (SLLSimpute), Bayesian principle component analysis (BPCAimpute), local least squares imputation (LLSimpute), iterated local least squares imputation (ILLSimpute) and adaptive k-nearest neighbors imputation (KNNKimpute) methods. The average of normalized root mean squares error (NRMSE) and relative NRMSE in different data sets with various missing rates shows CGimpute outperforms other methods. Copyright © 2011 Elsevier Ltd. All rights reserved.

Gradients estimation from random points with volumetric tensor in turbulence

NASA Astrophysics Data System (ADS)

Watanabe, Tomoaki; Nagata, Koji

2017-12-01

We present an estimation method of fully-resolved/coarse-grained gradients from randomly distributed points in turbulence. The method is based on a linear approximation of spatial gradients expressed with the volumetric tensor, which is a 3 × 3 matrix determined by a geometric distribution of the points. The coarse grained gradient can be considered as a low pass filtered gradient, whose cutoff is estimated with the eigenvalues of the volumetric tensor. The present method, the volumetric tensor approximation, is tested for velocity and passive scalar gradients in incompressible planar jet and mixing layer. Comparison with a finite difference approximation on a Cartesian grid shows that the volumetric tensor approximation computes the coarse grained gradients fairly well at a moderate computational cost under various conditions of spatial distributions of points. We also show that imposing the solenoidal condition improves the accuracy of the present method for solenoidal vectors, such as a velocity vector in incompressible flows, especially when the number of the points is not large. The volumetric tensor approximation with 4 points poorly estimates the gradient because of anisotropic distribution of the points. Increasing the number of points from 4 significantly improves the accuracy. Although the coarse grained gradient changes with the cutoff length, the volumetric tensor approximation yields the coarse grained gradient whose magnitude is close to the one obtained by the finite difference. We also show that the velocity gradient estimated with the present method well captures the turbulence characteristics such as local flow topology, amplification of enstrophy and strain, and energy transfer across scales.

Exciton intrachain transport induced by interchain packing configurations in conjugated polymers.

PubMed

Meng, Ruixuan; Gao, Kun; Zhang, Gaiyan; Han, Shixuan; Yang, Fujiang; Li, Yuan; Xie, Shijie

2015-07-28

Based on a tight binding model combined with a nonadiabatic dynamics approach, we theoretically investigate the exciton intrachain transport in conjugated polymers with different interchain packing configurations. We construct two different interchain packing configurations, i.e. linear and exponential forms, and simulate the dynamical processes of the exciton transport in these systems. We find that, in both cases, there exists a distribution of driving force for exciton transport, which stems from the gradient of the exciton creation energy along the chains. This finding enriches the picture of exciton transport in polymers and provides a new idea to improve the exciton transport length in polymeric photovoltaic devices.

A family of conjugate gradient methods for large-scale nonlinear equations.

PubMed

Feng, Dexiang; Sun, Min; Wang, Xueyong

2017-01-01

In this paper, we present a family of conjugate gradient projection methods for solving large-scale nonlinear equations. At each iteration, it needs low storage and the subproblem can be easily solved. Compared with the existing solution methods for solving the problem, its global convergence is established without the restriction of the Lipschitz continuity on the underlying mapping. Preliminary numerical results are reported to show the efficiency of the proposed method.

High-performance conjugate-gradient benchmark: A new metric for ranking high-performance computing systems

DOE PAGES

Dongarra, Jack; Heroux, Michael A.; Luszczek, Piotr

2015-08-17

Here, we describe a new high-performance conjugate-gradient (HPCG) benchmark. HPCG is composed of computations and data-access patterns commonly found in scientific applications. HPCG strives for a better correlation to existing codes from the computational science domain and to be representative of their performance. Furthermore, HPCG is meant to help drive the computer system design and implementation in directions that will better impact future performance improvement.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

PubMed

Yuan, Gonglin; Duan, Xiabin; Liu, Wenjie; Wang, Xiaoliang; Cui, Zengru; Sheng, Zhou

2015-01-01

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1) βk ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models

PubMed Central

Yuan, Gonglin; Duan, Xiabin; Liu, Wenjie; Wang, Xiaoliang; Cui, Zengru; Sheng, Zhou

2015-01-01

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1)β k ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations. PMID:26502409

Two variants of minimum discarded fill ordering

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Azevedo, E.F.; Forsyth, P.A.; Tang, Wei-Pai

1991-01-01

It is well known that the ordering of the unknowns can have a significant effect on the convergence of Preconditioned Conjugate Gradient (PCG) methods. There has been considerable experimental work on the effects of ordering for regular finite difference problems. In many cases, good results have been obtained with preconditioners based on diagonal, spiral or natural row orderings. However, for finite element problems having unstructured grids or grids generated by a local refinement approach, it is difficult to define many of the orderings for more regular problems. A recently proposed Minimum Discarded Fill (MDF) ordering technique is effective in findingmore » high quality Incomplete LU (ILU) preconditioners, especially for problems arising from unstructured finite element grids. Testing indicates this algorithm can identify a rather complicated physical structure in an anisotropic problem and orders the unknowns in the preferred'' direction. The MDF technique may be viewed as the numerical analogue of the minimum deficiency algorithm in sparse matrix technology. At any stage of the partial elimination, the MDF technique chooses the next pivot node so as to minimize the amount of discarded fill. In this work, two efficient variants of the MDF technique are explored to produce cost-effective high-order ILU preconditioners. The Threshold MDF orderings combine MDF ideas with drop tolerance techniques to identify the sparsity pattern in the ILU preconditioners. These techniques identify an ordering that encourages fast decay of the entries in the ILU factorization. The Minimum Update Matrix (MUM) ordering technique is a simplification of the MDF ordering and is closely related to the minimum degree algorithm. The MUM ordering is especially for large problems arising from Navier-Stokes problems. Some interesting pictures of the orderings are presented using a visualization tool. 22 refs., 4 figs., 7 tabs.« less

A fast finite-difference algorithm for topology optimization of permanent magnets

NASA Astrophysics Data System (ADS)

Abert, Claas; Huber, Christian; Bruckner, Florian; Vogler, Christoph; Wautischer, Gregor; Suess, Dieter

2017-09-01

We present a finite-difference method for the topology optimization of permanent magnets that is based on the fast-Fourier-transform (FFT) accelerated computation of the stray-field. The presented method employs the density approach for topology optimization and uses an adjoint method for the gradient computation. Comparison to various state-of-the-art finite-element implementations shows a superior performance and accuracy. Moreover, the presented method is very flexible and easy to implement due to various preexisting FFT stray-field implementations that can be used.

Particle-in-a-box model of exciton absorption and electroabsorption in conjugated polymers

NASA Astrophysics Data System (ADS)

Pedersen, Thomas G.

2000-12-01

The recently proposed particle-in-a-box model of one-dimensional excitons in conjugated polymers is applied in calculations of optical absorption and electroabsorption spectra. It is demonstrated that for polymers of long conjugation length a superposition of single exciton resonances produces a line shape characterized by a square-root singularity in agreement with experimental spectra near the absorption edge. The effects of finite conjugation length on both absorption and electroabsorption spectra are analyzed.

Nonlocal gradient corrections to the exchange free energy of an inhomogeneous many-fermion system at finite temperature

NASA Astrophysics Data System (ADS)

Geldart, D. J. W.; Dunlap, E.; Glasser, M. L.; Shegelski, Mark R. A.

1993-10-01

A general exact result is derived for the coefficient B x( n; T) which determines the first gradient correction to the leading exchange contribution to the free energy at finite temperature of a weakly inhomogeneous extended many fermion system having arbitrary two-body interactions. Explicit analytical results are given in the case of bare Coulomb interactions, and the case of statically screened Coulomb interactions is studied numerically. It is shown that nonanalytical structure leads to different limiting values of B x( n; T) when the inverse screening length and the temperature are both small. Some implications for physical many-electron systems are discussed, including the reasons for discrepancies between the first principles and semiempirical gradient coefficients for atomic exchange energies.

Preconditioned conjugate gradient technique for the analysis of symmetric anisotropic structures

NASA Technical Reports Server (NTRS)

Noor, Ahmed K.; Peters, Jeanne M.

1987-01-01

An efficient preconditioned conjugate gradient (PCG) technique and a computational procedure are presented for the analysis of symmetric anisotropic structures. The technique is based on selecting the preconditioning matrix as the orthotropic part of the global stiffness matrix of the structure, with all the nonorthotropic terms set equal to zero. This particular choice of the preconditioning matrix results in reducing the size of the analysis model of the anisotropic structure to that of the corresponding orthotropic structure. The similarities between the proposed PCG technique and a reduction technique previously presented by the authors are identified and exploited to generate from the PCG technique direct measures for the sensitivity of the different response quantities to the nonorthotropic (anisotropic) material coefficients of the structure. The effectiveness of the PCG technique is demonstrated by means of a numerical example of an anisotropic cylindrical panel.

Rapid and accurate reversed-phase high-performance liquid chromatographic determination of conjugated bile acids in human bile for routine clinical applications. Therapeutic control during gallstone dissolution therapy.

PubMed

Swobodnik, W; Klüppelberg, U; Wechsler, J G; Volz, M; Normandin, G; Ditschuneit, H

1985-05-03

This paper introduces a new method to detect the taurine and glycine conjugates of five different bile acids (cholic acid, deoxycholic acid, chenodeoxycholic acid, ursodeoxycholic acid and lithocholic acid) in human bile. Advantages of this method are sufficient separation of compounds within a short period of time and a high rate of reproducibility. Using a mobile phase gradient of acetonitrile and water, modified with tetrabutylammonium hydrogen sulphate (0.0075 mol/l), we were able to maximize the differentiation between ursodeoxycholic acid and lithocholic acid, which is of primary interest during conservative gallstone dissolution therapy. Use of this gradient reduced analysis time to less than 0.5 h. Recovery rates for this modified method ranged from 94% to 100%, and reproducibility was 98%, sufficient for routine clinical applications.

Experimental study of stochastic noise propagation in SPECT images reconstructed using the conjugate gradient algorithm.

PubMed

Mariano-Goulart, D; Fourcade, M; Bernon, J L; Rossi, M; Zanca, M

2003-01-01

Thanks to an experimental study based on simulated and physical phantoms, the propagation of the stochastic noise in slices reconstructed using the conjugate gradient algorithm has been analysed versus iterations. After a first increase corresponding to the reconstruction of the signal, the noise stabilises before increasing linearly with iterations. The level of the plateau as well as the slope of the subsequent linear increase depends on the noise in the projection data.

Conjugate gradient optimization programs for shuttle reentry

NASA Technical Reports Server (NTRS)

Powers, W. F.; Jacobson, R. A.; Leonard, D. A.

1972-01-01

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search

NASA Astrophysics Data System (ADS)

Ghani, Nur Hamizah Abdul; Mamat, Mustafa; Rivaie, Mohd

2017-08-01

Conjugate gradient (CG) method is an important technique in unconstrained optimization, due to its effectiveness and low memory requirements. The focus of this paper is to introduce a new CG method for solving large scale unconstrained optimization. Theoretical proofs show that the new method fulfills sufficient descent condition if strong Wolfe-Powell inexact line search is used. Besides, computational results show that our proposed method outperforms to other existing CG methods.

Mechanical Properties of Porous, High Temperature Structural Materials: Sources of Toughness in Reaction Bonded Silicon Nitride.

DTIC Science & Technology

1995-10-15

tensile extension. At each level of externally imposed displacements, internal equilibrium was achieved by a conjugate gradient method of energy...indentation cracks viewed by TEM. This could be due to either weaker grain boundaries or due to grain level internal stresses of misfit. The fact... internally using the conjugate gradient method until the overall elastic strain energy function 4 was minimized for a unit level of border displacement which

NASCAP user's manual

NASA Technical Reports Server (NTRS)

Mandell, M. J.; Harvey, J. M.; Katz, I.

1977-01-01

The NASCAP (NASA Charging Analyzer Program) code simulates the charging process for a complex object in either tenuous plasma or ground test environment. Detailed specifications needed to run the code are presented. The object definition section, OBJDEF, allows the test object to be easily defined in the cubic mesh. The test object is composed of conducting sections which may be wholly or partially covered with thin dielectric coatings. The potential section, POTENT, obtains the electrostatic potential in the space surrounding the object. It uses the conjugate gradient method to solve the finite element formulation of Poisson's equation. The CHARGE section of NASCAP treats charge redistribution among the surface cells of the object as well as charging through radiation bombardment. NASCAP has facilities for extensive graphical output, including several types of object display plots, potential contour plots, space charge density contour plots, current density plots, and particle trajectory plots.

Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cai, Yunfeng, E-mail: yfcai@math.pku.edu.cn; Department of Computer Science, University of California, Davis 95616; Bai, Zhaojun, E-mail: bai@cs.ucdavis.edu

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 blockmore » preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.« less

3-D geoelectrical modelling using finite-difference: a new boundary conditions improvement

NASA Astrophysics Data System (ADS)

Maineult, A.; Schott, J.-J.; Ardiot, A.

2003-04-01

Geoelectrical prospecting is a well-known and frequently used method for quantitative and non-destructive subsurface exploration until depths of a few hundreds metres. Thus archeological objects can be efficiently detected as their resistivities often contrast with those of the surrounding media. Nevertheless using the geoelectrical prospecting method has long been restricted due to inhability to model correctly arbitrarily-shaped structures. The one-dimensional modelling and inversion have long been classical, but are of no interest for the majority of field data, since the natural distribution of resistivity is rarely homogeneous or tabular. Since the 1970's some authors developed discrete methods in order to solve the two and three-dimensional problem, using mathematical tools such as finite-element or finite-difference. The finite-difference approach is quite simple, easily understandable and programmable. Since the work of Dey and Morrison (1979), this approach has become quite popular. Nevertheless, one of its major drawbacks is the difficulty to establish satisfying boundary conditions. Recently Lowry et al. (1989) and Zhao and Yedlin (1996) suggested some refinements on the improvement of the boundary problem. We propose a new betterment, based on the splitting of the potential into two terms, the potential due to a reference tabular medium and a secondary potential caused by a disturbance of this medium. The surface response of a tabular medium has long been known (see for example Koefoed 1979). Here we developed the analytical solution for the electrical tabular potential everywhere in the medium, in order to establish more satisfying boundary conditions. The response of the perturbation, that is to say the object of interest, is then solved using volume-difference and preconditioned conjugate gradient. Finally the grid is refined one or more times in the perturbed domain in order to ameliorate the precision. This method of modelling is easy to implement and numerical computations run very fast. Thanks to improved boundary conditions and refinement processes, edges effects are reduced. Moreover, one important conclusion of this work is the necessity to prefer three-dimensional prospecting, since in some cases a unique profile can lead to misinterpretation, as shown by the comparison of transverse profiles through a buried cylinder and through a buried sphere.

Method of Conjugate Radii for Solving Linear and Nonlinear Systems

NASA Technical Reports Server (NTRS)

Nachtsheim, Philip R.

1999-01-01

This paper describes a method to solve a system of N linear equations in N steps. A quadratic form is developed involving the sum of the squares of the residuals of the equations. Equating the quadratic form to a constant yields a surface which is an ellipsoid. For different constants, a family of similar ellipsoids can be generated. Starting at an arbitrary point an orthogonal basis is constructed and the center of the family of similar ellipsoids is found in this basis by a sequence of projections. The coordinates of the center in this basis are the solution of linear system of equations. A quadratic form in N variables requires N projections. That is, the current method is an exact method. It is shown that the sequence of projections is equivalent to a special case of the Gram-Schmidt orthogonalization process. The current method enjoys an advantage not shared by the classic Method of Conjugate Gradients. The current method can be extended to nonlinear systems without modification. For nonlinear equations the Method of Conjugate Gradients has to be augmented with a line-search procedure. Results for linear and nonlinear problems are presented.

Parallel Computation of Flow in Heterogeneous Media Modelled by Mixed Finite Elements

NASA Astrophysics Data System (ADS)

Cliffe, K. A.; Graham, I. G.; Scheichl, R.; Stals, L.

2000-11-01

In this paper we describe a fast parallel method for solving highly ill-conditioned saddle-point systems arising from mixed finite element simulations of stochastic partial differential equations (PDEs) modelling flow in heterogeneous media. Each realisation of these stochastic PDEs requires the solution of the linear first-order velocity-pressure system comprising Darcy's law coupled with an incompressibility constraint. The chief difficulty is that the permeability may be highly variable, especially when the statistical model has a large variance and a small correlation length. For reasonable accuracy, the discretisation has to be extremely fine. We solve these problems by first reducing the saddle-point formulation to a symmetric positive definite (SPD) problem using a suitable basis for the space of divergence-free velocities. The reduced problem is solved using parallel conjugate gradients preconditioned with an algebraically determined additive Schwarz domain decomposition preconditioner. The result is a solver which exhibits a good degree of robustness with respect to the mesh size as well as to the variance and to physically relevant values of the correlation length of the underlying permeability field. Numerical experiments exhibit almost optimal levels of parallel efficiency. The domain decomposition solver (DOUG, http://www.maths.bath.ac.uk/~parsoft) used here not only is applicable to this problem but can be used to solve general unstructured finite element systems on a wide range of parallel architectures.

Conjugate gradient method for phase retrieval based on the Wirtinger derivative.

PubMed

Wei, Zhun; Chen, Wen; Qiu, Cheng-Wei; Chen, Xudong

2017-05-01

A conjugate gradient Wirtinger flow (CG-WF) algorithm for phase retrieval is proposed in this paper. It is shown that, compared with recently reported Wirtinger flow and its modified methods, the proposed CG-WF algorithm is able to dramatically accelerate the convergence rate while keeping the dominant computational cost of each iteration unchanged. We numerically illustrate the effectiveness of our method in recovering 1D Gaussian signals and 2D natural color images under both Gaussian and coded diffraction pattern models.

Reconstruction for limited-projection fluorescence molecular tomography based on projected restarted conjugate gradient normal residual.

PubMed

Cao, Xu; Zhang, Bin; Liu, Fei; Wang, Xin; Bai, Jing

2011-12-01

Limited-projection fluorescence molecular tomography (FMT) can greatly reduce the acquisition time, which is suitable for resolving fast biology processes in vivo but suffers from severe ill-posedness because of the reconstruction using only limited projections. To overcome the severe ill-posedness, we report a reconstruction method based on the projected restarted conjugate gradient normal residual. The reconstruction results of two phantom experiments demonstrate that the proposed method is feasible for limited-projection FMT. © 2011 Optical Society of America

Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method.

PubMed

Bhaya, Amit; Kaszkurewicz, Eugenius

2004-01-01

It is pointed out that the so called momentum method, much used in the neural network literature as an acceleration of the backpropagation method, is a stationary version of the conjugate gradient method. Connections with the continuous optimization method known as heavy ball with friction are also made. In both cases, adaptive (dynamic) choices of the so called learning rate and momentum parameters are obtained using a control Liapunov function analysis of the system.

Weighted graph based ordering techniques for preconditioned conjugate gradient methods

NASA Technical Reports Server (NTRS)

Clift, Simon S.; Tang, Wei-Pai

1994-01-01

We describe the basis of a matrix ordering heuristic for improving the incomplete factorization used in preconditioned conjugate gradient techniques applied to anisotropic PDE's. Several new matrix ordering techniques, derived from well-known algorithms in combinatorial graph theory, which attempt to implement this heuristic, are described. These ordering techniques are tested against a number of matrices arising from linear anisotropic PDE's, and compared with other matrix ordering techniques. A variation of RCM is shown to generally improve the quality of incomplete factorization preconditioners.

A fast referenceless PRFS-based MR thermometry by phase finite difference

NASA Astrophysics Data System (ADS)

Zou, Chao; Shen, Huan; He, Mengyue; Tie, Changjun; Chung, Yiu-Cho; Liu, Xin

2013-08-01

Proton resonance frequency shift-based MR thermometry is a promising temperature monitoring approach for thermotherapy but its accuracy is vulnerable to inter-scan motion. Model-based referenceless thermometry has been proposed to address this problem but phase unwrapping is usually needed before the model fitting process. In this paper, a referenceless MR thermometry method using phase finite difference that avoids the time consuming phase unwrapping procedure is proposed. Unlike the previously proposed phase gradient technique, the use of finite difference in the new method reduces the fitting error resulting from the ringing artifacts associated with phase discontinuity in the calculation of the phase gradient image. The new method takes into account the values at the perimeter of the region of interest because of their direct relevance to the extrapolated baseline phase of the region of interest (where temperature increase takes place). In simulation study, in vivo and ex vivo experiments, the new method has a root-mean-square temperature error of 0.35 °C, 1.02 °C and 1.73 °C compared to 0.83 °C, 2.81 °C, and 3.76 °C from the phase gradient method, respectively. The method also demonstrated a slightly higher, albeit small, temperature accuracy than the original referenceless MR thermometry method. The proposed method is computationally efficient (∼0.1 s per image), making it very suitable for the real time temperature monitoring.

Finite Element Methods for real-time Haptic Feedback of Soft-Tissue Models in Virtual Reality Simulators

NASA Technical Reports Server (NTRS)

Frank, Andreas O.; Twombly, I. Alexander; Barth, Timothy J.; Smith, Jeffrey D.; Dalton, Bonnie P. (Technical Monitor)

2001-01-01

We have applied the linear elastic finite element method to compute haptic force feedback and domain deformations of soft tissue models for use in virtual reality simulators. Our results show that, for virtual object models of high-resolution 3D data (>10,000 nodes), haptic real time computations (>500 Hz) are not currently possible using traditional methods. Current research efforts are focused in the following areas: 1) efficient implementation of fully adaptive multi-resolution methods and 2) multi-resolution methods with specialized basis functions to capture the singularity at the haptic interface (point loading). To achieve real time computations, we propose parallel processing of a Jacobi preconditioned conjugate gradient method applied to a reduced system of equations resulting from surface domain decomposition. This can effectively be achieved using reconfigurable computing systems such as field programmable gate arrays (FPGA), thereby providing a flexible solution that allows for new FPGA implementations as improved algorithms become available. The resulting soft tissue simulation system would meet NASA Virtual Glovebox requirements and, at the same time, provide a generalized simulation engine for any immersive environment application, such as biomedical/surgical procedures or interactive scientific applications.

Application of adaptive gridding to magnetohydrodynamic flows

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schnack, D.D.; Lotatti, I.; Satyanarayana, P.

1996-12-31

The numerical simulation of the primitive, three-dimensional, time-dependent, resistive MHD equations on an unstructured, adaptive poloidal mesh using the TRIM code has been reported previously. The toroidal coordinate is approximated pseudo-spectrally with finite Fourier series and Fast-Fourier Transforms. The finite-volume algorithm preserves the magnetic field as solenoidal to round-off error, and also conserves mass, energy, and magnetic flux exactly. A semi-implicit method is used to allow for large time steps on the unstructured mesh. This is important for tokamak calculations where the relevant time scale is determined by the poloidal Alfven time. This also allows the viscosity to be treatedmore » implicitly. A conjugate-gradient method with pre-conditioning is used for matrix inversion. Applications to the growth and saturation of ideal instabilities in several toroidal fusion systems has been demonstrated. Recently we have concentrated on the details of the mesh adaption algorithm used in TRIM. We present several two-dimensional results relating to the use of grid adaptivity to track the evolution of hydrodynamic and MHD structures. Examples of plasma guns, opening switches, and supersonic flow over a magnetized sphere are presented. Issues relating to mesh adaption criteria are discussed.« less

Stability and Drag Reduction in a Boundary Layer with Microbubbles.

DTIC Science & Technology

1988-02-01

order accurate. .’ Since the numerical methods are not the object of this % dissertation, we decline from including the finite difference equations...previous appendix must be the special case of zero pressure gradient. Some entries of the matrices of the block tridiagonal system will be different ...of the wall mean velocity gradient was observed to be associated with the migration of the bubbles away from the boundary layer. The time scale of the

The multigrid preconditioned conjugate gradient method

NASA Technical Reports Server (NTRS)

Tatebe, Osamu

1993-01-01

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.

GPU computing with Kaczmarz’s and other iterative algorithms for linear systems

PubMed Central

Elble, Joseph M.; Sahinidis, Nikolaos V.; Vouzis, Panagiotis

2009-01-01

The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-dominated, of various sizes, and common to many fields, including computational fluid dynamics, heat transfer, and structural mechanics. The paper presents comparisons between GPU and CPU implementations of several well-known iterative methods, including Kaczmarz’s, Cimmino’s, component averaging, conjugate gradient normal residual (CGNR), symmetric successive overrelaxation-preconditioned conjugate gradient, and conjugate-gradient-accelerated component-averaged row projections (CARP-CG). Computations are preformed with dense as well as general banded systems. The results demonstrate that our GPU implementation outperforms CPU implementations of these algorithms, as well as previously studied parallel implementations on Linux clusters and shared memory systems. While the CGNR method had begun to fall out of favor for solving such problems, for the problems studied in this paper, the CGNR method implemented on the GPU performed better than the other methods, including a cluster implementation of the CARP-CG method. PMID:20526446

Iterative reconstruction methods in atmospheric tomography: FEWHA, Kaczmarz and Gradient-based algorithm

NASA Astrophysics Data System (ADS)

Ramlau, R.; Saxenhuber, D.; Yudytskiy, M.

2014-07-01

The problem of atmospheric tomography arises in ground-based telescope imaging with adaptive optics (AO), where one aims to compensate in real-time for the rapidly changing optical distortions in the atmosphere. Many of these systems depend on a sufficient reconstruction of the turbulence profiles in order to obtain a good correction. Due to steadily growing telescope sizes, there is a strong increase in the computational load for atmospheric reconstruction with current methods, first and foremost the MVM. In this paper we present and compare three novel iterative reconstruction methods. The first iterative approach is the Finite Element- Wavelet Hybrid Algorithm (FEWHA), which combines wavelet-based techniques and conjugate gradient schemes to efficiently and accurately tackle the problem of atmospheric reconstruction. The method is extremely fast, highly flexible and yields superior quality. Another novel iterative reconstruction algorithm is the three step approach which decouples the problem in the reconstruction of the incoming wavefronts, the reconstruction of the turbulent layers (atmospheric tomography) and the computation of the best mirror correction (fitting step). For the atmospheric tomography problem within the three step approach, the Kaczmarz algorithm and the Gradient-based method have been developed. We present a detailed comparison of our reconstructors both in terms of quality and speed performance in the context of a Multi-Object Adaptive Optics (MOAO) system for the E-ELT setting on OCTOPUS, the ESO end-to-end simulation tool.

Efficient spectral computation of the stationary states of rotating Bose-Einstein condensates by preconditioned nonlinear conjugate gradient methods

NASA Astrophysics Data System (ADS)

Antoine, Xavier; Levitt, Antoine; Tang, Qinglin

2017-08-01

We propose a preconditioned nonlinear conjugate gradient method coupled with a spectral spatial discretization scheme for computing the ground states (GS) of rotating Bose-Einstein condensates (BEC), modeled by the Gross-Pitaevskii Equation (GPE). We first start by reviewing the classical gradient flow (also known as imaginary time (IMT)) method which considers the problem from the PDE standpoint, leading to numerically solve a dissipative equation. Based on this IMT equation, we analyze the forward Euler (FE), Crank-Nicolson (CN) and the classical backward Euler (BE) schemes for linear problems and recognize classical power iterations, allowing us to derive convergence rates. By considering the alternative point of view of minimization problems, we propose the preconditioned steepest descent (PSD) and conjugate gradient (PCG) methods for the GS computation of the GPE. We investigate the choice of the preconditioner, which plays a key role in the acceleration of the convergence process. The performance of the new algorithms is tested in 1D, 2D and 3D. We conclude that the PCG method outperforms all the previous methods, most particularly for 2D and 3D fast rotating BECs, while being simple to implement.

Solving large mixed linear models using preconditioned conjugate gradient iteration.

PubMed

Strandén, I; Lidauer, M

1999-12-01

Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

A different approach to estimate nonlinear regression model using numerical methods

NASA Astrophysics Data System (ADS)

Mahaboob, B.; Venkateswarlu, B.; Mokeshrayalu, G.; Balasiddamuni, P.

2017-11-01

This research paper concerns with the computational methods namely the Gauss-Newton method, Gradient algorithm methods (Newton-Raphson method, Steepest Descent or Steepest Ascent algorithm method, the Method of Scoring, the Method of Quadratic Hill-Climbing) based on numerical analysis to estimate parameters of nonlinear regression model in a very different way. Principles of matrix calculus have been used to discuss the Gradient-Algorithm methods. Yonathan Bard [1] discussed a comparison of gradient methods for the solution of nonlinear parameter estimation problems. However this article discusses an analytical approach to the gradient algorithm methods in a different way. This paper describes a new iterative technique namely Gauss-Newton method which differs from the iterative technique proposed by Gorden K. Smyth [2]. Hans Georg Bock et.al [10] proposed numerical methods for parameter estimation in DAE’s (Differential algebraic equation). Isabel Reis Dos Santos et al [11], Introduced weighted least squares procedure for estimating the unknown parameters of a nonlinear regression metamodel. For large-scale non smooth convex minimization the Hager and Zhang (HZ) conjugate gradient Method and the modified HZ (MHZ) method were presented by Gonglin Yuan et al [12].

Hybrid DFP-CG method for solving unconstrained optimization problems

NASA Astrophysics Data System (ADS)

Osman, Wan Farah Hanan Wan; Asrul Hery Ibrahim, Mohd; Mamat, Mustafa

2017-09-01

The conjugate gradient (CG) method and quasi-Newton method are both well known method for solving unconstrained optimization method. In this paper, we proposed a new method by combining the search direction between conjugate gradient method and quasi-Newton method based on BFGS-CG method developed by Ibrahim et al. The Davidon-Fletcher-Powell (DFP) update formula is used as an approximation of Hessian for this new hybrid algorithm. Numerical result showed that the new algorithm perform well than the ordinary DFP method and proven to posses both sufficient descent and global convergence properties.

Geometrical optics analysis of the structural imperfection of retroreflection corner cubes with a nonlinear conjugate gradient method.

PubMed

Kim, Hwi; Min, Sung-Wook; Lee, Byoungho

2008-12-01

Geometrical optics analysis of the structural imperfection of retroreflection corner cubes is described. In the analysis, a geometrical optics model of six-beam reflection patterns generated by an imperfect retroreflection corner cube is developed, and its structural error extraction is formulated as a nonlinear optimization problem. The nonlinear conjugate gradient method is employed for solving the nonlinear optimization problem, and its detailed implementation is described. The proposed method of analysis is a mathematical basis for the nondestructive optical inspection of imperfectly fabricated retroreflection corner cubes.

Projection methods for line radiative transfer in spherical media.

NASA Astrophysics Data System (ADS)

Anusha, L. S.; Nagendra, K. N.

An efficient numerical method called the Preconditioned Bi-Conjugate Gradient (Pre-BiCG) method is presented for the solution of radiative transfer equation in spherical geometry. A variant of this method called Stabilized Preconditioned Bi-Conjugate Gradient (Pre-BiCG-STAB) is also presented. These methods are based on projections on the subspaces of the n dimensional Euclidean space mathbb {R}n called Krylov subspaces. The methods are shown to be faster in terms of convergence rate compared to the contemporary iterative methods such as Jacobi, Gauss-Seidel and Successive Over Relaxation (SOR).

Asymmetry and polarity of the South Atlantic conjugated margins related to the presence of cratons: a numerical study

NASA Astrophysics Data System (ADS)

Andrés-Martínez, Miguel; Pérez-Gussinyé, Marta; de Monserrat Navarro, Albert; Morgan, Jason P.

2015-04-01

Tectonic asymmetry of conjugated passive margins, where one margin is much narrower than the conjugate one, is commonly observed at many passive margins world-wide. Conjugate margin asymmetry has been suggested to be a consequence of lateral changes in rheology, composition, temperature gradient or geometries of the crust and lithosphere. Here we use the South Atlantic margins (from Camamu/Gabon to North Santos/South Kwanza) as a natural laboratory to understand conjugate margin asymmetry. Along this margin sector the polarity of the asymmetry changes. To the North, the Brazilian margin developed in the strong Sao Francisco craton, and this constitutes the narrow side of the conjugate pair. To the South, the Brazilian margin developed in the Ribeira fold belt, and the margin is wide. The opposite is true for the African side. We have thus numerically analysed how the relative distance between the initial location of extension and the craton influences the symmetry/asymmetry and polarity of the conjugate margin system. Our numerical model is 2D visco-elasto-plastic and has a free surface, strain weakening and shear heating. The initial set-up includes a cratonic domain, a mobile belt and a transition area between both. We have run tests with different rheologies, thickness of the lithosphere, and weak seeds at different distances from the craton. Results show asymmetric conjugated margins, where the narrower margin is generally the closest to the craton. Our models also allow us to study how the polarity is controlled by the distance between the initial weakness and the craton, and help to understand how the presence of cratonic domains affects the final architecture of the conjugated margins.

Audiomagnetotelluric Data and Two-Dimensional Models from Spring, Snake, and Three Lakes Valleys, Nevada

USGS Publications Warehouse

McPhee, Darcy K.; Chuchel, Bruce A.; Pellerin, Louise

2007-01-01

Audiomagnetotelluric (AMT) data along thirteen profiles in Spring, Snake, and Three Lakes Valleys, and the corresponding two-dimensional (2-D) inverse models, are presented. The AMT method is a valuable tool for estimating the electrical resistivity of the Earth over depth ranges of a few meters to roughly one kilometer. It is important for revealing subsurface structure and stratigraphy within the Basin and Range province of eastern Nevada that can be used to define the geohydrologic framework of the region. We collected AMT data using the Geometrics StrataGem EH4 system. Profiles were 1.2 to 4.6 km in length with station spacing of 100-400 m. Data were recorded in a coordinate system parallel to and perpendicular to the assumed regional geologic strike direction. We show station locations, sounding curves of apparent resistivity, phase, and coherency, and 2-D models. The 2-D inverse models are computed from the transverse electric (TE), transverse magnetic (TM), and TE+TM mode data using the conjugate gradient, finite-difference method of Rodi and Mackie (2001). Preliminary interpretation of these models defines the structural framework of the basins and the resistivity contrasts between alluvial basin-fill, volcanic units, and carbonate/clastic rocks.

GPU-based acceleration of computations in nonlinear finite element deformation analysis.

PubMed

Mafi, Ramin; Sirouspour, Shahin

2014-03-01

The physics of deformation for biological soft-tissue is best described by nonlinear continuum mechanics-based models, which then can be discretized by the FEM for a numerical solution. However, computational complexity of such models have limited their use in applications requiring real-time or fast response. In this work, we propose a graphic processing unit-based implementation of the FEM using implicit time integration for dynamic nonlinear deformation analysis. This is the most general formulation of the deformation analysis. It is valid for large deformations and strains and can account for material nonlinearities. The data-parallel nature and the intense arithmetic computations of nonlinear FEM equations make it particularly suitable for implementation on a parallel computing platform such as graphic processing unit. In this work, we present and compare two different designs based on the matrix-free and conventional preconditioned conjugate gradients algorithms for solving the FEM equations arising in deformation analysis. The speedup achieved with the proposed parallel implementations of the algorithms will be instrumental in the development of advanced surgical simulators and medical image registration methods involving soft-tissue deformation. Copyright © 2013 John Wiley & Sons, Ltd.

Problems with heterogeneous and non-isotropic media or distorted grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hyman, J.; Shashkov, M.; Steinberg, S.

1996-08-01

This paper defines discretizations of the divergence and flux operators that produce symmetric, positive-definite, and accurate approximations to steady-state diffusion problems. Because discontinuous material properties and highly distorted grids are allowed, the flux operator, rather than the gradient, is used as a fundamental operator to be discretized. Resulting finite-difference scheme is similar to those obtained from the mixed finite-element method.

Analysis and diagnosis of basal cell carcinoma (BCC) via infrared imaging

NASA Astrophysics Data System (ADS)

Flores-Sahagun, J. H.; Vargas, J. V. C.; Mulinari-Brenner, F. A.

2011-09-01

In this work, a structured methodology is proposed and tested through infrared imaging temperature measurements of a healthy control group to establish expected normality ranges and of basal cell carcinoma patients (a type of skin cancer) previously diagnosed through biopsies of the affected regions. A method of conjugated gradients is proposed to compare measured dimensionless temperature difference values (Δ θ) between two symmetric regions of the patient's body, that takes into account the skin, the surrounding ambient and the individual core temperatures and doing so, the limitation of the results interpretation for different individuals become simple and nonsubjective. The range of normal temperatures in different regions of the body for seven healthy individuals was determined, and admitting that the human skin exhibits a unimodal normal distribution, the normal range for each region was considered to be the mean dimensionless temperature difference plus/minus twice the standard deviation of the measurements (Δθ±2σ) in order to represent 95% of the population. Eleven patients with previously diagnosed basal cell carcinoma through biopsies were examined with the method, which was capable of detecting skin abnormalities in all cases. Therefore, the conjugated gradients method was considered effective in the identification of the basal cell carcinoma through infrared imaging even with the use of a low optical resolution camera (160 × 120 pixels) and a thermal resolution of 0.1 °C. The method could also be used to scan a larger area around the lesion in order to detect the presence of other lesions still not perceptible in the clinical exam. However, it is necessary that a temperature differences mesh-like mapping of the healthy human body skin is produced, so that the comparison of the patient Δ θ could be made with the exact region of such mapping in order to possibly make a more effective diagnosis. Finally, the infrared image analyzed through the conjugated gradients method could be useful in the definition of a better safety margin in the surgery for the removal of the lesion, both minimizing esthetics damage to the patient and possibly avoiding basal cell carcinoma recurrence.

Numerical solution of the Saint-Venant equations by an efficient hybrid finite-volume/finite-difference method

NASA Astrophysics Data System (ADS)

Lai, Wencong; Khan, Abdul A.

2018-04-01

A computationally efficient hybrid finite-volume/finite-difference method is proposed for the numerical solution of Saint-Venant equations in one-dimensional open channel flows. The method adopts a mass-conservative finite volume discretization for the continuity equation and a semi-implicit finite difference discretization for the dynamic-wave momentum equation. The spatial discretization of the convective flux term in the momentum equation employs an upwind scheme and the water-surface gradient term is discretized using three different schemes. The performance of the numerical method is investigated in terms of efficiency and accuracy using various examples, including steady flow over a bump, dam-break flow over wet and dry downstream channels, wetting and drying in a parabolic bowl, and dam-break floods in laboratory physical models. Numerical solutions from the hybrid method are compared with solutions from a finite volume method along with analytic solutions or experimental measurements. Comparisons demonstrates that the hybrid method is efficient, accurate, and robust in modeling various flow scenarios, including subcritical, supercritical, and transcritical flows. In this method, the QUICK scheme for the surface slope discretization is more accurate and less diffusive than the center difference and the weighted average schemes.

Renormalizability of the gradient flow in the 2D O(N) non-linear sigma model

NASA Astrophysics Data System (ADS)

Makino, Hiroki; Suzuki, Hiroshi

2015-03-01

It is known that the gauge field and its composite operators evolved by the Yang-Mills gradient flow are ultraviolet (UV) finite without any multiplicative wave function renormalization. In this paper, we prove that the gradient flow in the 2D O(N) non-linear sigma model possesses a similar property: The flowed N-vector field and its composite operators are UV finite without multiplicative wave function renormalization. Our proof in all orders of perturbation theory uses a (2+1)-dimensional field theoretical representation of the gradient flow, which possesses local gauge invariance without gauge field. As an application of the UV finiteness of the gradient flow, we construct the energy-momentum tensor in the lattice formulation of the O(N) non-linear sigma model that automatically restores the correct normalization and the conservation law in the continuum limit.

Optimization of neural network architecture for classification of radar jamming FM signals

NASA Astrophysics Data System (ADS)

Soto, Alberto; Mendoza, Ariadna; Flores, Benjamin C.

2017-05-01

The purpose of this study is to investigate several artificial Neural Network (NN) architectures in order to design a cognitive radar system capable of optimally distinguishing linear Frequency-Modulated (FM) signals from bandlimited Additive White Gaussian Noise (AWGN). The goal is to create a theoretical framework to determine an optimal NN architecture to achieve a Probability of Detection (PD) of 95% or higher and a Probability of False Alarm (PFA) of 1.5% or lower at 5 dB Signal to Noise Ratio (SNR). Literature research reveals that the frequency-domain power spectral densities characterize a signal more efficiently than its time-domain counterparts. Therefore, the input data is preprocessed by calculating the magnitude square of the Discrete Fourier Transform of the digitally sampled bandlimited AWGN and linear FM signals to populate a matrix containing N number of samples and M number of spectra. This matrix is used as input for the NN, and the spectra are divided as follows: 70% for training, 15% for validation, and 15% for testing. The study begins by experimentally deducing the optimal number of hidden neurons (1-40 neurons), then the optimal number of hidden layers (1-5 layers), and lastly, the most efficient learning algorithm. The training algorithms examined are: Resilient Backpropagation, Scaled Conjugate Gradient, Conjugate Gradient with Powell/Beale Restarts, Polak-Ribiére Conjugate Gradient, and Variable Learning Rate Backpropagation. We determine that an architecture with ten hidden neurons (or higher), one hidden layer, and a Scaled Conjugate Gradient for training algorithm encapsulates an optimal architecture for our application.

Formation of large-scale structures with sharp density gradient through Rayleigh-Taylor growth in a two-dimensional slab under the two-fluid and finite Larmor radius effects

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goto, R.; Hatori, T.; Miura, H., E-mail: miura.hideaki@nifs.ac.jp

Two-fluid and the finite Larmor effects on linear and nonlinear growth of the Rayleigh-Taylor instability in a two-dimensional slab are studied numerically with special attention to high-wave-number dynamics and nonlinear structure formation at a low β-value. The two effects stabilize the unstable high wave number modes for a certain range of the β-value. In nonlinear simulations, the absence of the high wave number modes in the linear stage leads to the formation of the density field structure much larger than that in the single-fluid magnetohydrodynamic simulation, together with a sharp density gradient as well as a large velocity difference. Themore » formation of the sharp velocity difference leads to a subsequent Kelvin-Helmholtz-type instability only when both the two-fluid and finite Larmor radius terms are incorporated, whereas it is not observed otherwise. It is shown that the emergence of the secondary instability can modify the outline of the turbulent structures associated with the primary Rayleigh-Taylor instability.« less

Automated Calibration For Numerical Models Of Riverflow

NASA Astrophysics Data System (ADS)

Fernandez, Betsaida; Kopmann, Rebekka; Oladyshkin, Sergey

2017-04-01

Calibration of numerical models is fundamental since the beginning of all types of hydro system modeling, to approximate the parameters that can mimic the overall system behavior. Thus, an assessment of different deterministic and stochastic optimization methods is undertaken to compare their robustness, computational feasibility, and global search capacity. Also, the uncertainty of the most suitable methods is analyzed. These optimization methods minimize the objective function that comprises synthetic measurements and simulated data. Synthetic measurement data replace the observed data set to guarantee an existing parameter solution. The input data for the objective function derivate from a hydro-morphological dynamics numerical model which represents an 180-degree bend channel. The hydro- morphological numerical model shows a high level of ill-posedness in the mathematical problem. The minimization of the objective function by different candidate methods for optimization indicates a failure in some of the gradient-based methods as Newton Conjugated and BFGS. Others reveal partial convergence, such as Nelder-Mead, Polak und Ribieri, L-BFGS-B, Truncated Newton Conjugated, and Trust-Region Newton Conjugated Gradient. Further ones indicate parameter solutions that range outside the physical limits, such as Levenberg-Marquardt and LeastSquareRoot. Moreover, there is a significant computational demand for genetic optimization methods, such as Differential Evolution and Basin-Hopping, as well as for Brute Force methods. The Deterministic Sequential Least Square Programming and the scholastic Bayes Inference theory methods present the optimal optimization results. keywords: Automated calibration of hydro-morphological dynamic numerical model, Bayesian inference theory, deterministic optimization methods.

The truncated conjugate gradient (TCG), a non-iterative/fixed-cost strategy for computing polarization in molecular dynamics: Fast evaluation of analytical forces

NASA Astrophysics Data System (ADS)

Aviat, Félix; Lagardère, Louis; Piquemal, Jean-Philip

2017-10-01

In a recent paper [F. Aviat et al., J. Chem. Theory Comput. 13, 180-190 (2017)], we proposed the Truncated Conjugate Gradient (TCG) approach to compute the polarization energy and forces in polarizable molecular simulations. The method consists in truncating the conjugate gradient algorithm at a fixed predetermined order leading to a fixed computational cost and can thus be considered "non-iterative." This gives the possibility to derive analytical forces avoiding the usual energy conservation (i.e., drifts) issues occurring with iterative approaches. A key point concerns the evaluation of the analytical gradients, which is more complex than that with a usual solver. In this paper, after reviewing the present state of the art of polarization solvers, we detail a viable strategy for the efficient implementation of the TCG calculation. The complete cost of the approach is then measured as it is tested using a multi-time step scheme and compared to timings using usual iterative approaches. We show that the TCG methods are more efficient than traditional techniques, making it a method of choice for future long molecular dynamics simulations using polarizable force fields where energy conservation matters. We detail the various steps required for the implementation of the complete method by software developers.

The truncated conjugate gradient (TCG), a non-iterative/fixed-cost strategy for computing polarization in molecular dynamics: Fast evaluation of analytical forces.

PubMed

Aviat, Félix; Lagardère, Louis; Piquemal, Jean-Philip

2017-10-28

In a recent paper [F. Aviat et al., J. Chem. Theory Comput. 13, 180-190 (2017)], we proposed the Truncated Conjugate Gradient (TCG) approach to compute the polarization energy and forces in polarizable molecular simulations. The method consists in truncating the conjugate gradient algorithm at a fixed predetermined order leading to a fixed computational cost and can thus be considered "non-iterative." This gives the possibility to derive analytical forces avoiding the usual energy conservation (i.e., drifts) issues occurring with iterative approaches. A key point concerns the evaluation of the analytical gradients, which is more complex than that with a usual solver. In this paper, after reviewing the present state of the art of polarization solvers, we detail a viable strategy for the efficient implementation of the TCG calculation. The complete cost of the approach is then measured as it is tested using a multi-time step scheme and compared to timings using usual iterative approaches. We show that the TCG methods are more efficient than traditional techniques, making it a method of choice for future long molecular dynamics simulations using polarizable force fields where energy conservation matters. We detail the various steps required for the implementation of the complete method by software developers.

Stabilization of lower hybrid drift modes by finite parallel wavenumber and electron temperature gradients in field-reversed configurations

NASA Astrophysics Data System (ADS)

Farengo, R.; Guzdar, P. N.; Lee, Y. C.

1989-08-01

The effect of finite parallel wavenumber and electron temperature gradients on the lower hybrid drift instability is studied in the parameter regime corresponding to the TRX-2 device [Fusion Technol. 9, 48 (1986)]. Perturbations in the electrostatic potential and all three components of the vector potential are considered and finite beta electron orbit modifications are included. The electron temperature gradient decreases the growth rate of the instability but, for kz=0, unstable modes exist for ηe(=T'en0/Ten0)>6. Since finite kz effects completely stabilize the mode at small values of kz/ky(≂5×10-3), magnetic shear could be responsible for stabilizing the lower hybrid drift instability in field-reversed configurations.

Multiplexed protein detection using antibody-conjugated microbead arrays in a microfabricated electrophoretic device

PubMed Central

Barbee, Kristopher D.; Hsiao, Alexander P.; Roller, Eric E.; Huang, Xiaohua

2011-01-01

We report the development of a microfabricated electrophoretic device for assembling high-density arrays of antibody-conjugated microbeads for chip-based protein detection. The device consists of a flow cell formed between a gold-coated silicon chip with an array of microwells etched in a silicon dioxide film and a glass coverslip with a series of thin gold counter electrode lines. We have demonstrated that 0.4 and 1 μm beads conjugated with antibodies can be rapidly assembled into the microwells by applying a pulsed electric field across the chamber. By assembling step-wise a mixture of fluorescently labeled antibody-conjugated microbeads, we incorporated both spatial and fluorescence encoding strategies to demonstrate significant multiplexing capabilities. We have shown that these antibody-conjugated microbead arrays can be used to perform on-chip sandwich immunoassays to detect test antigens at concentrations as low as 40 pM (6 ng/mL). A finite element model was also developed to examine the electric field distribution within the device for different counter electrode configurations over a range of line pitches and chamber heights. This device will be useful for assembling high-density, encoded antibody arrays for multiplexed detection of proteins and other types of protein-conjugated microbeads for applications such as the analysis of protein-protein interactions. PMID:20820631

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix [A projected preconditioned conjugate gradient algorithm for computing a large eigenspace of a Hermitian matrix

DOE PAGES

Vecharynski, Eugene; Yang, Chao; Pask, John E.

2015-02-25

Here, we present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimalmore » block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.« less

Finite Volume Numerical Methods for Aeroheating Rate Calculations from Infrared Thermographic Data

NASA Technical Reports Server (NTRS)

Daryabeigi, Kamran; Berry, Scott A.; Horvath, Thomas J.; Nowak, Robert J.

2003-01-01

The use of multi-dimensional finite volume numerical techniques with finite thickness models for calculating aeroheating rates from measured global surface temperatures on hypersonic wind tunnel models was investigated. Both direct and inverse finite volume techniques were investigated and compared with the one-dimensional semi -infinite technique. Global transient surface temperatures were measured using an infrared thermographic technique on a 0.333-scale model of the Hyper-X forebody in the Langley Research Center 20-Inch Mach 6 Air tunnel. In these tests the effectiveness of vortices generated via gas injection for initiating hypersonic transition on the Hyper-X forebody were investigated. An array of streamwise orientated heating striations were generated and visualized downstream of the gas injection sites. In regions without significant spatial temperature gradients, one-dimensional techniques provided accurate aeroheating rates. In regions with sharp temperature gradients due to the striation patterns two-dimensional heat transfer techniques were necessary to obtain accurate heating rates. The use of the one-dimensional technique resulted in differences of 20% in the calculated heating rates because it did not account for lateral heat conduction in the model.

Comparing implementations of penalized weighted least-squares sinogram restoration.

PubMed

Forthmann, Peter; Koehler, Thomas; Defrise, Michel; La Riviere, Patrick

2010-11-01

A CT scanner measures the energy that is deposited in each channel of a detector array by x rays that have been partially absorbed on their way through the object. The measurement process is complex and quantitative measurements are always and inevitably associated with errors, so CT data must be preprocessed prior to reconstruction. In recent years, the authors have formulated CT sinogram preprocessing as a statistical restoration problem in which the goal is to obtain the best estimate of the line integrals needed for reconstruction from the set of noisy, degraded measurements. The authors have explored both penalized Poisson likelihood (PL) and penalized weighted least-squares (PWLS) objective functions. At low doses, the authors found that the PL approach outperforms PWLS in terms of resolution-noise tradeoffs, but at standard doses they perform similarly. The PWLS objective function, being quadratic, is more amenable to computational acceleration than the PL objective. In this work, the authors develop and compare two different methods for implementing PWLS sinogram restoration with the hope of improving computational performance relative to PL in the standard-dose regime. Sinogram restoration is still significant in the standard-dose regime since it can still outperform standard approaches and it allows for correction of effects that are not usually modeled in standard CT preprocessing. The authors have explored and compared two implementation strategies for PWLS sinogram restoration: (1) A direct matrix-inversion strategy based on the closed-form solution to the PWLS optimization problem and (2) an iterative approach based on the conjugate-gradient algorithm. Obtaining optimal performance from each strategy required modifying the naive off-the-shelf implementations of the algorithms to exploit the particular symmetry and sparseness of the sinogram-restoration problem. For the closed-form approach, the authors subdivided the large matrix inversion into smaller coupled problems and exploited sparseness to minimize matrix operations. For the conjugate-gradient approach, the authors exploited sparseness and preconditioned the problem to speed up convergence. All methods produced qualitatively and quantitatively similar images as measured by resolution-variance tradeoffs and difference images. Despite the acceleration strategies, the direct matrix-inversion approach was found to be uncompetitive with iterative approaches, with a computational burden higher by an order of magnitude or more. The iterative conjugate-gradient approach, however, does appear promising, with computation times half that of the authors' previous penalized-likelihood implementation. Iterative conjugate-gradient based PWLS sinogram restoration with careful matrix optimizations has computational advantages over direct matrix PWLS inversion and over penalized-likelihood sinogram restoration and can be considered a good alternative in standard-dose regimes.

A comparison of two closely-related approaches to aerodynamic design optimization

NASA Technical Reports Server (NTRS)

Shubin, G. R.; Frank, P. D.

1991-01-01

Two related methods for aerodynamic design optimization are compared. The methods, called the implicit gradient approach and the variational (or optimal control) approach, both attempt to obtain gradients necessary for numerical optimization at a cost significantly less than that of the usual black-box approach that employs finite difference gradients. While the two methods are seemingly quite different, they are shown to differ (essentially) in that the order of discretizing the continuous problem, and of applying calculus, is interchanged. Under certain circumstances, the two methods turn out to be identical. We explore the relationship between these methods by applying them to a model problem for duct flow that has many features in common with transonic flow over an airfoil. We find that the gradients computed by the variational method can sometimes be sufficiently inaccurate to cause the optimization to fail.

Solar multi-conjugate adaptive optics performance improvement

NASA Astrophysics Data System (ADS)

Zhang, Zhicheng; Zhang, Xiaofang; Song, Jie

2015-08-01

In order to overcome the effect of the atmospheric anisoplanatism, Multi-Conjugate Adaptive Optics (MCAO), which was developed based on turbulence correction by means of several deformable mirrors (DMs) conjugated to different altitude and by which the limit of a small corrected FOV that is achievable with AO is overcome and a wider FOV is able to be corrected, has been widely used to widen the field-of-view (FOV) of a solar telescope. With the assistance of the multi-threaded Adaptive Optics Simulator (MAOS), we can make a 3D reconstruction of the distorted wavefront. The correction is applied by one or more DMs. This technique benefits from information about atmospheric turbulence at different layers, which can be used to reconstruct the wavefront extremely well. In MAOS, the sensors are either simulated as idealized wavefront gradient sensors, tip-tilt sensors based on the best Zernike fit, or a WFS using physical optics and incorporating user specified pixel characteristics and a matched filter pixel processing algorithm. Only considering the atmospheric anisoplanatism, we focus on how the performance of a solar MCAO system is related to the numbers of DMs and their conjugate heights. We theoretically quantify the performance of the tomographic solar MCAO system. The results indicate that the tomographic AO system can improve the average Strehl ratio of a solar telescope by only employing one or two DMs conjugated to the optimum altitude. And the S.R. has a significant increase when more deformable mirrors are used. Furthermore, we discuss the effects of DM conjugate altitude on the correction achievable by the MCAO system, and present the optimum DM conjugate altitudes.

Conjugate gradient coupled with multigrid for an indefinite problem

NASA Technical Reports Server (NTRS)

Gozani, J.; Nachshon, A.; Turkel, E.

1984-01-01

An iterative algorithm for the Helmholtz equation is presented. This scheme was based on the preconditioned conjugate gradient method for the normal equations. The preconditioning is one cycle of a multigrid method for the discrete Laplacian. The smoothing algorithm is red-black Gauss-Seidel and is constructed so it is a symmetric operator. The total number of iterations needed by the algorithm is independent of h. By varying the number of grids, the number of iterations depends only weakly on k when k(3)h(2) is constant. Comparisons with a SSOR preconditioner are presented.

Multigrid preconditioned conjugate-gradient method for large-scale wave-front reconstruction.

PubMed

Gilles, Luc; Vogel, Curtis R; Ellerbroek, Brent L

2002-09-01

We introduce a multigrid preconditioned conjugate-gradient (MGCG) iterative scheme for computing open-loop wave-front reconstructors for extreme adaptive optics systems. We present numerical simulations for a 17-m class telescope with n = 48756 sensor measurement grid points within the aperture, which indicate that our MGCG method has a rapid convergence rate for a wide range of subaperture average slope measurement signal-to-noise ratios. The total computational cost is of order n log n. Hence our scheme provides for fast wave-front simulation and control in large-scale adaptive optics systems.

A fast pulse design for parallel excitation with gridding conjugate gradient.

PubMed

Feng, Shuo; Ji, Jim

2013-01-01

Parallel excitation (pTx) is recognized as a crucial technique in high field MRI to address the transmit field inhomogeneity problem. However, it can be time consuming to design pTx pulses which is not desirable. In this work, we propose a pulse design with gridding conjugate gradient (CG) based on the small-tip-angle approximation. The two major time consuming matrix-vector multiplications are substituted by two operators which involves with FFT and gridding only. Simulation results have shown that the proposed method is 3 times faster than conventional method and the memory cost is reduced by 1000 times.

A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization

PubMed Central

Li, Xiangrong; Zhao, Xupei; Duan, Xiabin; Wang, Xiaoliang

2015-01-01

It is generally acknowledged that the conjugate gradient (CG) method achieves global convergence—with at most a linear convergence rate—because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search) is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method. PMID:26381742

A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization.

PubMed

Li, Xiangrong; Zhao, Xupei; Duan, Xiabin; Wang, Xiaoliang

2015-01-01

It is generally acknowledged that the conjugate gradient (CG) method achieves global convergence--with at most a linear convergence rate--because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search) is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method.

The influence of the radial pressure gradient on the blade root loss in an annular subsonic nozzle cascade

NASA Astrophysics Data System (ADS)

Meng, D.; Weng, Z.; Xiang, Y.

1985-09-01

This paper presents a method for predicting the blade root loss in an annular nozzle cascade in which consideration is given to the influence of the radial pressure gradient (RPG) on it. The variation of blade root losses under different RPG is obtained experimentally, and finite element method is used to calculate the pressure distribution in the blade passage.

Finite difference time domain (FDTD) method for modeling the effect of switched gradients on the human body in MRI.

PubMed

Zhao, Huawei; Crozier, Stuart; Liu, Feng

2002-12-01

Numerical modeling of the eddy currents induced in the human body by the pulsed field gradients in MRI presents a difficult computational problem. It requires an efficient and accurate computational method for high spatial resolution analyses with a relatively low input frequency. In this article, a new technique is described which allows the finite difference time domain (FDTD) method to be efficiently applied over a very large frequency range, including low frequencies. This is not the case in conventional FDTD-based methods. A method of implementing streamline gradients in FDTD is presented, as well as comparative analyses which show that the correct source injection in the FDTD simulation plays a crucial rule in obtaining accurate solutions. In particular, making use of the derivative of the input source waveform is shown to provide distinct benefits in accuracy over direct source injection. In the method, no alterations to the properties of either the source or the transmission media are required. The method is essentially frequency independent and the source injection method has been verified against examples with analytical solutions. Results are presented showing the spatial distribution of gradient-induced electric fields and eddy currents in a complete body model. Copyright 2002 Wiley-Liss, Inc.

Cholesteric liquid crystal gels with a graded mechanical stress

NASA Astrophysics Data System (ADS)

Agez, Gonzague; Relaix, Sabrina; Mitov, Michel

2014-02-01

In cholesteric liquid-crystalline gels, the mechanical role of the polymer network over the structure of the whole gel has been ignored. We show that it is the stress gradient exerted by the network over the helical structure that drives the broadening of the optical band gap, as evidenced by the absence of a gradient in chiral species. Model calculations and finite-difference time-domain simulations show that the network acts as a spring with a stiffness gradient. The present results indicate a revision to the common understanding of the physical properties of liquid-crystalline gels is necessary when a concentration gradient in a polymer network is present.

Cholesteric liquid crystal gels with a graded mechanical stress.

PubMed

Agez, Gonzague; Relaix, Sabrina; Mitov, Michel

2014-02-01

In cholesteric liquid-crystalline gels, the mechanical role of the polymer network over the structure of the whole gel has been ignored. We show that it is the stress gradient exerted by the network over the helical structure that drives the broadening of the optical band gap, as evidenced by the absence of a gradient in chiral species. Model calculations and finite-difference time-domain simulations show that the network acts as a spring with a stiffness gradient. The present results indicate a revision to the common understanding of the physical properties of liquid-crystalline gels is necessary when a concentration gradient in a polymer network is present.

Scanning electrochemical microscopy of menadione-glutathione conjugate export from yeast cells

PubMed Central

Mauzeroll, Janine; Bard, Allen J.

2004-01-01

The uptake of menadione (2-methyl-1,4-naphthoquinone), which is toxic to yeast cells, and its expulsion as a glutathione complex were studied by scanning electrochemical microscopy. The progression of the in vitro reaction between menadione and glutathione was monitored electrochemically by cyclic voltammetry and correlated with the spectroscopic (UV–visible) behavior. By observing the scanning electrochemical microscope tip current of yeast cells suspended in a menadione-containing solution, the export of the conjugate from the cells with time could be measured. Similar experiments were performed on immobilized yeast cell aggregates stressed by a menadione solution. From the export of the menadione-glutathione conjugate detected at a 1-μm-diameter electrode situated 10 μm from the cells, a flux of about 30,000 thiodione molecules per second per cell was extracted. Numerical simulations based on an explicit finite difference method further revealed that the observation of a constant efflux of thiodione from the cells suggested the rate was limited by the uptake of menadione and that the efflux through the glutathione-conjugate pump was at least an order of magnitude faster. PMID:15148374

Sensitivity Analysis for Coupled Aero-structural Systems

NASA Technical Reports Server (NTRS)

Giunta, Anthony A.

1999-01-01

A novel method has been developed for calculating gradients of aerodynamic force and moment coefficients for an aeroelastic aircraft model. This method uses the Global Sensitivity Equations (GSE) to account for the aero-structural coupling, and a reduced-order modal analysis approach to condense the coupling bandwidth between the aerodynamic and structural models. Parallel computing is applied to reduce the computational expense of the numerous high fidelity aerodynamic analyses needed for the coupled aero-structural system. Good agreement is obtained between aerodynamic force and moment gradients computed with the GSE/modal analysis approach and the same quantities computed using brute-force, computationally expensive, finite difference approximations. A comparison between the computational expense of the GSE/modal analysis method and a pure finite difference approach is presented. These results show that the GSE/modal analysis approach is the more computationally efficient technique if sensitivity analysis is to be performed for two or more aircraft design parameters.

Large-scale computation of incompressible viscous flow by least-squares finite element method

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to large-scale/three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations and results in symmetric, positive definite algebraic system which can be solved effectively by simple iterative methods. The first-order velocity-Bernoulli function-vorticity formulation for incompressible viscous flows is also tested. For three-dimensional cases, an additional compatibility equation, i.e., the divergence of the vorticity vector should be zero, is included to make the first-order system elliptic. The simple substitution of the Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. To show the validity of this scheme for large-scale computation, we give numerical results for 2D driven cavity problem at Re = 10000 with 408 x 400 bilinear elements. The flow in a 3D cavity is calculated at Re = 100, 400, and 1,000 with 50 x 50 x 50 trilinear elements. The Taylor-Goertler-like vortices are observed for Re = 1,000.

Spherical Viscoelastic Finite Element Model for Cascadia Interseismic Deformation

NASA Astrophysics Data System (ADS)

He, J.; Wang, K.; Dragert, H.; Miller, M. M.

2003-12-01

We have developed a 3-D spherical viscoelastic finite element model for the Cascadia subduction zone to study temporal and spatial variations of interseismic deformation. Previous 3-D viscoelastic finite element models of subduction zone earthquake cycles all use the Cartesian system, with the surface of the earth map-projected on to a horizontal plane. For earthquakes that rupture very long plate-boundary segments, such as the 1700 Cascadia, 1960 Chile, and 1964 Alaska great earthquakes, the Cartesian approach is inconvenient and less accurate. 3-D analytical solutions take into account the spherical geometry of the earth but have difficulty dealing with realistic plate boundary structure. For the new spherical finite element model, we use 27-node tri-quadratic isoparametric element. The resultant large sparse matrix system is solved by the stabilized bi-conjugate gradient method with ILUT preconditioning of fill-in level 6. Our experience suggests that lower order elements in the spherical system would result in unacceptable numerical errors unless one set of mesh lines is strictly radial. For the great Cascadia earthquake, we employ a smooth coseismic rupture model inferred from thermal data and results of tsunami models of the 1700 event, but we test different slip distances. For interseismic deformation, we use the conventional backslip approach. The contemporary deformation of the Cascadia margin consists of interseismic strain accumulation and a geological secular motion that can be described by a rotation of the forearc relative to North America. To isolate the interseismic deformation, we remove the secular motion from both the model formulation and geodetic data. The model predicts decreasing margin-normal shortening rates throughout the interseismic period as a result of stress relaxation in the viscoelastic mantle. The rate of decrease depends on the assumed mantle viscosity. With a viscosity of 1019 Pa s, model surface deformation at 300 years after the great earthquake agrees with geodetically observed contemporary deformation very well. The model also confirms the previous finding based on a Cartesian model that an inland region continues to move seaward several decades after the great earthquake.

Thermostructural Analysis of Carbon Cloth Phenolic Material Tested at the Laser Hardened Material Evaluation Laboratory

NASA Technical Reports Server (NTRS)

Clayton, J. Louie; Ehle, Curt; Saxon, Jeff (Technical Monitor)

2002-01-01

RSRM nozzle liner components have been analyzed and tested to explore the occurrence of anomalous material performance known as pocketing erosion. Primary physical factors that contribute to pocketing seem to include the geometric permeability, which governs pore pressure magnitudes and hence load, and carbon fiber high temperature tensile strength, which defines a material limiting capability. The study reports on the results of a coupled thermostructural finite element analysis of Carbon Cloth Phenolic (CCP) material tested at the Laser Hardened Material Evaluation Laboratory (the LHMEL facility). Modeled test configurations will be limited to the special case of where temperature gradients are oriented perpendicular to the composite material ply angle. Analyses were conducted using a transient, one-dimensional flow/thermal finite element code that models pore pressure and temperature distributions and in an explicitly coupled formulation, passes this information to a 2-dimensional finite element structural model for determination of the stress/deformation behavior of the orthotropic fiber/matrix CCP. Pore pressures are generated by thermal decomposition of the phenolic resin which evolve as a multi-component gas phase which is partially trapped in the porous microstructure of the composite. The nature of resultant pressures are described by using the Darcy relationships which have been modified to permit a multi-specie mass and momentum balance including water vapor condensation. Solution to the conjugate flow/thermal equations were performed using the SINDA code. Of particular importance to this problem was the implementation of a char and deformation state dependent (geometric) permeability as describing a first order interaction between the flow/thermal and structural models. Material property models are used to characterize the solid phase mechanical stiffness and failure. Structural calculations were performed using the ABAQUS code. Iterations were made between the two codes involving the dependent variables temperature, pressure and across-ply strain level. Model results comparisons are made for three different surface heat rates and dependent variable sensitivities discussed for the various cases.

Radiofrequency pulse design using nonlinear gradient magnetic fields.

PubMed

Kopanoglu, Emre; Constable, R Todd

2015-09-01

An iterative k-space trajectory and radiofrequency (RF) pulse design method is proposed for excitation using nonlinear gradient magnetic fields. The spatial encoding functions (SEFs) generated by nonlinear gradient fields are linearly dependent in Cartesian coordinates. Left uncorrected, this may lead to flip angle variations in excitation profiles. In the proposed method, SEFs (k-space samples) are selected using a matching pursuit algorithm, and the RF pulse is designed using a conjugate gradient algorithm. Three variants of the proposed approach are given: the full algorithm, a computationally cheaper version, and a third version for designing spoke-based trajectories. The method is demonstrated for various target excitation profiles using simulations and phantom experiments. The method is compared with other iterative (matching pursuit and conjugate gradient) and noniterative (coordinate-transformation and Jacobian-based) pulse design methods as well as uniform density spiral and EPI trajectories. The results show that the proposed method can increase excitation fidelity. An iterative method for designing k-space trajectories and RF pulses using nonlinear gradient fields is proposed. The method can either be used for selecting the SEFs individually to guide trajectory design, or can be adapted to design and optimize specific trajectories of interest. © 2014 Wiley Periodicals, Inc.

Tailoring magnetic field gradient design to magnet cryostat geometry.

PubMed

Trakic, A; Liu, F; Lopez, H S; Wang, H; Crozier, S

2006-01-01

Eddy currents induced within a magnetic resonance imaging (MRI) cryostat bore during pulsing of gradient coils can be applied constructively together with the gradient currents that generate them, to obtain good quality gradient uniformities within a specified imaging volume over time. This can be achieved by simultaneously optimizing the spatial distribution and temporal pre-emphasis of the gradient coil current, to account for the spatial and temporal variation of the secondary magnetic fields due to the induced eddy currents. This method allows the tailored design of gradient coil/magnet configurations and consequent engineering trade-offs. To compute the transient eddy currents within a realistic cryostat vessel, a low-frequency finite-difference time-domain (FDTD) method using total-field scattered-field (TFSF) scheme has been performed and validated.

Numerical solution of transport equation for applications in environmental hydraulics and hydrology

NASA Astrophysics Data System (ADS)

Rashidul Islam, M.; Hanif Chaudhry, M.

1997-04-01

The advective term in the one-dimensional transport equation, when numerically discretized, produces artificial diffusion. To minimize such artificial diffusion, which vanishes only for Courant number equal to unity, transport owing to advection has been modeled separately. The numerical solution of the advection equation for a Gaussian initial distribution is well established; however, large oscillations are observed when applied to an initial distribution with sleep gradients, such as trapezoidal distribution of a constituent or propagation of mass from a continuous input. In this study, the application of seven finite-difference schemes and one polynomial interpolation scheme is investigated to solve the transport equation for both Gaussian and non-Gaussian (trapezoidal) initial distributions. The results obtained from the numerical schemes are compared with the exact solutions. A constant advective velocity is assumed throughout the transport process. For a Gaussian distribution initial condition, all eight schemes give excellent results, except the Lax scheme which is diffusive. In application to the trapezoidal initial distribution, explicit finite-difference schemes prove to be superior to implicit finite-difference schemes because the latter produce large numerical oscillations near the steep gradients. The Warming-Kutler-Lomax (WKL) explicit scheme is found to be better among this group. The Hermite polynomial interpolation scheme yields the best result for a trapezoidal distribution among all eight schemes investigated. The second-order accurate schemes are sufficiently accurate for most practical problems, but the solution of unusual problems (concentration with steep gradient) requires the application of higher-order (e.g. third- and fourth-order) accurate schemes.

A High Order Finite Difference Scheme with Sharp Shock Resolution for the Euler Equations

NASA Technical Reports Server (NTRS)

Gerritsen, Margot; Olsson, Pelle

1996-01-01

We derive a high-order finite difference scheme for the Euler equations that satisfies a semi-discrete energy estimate, and present an efficient strategy for the treatment of discontinuities that leads to sharp shock resolution. The formulation of the semi-discrete energy estimate is based on a symmetrization of the Euler equations that preserves the homogeneity of the flux vector, a canonical splitting of the flux derivative vector, and the use of difference operators that satisfy a discrete analogue to the integration by parts procedure used in the continuous energy estimate. Around discontinuities or sharp gradients, refined grids are created on which the discrete equations are solved after adding a newly constructed artificial viscosity. The positioning of the sub-grids and computation of the viscosity are aided by a detection algorithm which is based on a multi-scale wavelet analysis of the pressure grid function. The wavelet theory provides easy to implement mathematical criteria to detect discontinuities, sharp gradients and spurious oscillations quickly and efficiently.

Micromorphic approach for gradient-extended thermo-elastic-plastic solids in the logarithmic strain space

NASA Astrophysics Data System (ADS)

Aldakheel, Fadi

2017-11-01

The coupled thermo-mechanical strain gradient plasticity theory that accounts for microstructure-based size effects is outlined within this work. It extends the recent work of Miehe et al. (Comput Methods Appl Mech Eng 268:704-734, 2014) to account for thermal effects at finite strains. From the computational viewpoint, the finite element design of the coupled problem is not straightforward and requires additional strategies due to the difficulties near the elastic-plastic boundaries. To simplify the finite element formulation, we extend it toward the micromorphic approach to gradient thermo-plasticity model in the logarithmic strain space. The key point is the introduction of dual local-global field variables via a penalty method, where only the global fields are restricted by boundary conditions. Hence, the problem of restricting the gradient variable to the plastic domain is relaxed, which makes the formulation very attractive for finite element implementation as discussed in Forest (J Eng Mech 135:117-131, 2009) and Miehe et al. (Philos Trans R Soc A Math Phys Eng Sci 374:20150170, 2016).

Superlinear convergence estimates for a conjugate gradient method for the biharmonic equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chan, R.H.; Delillo, T.K.; Horn, M.A.

1998-01-01

The method of Muskhelishvili for solving the biharmonic equation using conformal mapping is investigated. In [R.H. Chan, T.K. DeLillo, and M.A. Horn, SIAM J. Sci. Comput., 18 (1997), pp. 1571--1582] it was shown, using the Hankel structure, that the linear system in [N.I. Muskhelishvili, Some Basic Problems of the Mathematical Theory of Elasticity, Noordhoff, Groningen, the Netherlands] is the discretization of the identity plus a compact operator, and therefore the conjugate gradient method will converge superlinearly. Estimates are given here of the superlinear convergence in the cases when the boundary curve is analytic or in a Hoelder class.

Comparison of Conjugate Gradient Density Matrix Search and Chebyshev Expansion Methods for Avoiding Diagonalization in Large-Scale Electronic Structure Calculations

NASA Technical Reports Server (NTRS)

Bates, Kevin R.; Daniels, Andrew D.; Scuseria, Gustavo E.

1998-01-01

We report a comparison of two linear-scaling methods which avoid the diagonalization bottleneck of traditional electronic structure algorithms. The Chebyshev expansion method (CEM) is implemented for carbon tight-binding calculations of large systems and its memory and timing requirements compared to those of our previously implemented conjugate gradient density matrix search (CG-DMS). Benchmark calculations are carried out on icosahedral fullerenes from C60 to C8640 and the linear scaling memory and CPU requirements of the CEM demonstrated. We show that the CPU requisites of the CEM and CG-DMS are similar for calculations with comparable accuracy.

Inverse solutions for electrical impedance tomography based on conjugate gradients methods

NASA Astrophysics Data System (ADS)

Wang, M.

2002-01-01

A multistep inverse solution for two-dimensional electric field distribution is developed to deal with the nonlinear inverse problem of electric field distribution in relation to its boundary condition and the problem of divergence due to errors introduced by the ill-conditioned sensitivity matrix and the noise produced by electrode modelling and instruments. This solution is based on a normalized linear approximation method where the change in mutual impedance is derived from the sensitivity theorem and a method of error vector decomposition. This paper presents an algebraic solution of the linear equations at each inverse step, using a generalized conjugate gradients method. Limiting the number of iterations in the generalized conjugate gradients method controls the artificial errors introduced by the assumption of linearity and the ill-conditioned sensitivity matrix. The solution of the nonlinear problem is approached using a multistep inversion. This paper also reviews the mathematical and physical definitions of the sensitivity back-projection algorithm based on the sensitivity theorem. Simulations and discussion based on the multistep algorithm, the sensitivity coefficient back-projection method and the Newton-Raphson method are given. Examples of imaging gas-liquid mixing and a human hand in brine are presented.

Analysis of Artificial Neural Network Backpropagation Using Conjugate Gradient Fletcher Reeves In The Predicting Process

NASA Astrophysics Data System (ADS)

Wanto, Anjar; Zarlis, Muhammad; Sawaluddin; Hartama, Dedy

2017-12-01

Backpropagation is a good artificial neural network algorithm used to predict, one of which is to predict the rate of Consumer Price Index (CPI) based on the foodstuff sector. While conjugate gradient fletcher reeves is a suitable optimization method when juxtaposed with backpropagation method, because this method can shorten iteration without reducing the quality of training and testing result. Consumer Price Index (CPI) data that will be predicted to come from the Central Statistics Agency (BPS) Pematangsiantar. The results of this study will be expected to contribute to the government in making policies to improve economic growth. In this study, the data obtained will be processed by conducting training and testing with artificial neural network backpropagation by using parameter learning rate 0,01 and target error minimum that is 0.001-0,09. The training network is built with binary and bipolar sigmoid activation functions. After the results with backpropagation are obtained, it will then be optimized using the conjugate gradient fletcher reeves method by conducting the same training and testing based on 5 predefined network architectures. The result, the method used can increase the speed and accuracy result.

Panel flutter optimization by gradient projection

NASA Technical Reports Server (NTRS)

Pierson, B. L.

1975-01-01

A gradient projection optimal control algorithm incorporating conjugate gradient directions of search is described and applied to several minimum weight panel design problems subject to a flutter speed constraint. New numerical solutions are obtained for both simply-supported and clamped homogeneous panels of infinite span for various levels of inplane loading and minimum thickness. The minimum thickness inequality constraint is enforced by a simple transformation of variables.

Metamaterials with gradient negative index of refraction.

PubMed

Pinchuk, Anatoliy O; Schatz, George C

2007-10-01

We propose a new metamaterial with a gradient negative index of refraction, which can focus a collimated beam of light coming from a distant object. A slab of the negative refractive index metamaterial has a focal length that can be tuned by changing the gradient of the negative refractive index. A thin metal film pierced with holes of appropriate size or spacing between them can be used as a metamaterial with the gradient negative index of refraction. We use finite-difference time-domain calculations to show the focusing of a plane electromagnetic wave passing through a system of equidistantly spaced holes in a metal slab with decreasing diameters toward the edges of the slab.

Paramecium swimming in capillary tube

NASA Astrophysics Data System (ADS)

Jana, Saikat; Um, Soong Ho; Jung, Sunghwan

2012-04-01

Swimming organisms in their natural habitat need to navigate through a wide range of geometries and chemical environments. Interaction with boundaries in such situations is ubiquitous and can significantly modify the swimming characteristics of the organism when compared to ideal laboratory conditions. We study the different patterns of ciliary locomotion in glass capillaries of varying diameter and characterize the effect of the solid boundaries on the velocities of the organism. Experimental observations show that Paramecium executes helical trajectories that slowly transition to straight lines as the diameter of the capillary tubes decreases. We predict the swimming velocity in capillaries by modeling the system as a confined cylinder propagating longitudinal metachronal waves that create a finite pressure gradient. Comparing with experiments, we find that such pressure gradient considerations are necessary for modeling finite sized ciliary organisms in restrictive geometries.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

NASA Astrophysics Data System (ADS)

Lin, Guang; Liu, Jiangguo; Mu, Lin; Ye, Xiu

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors. We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.

A study of gradient strengthening based on a finite-deformation gradient crystal-plasticity model

NASA Astrophysics Data System (ADS)

Pouriayevali, Habib; Xu, Bai-Xiang

2017-11-01

A comprehensive study on a finite-deformation gradient crystal-plasticity model which has been derived based on Gurtin's framework (Int J Plast 24:702-725, 2008) is carried out here. This systematic investigation on the different roles of governing components of the model represents the strength of this framework in the prediction of a wide range of hardening behaviors as well as rate-dependent and scale-variation responses in a single crystal. The model is represented in the reference configuration for the purpose of numerical implementation and then implemented in the FEM software ABAQUS via a user-defined subroutine (UEL). Furthermore, a function of accumulation rates of dislocations is employed and viewed as a measure of formation of short-range interactions. Our simulation results reveal that the dissipative gradient strengthening can be identified as a source of isotropic-hardening behavior, which may represent the effect of irrecoverable work introduced by Gurtin and Ohno (J Mech Phys Solids 59:320-343, 2011). Here, the variation of size dependency at different magnitude of a rate-sensitivity parameter is also discussed. Moreover, an observation of effect of a distinctive feature in the model which explains the effect of distortion of crystal lattice in the reference configuration is reported in this study for the first time. In addition, plastic flows in predefined slip systems and expansion of accumulation of GNDs are distinctly observed in varying scales and under different loading conditions.

Limiting similarity and functional diversity along environmental gradients

USGS Publications Warehouse

Schwilk, D.W.; Ackerly, D.D.

2005-01-01

Recent developments in community models emphasize the importance of incorporating stochastic processes (e.g. ecological drift) in models of niche-structured community assembly. We constructed a finite, spatially explicit, lottery model to simulate the distribution of species in a one-dimensional landscape with an underlying gradient in environmental conditions. Our framework combines the potential for ecological drift with environmentally-mediated competition for space in a heterogeneous environment. We examined the influence of niche breadth, dispersal distances, community size (total number of individuals) and the breadth of the environmental gradient on levels of species and functional trait diversity (i.e. differences in niche optima). Three novel results emerge from this model: (1) niche differences between adjacent species (e.g. limiting similarity) increase in smaller communities, because of the interaction of competitive effects and finite population sizes; (2) immigration from a regional species pool, stochasticity and niche-assembly generate a bimodal distribution of species residence times ('transient' and 'resident') under a heterogeneous environment; and (3) the magnitude of environmental heterogeneity has a U-shaped effect on diversity, because of shifts in species richness of resident vs. transient species. These predictions illustrate the potential importance of stochastic (although not necessarily neutral) processes in community assembly. ??2005 Blackwell Publishing Ltd/CNRS.

High-order accurate finite-volume formulations for the pressure gradient force in layered ocean models

NASA Astrophysics Data System (ADS)

Engwirda, Darren; Kelley, Maxwell; Marshall, John

2017-08-01

Discretisation of the horizontal pressure gradient force in layered ocean models is a challenging task, with non-trivial interactions between the thermodynamics of the fluid and the geometry of the layers often leading to numerical difficulties. We present two new finite-volume schemes for the pressure gradient operator designed to address these issues. In each case, the horizontal acceleration is computed as an integration of the contact pressure force that acts along the perimeter of an associated momentum control-volume. A pair of new schemes are developed by exploring different control-volume geometries. Non-linearities in the underlying equation-of-state definitions and thermodynamic profiles are treated using a high-order accurate numerical integration framework, designed to preserve hydrostatic balance in a non-linear manner. Numerical experiments show that the new methods achieve high levels of consistency, maintaining hydrostatic and thermobaric equilibrium in the presence of strongly-sloping layer geometries, non-linear equations-of-state and non-uniform vertical stratification profiles. These results suggest that the new pressure gradient formulations may be appropriate for general circulation models that employ hybrid vertical coordinates and/or terrain-following representations.

Audiomagnetotelluric Data and Preliminary Two-Dimensional Models from Spring, Dry Lake, and Delamar Valleys, Nevada

USGS Publications Warehouse

McPhee, Darcy K.; Chuchel, Bruce A.; Pellerin, Louise

2008-01-01

This report presents audiomagnetotelluric (AMT) data along fourteen profiles in Spring, Delamar, and Dry Lake Valleys, and the corresponding preliminary two-dimensional (2-D) inverse models. The AMT method is a valuable tool for estimating the electrical resistivity of the Earth over depth ranges from a few meters to less than one kilometer, and it is important for revealing subsurface structure and stratigraphy within the Basin and Range province of eastern Nevada, which can be used to define the geohydrologic framework of the region. We collected AMT data by using the Geometrics StrataGem EH4 system. Profiles were 0.7 - 3.2 km in length with station spacing of 50-400 m. Data were recorded in a coordinate system parallel to and perpendicular to the regional geologic-strike direction with Z positive down. We show AMT station locations, sounding curves of apparent resistivity, phase, and coherency, and 2-D models of subsurface resistivity along the profiles. The 2-D inverse models are computed from the transverse electric (TE), transverse magnetic (TM), and TE+TM mode data by using a conjugate gradient, finite-difference method. Preliminary interpretation of the 2-D models defines the structural framework of the basins and the resistivity contrasts between alluvial basin-fill, volcanic units, and carbonate basement rocks.

Repeated Red-Black ordering

NASA Astrophysics Data System (ADS)

Ciarlet, P.

1994-09-01

Hereafter, we describe and analyze, from both a theoretical and a numerical point of view, an iterative method for efficiently solving symmetric elliptic problems with possibly discontinuous coefficients. In the following, we use the Preconditioned Conjugate Gradient method to solve the symmetric positive definite linear systems which arise from the finite element discretization of the problems. We focus our interest on sparse and efficient preconditioners. In order to define the preconditioners, we perform two steps: first we reorder the unknowns and then we carry out a (modified) incomplete factorization of the original matrix. We study numerically and theoretically two preconditioners, the second preconditioner corresponding to the one investigated by Brand and Heinemann [2]. We prove convergence results about the Poisson equation with either Dirichlet or periodic boundary conditions. For a meshsizeh, Brand proved that the condition number of the preconditioned system is bounded byO(h-1/2) for Dirichlet boundary conditions. By slightly modifying the preconditioning process, we prove that the condition number is bounded byO(h-1/3).

Optimal design of solidification processes

NASA Technical Reports Server (NTRS)

Dantzig, Jonathan A.; Tortorelli, Daniel A.

1991-01-01

An optimal design algorithm is presented for the analysis of general solidification processes, and is demonstrated for the growth of GaAs crystals in a Bridgman furnace. The system is optimal in the sense that the prespecified temperature distribution in the solidifying materials is obtained to maximize product quality. The optimization uses traditional numerical programming techniques which require the evaluation of cost and constraint functions and their sensitivities. The finite element method is incorporated to analyze the crystal solidification problem, evaluate the cost and constraint functions, and compute the sensitivities. These techniques are demonstrated in the crystal growth application by determining an optimal furnace wall temperature distribution to obtain the desired temperature profile in the crystal, and hence to maximize the crystal's quality. Several numerical optimization algorithms are studied to determine the proper convergence criteria, effective 1-D search strategies, appropriate forms of the cost and constraint functions, etc. In particular, we incorporate the conjugate gradient and quasi-Newton methods for unconstrained problems. The efficiency and effectiveness of each algorithm is presented in the example problem.

Using the GeoFEST Faulted Region Simulation System

NASA Technical Reports Server (NTRS)

Parker, Jay W.; Lyzenga, Gregory A.; Donnellan, Andrea; Judd, Michele A.; Norton, Charles D.; Baker, Teresa; Tisdale, Edwin R.; Li, Peggy

2004-01-01

GeoFEST (the Geophysical Finite Element Simulation Tool) simulates stress evolution, fault slip and plastic/elastic processes in realistic materials, and so is suitable for earthquake cycle studies in regions such as Southern California. Many new capabilities and means of access for GeoFEST are now supported. New abilities include MPI-based cluster parallel computing using automatic PYRAMID/Parmetis-based mesh partitioning, automatic mesh generation for layered media with rectangular faults, and results visualization that is integrated with remote sensing data. The parallel GeoFEST application has been successfully run on over a half-dozen computers, including Intel Xeon clusters, Itanium II and Altix machines, and the Apple G5 cluster. It is not separately optimized for different machines, but relies on good domain partitioning for load-balance and low communication, and careful writing of the parallel diagonally preconditioned conjugate gradient solver to keep communication overhead low. Demonstrated thousand-step solutions for over a million finite elements on 64 processors require under three hours, and scaling tests show high efficiency when using more than (order of) 4000 elements per processor. The source code and documentation for GeoFEST is available at no cost from Open Channel Foundation. In addition GeoFEST may be used through a browser-based portal environment available to approved users. That environment includes semi-automated geometry creation and mesh generation tools, GeoFEST, and RIVA-based visualization tools that include the ability to generate a flyover animation showing deformations and topography. Work is in progress to support simulation of a region with several faults using 16 million elements, using a strain energy metric to adapt the mesh to faithfully represent the solution in a region of widely varying strain.

A Modulated-Gradient Parametrization for the Large-Eddy Simulation of the Atmospheric Boundary Layer Using the Weather Research and Forecasting Model

NASA Astrophysics Data System (ADS)

Khani, Sina; Porté-Agel, Fernando

2017-12-01

The performance of the modulated-gradient subgrid-scale (SGS) model is investigated using large-eddy simulation (LES) of the neutral atmospheric boundary layer within the weather research and forecasting model. Since the model includes a finite-difference scheme for spatial derivatives, the discretization errors may affect the simulation results. We focus here on understanding the effects of finite-difference schemes on the momentum balance and the mean velocity distribution, and the requirement (or not) of the ad hoc canopy model. We find that, unlike the Smagorinsky and turbulent kinetic energy (TKE) models, the calculated mean velocity and vertical shear using the modulated-gradient model, are in good agreement with Monin-Obukhov similarity theory, without the need for an extra near-wall canopy model. The structure of the near-wall turbulent eddies is better resolved using the modulated-gradient model in comparison with the classical Smagorinsky and TKE models, which are too dissipative and yield unrealistic smoothing of the smallest resolved scales. Moreover, the SGS fluxes obtained from the modulated-gradient model are much smaller near the wall in comparison with those obtained from the regular Smagorinsky and TKE models. The apparent inability of the LES model in reproducing the mean streamwise component of the momentum balance using the total (resolved plus SGS) stress near the surface is probably due to the effect of the discretization errors, which can be calculated a posteriori using the Taylor-series expansion of the resolved velocity field. Overall, we demonstrate that the modulated-gradient model is less dissipative and yields more accurate results in comparison with the classical Smagorinsky model, with similar computational costs.

First production of fluorescent anti-ribonucleoproteins conjugate for diagnostic of rabies in Brazil.

PubMed

Medeiros Caporale, Graciane Maria; Rodrigues da Silva, Andréa de Cássia; Peixoto, Zélia Maria Pinheiro; Chaves, Luciana Botelho; Carrieri, Maria Luiza; Vassão, Ruth Camargo

2009-01-01

The laboratory tests recommended by the World Health Organization for detection of rabies virus and evaluation of specific antibodies are performed with fluorescent antibodies against the virus, the ribonucleoproteins (RNPs), or by monoclonal antibodies. In this study, we purified the rabies virus RNPs for the production of a conjugate presenting sensibility and specificity compatible with commercial reagents. The method employed for the purification of RNPs was ultracentrifugation in cesium chloride gradient, the obtained product being used for immunizing rabbits, from which the hyperimmune sera were collected. The serum used for conjugate production was the one presenting the highest titer (1/2,560) when tested by indirect immunofluorescence. The antibodies were purified by anion exchange chromatography (QAE-Sephadex A-50),conjugated to fluorescein isothiocyanate and separated by gel filtration (Sephadex G-50). The resulting conjugate presented titers of 1/400 and 1/500 when assayed by direct immunofluorescence (DIF) and simplified fluorescence inhibition microtest, respectively. Sensibility and specificity tests were performed by DIF in 100 central nervous system samples of different animal species, presenting 100% matches when compared with the commercial reagent used as standard, independent of the conservation state of the samples. The quality reached by our conjugate will enable the standardization of this reagent for use by the laboratories performing diagnosis of rabies in Brazil, contributing to the intensification of the epidemiological vigilance and research on this disease. Copyright 2009 Wiley-Liss, Inc.

Comparing implementations of penalized weighted least-squares sinogram restoration

PubMed Central

Forthmann, Peter; Koehler, Thomas; Defrise, Michel; La Riviere, Patrick

2010-01-01

Purpose: A CT scanner measures the energy that is deposited in each channel of a detector array by x rays that have been partially absorbed on their way through the object. The measurement process is complex and quantitative measurements are always and inevitably associated with errors, so CT data must be preprocessed prior to reconstruction. In recent years, the authors have formulated CT sinogram preprocessing as a statistical restoration problem in which the goal is to obtain the best estimate of the line integrals needed for reconstruction from the set of noisy, degraded measurements. The authors have explored both penalized Poisson likelihood (PL) and penalized weighted least-squares (PWLS) objective functions. At low doses, the authors found that the PL approach outperforms PWLS in terms of resolution-noise tradeoffs, but at standard doses they perform similarly. The PWLS objective function, being quadratic, is more amenable to computational acceleration than the PL objective. In this work, the authors develop and compare two different methods for implementing PWLS sinogram restoration with the hope of improving computational performance relative to PL in the standard-dose regime. Sinogram restoration is still significant in the standard-dose regime since it can still outperform standard approaches and it allows for correction of effects that are not usually modeled in standard CT preprocessing. Methods: The authors have explored and compared two implementation strategies for PWLS sinogram restoration: (1) A direct matrix-inversion strategy based on the closed-form solution to the PWLS optimization problem and (2) an iterative approach based on the conjugate-gradient algorithm. Obtaining optimal performance from each strategy required modifying the naive off-the-shelf implementations of the algorithms to exploit the particular symmetry and sparseness of the sinogram-restoration problem. For the closed-form approach, the authors subdivided the large matrix inversion into smaller coupled problems and exploited sparseness to minimize matrix operations. For the conjugate-gradient approach, the authors exploited sparseness and preconditioned the problem to speed up convergence. Results: All methods produced qualitatively and quantitatively similar images as measured by resolution-variance tradeoffs and difference images. Despite the acceleration strategies, the direct matrix-inversion approach was found to be uncompetitive with iterative approaches, with a computational burden higher by an order of magnitude or more. The iterative conjugate-gradient approach, however, does appear promising, with computation times half that of the authors’ previous penalized-likelihood implementation. Conclusions: Iterative conjugate-gradient based PWLS sinogram restoration with careful matrix optimizations has computational advantages over direct matrix PWLS inversion and over penalized-likelihood sinogram restoration and can be considered a good alternative in standard-dose regimes. PMID:21158306

RF Pulse Design using Nonlinear Gradient Magnetic Fields

PubMed Central

Kopanoglu, Emre; Constable, R. Todd

2014-01-01

Purpose An iterative k-space trajectory and radio-frequency (RF) pulse design method is proposed for Excitation using Nonlinear Gradient Magnetic fields (ENiGMa). Theory and Methods The spatial encoding functions (SEFs) generated by nonlinear gradient fields (NLGFs) are linearly dependent in Cartesian-coordinates. Left uncorrected, this may lead to flip-angle variations in excitation profiles. In the proposed method, SEFs (k-space samples) are selected using a Matching-Pursuit algorithm, and the RF pulse is designed using a Conjugate-Gradient algorithm. Three variants of the proposed approach are given: the full-algorithm, a computationally-cheaper version, and a third version for designing spoke-based trajectories. The method is demonstrated for various target excitation profiles using simulations and phantom experiments. Results The method is compared to other iterative (Matching-Pursuit and Conjugate Gradient) and non-iterative (coordinate-transformation and Jacobian-based) pulse design methods as well as uniform density spiral and EPI trajectories. The results show that the proposed method can increase excitation fidelity significantly. Conclusion An iterative method for designing k-space trajectories and RF pulses using nonlinear gradient fields is proposed. The method can either be used for selecting the SEFs individually to guide trajectory design, or can be adapted to design and optimize specific trajectories of interest. PMID:25203286

Three-Dimensional Viscous Alternating Direction Implicit Algorithm and Strategies for Shape Optimization

NASA Technical Reports Server (NTRS)

Pandya, Mohagna J.; Baysal, Oktay

1997-01-01

A gradient-based shape optimization based on quasi-analytical sensitivities has been extended for practical three-dimensional aerodynamic applications. The flow analysis has been rendered by a fully implicit, finite-volume formulation of the Euler and Thin-Layer Navier-Stokes (TLNS) equations. Initially, the viscous laminar flow analysis for a wing has been compared with an independent computational fluid dynamics (CFD) code which has been extensively validated. The new procedure has been demonstrated in the design of a cranked arrow wing at Mach 2.4 with coarse- and fine-grid based computations performed with Euler and TLNS equations. The influence of the initial constraints on the geometry and aerodynamics of the optimized shape has been explored. Various final shapes generated for an identical initial problem formulation but with different optimization path options (coarse or fine grid, Euler or TLNS), have been aerodynamically evaluated via a common fine-grid TLNS-based analysis. The initial constraint conditions show significant bearing on the optimization results. Also, the results demonstrate that to produce an aerodynamically efficient design, it is imperative to include the viscous physics in the optimization procedure with the proper resolution. Based upon the present results, to better utilize the scarce computational resources, it is recommended that, a number of viscous coarse grid cases using either a preconditioned bi-conjugate gradient (PbCG) or an alternating-direction-implicit (ADI) method, should initially be employed to improve the optimization problem definition, the design space and initial shape. Optimized shapes should subsequently be analyzed using a high fidelity (viscous with fine-grid resolution) flow analysis to evaluate their true performance potential. Finally, a viscous fine-grid-based shape optimization should be conducted, using an ADI method, to accurately obtain the final optimized shape.

Efficient L1 regularization-based reconstruction for fluorescent molecular tomography using restarted nonlinear conjugate gradient.

PubMed

Shi, Junwei; Zhang, Bin; Liu, Fei; Luo, Jianwen; Bai, Jing

2013-09-15

For the ill-posed fluorescent molecular tomography (FMT) inverse problem, the L1 regularization can protect the high-frequency information like edges while effectively reduce the image noise. However, the state-of-the-art L1 regularization-based algorithms for FMT reconstruction are expensive in memory, especially for large-scale problems. An efficient L1 regularization-based reconstruction algorithm based on nonlinear conjugate gradient with restarted strategy is proposed to increase the computational speed with low memory consumption. The reconstruction results from phantom experiments demonstrate that the proposed algorithm can obtain high spatial resolution and high signal-to-noise ratio, as well as high localization accuracy for fluorescence targets.

New hybrid conjugate gradient methods with the generalized Wolfe line search.

PubMed

Xu, Xiao; Kong, Fan-Yu

2016-01-01

The conjugate gradient method was an efficient technique for solving the unconstrained optimization problem. In this paper, we made a linear combination with parameters β k of the DY method and the HS method, and putted forward the hybrid method of DY and HS. We also proposed the hybrid of FR and PRP by the same mean. Additionally, to present the two hybrid methods, we promoted the Wolfe line search respectively to compute the step size α k of the two hybrid methods. With the new Wolfe line search, the two hybrid methods had descent property and global convergence property of the two hybrid methods that can also be proved.

Noise effect in an improved conjugate gradient algorithm to invert particle size distribution and the algorithm amendment.

PubMed

Wei, Yongjie; Ge, Baozhen; Wei, Yaolin

2009-03-20

In general, model-independent algorithms are sensitive to noise during laser particle size measurement. An improved conjugate gradient algorithm (ICGA) that can be used to invert particle size distribution (PSD) from diffraction data is presented. By use of the ICGA to invert simulated data with multiplicative or additive noise, we determined that additive noise is the main factor that induces distorted results. Thus the ICGA is amended by introduction of an iteration step-adjusting parameter and is used experimentally on simulated data and some samples. The experimental results show that the sensitivity of the ICGA to noise is reduced and the inverted results are in accord with the real PSD.

A conjugate gradient method with descent properties under strong Wolfe line search

NASA Astrophysics Data System (ADS)

Zull, N.; ‘Aini, N.; Shoid, S.; Ghani, N. H. A.; Mohamed, N. S.; Rivaie, M.; Mamat, M.

2017-09-01

The conjugate gradient (CG) method is one of the optimization methods that are often used in practical applications. The continuous and numerous studies conducted on the CG method have led to vast improvements in its convergence properties and efficiency. In this paper, a new CG method possessing the sufficient descent and global convergence properties is proposed. The efficiency of the new CG algorithm relative to the existing CG methods is evaluated by testing them all on a set of test functions using MATLAB. The tests are measured in terms of iteration numbers and CPU time under strong Wolfe line search. Overall, this new method performs efficiently and comparable to the other famous methods.

A new nonlinear conjugate gradient coefficient under strong Wolfe-Powell line search

NASA Astrophysics Data System (ADS)

Mohamed, Nur Syarafina; Mamat, Mustafa; Rivaie, Mohd

2017-08-01

A nonlinear conjugate gradient method (CG) plays an important role in solving a large-scale unconstrained optimization problem. This method is widely used due to its simplicity. The method is known to possess sufficient descend condition and global convergence properties. In this paper, a new nonlinear of CG coefficient βk is presented by employing the Strong Wolfe-Powell inexact line search. The new βk performance is tested based on number of iterations and central processing unit (CPU) time by using MATLAB software with Intel Core i7-3470 CPU processor. Numerical experimental results show that the new βk converge rapidly compared to other classical CG method.

A modified conjugate gradient coefficient with inexact line search for unconstrained optimization

NASA Astrophysics Data System (ADS)

Aini, Nurul; Rivaie, Mohd; Mamat, Mustafa

2016-11-01

Conjugate gradient (CG) method is a line search algorithm mostly known for its wide application in solving unconstrained optimization problems. Its low memory requirements and global convergence properties makes it one of the most preferred method in real life application such as in engineering and business. In this paper, we present a new CG method based on AMR* and CD method for solving unconstrained optimization functions. The resulting algorithm is proven to have both the sufficient descent and global convergence properties under inexact line search. Numerical tests are conducted to assess the effectiveness of the new method in comparison to some previous CG methods. The results obtained indicate that our method is indeed superior.

Method to create gradient index in a polymer

DOEpatents

Dirk, Shawn M; Johnson, Ross Stefan; Boye, Robert; Descour, Michael R; Sweatt, William C; Wheeler, David R; Kaehr, Bryan James

2014-10-14

Novel photo-writable and thermally switchable polymeric materials exhibit a refractive index change of .DELTA.n.gtoreq.1.0 when exposed to UV light or heat. For example, lithography can be used to convert a non-conjugated precursor polymer to a conjugated polymer having a higher index-of-refraction. Further, two-photon lithography can be used to pattern high-spatial frequency structures.

Efficiency of unconstrained minimization techniques in nonlinear analysis

NASA Technical Reports Server (NTRS)

Kamat, M. P.; Knight, N. F., Jr.

1978-01-01

Unconstrained minimization algorithms have been critically evaluated for their effectiveness in solving structural problems involving geometric and material nonlinearities. The algorithms have been categorized as being zeroth, first, or second order depending upon the highest derivative of the function required by the algorithm. The sensitivity of these algorithms to the accuracy of derivatives clearly suggests using analytically derived gradients instead of finite difference approximations. The use of analytic gradients results in better control of the number of minimizations required for convergence to the exact solution.

Global Existence Results for Viscoplasticity at Finite Strain

NASA Astrophysics Data System (ADS)

Mielke, Alexander; Rossi, Riccarda; Savaré, Giuseppe

2018-01-01

We study a model for rate-dependent gradient plasticity at finite strain based on the multiplicative decomposition of the strain tensor, and investigate the existence of global-in-time solutions to the related PDE system. We reveal its underlying structure as a generalized gradient system, where the driving energy functional is highly nonconvex and features the geometric nonlinearities related to finite-strain elasticity as well as the multiplicative decomposition of finite-strain plasticity. Moreover, the dissipation potential depends on the left-invariant plastic rate, and thus depends on the plastic state variable. The existence theory is developed for a class of abstract, nonsmooth, and nonconvex gradient systems, for which we introduce suitable notions of solutions, namely energy-dissipation-balance and energy-dissipation-inequality solutions. Hence, we resort to the toolbox of the direct method of the calculus of variations to check that the specific energy and dissipation functionals for our viscoplastic models comply with the conditions of the general theory.

The discrete adjoint method for parameter identification in multibody system dynamics.

PubMed

Lauß, Thomas; Oberpeilsteiner, Stefan; Steiner, Wolfgang; Nachbagauer, Karin

2018-01-01

The adjoint method is an elegant approach for the computation of the gradient of a cost function to identify a set of parameters. An additional set of differential equations has to be solved to compute the adjoint variables, which are further used for the gradient computation. However, the accuracy of the numerical solution of the adjoint differential equation has a great impact on the gradient. Hence, an alternative approach is the discrete adjoint method , where the adjoint differential equations are replaced by algebraic equations. Therefore, a finite difference scheme is constructed for the adjoint system directly from the numerical time integration method. The method provides the exact gradient of the discretized cost function subjected to the discretized equations of motion.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Guang; Liu, Jiangguo; Mu, Lin

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors.more » We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.« less

Multilayered Magnetic Gelatin Membrane Scaffolds

PubMed Central

Samal, Sangram K.; Goranov, Vitaly; Dash, Mamoni; Russo, Alessandro; Shelyakova, Tatiana; Graziosi, Patrizio; Lungaro, Lisa; Riminucci, Alberto; Uhlarz, Marc; Bañobre-López, Manuel; Rivas, Jose; Herrmannsdörfer, Thomas; Rajadas, Jayakumar; De Smedt, Stefaan; Braeckmans, Kevin; Kaplan, David L.; Dediu, V. Alek

2016-01-01

A versatile approach for the design and fabrication of multilayer magnetic scaffolds with tunable magnetic gradients is described. Multilayer magnetic gelatin membrane scaffolds with intrinsic magnetic gradients were designed to encapsulate magnetized bioagents under an externally applied magnetic field for use in magnetic-field-assisted tissue engineering. The temperature of the individual membranes increased up to 43.7 °C under an applied oscillating magnetic field for 70 s by magnetic hyperthermia, enabling the possibility of inducing a thermal gradient inside the final 3D multilayer magnetic scaffolds. On the basis of finite element method simulations, magnetic gelatin membranes with different concentrations of magnetic nanoparticles were assembled into 3D multilayered scaffolds. A magnetic-gradient-controlled distribution of magnetically labeled stem cells was demonstrated in vitro. This magnetic biomaterial–magnetic cell strategy can be expanded to a number of different magnetic biomaterials for various tissue engineering applications. PMID:26451743

Multilayered Magnetic Gelatin Membrane Scaffolds.

PubMed

Samal, Sangram K; Goranov, Vitaly; Dash, Mamoni; Russo, Alessandro; Shelyakova, Tatiana; Graziosi, Patrizio; Lungaro, Lisa; Riminucci, Alberto; Uhlarz, Marc; Bañobre-López, Manuel; Rivas, Jose; Herrmannsdörfer, Thomas; Rajadas, Jayakumar; De Smedt, Stefaan; Braeckmans, Kevin; Kaplan, David L; Dediu, V Alek

2015-10-21

A versatile approach for the design and fabrication of multilayer magnetic scaffolds with tunable magnetic gradients is described. Multilayer magnetic gelatin membrane scaffolds with intrinsic magnetic gradients were designed to encapsulate magnetized bioagents under an externally applied magnetic field for use in magnetic-field-assisted tissue engineering. The temperature of the individual membranes increased up to 43.7 °C under an applied oscillating magnetic field for 70 s by magnetic hyperthermia, enabling the possibility of inducing a thermal gradient inside the final 3D multilayer magnetic scaffolds. On the basis of finite element method simulations, magnetic gelatin membranes with different concentrations of magnetic nanoparticles were assembled into 3D multilayered scaffolds. A magnetic-gradient-controlled distribution of magnetically labeled stem cells was demonstrated in vitro. This magnetic biomaterial-magnetic cell strategy can be expanded to a number of different magnetic biomaterials for various tissue engineering applications.

Conjugate Heat Transfer Study in Hypersonic Flows

NASA Astrophysics Data System (ADS)

Sahoo, Niranjan; Kulkarni, Vinayak; Peetala, Ravi Kumar

2018-04-01

Coupled and decoupled conjugate heat transfer (CHT) studies are carried out to imitate experimental studies for heat transfer measurement in hypersonic flow regime. The finite volume based solvers are used for analyzing the heat interaction between fluid and solid domains. Temperature and surface heat flux signals are predicted by both coupled and decoupled CHT analysis techniques for hypersonic Mach numbers. These two methodologies are also used to study the effect of different wall materials on surface parameters. Effectiveness of these CHT solvers has been verified for the inverse problem of wall heat flux recovery using various techniques reported in the literature. Both coupled and decoupled CHT techniques are seen to be equally useful for prediction of local temperature and heat flux signals prior to the experiments in hypersonic flows.

Finite Element Analysis of Surface Residual Stress in Functionally Gradient Cemented Carbide Tool

NASA Astrophysics Data System (ADS)

Su, Chuangnan; Liu, Deshun; Tang, Siwen; Li, Pengnan; Qiu, Xinyi

2018-03-01

A component distribution model is proposed for three-component functionally gradient cemented carbide (FGCC) based on electron probe microanalysis results obtained for gradient layer thickness, microstructure, and elemental distribution. The residual surface stress of FGCC-T5 tools occurring during the fabrication process is analyzed using an ANSYS-implemented finite element method (FEM) and X-ray diffraction. A comparison of the experimental and calculated values verifies the feasibility of using FEM to analyze the residual surface stress in FGCC-T5 tools. The effects of the distribution index, geometrical shape, substrate thickness, gradient layer thickness, and position of the cobalt-rich layer on residual surface stress are studied in detail.

Primer vector theory and applications

NASA Technical Reports Server (NTRS)

Jezewski, D. J.

1975-01-01

A method developed to compute two-body, optimal, N-impulse trajectories was presented. The necessary conditions established define the gradient structure of the primer vector and its derivative for any set of boundary conditions and any number of impulses. Inequality constraints, a conjugate gradient iterator technique, and the use of a penalty function were also discussed.

Computational trigonometry

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gustafson, K.

1994-12-31

By means of the author`s earlier theory of antieigenvalues and antieigenvectors, a new computational approach to iterative methods is presented. This enables an explicit trigonometric understanding of iterative convergence and provides new insights into the sharpness of error bounds. Direct applications to Gradient descent, Conjugate gradient, GCR(k), Orthomin, CGN, GMRES, CGS, and other matrix iterative schemes will be given.

Fast conjugate phase image reconstruction based on a Chebyshev approximation to correct for B0 field inhomogeneity and concomitant gradients.

PubMed

Chen, Weitian; Sica, Christopher T; Meyer, Craig H

2008-11-01

Off-resonance effects can cause image blurring in spiral scanning and various forms of image degradation in other MRI methods. Off-resonance effects can be caused by both B0 inhomogeneity and concomitant gradient fields. Previously developed off-resonance correction methods focus on the correction of a single source of off-resonance. This work introduces a computationally efficient method of correcting for B0 inhomogeneity and concomitant gradients simultaneously. The method is a fast alternative to conjugate phase reconstruction, with the off-resonance phase term approximated by Chebyshev polynomials. The proposed algorithm is well suited for semiautomatic off-resonance correction, which works well even with an inaccurate or low-resolution field map. The proposed algorithm is demonstrated using phantom and in vivo data sets acquired by spiral scanning. Semiautomatic off-resonance correction alone is shown to provide a moderate amount of correction for concomitant gradient field effects, in addition to B0 imhomogeneity effects. However, better correction is provided by the proposed combined method. The best results were produced using the semiautomatic version of the proposed combined method.

A forward model and conjugate gradient inversion technique for low-frequency ultrasonic imaging.

PubMed

van Dongen, Koen W A; Wright, William M D

2006-10-01

Emerging methods of hyperthermia cancer treatment require noninvasive temperature monitoring, and ultrasonic techniques show promise in this regard. Various tomographic algorithms are available that reconstruct sound speed or contrast profiles, which can be related to temperature distribution. The requirement of a high enough frequency for adequate spatial resolution and a low enough frequency for adequate tissue penetration is a difficult compromise. In this study, the feasibility of using low frequency ultrasound for imaging and temperature monitoring was investigated. The transient probing wave field had a bandwidth spanning the frequency range 2.5-320.5 kHz. The results from a forward model which computed the propagation and scattering of low-frequency acoustic pressure and velocity wave fields were used to compare three imaging methods formulated within the Born approximation, representing two main types of reconstruction. The first uses Fourier techniques to reconstruct sound-speed profiles from projection or Radon data based on optical ray theory, seen as an asymptotical limit for comparison. The second uses backpropagation and conjugate gradient inversion methods based on acoustical wave theory. The results show that the accuracy in localization was 2.5 mm or better when using low frequencies and the conjugate gradient inversion scheme, which could be used for temperature monitoring.

Improved preconditioned conjugate gradient algorithm and application in 3D inversion of gravity-gradiometry data

NASA Astrophysics Data System (ADS)

Wang, Tai-Han; Huang, Da-Nian; Ma, Guo-Qing; Meng, Zhao-Hai; Li, Ye

2017-06-01

With the continuous development of full tensor gradiometer (FTG) measurement techniques, three-dimensional (3D) inversion of FTG data is becoming increasingly used in oil and gas exploration. In the fast processing and interpretation of large-scale high-precision data, the use of the graphics processing unit process unit (GPU) and preconditioning methods are very important in the data inversion. In this paper, an improved preconditioned conjugate gradient algorithm is proposed by combining the symmetric successive over-relaxation (SSOR) technique and the incomplete Choleksy decomposition conjugate gradient algorithm (ICCG). Since preparing the preconditioner requires extra time, a parallel implement based on GPU is proposed. The improved method is then applied in the inversion of noisecontaminated synthetic data to prove its adaptability in the inversion of 3D FTG data. Results show that the parallel SSOR-ICCG algorithm based on NVIDIA Tesla C2050 GPU achieves a speedup of approximately 25 times that of a serial program using a 2.0 GHz Central Processing Unit (CPU). Real airborne gravity-gradiometry data from Vinton salt dome (southwest Louisiana, USA) are also considered. Good results are obtained, which verifies the efficiency and feasibility of the proposed parallel method in fast inversion of 3D FTG data.

Gradient flows without blow-up for Lefschetz thimbles

DOE PAGES

Tanizaki, Yuya; Nishimura, Hiromichi; Verbaarschot, Jacobus J. M.

2017-10-16

We propose new gradient flows that define Lefschetz thimbles and do not blow up in a finite flow time. Here, we study analytic properties of these gradient flows, and confirm them by numerical tests in simple examples.

Architecting the Finite Element Method Pipeline for the GPU.

PubMed

Fu, Zhisong; Lewis, T James; Kirby, Robert M; Whitaker, Ross T

2014-02-01

The finite element method (FEM) is a widely employed numerical technique for approximating the solution of partial differential equations (PDEs) in various science and engineering applications. Many of these applications benefit from fast execution of the FEM pipeline. One way to accelerate the FEM pipeline is by exploiting advances in modern computational hardware, such as the many-core streaming processors like the graphical processing unit (GPU). In this paper, we present the algorithms and data-structures necessary to move the entire FEM pipeline to the GPU. First we propose an efficient GPU-based algorithm to generate local element information and to assemble the global linear system associated with the FEM discretization of an elliptic PDE. To solve the corresponding linear system efficiently on the GPU, we implement a conjugate gradient method preconditioned with a geometry-informed algebraic multi-grid (AMG) method preconditioner. We propose a new fine-grained parallelism strategy, a corresponding multigrid cycling stage and efficient data mapping to the many-core architecture of GPU. Comparison of our on-GPU assembly versus a traditional serial implementation on the CPU achieves up to an 87 × speedup. Focusing on the linear system solver alone, we achieve a speedup of up to 51 × versus use of a comparable state-of-the-art serial CPU linear system solver. Furthermore, the method compares favorably with other GPU-based, sparse, linear solvers.

Some Finite Difference Solutions of the Laminar Compressible Boundary Layer Showing the Effects of Upstream Transpiration Cooling

NASA Technical Reports Server (NTRS)

Howe, John T.

1959-01-01

Three numerical solutions of the partial differential equations describing the compressible laminar boundary layer are obtained by the finite difference method described in reports by I. Flugge-Lotz, D.C. Baxter, and this author. The solutions apply to steady-state supersonic flow without pressure gradient, over a cold wall and over an adiabatic wall, both having transpiration cooling upstream, and over an adiabatic wall with upstream cooling but without upstream transpiration. It is shown that for a given upstream wall temperature, upstream transpiration cooling affords much better protection to the adiabatic solid wall than does upstream cooling without transpiration. The results of the numerical solutions are compared with those of approximate solutions. The thermal results of the finite difference solution lie between the results of Rubesin and Inouye, and those of Libby and Pallone. When the skin-friction results of one finite difference solution are used in the thermal analysis of Rubesin and Inouye, improved agreement between the thermal results of the two methods of solution is obtained.

Elastic critical moment for bisymmetric steel profiles and its sensitivity by the finite difference method

NASA Astrophysics Data System (ADS)

Kamiński, M.; Supeł, Ł.

2016-02-01

It is widely known that lateral-torsional buckling of a member under bending and warping restraints of its cross-sections in the steel structures are crucial for estimation of their safety and durability. Although engineering codes for steel and aluminum structures support the designer with the additional analytical expressions depending even on the boundary conditions and internal forces diagrams, one may apply alternatively the traditional Finite Element or Finite Difference Methods (FEM, FDM) to determine the so-called critical moment representing this phenomenon. The principal purpose of this work is to compare three different ways of determination of critical moment, also in the context of structural sensitivity analysis with respect to the structural element length. Sensitivity gradients are determined by the use of both analytical and the central finite difference scheme here and contrasted also for analytical, FEM as well as FDM approaches. Computational study is provided for the entire family of the steel I- and H - beams available for the practitioners in this area, and is a basis for further stochastic reliability analysis as well as durability prediction including possible corrosion progress.

HPLC analysis of functionalized poly(amidoamine) dendrimers and the interaction between a folate-dendrimer conjugate and folate binding protein.

PubMed

Shi, Xiangyang; Bi, Xiangdong; Ganser, T Rose; Hong, Seungpyo; Myc, Lukasz A; Desai, Ankur; Holl, Mark M Banaszak; Baker, James R

2006-07-01

Poly(amidoamine) (PAMAM) dendrimers of different generations with carboxyl, acetyl, and hydroxyl terminal groups and a folic acid (FA)-dendrimer conjugate were separated and analyzed using reverse-phase high performance liquid chromatography (HPLC). Analysis of both the individual PAMAM derivatives and the separation of mixed generations can be achieved using a linear gradient 0-50% acetonitrile (ACN) (balance water) within 40 min. We also show that PAMAMs with defined acetylation and carboxylation degrees can be analyzed using HPLC. Furthermore, a generation 5 dendrimer-FA conjugate (G5.75Ac-FA4; Ac denotes acetyl) was analyzed and its specific binding with a bovine folic acid binding protein (FBP) was monitored. The HPLC and sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE) results indicate the formation of three complexes after the binding of G5.75Ac-FA4 with FBP. Dendrimers with FA moieties show much higher specific binding capability with FBP than those without FA moieties. Findings from this study indicate that HPLC is an effective technique not only for characterization and separation of functionalized PAMAM dendrimers and conjugates but also for investigation of the interaction between dendrimers and biomolecules.

Accurate reconstruction of the optical parameter distribution in participating medium based on the frequency-domain radiative transfer equation

NASA Astrophysics Data System (ADS)

Qiao, Yao-Bin; Qi, Hong; Zhao, Fang-Zhou; Ruan, Li-Ming

2016-12-01

Reconstructing the distribution of optical parameters in the participating medium based on the frequency-domain radiative transfer equation (FD-RTE) to probe the internal structure of the medium is investigated in the present work. The forward model of FD-RTE is solved via the finite volume method (FVM). The regularization term formatted by the generalized Gaussian Markov random field model is used in the objective function to overcome the ill-posed nature of the inverse problem. The multi-start conjugate gradient (MCG) method is employed to search the minimum of the objective function and increase the efficiency of convergence. A modified adjoint differentiation technique using the collimated radiative intensity is developed to calculate the gradient of the objective function with respect to the optical parameters. All simulation results show that the proposed reconstruction algorithm based on FD-RTE can obtain the accurate distributions of absorption and scattering coefficients. The reconstructed images of the scattering coefficient have less errors than those of the absorption coefficient, which indicates the former are more suitable to probing the inner structure. Project supported by the National Natural Science Foundation of China (Grant No. 51476043), the Major National Scientific Instruments and Equipment Development Special Foundation of China (Grant No. 51327803), and the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (Grant No. 51121004).

Further insights into normal aortic valve function: role of a compliant aortic root on leaflet opening and valve orifice area.

PubMed

Sripathi, Vangipuram Canchi; Kumar, Ramarathnam Krishna; Balakrishnan, Komarakshi R

2004-03-01

This study aims to find the fundamental differences in the mechanism of opening and closing of a normal aortic valve and a valve with a stiff root, using a dynamic finite element model. A dynamic, finite element model with time varying pressure was used in this study. Shell elements with linear elastic properties for the leaflet and root were used. Two different cases were analyzed: (1) normal leaflets inside a compliant root, and (2) normal leaflets inside a stiff root. A compliant aortic root contributes substantially to the smooth and symmetrical leaflet opening with minimal gradients. In contrast, the leaflet opening inside a stiff root is delayed, asymmetric, and wrinkled. However, this wrinkling is not associated with increased leaflet stresses. In compliant roots, the effective valve orifice area can substantially increase because of increased root pressure and transvalvular gradients. In stiff roots this effect is strikingly absent. A compliant aortic root contributes substantially to smooth and symmetrical leaflet opening with minimal gradients. The compliance also contributes much to the ability of the normal aortic valve to increase its effective valve orifice in response to physiologic demands of exercise. This effect is strikingly absent in stiff roots.

Effects of finite electron temperature on gradient drift instabilities in partially magnetized plasmas

NASA Astrophysics Data System (ADS)

Lakhin, V. P.; Ilgisonis, V. I.; Smolyakov, A. I.; Sorokina, E. A.; Marusov, N. A.

2018-01-01

The gradient-drift instabilities of partially magnetized plasmas in plasma devices with crossed electric and magnetic fields are investigated in the framework of the two-fluid model with finite electron temperature in an inhomogeneous magnetic field. The finite electron Larmor radius (FLR) effects are also included via the gyroviscosity tensor taking into account the magnetic field gradient. This model correctly describes the electron dynamics for k⊥ρe>1 in the sense of Padé approximants (here, k⊥ and ρe are the wavenumber perpendicular to the magnetic field and the electron Larmor radius, respectively). The local dispersion relation for electrostatic plasma perturbations with the frequency in the range between the ion and electron cyclotron frequencies and propagating strictly perpendicular to the magnetic field is derived. The dispersion relation includes the effects of the equilibrium E ×B electron current, finite ion velocity, electron inertia, electron FLR, magnetic field gradients, and Debye length effects. The necessary and sufficient condition of stability is derived, and the stability boundary is found. It is shown that, in general, the electron inertia and FLR effects stabilize the short-wavelength perturbations. In some cases, such effects completely suppress the high-frequency short-wavelength modes so that only the long-wavelength low-frequency (with respect to the lower-hybrid frequency) modes remain unstable.

Finite-frequency sensitivity kernels for head waves

NASA Astrophysics Data System (ADS)

Zhang, Zhigang; Shen, Yang; Zhao, Li

2007-11-01

Head waves are extremely important in determining the structure of the predominantly layered Earth. While several recent studies have shown the diffractive nature and the 3-D Fréchet kernels of finite-frequency turning waves, analogues of head waves in a continuous velocity structure, the finite-frequency effects and sensitivity kernels of head waves are yet to be carefully examined. We present the results of a numerical study focusing on the finite-frequency effects of head waves. Our model has a low-velocity layer over a high-velocity half-space and a cylindrical-shaped velocity perturbation placed beneath the interface at different locations. A 3-D finite-difference method is used to calculate synthetic waveforms. Traveltime and amplitude anomalies are measured by the cross-correlation of synthetic seismograms from models with and without the velocity perturbation and are compared to the 3-D sensitivity kernels constructed from full waveform simulations. The results show that the head wave arrival-time and amplitude are influenced by the velocity structure surrounding the ray path in a pattern that is consistent with the Fresnel zones. Unlike the `banana-doughnut' traveltime sensitivity kernels of turning waves, the traveltime sensitivity of the head wave along the ray path below the interface is weak, but non-zero. Below the ray path, the traveltime sensitivity reaches the maximum (absolute value) at a depth that depends on the wavelength and propagation distance. The sensitivity kernels vary with the vertical velocity gradient in the lower layer, but the variation is relatively small at short propagation distances when the vertical velocity gradient is within the range of the commonly accepted values. Finally, the depression or shoaling of the interface results in increased or decreased sensitivities, respectively, beneath the interface topography.

Design of the sample cell in near-field surface-enhanced Raman scattering by finite difference time domain method

NASA Astrophysics Data System (ADS)

Li, Yaqin; Jian, Guoshu; Wu, Shifa

2006-11-01

The rational design of the sample cell may improve the sensitivity of surface-enhanced Raman scattering (SERS) detection in a high degree. Finite difference time domain (FDTD) simulations of the configuration of Ag film-Ag particles illuminated by plane wave and evanescent wave are performed to provide physical insight for design of the sample cell. Numerical solutions indicate that the sample cell can provide more "hot spots' and the massive field intensity enhancement occurs in these "hot spots'. More information on the nanometer character of the sample can be got because of gradient-field Raman (GFR) of evanescent wave.

Development of Detectability Limits for On-Orbit Inspection of Space Shuttle Wing Leading Edge

NASA Technical Reports Server (NTRS)

Stephan, Ryan A.; Johnson, David G.; Mastropietro, A. J.; Ancarrow, Walt C.

2005-01-01

At the conclusion of the Columbia Accident Investigation, one of the recommendations of the Columbia Accident Investigation Board (CAIB) was that NASA develop and implement an inspection plan for the Reinforced Carbon-Carbon (RCC) system components of the Space Shuttle. To address these issues, a group of scientists and engineers at NASA Langley Research Center proposed the use of an IR camera to inspect the RCC. Any crack in an RCC panel changes the thermal resistance of the material in the direction perpendicular to the crack. The change in thermal resistance can be made visible by introducing a heat flow across the crack and using an IR camera to image the resulting surface temperature distribution. The temperature difference across the crack depends on the change in the thermal resistance, the length of the crack, the local thermal gradient, and the rate of radiation exchange with the environment. This paper describes how the authors derived the minimum thermal gradient detectability limits for a through crack in an RCC panel. This paper will also show, through the use of a transient, 3-dimensional, finite element model, that these minimum gradients naturally exist on-orbit. The results from the finite element model confirm that there are sufficient thermal gradient to detect a crack on 96% of the RCC leading edge.

A conjugate gradient method for solving the non-LTE line radiation transfer problem

NASA Astrophysics Data System (ADS)

Paletou, F.; Anterrieu, E.

2009-12-01

This study concerns the fast and accurate solution of the line radiation transfer problem, under non-LTE conditions. We propose and evaluate an alternative iterative scheme to the classical ALI-Jacobi method, and to the more recently proposed Gauss-Seidel and successive over-relaxation (GS/SOR) schemes. Our study is indeed based on applying a preconditioned bi-conjugate gradient method (BiCG-P). Standard tests, in 1D plane parallel geometry and in the frame of the two-level atom model with monochromatic scattering are discussed. Rates of convergence between the previously mentioned iterative schemes are compared, as are their respective timing properties. The smoothing capability of the BiCG-P method is also demonstrated.

Modelling Schumann resonances from ELF measurements using non-linear optimization methods

NASA Astrophysics Data System (ADS)

Castro, Francisco; Toledo-Redondo, Sergio; Fornieles, Jesús; Salinas, Alfonso; Portí, Jorge; Navarro, Enrique; Sierra, Pablo

2017-04-01

Schumann resonances (SR) can be found in planetary atmospheres, inside the cavity formed by the conducting surface of the planet and the lower ionosphere. They are a powerful tool to investigate both the electric processes that occur in the atmosphere and the characteristics of the surface and the lower ionosphere. In this study, the measurements are obtained in the ELF (Extremely Low Frequency) Juan Antonio Morente station located in the national park of Sierra Nevada. The three first modes, contained in the frequency band between 6 to 25 Hz, will be considered. For each time series recorded by the station, the amplitude spectrum was estimated by using Bartlett averaging. Then, the central frequencies and amplitudes of the SRs were obtained by fitting the spectrum with non-linear functions. In the poster, a study of nonlinear unconstrained optimization methods applied to the estimation of the Schumann Resonances will be presented. Non-linear fit, also known as optimization process, is the procedure followed in obtaining Schumann Resonances from the natural electromagnetic noise. The optimization methods that have been analysed are: Levenberg-Marquardt, Conjugate Gradient, Gradient, Newton and Quasi-Newton. The functions that the different methods fit to data are three lorentzian curves plus a straight line. Gaussian curves have also been considered. The conclusions of this study are outlined in the following paragraphs: i) Natural electromagnetic noise is better fitted using Lorentzian functions; ii) the measurement bandwidth can accelerate the convergence of the optimization method; iii) Gradient method has less convergence and has a highest mean squared error (MSE) between measurement and the fitted function, whereas Levenberg-Marquad, Gradient conjugate method and Cuasi-Newton method give similar results (Newton method presents higher MSE); v) There are differences in the MSE between the parameters that define the fit function, and an interval from 1% to 5% has been found.

Enhanced spatial resolution in fluorescence molecular tomography using restarted L1-regularized nonlinear conjugate gradient algorithm.

PubMed

Shi, Junwei; Liu, Fei; Zhang, Guanglei; Luo, Jianwen; Bai, Jing

2014-04-01

Owing to the high degree of scattering of light through tissues, the ill-posedness of fluorescence molecular tomography (FMT) inverse problem causes relatively low spatial resolution in the reconstruction results. Unlike L2 regularization, L1 regularization can preserve the details and reduce the noise effectively. Reconstruction is obtained through a restarted L1 regularization-based nonlinear conjugate gradient (re-L1-NCG) algorithm, which has been proven to be able to increase the computational speed with low memory consumption. The algorithm consists of inner and outer iterations. In the inner iteration, L1-NCG is used to obtain the L1-regularized results. In the outer iteration, the restarted strategy is used to increase the convergence speed of L1-NCG. To demonstrate the performance of re-L1-NCG in terms of spatial resolution, simulation and physical phantom studies with fluorescent targets located with different edge-to-edge distances were carried out. The reconstruction results show that the re-L1-NCG algorithm has the ability to resolve targets with an edge-to-edge distance of 0.1 cm at a depth of 1.5 cm, which is a significant improvement for FMT.

How cereal grass shoots perceive and respond to gravity

NASA Technical Reports Server (NTRS)

Kaufman, P. B.; Brock, T. G.; Song, I.; Rho, Y. B.; Ghosheh, N. S.

1987-01-01

The leaf-sheath pulvinus of grasses presents a unique system for studying gravitropism, primarily because of its differences from other organs. The mature pulvinus is a discrete organ specialized for gravitropism: it is nongrowing in the absence of gravistimulation and capable of displaying a graviresponse independent of the rest of the plant. In this paper we present a model for gravitropism in pulvini based on recent findings from studies on the mechanisms of graviperception and graviresponse. According to this model, amyloplasts play an essential role in perceiving a change in the orientation of the pulvinus. The perception of this reorientation leads to the enhanced synthesis and release from conjugate of the auxin IAA, and the increased conjugation of gibberellin, on a localized basis. Because there is a graded growth promotion across the gravistimulated pulvinus, it is suggested that the observed hormonal asymmetry is actually an indication of a linear gradient of hormone concentration, as well as hormone response, across the pulvinus. It is further suggested that the linear gradient of hormone concentration may be predominantly the result of local changes in hormone level, rather than a product of hormonal movement into or across the pulvinus.

Algorithms for accelerated convergence of adaptive PCA.

PubMed

Chatterjee, C; Kang, Z; Roychowdhury, V P

2000-01-01

We derive and discuss new adaptive algorithms for principal component analysis (PCA) that are shown to converge faster than the traditional PCA algorithms due to Oja, Sanger, and Xu. It is well known that traditional PCA algorithms that are derived by using gradient descent on an objective function are slow to converge. Furthermore, the convergence of these algorithms depends on appropriate choices of the gain sequences. Since online applications demand faster convergence and an automatic selection of gains, we present new adaptive algorithms to solve these problems. We first present an unconstrained objective function, which can be minimized to obtain the principal components. We derive adaptive algorithms from this objective function by using: 1) gradient descent; 2) steepest descent; 3) conjugate direction; and 4) Newton-Raphson methods. Although gradient descent produces Xu's LMSER algorithm, the steepest descent, conjugate direction, and Newton-Raphson methods produce new adaptive algorithms for PCA. We also provide a discussion on the landscape of the objective function, and present a global convergence proof of the adaptive gradient descent PCA algorithm using stochastic approximation theory. Extensive experiments with stationary and nonstationary multidimensional Gaussian sequences show faster convergence of the new algorithms over the traditional gradient descent methods.We also compare the steepest descent adaptive algorithm with state-of-the-art methods on stationary and nonstationary sequences.

Thermal modeling of nickel-hydrogen battery cells operating under transient orbital conditions

NASA Technical Reports Server (NTRS)

Schrage, Dean S.

1991-01-01

An analytical study of the thermal operating characteristics of nickel-hydrogen battery cells is presented. Combined finite-element and finite-difference techniques are employed to arrive at a computationally efficient composite thermal model representing a series-cell arrangement operating in conjunction with a radiately coupled baseplate and coldplate thermal bus. An aggressive, low-mass design approach indicates that thermal considerations can and should direct the design of the thermal bus arrangement. Special consideration is given to the potential for mixed conductive and convective processes across the hydrogen gap. Results of a compressible flow model are presented and indicate the transfer process is suitably represented by molecular conduction. A high-fidelity thermal model of the cell stack (and related components) indicates the presence of axial and radial temperature gradients. A detailed model of the thermal bus reveals the thermal interaction of individual cells and is imperative for assessing the intercell temperature gradients.

Finite-element modeling and micromagnetic modeling of perpendicular writers

NASA Astrophysics Data System (ADS)

Heinonen, Olle; Bozeman, Steven P.

2006-04-01

We compare finite-element modeling (FEM) and fully micromagnetic modeling results of four prototypical writers for perpendicular recording. In general, the agreement between the two models is quite good in the vicinity of saturated or near-saturated magnetic material, such as the pole tip, for quantities such as the magnetic field, the gradient of the magnetic field and the write width. However, in the vicinity of magnetic material far from saturation, e.g., return pole or trailing edge write shield, there can be large qualitative and quantitative differences.

A Study on Aircraft Structure and Jet Engine

NASA Astrophysics Data System (ADS)

Park, Gil Moon; Park, Hwan Kyu; Kim, Jong Il; Kim, Jin Won; Kim, Jin Heung; Lee, Moo Seok; Chung, Nak Kyu

1985-12-01

The one of critical factor in gas turbine engine performance is high turbine inlet gas temperature. Therefore, the turbine rotor has so many problems which must be considered such as the turbine blade cooling, thermal stress of turbine disk due to severe temperature gradient, turbine rotor tip clearance, under the high operation temperature. The purpose of this study is to provide the temperature distribution and heat flux in turbine disk which is required to considered premensioned problem by the Finite Difference Method and the Finite Element Methods on the steady state condition.

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity

DOE PAGES

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

2018-02-08

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

Conjugation of gold nanoparticles and recombinant human endostatin modulates vascular normalization via interruption of anterior gradient 2-mediated angiogenesis.

PubMed

Pan, Fan; Yang, Wende; Li, Wei; Yang, Xiao-Yan; Liu, Shuhao; Li, Xin; Zhao, Xiaoxu; Ding, Hui; Qin, Li; Pan, Yunlong

2017-07-01

Several studies have revealed the potential of normalizing tumor vessels in anti-angiogenic treatment. Recombinant human endostatin is an anti-angiogenic agent which has been applied in clinical tumor treatment. Our previous research indicated that gold nanoparticles could be a nanoparticle carrier for recombinant human endostatin delivery. The recombinant human endostatin-gold nanoparticle conjugates normalized vessels, which improved chemotherapy. However, the mechanism of recombinant human endostatin-gold nanoparticle-induced vascular normalization has not been explored. Anterior gradient 2 has been reported to be over-expressed in many malignant tumors and involved in tumor angiogenesis. To date, the precise efficacy of recombinant human endostatin-gold nanoparticles on anterior gradient 2-mediated angiogenesis or anterior gradient 2-related signaling cohort remained unknown. In this study, we aimed to explore whether recombinant human endostatin-gold nanoparticles could normalize vessels in metastatic colorectal cancer xenografts, and we further elucidated whether recombinant human endostatin-gold nanoparticles could interrupt anterior gradient 2-induced angiogenesis. In vivo, it was indicated that recombinant human endostatin-gold nanoparticles increased pericyte expression while inhibit vascular endothelial growth factor receptor 2 and anterior gradient 2 expression in metastatic colorectal cancer xenografts. In vitro, we uncovered that recombinant human endostatin-gold nanoparticles reduced cell migration and tube formation induced by anterior gradient 2 in human umbilical vein endothelial cells. Treatment with recombinant human endostatin-gold nanoparticles attenuated anterior gradient 2-mediated activation of MMP2, cMyc, VE-cadherin, phosphorylation of p38, and extracellular signal-regulated protein kinases 1 and 2 (ERK1/2) in human umbilical vein endothelial cells. Our findings demonstrated recombinant human endostatin-gold nanoparticles might normalize vessels by interfering anterior gradient 2-mediated angiogenesis in metastatic colorectal cancer.

Microscope Resolution.

ERIC Educational Resources Information Center

Higbie, J.

1981-01-01

Describes problems using the Jenkins and White approach and standard diffraction theory when dealing with the topic of finite conjugate, point-source resolution and how they may be resolved using the relatively obscure Abbe's sine theorem. (JN)

Multi-color incomplete Cholesky conjugate gradient methods for vector computers. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Poole, E. L.

1986-01-01

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Calixarene-Mediated Liquid-Membrane Transport of Choline Conjugates.

PubMed

Adhikari, Birendra Babu; Fujii, Ayu; Schramm, Michael P

2014-05-01

A series of supramolecular calixarenes efficiently transport distinct molecular species through a liquid membrane when attached to a receptor-complementary choline handle. Calix-[6]arene hexacarboxylic acid was highly effective at transporting different target molecules against a pH gradient. Both carboxylic- and phosphonic-acid-functionalized calix[4]arenes effect transport without requiring a pH or ion gradient. NMR binding studies, two-phase solvent extraction, and three-phase transport experiments reveal the necessary and subtle parameters to effect the transport of molecules attached to a choline "handle". On the other hand, rescorin[4]arene cavitands, which have similar guest recognition profiles, did not transport guest molecules. These developments reveal new approaches towards attempting synthetic-receptor-mediated selective small-molecule transport in vesicular and cellular systems.

Fast conjugate phase image reconstruction based on a Chebyshev approximation to correct for B0 field inhomogeneity and concomitant gradients

PubMed Central

Chen, Weitian; Sica, Christopher T.; Meyer, Craig H.

2008-01-01

Off-resonance effects can cause image blurring in spiral scanning and various forms of image degradation in other MRI methods. Off-resonance effects can be caused by both B0 inhomogeneity and concomitant gradient fields. Previously developed off-resonance correction methods focus on the correction of a single source of off-resonance. This work introduces a computationally efficient method of correcting for B0 inhomogeneity and concomitant gradients simultaneously. The method is a fast alternative to conjugate phase reconstruction, with the off-resonance phase term approximated by Chebyshev polynomials. The proposed algorithm is well suited for semiautomatic off-resonance correction, which works well even with an inaccurate or low-resolution field map. The proposed algorithm is demonstrated using phantom and in vivo data sets acquired by spiral scanning. Semiautomatic off-resonance correction alone is shown to provide a moderate amount of correction for concomitant gradient field effects, in addition to B0 imhomogeneity effects. However, better correction is provided by the proposed combined method. The best results were produced using the semiautomatic version of the proposed combined method. PMID:18956462

Parallel Semi-Implicit Spectral Element Atmospheric Model

NASA Astrophysics Data System (ADS)

Fournier, A.; Thomas, S.; Loft, R.

2001-05-01

The shallow-water equations (SWE) have long been used to test atmospheric-modeling numerical methods. The SWE contain essential wave-propagation and nonlinear effects of more complete models. We present a semi-implicit (SI) improvement of the Spectral Element Atmospheric Model to solve the SWE (SEAM, Taylor et al. 1997, Fournier et al. 2000, Thomas & Loft 2000). SE methods are h-p finite element methods combining the geometric flexibility of size-h finite elements with the accuracy of degree-p spectral methods. Our work suggests that exceptional parallel-computation performance is achievable by a General-Circulation-Model (GCM) dynamical core, even at modest climate-simulation resolutions (>1o). The code derivation involves weak variational formulation of the SWE, Gauss(-Lobatto) quadrature over the collocation points, and Legendre cardinal interpolators. Appropriate weak variation yields a symmetric positive-definite Helmholtz operator. To meet the Ladyzhenskaya-Babuska-Brezzi inf-sup condition and avoid spurious modes, we use a staggered grid. The SI scheme combines leapfrog and Crank-Nicholson schemes for the nonlinear and linear terms respectively. The localization of operations to elements ideally fits the method to cache-based microprocessor computer architectures --derivatives are computed as collections of small (8x8), naturally cache-blocked matrix-vector products. SEAM also has desirable boundary-exchange communication, like finite-difference models. Timings on on the IBM SP and Compaq ES40 supercomputers indicate that the SI code (20-min timestep) requires 1/3 the CPU time of the explicit code (2-min timestep) for T42 resolutions. Both codes scale nearly linearly out to 400 processors. We achieved single-processor performance up to 30% of peak for both codes on the 375-MHz IBM Power-3 processors. Fast computation and linear scaling lead to a useful climate-simulation dycore only if enough model time is computed per unit wall-clock time. An efficient SI solver is essential to substantially increase this rate. Parallel preconditioning for an iterative conjugate-gradient elliptic solver is described. We are building a GCM dycore capable of 200 GF% lOPS sustained performance on clustered RISC/cache architectures using hybrid MPI/OpenMP programming.

Microfluidic immunomagnetic cell separation from whole blood.

PubMed

Bhuvanendran Nair Gourikutty, Sajay; Chang, Chia-Pin; Puiu, Poenar Daniel

2016-02-01

Immunomagnetic-based separation has become a viable technique for the separation of cells and biomolecules. Here we report on the design and analysis of a simple and efficient microfluidic device for high throughput and high efficiency capture of cells tagged with magnetic particles. This is made possible by using a microfluidic chip integrated with customized arrays of permanent magnets capable of creating large magnetic field gradients, which determine the effective capturing of the tagged cells. This method is based on manipulating the cells which are under the influence of a combination of magnetic and fluid dynamic forces in a fluid under laminar flow through a microfluidic chip. A finite element analysis (FEA) model is developed to analyze the cell separation process and predict its behavior, which is validated subsequently by the experimental results. The magnetic field gradients created by various arrangements of magnetic arrays have been simulated using FEA and the influence of these field gradients on cell separation has been studied with the design of our microfluidic chip. The proof-of-concept for the proposed technique is demonstrated by capturing white blood cells (WBCs) from whole human blood. CD45-conjugated magnetic particles were added into whole blood samples to label WBCs and the mixture was flown through our microfluidic device to separate the labeled cells. After the separation process, the remaining WBCs in the elute were counted to determine the capture efficiency, and it was found that more than 99.9% WBCs have been successfully separated from whole blood. The proposed design can be used for positive selection as well as for negative enrichment of rare cells. Copyright © 2015 Elsevier B.V. All rights reserved.

Truncated Conjugate Gradient: An Optimal Strategy for the Analytical Evaluation of the Many-Body Polarization Energy and Forces in Molecular Simulations.

PubMed

Aviat, Félix; Levitt, Antoine; Stamm, Benjamin; Maday, Yvon; Ren, Pengyu; Ponder, Jay W; Lagardère, Louis; Piquemal, Jean-Philip

2017-01-10

We introduce a new class of methods, denoted as Truncated Conjugate Gradient(TCG), to solve the many-body polarization energy and its associated forces in molecular simulations (i.e. molecular dynamics (MD) and Monte Carlo). The method consists in a fixed number of Conjugate Gradient (CG) iterations. TCG approaches provide a scalable solution to the polarization problem at a user-chosen cost and a corresponding optimal accuracy. The optimality of the CG-method guarantees that the number of the required matrix-vector products are reduced to a minimum compared to other iterative methods. This family of methods is non-empirical, fully adaptive, and provides analytical gradients, avoiding therefore any energy drift in MD as compared to popular iterative solvers. Besides speed, one great advantage of this class of approximate methods is that their accuracy is systematically improvable. Indeed, as the CG-method is a Krylov subspace method, the associated error is monotonically reduced at each iteration. On top of that, two improvements can be proposed at virtually no cost: (i) the use of preconditioners can be employed, which leads to the Truncated Preconditioned Conjugate Gradient (TPCG); (ii) since the residual of the final step of the CG-method is available, one additional Picard fixed point iteration ("peek"), equivalent to one step of Jacobi Over Relaxation (JOR) with relaxation parameter ω, can be made at almost no cost. This method is denoted by TCG-n(ω). Black-box adaptive methods to find good choices of ω are provided and discussed. Results show that TPCG-3(ω) is converged to high accuracy (a few kcal/mol) for various types of systems including proteins and highly charged systems at the fixed cost of four matrix-vector products: three CG iterations plus the initial CG descent direction. Alternatively, T(P)CG-2(ω) provides robust results at a reduced cost (three matrix-vector products) and offers new perspectives for long polarizable MD as a production algorithm. The T(P)CG-1(ω) level provides less accurate solutions for inhomogeneous systems, but its applicability to well-conditioned problems such as water is remarkable, with only two matrix-vector product evaluations.

Truncated Conjugate Gradient: An Optimal Strategy for the Analytical Evaluation of the Many-Body Polarization Energy and Forces in Molecular Simulations

PubMed Central

2016-01-01

We introduce a new class of methods, denoted as Truncated Conjugate Gradient(TCG), to solve the many-body polarization energy and its associated forces in molecular simulations (i.e. molecular dynamics (MD) and Monte Carlo). The method consists in a fixed number of Conjugate Gradient (CG) iterations. TCG approaches provide a scalable solution to the polarization problem at a user-chosen cost and a corresponding optimal accuracy. The optimality of the CG-method guarantees that the number of the required matrix-vector products are reduced to a minimum compared to other iterative methods. This family of methods is non-empirical, fully adaptive, and provides analytical gradients, avoiding therefore any energy drift in MD as compared to popular iterative solvers. Besides speed, one great advantage of this class of approximate methods is that their accuracy is systematically improvable. Indeed, as the CG-method is a Krylov subspace method, the associated error is monotonically reduced at each iteration. On top of that, two improvements can be proposed at virtually no cost: (i) the use of preconditioners can be employed, which leads to the Truncated Preconditioned Conjugate Gradient (TPCG); (ii) since the residual of the final step of the CG-method is available, one additional Picard fixed point iteration (“peek”), equivalent to one step of Jacobi Over Relaxation (JOR) with relaxation parameter ω, can be made at almost no cost. This method is denoted by TCG-n(ω). Black-box adaptive methods to find good choices of ω are provided and discussed. Results show that TPCG-3(ω) is converged to high accuracy (a few kcal/mol) for various types of systems including proteins and highly charged systems at the fixed cost of four matrix-vector products: three CG iterations plus the initial CG descent direction. Alternatively, T(P)CG-2(ω) provides robust results at a reduced cost (three matrix-vector products) and offers new perspectives for long polarizable MD as a production algorithm. The T(P)CG-1(ω) level provides less accurate solutions for inhomogeneous systems, but its applicability to well-conditioned problems such as water is remarkable, with only two matrix-vector product evaluations. PMID:28068773

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tanizaki, Yuya; Nishimura, Hiromichi; Verbaarschot, Jacobus J. M.

We propose new gradient flows that define Lefschetz thimbles and do not blow up in a finite flow time. Here, we study analytic properties of these gradient flows, and confirm them by numerical tests in simple examples.

Conjugate-gradient optimization method for orbital-free density functional calculations.

PubMed

Jiang, Hong; Yang, Weitao

2004-08-01

Orbital-free density functional theory as an extension of traditional Thomas-Fermi theory has attracted a lot of interest in the past decade because of developments in both more accurate kinetic energy functionals and highly efficient numerical methodology. In this paper, we developed a conjugate-gradient method for the numerical solution of spin-dependent extended Thomas-Fermi equation by incorporating techniques previously used in Kohn-Sham calculations. The key ingredient of the method is an approximate line-search scheme and a collective treatment of two spin densities in the case of spin-dependent extended Thomas-Fermi problem. Test calculations for a quartic two-dimensional quantum dot system and a three-dimensional sodium cluster Na216 with a local pseudopotential demonstrate that the method is accurate and efficient. (c) 2004 American Institute of Physics.

An efficient impedance method for induced field evaluation based on a stabilized Bi-conjugate gradient algorithm.

PubMed

Wang, Hua; Liu, Feng; Xia, Ling; Crozier, Stuart

2008-11-21

This paper presents a stabilized Bi-conjugate gradient algorithm (BiCGstab) that can significantly improve the performance of the impedance method, which has been widely applied to model low-frequency field induction phenomena in voxel phantoms. The improved impedance method offers remarkable computational advantages in terms of convergence performance and memory consumption over the conventional, successive over-relaxation (SOR)-based algorithm. The scheme has been validated against other numerical/analytical solutions on a lossy, multilayered sphere phantom excited by an ideal coil loop. To demonstrate the computational performance and application capability of the developed algorithm, the induced fields inside a human phantom due to a low-frequency hyperthermia device is evaluated. The simulation results show the numerical accuracy and superior performance of the method.

Sparse reconstruction for quantitative bioluminescence tomography based on the incomplete variables truncated conjugate gradient method.

PubMed

He, Xiaowei; Liang, Jimin; Wang, Xiaorui; Yu, Jingjing; Qu, Xiaochao; Wang, Xiaodong; Hou, Yanbin; Chen, Duofang; Liu, Fang; Tian, Jie

2010-11-22

In this paper, we present an incomplete variables truncated conjugate gradient (IVTCG) method for bioluminescence tomography (BLT). Considering the sparse characteristic of the light source and insufficient surface measurement in the BLT scenarios, we combine a sparseness-inducing (ℓ1 norm) regularization term with a quadratic error term in the IVTCG-based framework for solving the inverse problem. By limiting the number of variables updated at each iterative and combining a variable splitting strategy to find the search direction more efficiently, it obtains fast and stable source reconstruction, even without a priori information of the permissible source region and multispectral measurements. Numerical experiments on a mouse atlas validate the effectiveness of the method. In vivo mouse experimental results further indicate its potential for a practical BLT system.

High-fidelity phase and amplitude control of phase-only computer generated holograms using conjugate gradient minimisation.

PubMed

Bowman, D; Harte, T L; Chardonnet, V; De Groot, C; Denny, S J; Le Goc, G; Anderson, M; Ireland, P; Cassettari, D; Bruce, G D

2017-05-15

We demonstrate simultaneous control of both the phase and amplitude of light using a conjugate gradient minimisation-based hologram calculation technique and a single phase-only spatial light modulator (SLM). A cost function, which incorporates the inner product of the light field with a chosen target field within a defined measure region, is efficiently minimised to create high fidelity patterns in the Fourier plane of the SLM. A fidelity of F = 0.999997 is achieved for a pattern resembling an LG10 mode with a calculated light-usage efficiency of 41.5%. Possible applications of our method in optical trapping and ultracold atoms are presented and we show uncorrected experimental realisation of our patterns with F = 0.97 and 7.8% light efficiency.

A Semi-Implicit, Three-Dimensional Model for Estuarine Circulation

USGS Publications Warehouse

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.

LC-NMR Technique in the Analysis of Phytosterols in Natural Extracts

PubMed Central

Horník, Štěpán; Sajfrtová, Marie; Sýkora, Jan; Březinová, Anna; Wimmer, Zdeněk

2013-01-01

The ability of LC-NMR to detect simultaneously free and conjugated phytosterols in natural extracts was tested. The advantages and disadvantages of a gradient HPLC-NMR method were compared to the fast composition screening using SEC-NMR method. Fractions of free and conjugated phytosterols were isolated and analyzed by isocratic HPLC-NMR methods. The results of qualitative and quantitative analyses were in a good agreement with the literature data. PMID:24455424

Finite Volume Numerical Methods for Aeroheating Rate Calculations from Infrared Thermographic Data

NASA Technical Reports Server (NTRS)

Daryabeigi, Kamran; Berry, Scott A.; Horvath, Thomas J.; Nowak, Robert J.

2006-01-01

The use of multi-dimensional finite volume heat conduction techniques for calculating aeroheating rates from measured global surface temperatures on hypersonic wind tunnel models was investigated. Both direct and inverse finite volume techniques were investigated and compared with the standard one-dimensional semi-infinite technique. Global transient surface temperatures were measured using an infrared thermographic technique on a 0.333-scale model of the Hyper-X forebody in the NASA Langley Research Center 20-Inch Mach 6 Air tunnel. In these tests the effectiveness of vortices generated via gas injection for initiating hypersonic transition on the Hyper-X forebody was investigated. An array of streamwise-orientated heating striations was generated and visualized downstream of the gas injection sites. In regions without significant spatial temperature gradients, one-dimensional techniques provided accurate aeroheating rates. In regions with sharp temperature gradients caused by striation patterns multi-dimensional heat transfer techniques were necessary to obtain more accurate heating rates. The use of the one-dimensional technique resulted in differences of 20% in the calculated heating rates compared to 2-D analysis because it did not account for lateral heat conduction in the model.

On the relation between phase-field crack approximation and gradient damage modelling

NASA Astrophysics Data System (ADS)

Steinke, Christian; Zreid, Imadeddin; Kaliske, Michael

2017-05-01

The finite element implementation of a gradient enhanced microplane damage model is compared to a phase-field model for brittle fracture. Phase-field models and implicit gradient damage models share many similarities despite being conceived from very different standpoints. In both approaches, an additional differential equation and a length scale are introduced. However, while the phase-field method is formulated starting from the description of a crack in fracture mechanics, the gradient method starts from a continuum mechanics point of view. At first, the scope of application for both models is discussed to point out intersections. Then, the analysis of the employed mathematical methods and their rigorous comparison are presented. Finally, numerical examples are introduced to illustrate the findings of the comparison which are summarized in a conclusion at the end of the paper.

Numerical simulation of aerothermal loads in hypersonic engine inlets due to shock impingement

NASA Technical Reports Server (NTRS)

Ramakrishnan, R.

1992-01-01

The effect of shock impingement on an axial corner simulating the inlet of a hypersonic vehicle engine is modeled using a finite-difference procedure. A three-dimensional dynamic grid adaptation procedure is utilized to move the grids to regions with strong flow gradients. The adaptation procedure uses a grid relocation stencil that is valid at both the interior and boundary points of the finite-difference grid. A linear combination of spatial derivatives of specific flow variables, calculated with finite-element interpolation functions, are used as adaptation measures. This computational procedure is used to study laminar and turbulent Mach 6 flows in the axial corner. The description of flow physics and qualitative measures of heat transfer distributions on cowl and strut surfaces obtained from the analysis are compared with experimental observations. Conclusions are drawn regarding the capability of the numerical scheme for enhanced modeling of high-speed compressible flows.

Distributed Memory Parallel Computing with SEAWAT

NASA Astrophysics Data System (ADS)

Verkaik, J.; Huizer, S.; van Engelen, J.; Oude Essink, G.; Ram, R.; Vuik, K.

2017-12-01

Fresh groundwater reserves in coastal aquifers are threatened by sea-level rise, extreme weather conditions, increasing urbanization and associated groundwater extraction rates. To counteract these threats, accurate high-resolution numerical models are required to optimize the management of these precious reserves. The major model drawbacks are long run times and large memory requirements, limiting the predictive power of these models. Distributed memory parallel computing is an efficient technique for reducing run times and memory requirements, where the problem is divided over multiple processor cores. A new Parallel Krylov Solver (PKS) for SEAWAT is presented. PKS has recently been applied to MODFLOW and includes Conjugate Gradient (CG) and Biconjugate Gradient Stabilized (BiCGSTAB) linear accelerators. Both accelerators are preconditioned by an overlapping additive Schwarz preconditioner in a way that: a) subdomains are partitioned using Recursive Coordinate Bisection (RCB) load balancing, b) each subdomain uses local memory only and communicates with other subdomains by Message Passing Interface (MPI) within the linear accelerator, c) it is fully integrated in SEAWAT. Within SEAWAT, the PKS-CG solver replaces the Preconditioned Conjugate Gradient (PCG) solver for solving the variable-density groundwater flow equation and the PKS-BiCGSTAB solver replaces the Generalized Conjugate Gradient (GCG) solver for solving the advection-diffusion equation. PKS supports the third-order Total Variation Diminishing (TVD) scheme for computing advection. Benchmarks were performed on the Dutch national supercomputer (https://userinfo.surfsara.nl/systems/cartesius) using up to 128 cores, for a synthetic 3D Henry model (100 million cells) and the real-life Sand Engine model ( 10 million cells). The Sand Engine model was used to investigate the potential effect of the long-term morphological evolution of a large sand replenishment and climate change on fresh groundwater resources. Speed-ups up to 40 were obtained with the new PKS solver.

Topology optimization of finite strain viscoplastic systems under transient loads

DOE PAGES

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

2018-02-08

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

The Möbius domain wall fermion algorithm

NASA Astrophysics Data System (ADS)

Brower, Richard C.; Neff, Harmut; Orginos, Kostas

2017-11-01

We present a review of the properties of generalized domain wall Fermions, based on a (real) Möbius transformation on the Wilson overlap kernel, discussing their algorithmic efficiency, the degree of explicit chiral violations measured by the residual mass (mres) and the Ward-Takahashi identities. The Möbius class interpolates between Shamir's domain wall operator and Boriçi's domain wall implementation of Neuberger's overlap operator without increasing the number of Dirac applications per conjugate gradient iteration. A new scaling parameter (α) reduces chiral violations at finite fifth dimension (Ls) but yields exactly the same overlap action in the limit Ls → ∞. Through the use of 4d Red/Black preconditioning and optimal tuning for the scaling α(Ls) , we show that chiral symmetry violations are typically reduced by an order of magnitude at fixed Ls. We argue that the residual mass for a tuned Möbius algorithm with α = O(1 /Lsγ) for γ < 1 will eventually fall asymptotically as mres = O(1 /Ls1+γ) in the case of a 5D Hamiltonian with out a spectral gap.

Numerical solution of the Hele-Shaw equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitaker, N.

1987-04-01

An algorithm is presented for approximating the motion of the interface between two immiscible fluids in a Hele-Shaw cell. The interface is represented by a set of volume fractions. We use the Simple Line Interface Calculation method along with the method of fractional steps to transport the interface. The equation of continuity leads to a Poisson equation for the pressure. The Poisson equation is discretized. Near the interface where the velocity field is discontinuous, the discretization is based on a weak formulation of the continuity equation. Interpolation is used on each side of the interface to increase the accuracy ofmore » the algorithm. The weak formulation as well as the interpolation are based on the computed volume fractions. This treatment of the interface is new. The discretized equations are solved by a modified conjugate gradient method. Surface tension is included and the curvature is computed through the use of osculating circles. For perturbations of small amplitude, a surprisingly good agreement is found between the numerical results and linearized perturbation theory. Numerical results are presented for the finite amplitude growth of unstable fingers. 62 refs., 13 figs.« less

The numerical solution of the Helmholtz equation for wave propagation problems in underwater acoustics

NASA Technical Reports Server (NTRS)

Bayliss, A.; Goldstein, C. I.; Turkel, E.

1984-01-01

The Helmholtz Equation (-delta-K(2)n(2))u=0 with a variable index of refraction, n, and a suitable radiation condition at infinity serves as a model for a wide variety of wave propagation problems. A numerical algorithm was developed and a computer code implemented that can effectively solve this equation in the intermediate frequency range. The equation is discretized using the finite element method, thus allowing for the modeling of complicated geometrices (including interfaces) and complicated boundary conditions. A global radiation boundary condition is imposed at the far field boundary that is exact for an arbitrary number of propagating modes. The resulting large, non-selfadjoint system of linear equations with indefinite symmetric part is solved using the preconditioned conjugate gradient method applied to the normal equations. A new preconditioner is developed based on the multigrid method. This preconditioner is vectorizable and is extremely effective over a wide range of frequencies provided the number of grid levels is reduced for large frequencies. A heuristic argument is given that indicates the superior convergence properties of this preconditioner.

DenInv3D: a geophysical software for three-dimensional density inversion of gravity field data

NASA Astrophysics Data System (ADS)

Tian, Yu; Ke, Xiaoping; Wang, Yong

2018-04-01

This paper presents a three-dimensional density inversion software called DenInv3D that operates on gravity and gravity gradient data. The software performs inversion modelling, kernel function calculation, and inversion calculations using the improved preconditioned conjugate gradient (PCG) algorithm. In the PCG algorithm, due to the uncertainty of empirical parameters, such as the Lagrange multiplier, we use the inflection point of the L-curve as the regularisation parameter. The software can construct unequally spaced grids and perform inversions using such grids, which enables changing the resolution of the inversion results at different depths. Through inversion of airborne gradiometry data on the Australian Kauring test site, we discovered that anomalous blocks of different sizes are present within the study area in addition to the central anomalies. The software of DenInv3D can be downloaded from http://159.226.162.30.

Scintillation Reduction using Conjugate-Plane Imaging

NASA Astrophysics Data System (ADS)

Vander Haagen, Gary A.

2017-06-01

All observatories are plagued by atmospheric turbulence exhibited as star scintillation or "twinkle" whether a high altitude adaptive optics research or a 30 cm amateur telescope. It is well known that these disturbances are caused by wind and temperature driven refractive gradients in the atmosphere and limit the ultimate photometric resolution of land-based facilities. One approach identified by Fuchs (1998) for scintillation noise reduction was to create a conjugate image space at the telescope and focus on the dominant conjugate turbulent layer within that space. When focused on the turbulent layer little or no scintillation exists. This technique is described whereby noise reductions of 6 to 11/1 have been experienced with mathematical and optical bench simulations. Discussed is a proof-of-principle conjugate optical train design for an 80 mm, f-7 telescope.

A Newton method for the magnetohydrodynamic equilibrium equations

NASA Astrophysics Data System (ADS)

Oliver, Hilary James

We have developed and implemented a (J, B) space Newton method to solve the full nonlinear three dimensional magnetohydrodynamic equilibrium equations in toroidal geometry. Various cases have been run successfully, demonstrating significant improvement over Picard iteration, including a 3D stellarator equilibrium at β = 2%. The algorithm first solves the equilibrium force balance equation for the current density J, given a guess for the magnetic field B. This step is taken from the Picard-iterative PIES 3D equilibrium code. Next, we apply Newton's method to Ampere's Law by expansion of the functional J(B), which is defined by the first step. An analytic calculation in magnetic coordinates, of how the Pfirsch-Schlüter currents vary in the plasma in response to a small change in the magnetic field, yields the Newton gradient term (analogous to ∇f . δx in Newton's method for f(x) = 0). The algorithm is computationally feasible because we do this analytically, and because the gradient term is flux surface local when expressed in terms of a vector potential in an Ar=0 gauge. The equations are discretized by a hybrid spectral/offset grid finite difference technique, and leading order radial dependence is factored from Fourier coefficients to improve finite- difference accuracy near the polar-like origin. After calculating the Newton gradient term we transfer the equation from the magnetic grid to a fixed background grid, which greatly improves the code's performance.

Representing Matrix Cracks Through Decomposition of the Deformation Gradient Tensor in Continuum Damage Mechanics Methods

NASA Technical Reports Server (NTRS)

Leone, Frank A., Jr.

2015-01-01

A method is presented to represent the large-deformation kinematics of intraply matrix cracks and delaminations in continuum damage mechanics (CDM) constitutive material models. The method involves the additive decomposition of the deformation gradient tensor into 'crack' and 'bulk material' components. The response of the intact bulk material is represented by a reduced deformation gradient tensor, and the opening of an embedded cohesive interface is represented by a normalized cohesive displacement-jump vector. The rotation of the embedded interface is tracked as the material deforms and as the crack opens. The distribution of the total local deformation between the bulk material and the cohesive interface components is determined by minimizing the difference between the cohesive stress and the bulk material stress projected onto the cohesive interface. The improvements to the accuracy of CDM models that incorporate the presented method over existing approaches are demonstrated for a single element subjected to simple shear deformation and for a finite element model of a unidirectional open-hole tension specimen. The material model is implemented as a VUMAT user subroutine for the Abaqus/Explicit finite element software. The presented deformation gradient decomposition method reduces the artificial load transfer across matrix cracks subjected to large shearing deformations, and avoids the spurious secondary failure modes that often occur in analyses based on conventional progressive damage models.

ECP Milestone Report WBS 2.3.4.13 ECP/VTK-m FY18Q1 [MS-18/01-03] Multiblock / Gradients / Release STDA05-5.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Moreland, Kenneth D.; Pugmire, David; Geveci, Berk

The FY18Q1 milestone of the ECP/VTK-m project includes the implementation of a multiblock data set, the completion of a gradients filtering operation, and the release of version 1.1 of the VTK-m software. With the completion of this milestone, the new multiblock data set allows us to iteratively schedule algorithms on composite data structures such as assemblies or hierarchies like AMR. The new gradient algorithms approximate derivatives of fields in 3D structures with finite differences. Finally, the release of VTK-m version 1.1 tags a stable release of the software that can more easily be incorporated into external projects.

Longitudinal gradient coil optimization in the presence of transient eddy currents.

PubMed

Trakic, A; Liu, F; Lopez, H Sanchez; Wang, H; Crozier, S

2007-06-01

The switching of magnetic field gradient coils in magnetic resonance imaging (MRI) inevitably induces transient eddy currents in conducting system components, such as the cryostat vessel. These secondary currents degrade the spatial and temporal performance of the gradient coils, and compensation methods are commonly employed to correct for these distortions. This theoretical study shows that by incorporating the eddy currents into the coil optimization process, it is possible to modify a gradient coil design so that the fields created by the coil and the eddy currents combine together to generate a spatially homogeneous gradient that follows the input pulse. Shielded and unshielded longitudinal gradient coils are used to exemplify this novel approach. To assist in the evaluation of transient eddy currents induced within a realistic cryostat vessel, a low-frequency finite-difference time-domain (FDTD) method using the total-field scattered-field (TFSF) scheme was performed. The simulations demonstrate the effectiveness of the proposed method for optimizing longitudinal gradient fields while taking into account the spatial and temporal behavior of the eddy currents.

RES: Regularized Stochastic BFGS Algorithm

NASA Astrophysics Data System (ADS)

Mokhtari, Aryan; Ribeiro, Alejandro

2014-12-01

RES, a regularized stochastic version of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method is proposed to solve convex optimization problems with stochastic objectives. The use of stochastic gradient descent algorithms is widespread, but the number of iterations required to approximate optimal arguments can be prohibitive in high dimensional problems. Application of second order methods, on the other hand, is impracticable because computation of objective function Hessian inverses incurs excessive computational cost. BFGS modifies gradient descent by introducing a Hessian approximation matrix computed from finite gradient differences. RES utilizes stochastic gradients in lieu of deterministic gradients for both, the determination of descent directions and the approximation of the objective function's curvature. Since stochastic gradients can be computed at manageable computational cost RES is realizable and retains the convergence rate advantages of its deterministic counterparts. Convergence results show that lower and upper bounds on the Hessian egeinvalues of the sample functions are sufficient to guarantee convergence to optimal arguments. Numerical experiments showcase reductions in convergence time relative to stochastic gradient descent algorithms and non-regularized stochastic versions of BFGS. An application of RES to the implementation of support vector machines is developed.

Wide emission-tunable CdTeSe/ZnSe/ZnS core–shell quantum dots and their conjugation with E. coli O-157

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou, Haifeng; Zhou, Guangjun, E-mail: gjzhou@sdu.edu.cn; Zhou, Juan

2015-05-15

Highlights: • QDs with variety morphology were obtained via an injection controlled process. • 3-D PL spectra of core–shell QDs show different excitation wavelength dependence. • The PL intensity of QDs with ZnSe transition layer increases dramatically. • Core–shell QDs were processed into aqueous phase and conjugated with E. coli O-157. - Abstract: Wide emission-tunable and different morphological alloyed CdTeSe quantum dots (QDs), CdTeSe/ZnS and CdTeSe/ZnSe/ZnS core–shell QDs were successfully synthesized via an injection controlled process. The effect of injection procedure and reaction temperature were systematically discussed and the growth mechanism was proposed. Most efficient PL wavelength was correlated withmore » reaction time and temperature. The 3-D PL spectra of spherical bare CdTeSe and core–shell QDs with different passivation showed different excitation wavelength dependency. The PL intensity of CdTeSe/ZnSe/ZnS core–shell QDs increased greatly in comparison with that of CdTeSe and CdTeSe/ZnSe QDs. ZnSe transition layer played an important role in improving the PL intensity by providing a smoothened interface and gradient band offsets. The core–shell QDs were transferred into aqueous phase and successfully conjugated with Escherichia coli O-157. The proposed phase-transfer and bio-labeling strategy may be applicable to various QDs with different compositions.« less

Flow convergence caused by a salinity minimum in a tidal channel

USGS Publications Warehouse

Warner, John C.; Schoellhamer, David H.; Burau, Jon R.; Schladow, S. Geoffrey

2006-01-01

Residence times of dissolved substances and sedimentation rates in tidal channels are affected by residual (tidally averaged) circulation patterns. One influence on these circulation patterns is the longitudinal density gradient. In most estuaries the longitudinal density gradient typically maintains a constant direction. However, a junction of tidal channels can create a local reversal (change in sign) of the density gradient. This can occur due to a difference in the phase of tidal currents in each channel. In San Francisco Bay, the phasing of the currents at the junction of Mare Island Strait and Carquinez Strait produces a local salinity minimum in Mare Island Strait. At the location of a local salinity minimum the longitudinal density gradient reverses direction. This paper presents four numerical models that were used to investigate the circulation caused by the salinity minimum: (1) A simple one-dimensional (1D) finite difference model demonstrates that a local salinity minimum is advected into Mare Island Strait from the junction with Carquinez Strait during flood tide. (2) A three-dimensional (3D) hydrodynamic finite element model is used to compute the tidally averaged circulation in a channel that contains a salinity minimum (a change in the sign of the longitudinal density gradient) and compares that to a channel that contains a longitudinal density gradient in a constant direction. The tidally averaged circulation produced by the salinity minimum is characterized by converging flow at the bed and diverging flow at the surface, whereas the circulation produced by the constant direction gradient is characterized by converging flow at the bed and downstream surface currents. These velocity fields are used to drive both a particle tracking and a sediment transport model. (3) A particle tracking model demonstrates a 30 percent increase in the residence time of neutrally buoyant particles transported through the salinity minimum, as compared to transport through a constant direction density gradient. (4) A sediment transport model demonstrates increased deposition at the near-bed null point of the salinity minimum, as compared to the constant direction gradient null point. These results are corroborated by historically noted large sedimentation rates and a local maximum of selenium accumulation in clams at the null point in Mare Island Strait.

Incompressible spectral-element method: Derivation of equations

NASA Technical Reports Server (NTRS)

Deanna, Russell G.

1993-01-01

A fractional-step splitting scheme breaks the full Navier-Stokes equations into explicit and implicit portions amenable to the calculus of variations. Beginning with the functional forms of the Poisson and Helmholtz equations, we substitute finite expansion series for the dependent variables and derive the matrix equations for the unknown expansion coefficients. This method employs a new splitting scheme which differs from conventional three-step (nonlinear, pressure, viscous) schemes. The nonlinear step appears in the conventional, explicit manner, the difference occurs in the pressure step. Instead of solving for the pressure gradient using the nonlinear velocity, we add the viscous portion of the Navier-Stokes equation from the previous time step to the velocity before solving for the pressure gradient. By combining this 'predicted' pressure gradient with the nonlinear velocity in an explicit term, and the Crank-Nicholson method for the viscous terms, we develop a Helmholtz equation for the final velocity.

Sequential pattern formation governed by signaling gradients

NASA Astrophysics Data System (ADS)

Jörg, David J.; Oates, Andrew C.; Jülicher, Frank

2016-10-01

Rhythmic and sequential segmentation of the embryonic body plan is a vital developmental patterning process in all vertebrate species. However, a theoretical framework capturing the emergence of dynamic patterns of gene expression from the interplay of cell oscillations with tissue elongation and shortening and with signaling gradients, is still missing. Here we show that a set of coupled genetic oscillators in an elongating tissue that is regulated by diffusing and advected signaling molecules can account for segmentation as a self-organized patterning process. This system can form a finite number of segments and the dynamics of segmentation and the total number of segments formed depend strongly on kinetic parameters describing tissue elongation and signaling molecules. The model accounts for existing experimental perturbations to signaling gradients, and makes testable predictions about novel perturbations. The variety of different patterns formed in our model can account for the variability of segmentation between different animal species.

Using time-dependent density functional theory in real time for calculating electronic transport

NASA Astrophysics Data System (ADS)

Schaffhauser, Philipp; Kümmel, Stephan

2016-01-01

We present a scheme for calculating electronic transport within the propagation approach to time-dependent density functional theory. Our scheme is based on solving the time-dependent Kohn-Sham equations on grids in real space and real time for a finite system. We use absorbing and antiabsorbing boundaries for simulating the coupling to a source and a drain. The boundaries are designed to minimize the effects of quantum-mechanical reflections and electrical polarization build-up, which are the major obstacles when calculating transport by applying an external bias to a finite system. We show that the scheme can readily be applied to real molecules by calculating the current through a conjugated molecule as a function of time. By comparing to literature results for the conjugated molecule and to analytic results for a one-dimensional model system we demonstrate the reliability of the concept.

Neuroperformance Imaging

DTIC Science & Technology

2012-10-01

EMBC10.1722. 10. Mitra, P.P., Halperin, B.I.: Effects of finite gradient-pulse widths in pulsed- field - gradient diffusion measurements . Journal of Magnetic ...December 2011 ABSTRACT: The addition of a pair of magnetic field gradient pulses had initially enabled the measurement of spin motion to nuclear mag- netic...introduced a pair of (homogenous) magnetic field gradients into the spin echo experi- ment with the purpose of accurately measuring the scalar diffusion

A modified conjugate gradient method based on the Tikhonov system for computerized tomography (CT).

PubMed

Wang, Qi; Wang, Huaxiang

2011-04-01

During the past few decades, computerized tomography (CT) was widely used for non-destructive testing (NDT) and non-destructive examination (NDE) in the industrial area because of its characteristics of non-invasiveness and visibility. Recently, CT technology has been applied to multi-phase flow measurement. Using the principle of radiation attenuation measurements along different directions through the investigated object with a special reconstruction algorithm, cross-sectional information of the scanned object can be worked out. It is a typical inverse problem and has always been a challenge for its nonlinearity and ill-conditions. The Tikhonov regulation method is widely used for similar ill-posed problems. However, the conventional Tikhonov method does not provide reconstructions with qualities good enough, the relative errors between the reconstructed images and the real distribution should be further reduced. In this paper, a modified conjugate gradient (CG) method is applied to a Tikhonov system (MCGT method) for reconstructing CT images. The computational load is dominated by the number of independent measurements m, and a preconditioner is imported to lower the condition number of the Tikhonov system. Both simulation and experiment results indicate that the proposed method can reduce the computational time and improve the quality of image reconstruction. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

Modeling of Field-Aligned Guided Echoes in the Plasmasphere

NASA Technical Reports Server (NTRS)

Fung, Shing F.; Green, James L.

2004-01-01

The conditions under which high frequency (f>>f(sub uh)) long-range extraordinary-mode discrete field-aligned echoes observed by the Radio Plasma Imager (RPI) on board the Imager for Magnetopause-to-Aurora Global Exploration (IMAGE) satellite in the plasmasphere are investigated by ray tracing modeling. Field-aligned discrete echoes are most commonly observed by RPI in the plasmasphere although they are also observed over the polar cap region. The plasmasphere field-aligned echoes appearing as multiple echo traces at different virtual ranges are attributed to signals reflected successively between conjugate hemispheres that propagate along or nearly along closed geomagnetic field lines. The ray tracing simulations show that field-aligned ducts with as little as 1% density perturbations (depletions) and less than 10 wavelengths wide can guide nearly field-aligned propagating high frequency X mode waves. Effective guidance of wave at a given frequency and wave normal angle (Psi) depends on the cross-field density scale of the duct, such that ducts with stronger density depletions need to be wider in order to maintain the same gradient of refractive index across the magnetic field. While signal guidance by field aligned density gradient without ducting is possible only over the polar region, conjugate field-aligned echoes that have traversed through the equatorial region are most likely guided by ducting.

Uptake and intracellular fate of [14C]sucrose-insulin in perfused rat livers.

PubMed

Surmacz, C A; Wert, J J; Ward, W F; Mortimore, G E

1988-07-01

Insulin was covalently linked to [14C]sucrose by means of cyanuric chloride to provide a label that would remain entrapped within the vacuolar system. The uptake of the conjugate by the perfused rat liver was rapid (half-life = 2.9 min), competitively inhibited by native insulin, and abolished by alkali denaturation. As assessed by its distribution on self-generating gradients of colloidal silica-povidone, label in lysosome-enriched samples of liver taken at different times after the addition of the conjugate moved progressively during 15 min from the plasma membrane into an intermediate peak and then to dense lysosomal fractions. After 30-60 min, the label had equilibrated throughout the lysosomal-vacuolar system. The initial movement from the plasma membrane to the intermediate peak occurred between 2 and 5 min. Because label in the peak could be physically separated from the lysosomal marker, beta-acetylglucosaminidase, by dispersing the sample through the gradient mixture before centrifugation rather than layering it, we concluded that the intermediate particles in question were not lysosomal in nature. On gel-filtration chromatography, label extracted from the intermediate peak did not move with insulin but rather as a broad band of lower molecular weight products, suggesting that insulin is subject to early proteolytic attack within a nonlysosomal compartment.

Calixarene-Mediated Liquid-Membrane Transport of Choline Conjugates

PubMed Central

Adhikari, Birendra Babu; Fujii, Ayu

2015-01-01

A series of supramolecular calixarenes efficiently transport distinct molecular species through a liquid membrane when attached to a receptor-complementary choline handle. Calix-[6]arene hexacarboxylic acid was highly effective at transporting different target molecules against a pH gradient. Both carboxylic- and phosphonic-acid-functionalized calix[4]arenes effect transport without requiring a pH or ion gradient. NMR binding studies, two-phase solvent extraction, and three-phase transport experiments reveal the necessary and subtle parameters to effect the transport of molecules attached to a choline “handle”. On the other hand, rescorin[4]arene cavitands, which have similar guest recognition profiles, did not transport guest molecules. These developments reveal new approaches towards attempting synthetic-receptor-mediated selective small-molecule transport in vesicular and cellular systems. PMID:26161034

Finite element analysis of gradient z-coil induced eddy currents in a permanent MRI magnet.

PubMed

Li, Xia; Xia, Ling; Chen, Wufan; Liu, Feng; Crozier, Stuart; Xie, Dexin

2011-01-01

In permanent magnetic resonance imaging (MRI) systems, pulsed gradient fields induce strong eddy currents in the conducting structures of the magnet body. The gradient field for image encoding is perturbed by these eddy currents leading to MR image distortions. This paper presents a comprehensive finite element (FE) analysis of the eddy current generation in the magnet conductors. In the proposed FE model, the hysteretic characteristics of ferromagnetic materials are considered and a scalar Preisach hysteresis model is employed. The developed FE model was applied to study gradient z-coil induced eddy currents in a 0.5 T permanent MRI device. The simulation results demonstrate that the approach could be effectively used to investigate eddy current problems involving ferromagnetic materials. With the knowledge gained from this eddy current model, our next step is to design a passive magnet structure and active gradient coils to reduce the eddy current effects. Copyright © 2010 Elsevier Inc. All rights reserved.

Using Elman recurrent neural networks with conjugate gradient algorithm in determining the anesthetic the amount of anesthetic medicine to be applied.

PubMed

Güntürkün, Rüştü

2010-08-01

In this study, Elman recurrent neural networks have been defined by using conjugate gradient algorithm in order to determine the depth of anesthesia in the continuation stage of the anesthesia and to estimate the amount of medicine to be applied at that moment. The feed forward neural networks are also used for comparison. The conjugate gradient algorithm is compared with back propagation (BP) for training of the neural Networks. The applied artificial neural network is composed of three layers, namely the input layer, the hidden layer and the output layer. The nonlinear activation function sigmoid (sigmoid function) has been used in the hidden layer and the output layer. EEG data has been recorded with Nihon Kohden 9200 brand 22-channel EEG device. The international 8-channel bipolar 10-20 montage system (8 TB-b system) has been used in assembling the recording electrodes. EEG data have been recorded by being sampled once in every 2 milliseconds. The artificial neural network has been designed so as to have 60 neurons in the input layer, 30 neurons in the hidden layer and 1 neuron in the output layer. The values of the power spectral density (PSD) of 10-second EEG segments which correspond to the 1-50 Hz frequency range; the ratio of the total power of PSD values of the EEG segment at that moment in the same range to the total of PSD values of EEG segment taken prior to the anesthesia.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Poole, E.L.

1986-01-01

This research is concerned with the solution on vector computers of linear systems of equations. Ax = b, where A is a large, sparse symmetric positive definite matrix with non-zero elements lying only along a few diagonals of the matrix. The system is solved using the incomplete Cholesky conjugate gradient method (ICCG). Multi-color orderings are used of the unknowns in the linear system to obtain p-color matrices for which a no-fill block ICCG method is implemented on the CYBER 205 with O(N/p) length vector operations in both the decomposition of A and, more importantly, in the forward and back solvesmore » necessary at each iteration of the method. (N is the number of unknowns and p is a small constant). A p-colored matrix is a matrix that can be partitioned into a p x p block matrix where the diagonal blocks are diagonal matrices. The matrix is stored by diagonals and matrix multiplication by diagonals is used to carry out the decomposition of A and the forward and back solves. Additionally, if the vectors across adjacent blocks line up, then some of the overhead associated with vector startups can be eliminated in the matrix vector multiplication necessary at each conjugate gradient iteration. Necessary and sufficient conditions are given to determine which multi-color orderings of the unknowns correspond to p-color matrices, and a process is indicated for choosing multi-color orderings.« less

Conjugate-gradient preconditioning methods for shift-variant PET image reconstruction.

PubMed

Fessler, J A; Booth, S D

1999-01-01

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inverse problems that are approximately shift-invariant, i.e., for those with approximately block-Toeplitz or block-circulant Hessians. However, in applications with nonuniform noise variance, such as arises from Poisson statistics in emission tomography and in quantum-limited optical imaging, the Hessian of the weighted least-squares objective function is quite shift-variant, and circulant preconditioners perform poorly. Additional shift-variance is caused by edge-preserving regularization methods based on nonquadratic penalty functions. This paper describes new preconditioners that approximate more accurately the Hessian matrices of shift-variant imaging problems. Compared to diagonal or circulant preconditioning, the new preconditioners lead to significantly faster convergence rates for the unconstrained conjugate-gradient (CG) iteration. We also propose a new efficient method for the line-search step required by CG methods. Applications to positron emission tomography (PET) illustrate the method.

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

NASA Technical Reports Server (NTRS)

Madyastha, Raghavendra K.; Aazhang, Behnaam; Henson, Troy F.; Huxhold, Wendy L.

1992-01-01

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Numerical reconstruction of tsunami source using combined seismic, satellite and DART data

NASA Astrophysics Data System (ADS)

Krivorotko, Olga; Kabanikhin, Sergey; Marinin, Igor

2014-05-01

Recent tsunamis, for instance, in Japan (2011), in Sumatra (2004), and at the Indian coast (2004) showed that a system of producing exact and timely information about tsunamis is of a vital importance. Numerical simulation is an effective instrument for providing such information. Bottom relief characteristics and the initial perturbation data (a tsunami source) are required for the direct simulation of tsunamis. The seismic data about the source are usually obtained in a few tens of minutes after an event has occurred (the seismic waves velocity being about five hundred kilometres per minute, while the velocity of tsunami waves is less than twelve kilometres per minute). A difference in the arrival times of seismic and tsunami waves can be used when operationally refining the tsunami source parameters and modelling expected tsunami wave height on the shore. The most suitable physical models related to the tsunamis simulation are based on the shallow water equations. The problem of identification parameters of a tsunami source using additional measurements of a passing wave is called inverse tsunami problem. We investigate three different inverse problems of determining a tsunami source using three different additional data: Deep-ocean Assessment and Reporting of Tsunamis (DART) measurements, satellite wave-form images and seismic data. These problems are severely ill-posed. We apply regularization techniques to control the degree of ill-posedness such as Fourier expansion, truncated singular value decomposition, numerical regularization. The algorithm of selecting the truncated number of singular values of an inverse problem operator which is agreed with the error level in measured data is described and analyzed. In numerical experiment we used gradient methods (Landweber iteration and conjugate gradient method) for solving inverse tsunami problems. Gradient methods are based on minimizing the corresponding misfit function. To calculate the gradient of the misfit function, the adjoint problem is solved. The conservative finite-difference schemes for solving the direct and adjoint problems in the approximation of shallow water are constructed. Results of numerical experiments of the tsunami source reconstruction are presented and discussed. We show that using a combination of three different types of data allows one to increase the stability and efficiency of tsunami source reconstruction. Non-profit organization WAPMERR (World Agency of Planetary Monitoring and Earthquake Risk Reduction) in collaboration with Informap software development department developed the Integrated Tsunami Research and Information System (ITRIS) to simulate tsunami waves and earthquakes, river course changes, coastal zone floods, and risk estimates for coastal constructions at wave run-ups and earthquakes. The special scientific plug-in components are embedded in a specially developed GIS-type graphic shell for easy data retrieval, visualization and processing. This work was supported by the Russian Foundation for Basic Research (project No. 12-01-00773 'Theory and Numerical Methods for Solving Combined Inverse Problems of Mathematical Physics') and interdisciplinary project of SB RAS 14 'Inverse Problems and Applications: Theory, Algorithms, Software'.

Thermodynamics of Gas Turbine Cycles with Analytic Derivatives in OpenMDAO

NASA Technical Reports Server (NTRS)

Gray, Justin; Chin, Jeffrey; Hearn, Tristan; Hendricks, Eric; Lavelle, Thomas; Martins, Joaquim R. R. A.

2016-01-01

A new equilibrium thermodynamics analysis tool was built based on the CEA method using the OpenMDAO framework. The new tool provides forward and adjoint analytic derivatives for use with gradient based optimization algorithms. The new tool was validated against the original CEA code to ensure an accurate analysis and the analytic derivatives were validated against finite-difference approximations. Performance comparisons between analytic and finite difference methods showed a significant speed advantage for the analytic methods. To further test the new analysis tool, a sample optimization was performed to find the optimal air-fuel equivalence ratio, , maximizing combustion temperature for a range of different pressures. Collectively, the results demonstrate the viability of the new tool to serve as the thermodynamic backbone for future work on a full propulsion modeling tool.

Numerical algorithms for scatter-to-attenuation reconstruction in PET: empirical comparison of convergence, acceleration, and the effect of subsets.

PubMed

Berker, Yannick; Karp, Joel S; Schulz, Volkmar

2017-09-01

The use of scattered coincidences for attenuation correction of positron emission tomography (PET) data has recently been proposed. For practical applications, convergence speeds require further improvement, yet there exists a trade-off between convergence speed and the risk of non-convergence. In this respect, a maximum-likelihood gradient-ascent (MLGA) algorithm and a two-branch back-projection (2BP), which was previously proposed, were evaluated. MLGA was combined with the Armijo step size rule; and accelerated using conjugate gradients, Nesterov's momentum method, and data subsets of different sizes. In 2BP, we varied the subset size, an important determinant of convergence speed and computational burden. We used three sets of simulation data to evaluate the impact of a spatial scale factor. The Armijo step size allowed 10-fold increased step sizes compared to native MLGA. Conjugate gradients and Nesterov momentum lead to slightly faster, yet non-uniform convergence; improvements were mostly confined to later iterations, possibly due to the non-linearity of the problem. MLGA with data subsets achieved faster, uniform, and predictable convergence, with a speed-up factor equivalent to the number of subsets and no increase in computational burden. By contrast, 2BP computational burden increased linearly with the number of subsets due to repeated evaluation of the objective function, and convergence was limited to the case of many (and therefore small) subsets, which resulted in high computational burden. Possibilities of improving 2BP appear limited. While general-purpose acceleration methods appear insufficient for MLGA, results suggest that data subsets are a promising way of improving MLGA performance.

Vortex Formation and Particle Transport in a Cross-Field Plasma Sheath.

DTIC Science & Technology

1988-03-20

equations is similar to the cross-field equations of Horton et al.[27], differing by the addition of the first term in Eq.(17), which allows for a finite ...free energy winch maintains -, these structures resides in the temperature difference between tbe reservoir * of hot ions and electrons, which are...temperature gradient. However, the detailed * dynamics of each system, and the physics of the media considered, are, of course, very different . The work

Horizontal density-gradient effects on simulation of flow and transport in the Potomac Estuary

USGS Publications Warehouse

Schaffranek, Raymond W.; Baltzer, Robert A.; ,

1990-01-01

A two-dimensional, depth-integrated, hydrodynamic/transport model of the Potomac Estuary between Indian Head and Morgantown, Md., has been extended to include treatment of baroclinic forcing due to horizontal density gradients. The finite-difference model numerically integrates equations of mass and momentum conservation in conjunction with a transport equation for heat, salt, and constituent fluxes. Lateral and longitudinal density gradients are determined from salinity distributions computed from the convection-diffusion equation and an equation of state that expresses density as a function of temperature and salinity; thus, the hydrodynamic and transport computations are directly coupled. Horizontal density variations are shown to contribute significantly to momentum fluxes determined in the hydrodynamic computation. These fluxes lead to enchanced tidal pumping, and consequently greater dispersion, as is evidenced by numerical simulations. Density gradient effects on tidal propagation and transport behavior are discussed and demonstrated.

Surface Profile and Stress Field Evaluation using Digital Gradient Sensing Method

DOE PAGES

Miao, C.; Sundaram, B. M.; Huang, L.; ...

2016-08-09

Shape and surface topography evaluation from measured orthogonal slope/gradient data is of considerable engineering significance since many full-field optical sensors and interferometers readily output accurate data of that kind. This has applications ranging from metrology of optical and electronic elements (lenses, silicon wafers, thin film coatings), surface profile estimation, wave front and shape reconstruction, to name a few. In this context, a new methodology for surface profile and stress field determination based on a recently introduced non-contact, full-field optical method called digital gradient sensing (DGS) capable of measuring small angular deflections of light rays coupled with a robust finite-difference-based least-squaresmore » integration (HFLI) scheme in the Southwell configuration is advanced here. The method is demonstrated by evaluating (a) surface profiles of mechanically warped silicon wafers and (b) stress gradients near growing cracks in planar phase objects.« less

Finite volume treatment of dispersion-relation-preserving and optimized prefactored compact schemes for wave propagation

NASA Astrophysics Data System (ADS)

Popescu, Mihaela; Shyy, Wei; Garbey, Marc

2005-12-01

In developing suitable numerical techniques for computational aero-acoustics, the dispersion-relation-preserving (DRP) scheme by Tam and co-workers and the optimized prefactored compact (OPC) scheme by Ashcroft and Zhang have shown desirable properties of reducing both dissipative and dispersive errors. These schemes, originally based on the finite difference, attempt to optimize the coefficients for better resolution of short waves with respect to the computational grid while maintaining pre-determined formal orders of accuracy. In the present study, finite volume formulations of both schemes are presented to better handle the nonlinearity and complex geometry encountered in many engineering applications. Linear and nonlinear wave equations, with and without viscous dissipation, have been adopted as the test problems. Highlighting the principal characteristics of the schemes and utilizing linear and nonlinear wave equations with different wavelengths as the test cases, the performance of these approaches is documented. For the linear wave equation, there is no major difference between the DRP and OPC schemes. For the nonlinear wave equations, the finite volume version of both DRP and OPC schemes offers substantially better solutions in regions of high gradient or discontinuity.

Control Theory based Shape Design for the Incompressible Navier-Stokes Equations

NASA Astrophysics Data System (ADS)

Cowles, G.; Martinelli, L.

2003-12-01

A design method for shape optimization in incompressible turbulent viscous flow has been developed and validated for inverse design. The gradient information is determined using a control theory based algorithm. With such an approach, the cost of computing the gradient is negligible. An additional adjoint system must be solved which requires the cost of a single steady state flow solution. Thus, this method has an enormous advantage over traditional finite-difference based algorithms. The method of artificial compressibility is utilized to solve both the flow and adjoint systems. An algebraic turbulence model is used to compute the eddy viscosity. The method is validated using several inverse wing design test cases. In each case, the program must modify the shape of the initial wing such that its pressure distribution matches that of the target wing. Results are shown for the inversion of both finite thickness wings as well as zero thickness wings which can be considered a model of yacht sails.

Scintillation Reduction using Conjugate-Plane Imaging (Abstract)

NASA Astrophysics Data System (ADS)

Vander Haagen, G. A.

2017-12-01

(Abstract only) All observatories are plagued by atmospheric turbulence exhibited as star scintillation or "twinkle" whether a high altitude adaptive optics research or a 30-cm amateur telescope. It is well known that these disturbances are caused by wind and temperature-driven refractive gradients in the atmosphere and limit the ultimate photometric resolution of land-based facilities. One approach identified by Fuchs (1998) for scintillation noise reduction was to create a conjugate image space at the telescope and focus on the dominant conjugate turbulent layer within that space. When focused on the turbulent layer little or no scintillation exists. This technique is described whereby noise reductions of 6 to 11/1 have been experienced with mathematical and optical bench simulations. Discussed is a proof-of-principle conjugate optical train design for an 80-mm, f7 telescope.

Speed and convergence properties of gradient algorithms for optimization of IMRT.

PubMed

Zhang, Xiaodong; Liu, Helen; Wang, Xiaochun; Dong, Lei; Wu, Qiuwen; Mohan, Radhe

2004-05-01

Gradient algorithms are the most commonly employed search methods in the routine optimization of IMRT plans. It is well known that local minima can exist for dose-volume-based and biology-based objective functions. The purpose of this paper is to compare the relative speed of different gradient algorithms, to investigate the strategies for accelerating the optimization process, to assess the validity of these strategies, and to study the convergence properties of these algorithms for dose-volume and biological objective functions. With these aims in mind, we implemented Newton's, conjugate gradient (CG), and the steepest decent (SD) algorithms for dose-volume- and EUD-based objective functions. Our implementation of Newton's algorithm approximates the second derivative matrix (Hessian) by its diagonal. The standard SD algorithm and the CG algorithm with "line minimization" were also implemented. In addition, we investigated the use of a variation of the CG algorithm, called the "scaled conjugate gradient" (SCG) algorithm. To accelerate the optimization process, we investigated the validity of the use of a "hybrid optimization" strategy, in which approximations to calculated dose distributions are used during most of the iterations. Published studies have indicated that getting trapped in local minima is not a significant problem. To investigate this issue further, we first obtained, by trial and error, and starting with uniform intensity distributions, the parameters of the dose-volume- or EUD-based objective functions which produced IMRT plans that satisfied the clinical requirements. Using the resulting optimized intensity distributions as the initial guess, we investigated the possibility of getting trapped in a local minimum. For most of the results presented, we used a lung cancer case. To illustrate the generality of our methods, the results for a prostate case are also presented. For both dose-volume and EUD based objective functions, Newton's method far outperforms other algorithms in terms of speed. The SCG algorithm, which avoids expensive "line minimization," can speed up the standard CG algorithm by at least a factor of 2. For the same initial conditions, all algorithms converge essentially to the same plan. However, we demonstrate that for any of the algorithms studied, starting with previously optimized intensity distributions as the initial guess but for different objective function parameters, the solution frequently gets trapped in local minima. We found that the initial intensity distribution obtained from IMRT optimization utilizing objective function parameters, which favor a specific anatomic structure, would lead to a local minimum corresponding to that structure. Our results indicate that from among the gradient algorithms tested, Newton's method appears to be the fastest by far. Different gradient algorithms have the same convergence properties for dose-volume- and EUD-based objective functions. The hybrid dose calculation strategy is valid and can significantly accelerate the optimization process. The degree of acceleration achieved depends on the type of optimization problem being addressed (e.g., IMRT optimization, intensity modulated beam configuration optimization, or objective function parameter optimization). Under special conditions, gradient algorithms will get trapped in local minima, and reoptimization, starting with the results of previous optimization, will lead to solutions that are generally not significantly different from the local minimum.

Functionalization of quantum rods with oligonucleotides for programmable assembly with DNA origami

NASA Astrophysics Data System (ADS)

Doane, Tennyson L.; Alam, Rabeka; Maye, Mathew M.

2015-02-01

The DNA-mediated self-assembly of CdSe/CdS quantum rods (QRs) onto DNA origami is described. Two QR types with unique optical emission and high polarization were synthesized, and then functionalized with oligonucleotides (ssDNA) using a novel protection-deprotection approach, which harnessed ssDNA's tailorable rigidity and denaturation temperature to increase DNA coverage by reducing non-specific coordination and wrapping. The QR assembly was programmable, and occurred at two different assembly zones that had capture strands in parallel alignment. QRs with different optical properties were assembled, opening up future studies on orientation dependent QR FRET. The QR-origami conjugates could be purified via gel electrophoresis and sucrose gradient ultracentrifugation. Assembly yields, QR stoichiometry and orientation, as well as energy transfer implications were studied in light of QR distances, origami flexibility, and conditions.The DNA-mediated self-assembly of CdSe/CdS quantum rods (QRs) onto DNA origami is described. Two QR types with unique optical emission and high polarization were synthesized, and then functionalized with oligonucleotides (ssDNA) using a novel protection-deprotection approach, which harnessed ssDNA's tailorable rigidity and denaturation temperature to increase DNA coverage by reducing non-specific coordination and wrapping. The QR assembly was programmable, and occurred at two different assembly zones that had capture strands in parallel alignment. QRs with different optical properties were assembled, opening up future studies on orientation dependent QR FRET. The QR-origami conjugates could be purified via gel electrophoresis and sucrose gradient ultracentrifugation. Assembly yields, QR stoichiometry and orientation, as well as energy transfer implications were studied in light of QR distances, origami flexibility, and conditions. Electronic supplementary information (ESI) available: Experimental conditions, DNA origami blueprint and sequences, FRET calculations. Additional Fig. S1-S13. See DOI: 10.1039/c4nr07662a

Deformation of conjugate compliant fault zones induced by the 2013 Mw7.7 Baluchistan (Pakistan) earthquake

NASA Astrophysics Data System (ADS)

Dutta, Rishabh; Wang, Teng; Feng, Guangcai; Harrington, Jonathan; Vasyura-Bathke, Hannes; Jónsson, Sigurjón

2017-04-01

Strain localizations in compliant fault zones (with elastic moduli lower than the surrounding rocks) induced by nearby earthquakes have been detected using geodetic observations in a few cases in the past. Here we observe small-scale changes in interferometric Synthetic Aperture Radar (InSAR) measurements along multiple conjugate faults near the rupture of the 2013 Mw7.7 Baluchistan (Pakistan) earthquake. After removing the main coseismic deformation signal in the interferograms and correcting them for topography-related phase, we observe 2-3 cm signal along several conjugate faults that are 15-30 km from the mainshock fault rupture. These conjugate compliant faults have strikes of N30°E and N45°W. The sense of motion indicates left-lateral deformation across the N30°E faults and right-lateral deformation across the N45°W faults, which suggests the conjugate faults were subjected to extensional coseismic stresses along the WSW-ENE direction. The spacing between the different sets of faults is around 5 to 8 km. We explain the observed strain localizations as an elastic response of the compliant conjugate faults induced by the Baluchistan earthquake. Using 3D Finite Element models (FEM), we impose coseismic static displacements due to the earthquake along the boundaries of the FEM domain to reproduce the coseismic stress changes acting across the compliant faults. The InSAR measurements are used to constrain the geometry and rigidity variations of the compliant faults with respect to the surrounding rocks. The best fitting models show the compliant fault zones to have a width of 0.5 km to 2 km and a reduction of the shear modulus by a factor of 3 to 4. Our study yields similar values as were found for compliant fault zones near the 1992 Landers and the 1999 Hector Mine earthquakes in California, although here the strain localization is occurring on more complex conjugate sets of faults.

Hybrid High-Order methods for finite deformations of hyperelastic materials

NASA Astrophysics Data System (ADS)

Abbas, Mickaël; Ern, Alexandre; Pignet, Nicolas

2018-01-01

We devise and evaluate numerically Hybrid High-Order (HHO) methods for hyperelastic materials undergoing finite deformations. The HHO methods use as discrete unknowns piecewise polynomials of order k≥1 on the mesh skeleton, together with cell-based polynomials that can be eliminated locally by static condensation. The discrete problem is written as the minimization of a broken nonlinear elastic energy where a local reconstruction of the displacement gradient is used. Two HHO methods are considered: a stabilized method where the gradient is reconstructed as a tensor-valued polynomial of order k and a stabilization is added to the discrete energy functional, and an unstabilized method which reconstructs a stable higher-order gradient and circumvents the need for stabilization. Both methods satisfy the principle of virtual work locally with equilibrated tractions. We present a numerical study of the two HHO methods on test cases with known solution and on more challenging three-dimensional test cases including finite deformations with strong shear layers and cavitating voids. We assess the computational efficiency of both methods, and we compare our results to those obtained with an industrial software using conforming finite elements and to results from the literature. The two HHO methods exhibit robust behavior in the quasi-incompressible regime.

An evaluation of a coupled microstructural approach for the analysis of functionally graded composites via the finite-element method

NASA Technical Reports Server (NTRS)

Pindera, Marek-Jerzy; Dunn, Patrick

1995-01-01

A comparison is presented between the predictions of the finite-element analysis and a recently developed higher-order theory for functionally graded materials subjected to a thorough-thickness temperature gradient. In contrast to existing micromechanical theories that utilize classical (i.e., uncoupled) homogenization schemes to calculate micro-level and macro-level stress and displacement fields in materials with uniform or nonuniform fiber spacing (i.e., functionally graded materials), the new theory explicitly couples the microstructural details with the macrostructure of the composite. Previous thermo-elastic analysis has demonstrated that such coupling is necessary when: the temperature gradient is large with respect to the dimension of the reinforcement; the characteristic dimension of the reinforcement is large relative to the global dimensions of the composite and the number of reinforcing fibers or inclusions is small. In these circumstances, the standard micromechanical analyses based on the concept of the representative volume element used to determine average composite properties produce questionable results. The comparison between the predictions of the finite-element method and the higher-order theory presented herein establish the theory's accuracy in predicting thermal and stress fields within composites with a finite number of fibers in the thickness direction subjected to a thorough-thickness thermal gradient.

Fully-Implicit Navier-Stokes (FIN-S)

NASA Technical Reports Server (NTRS)

Kirk, Benjamin S.

2010-01-01

FIN-S is a SUPG finite element code for flow problems under active development at NASA Lyndon B. Johnson Space Center and within PECOS: a) The code is built on top of the libMesh parallel, adaptive finite element library. b) The initial implementation of the code targeted supersonic/hypersonic laminar calorically perfect gas flows & conjugate heat transfer. c) Initial extension to thermochemical nonequilibrium about 9 months ago. d) The technologies in FIN-S have been enhanced through a strongly collaborative research effort with Sandia National Labs.

Geohydrology of, and simulation of ground-water flow in, the Milford-Souhegan glacial-drift aquifer, Milford, New Hampshire

USGS Publications Warehouse

Harte, P.T.; Mack, Thomas J.

1992-01-01

Hydrogeologic data collected since 1990 were assessed and a ground-water-flow model was refined in this study of the Milford-Souhegan glacial-drift aquifer in Milford, New Hampshire. The hydrogeologic data collected were used to refine estimates of hydraulic conductivity and saturated thickness of the aquifer, which were previously calculated during 1988-90. In October 1990, water levels were measured at 124 wells and piezometers, and at 45 stream-seepage sites on the main stem of the Souhegan River, and on small tributary streams overlying the aquifer to improve an understanding of ground-water-flow patterns and stream-seepage gains and losses. Refinement of the ground-water-flow model included a reduction in the number of active cells in layer 2 in the central part of the aquifer, a revision of simulated hydraulic conductivity in model layers 2 and representing the aquifer, incorporation of a new block-centered finite-difference ground-water-flow model, and incorporation of a new solution algorithm and solver (a preconditioned conjugate-gradient algorithm). Refinements to the model resulted in decreases in the difference between calculated and measured heads at 22 wells. The distribution of gains and losses of stream seepage calculated in simulation with the refined model is similar to that calculated in the previous model simulation. The contributing area to the Savage well, under average pumping conditions, decreased by 0.021 square miles from the area calculated in the previous model simulation. The small difference in the contrib- uting recharge area indicates that the additional data did not enhance model simulation and that the conceptual framework for the previous model is accurate.

Aerodynamic shape optimization using preconditioned conjugate gradient methods

NASA Technical Reports Server (NTRS)

Burgreen, Greg W.; Baysal, Oktay

1993-01-01

In an effort to further improve upon the latest advancements made in aerodynamic shape optimization procedures, a systematic study is performed to examine several current solution methodologies as applied to various aspects of the optimization procedure. It is demonstrated that preconditioned conjugate gradient-like methodologies dramatically decrease the computational efforts required for such procedures. The design problem investigated is the shape optimization of the upper and lower surfaces of an initially symmetric (NACA-012) airfoil in inviscid transonic flow and at zero degree angle-of-attack. The complete surface shape is represented using a Bezier-Bernstein polynomial. The present optimization method then automatically obtains supercritical airfoil shapes over a variety of freestream Mach numbers. Furthermore, the best optimization strategy examined resulted in a factor of 8 decrease in computational time as well as a factor of 4 decrease in memory over the most efficient strategies in current use.

On a concurrent element-by-element preconditioned conjugate gradient algorithm for multiple load cases

NASA Technical Reports Server (NTRS)

Watson, Brian; Kamat, M. P.

1990-01-01

Element-by-element preconditioned conjugate gradient (EBE-PCG) algorithms have been advocated for use in parallel/vector processing environments as being superior to the conventional LDL(exp T) decomposition algorithm for single load cases. Although there may be some advantages in using such algorithms for a single load case, when it comes to situations involving multiple load cases, the LDL(exp T) decomposition algorithm would appear to be decidedly more cost-effective. The authors have outlined an EBE-PCG algorithm suitable for multiple load cases and compared its effectiveness to the highly efficient LDL(exp T) decomposition scheme. The proposed algorithm offers almost no advantages over the LDL(exp T) algorithm for the linear problems investigated on the Alliant FX/8. However, there may be some merit in the algorithm in solving nonlinear problems with load incrementation, but that remains to be investigated.

A fast, preconditioned conjugate gradient Toeplitz solver

NASA Technical Reports Server (NTRS)

Pan, Victor; Schrieber, Robert

1989-01-01

A simple factorization is given of an arbitrary hermitian, positive definite matrix in which the factors are well-conditioned, hermitian, and positive definite. In fact, given knowledge of the extreme eigenvalues of the original matrix A, an optimal improvement can be achieved, making the condition numbers of each of the two factors equal to the square root of the condition number of A. This technique is to applied to the solution of hermitian, positive definite Toeplitz systems. Large linear systems with hermitian, positive definite Toeplitz matrices arise in some signal processing applications. A stable fast algorithm is given for solving these systems that is based on the preconditioned conjugate gradient method. The algorithm exploits Toeplitz structure to reduce the cost of an iteration to O(n log n) by applying the fast Fourier Transform to compute matrix-vector products. Matrix factorization is used as a preconditioner.

Improved Conjugate Gradient Bundle Adjustment of Dunhuang Wall Painting Images

NASA Astrophysics Data System (ADS)

Hu, K.; Huang, X.; You, H.

2017-09-01

Bundle adjustment with additional parameters is identified as a critical step for precise orthoimage generation and 3D reconstruction of Dunhuang wall paintings. Due to the introduction of self-calibration parameters and quasi-planar constraints, the structure of coefficient matrix of the reduced normal equation is banded-bordered, making the solving process of bundle adjustment complex. In this paper, Conjugate Gradient Bundle Adjustment (CGBA) method is deduced by calculus of variations. A preconditioning method based on improved incomplete Cholesky factorization is adopt to reduce the condition number of coefficient matrix, as well as to accelerate the iteration rate of CGBA. Both theoretical analysis and experimental results comparison with conventional method indicate that, the proposed method can effectively conquer the ill-conditioned problem of normal equation and improve the calculation efficiency of bundle adjustment with additional parameters considerably, while maintaining the actual accuracy.

Preconditioning strategies for nonlinear conjugate gradient methods, based on quasi-Newton updates

NASA Astrophysics Data System (ADS)

Andrea, Caliciotti; Giovanni, Fasano; Massimo, Roma

2016-10-01

This paper reports two proposals of possible preconditioners for the Nonlinear Conjugate Gradient (NCG) method, in large scale unconstrained optimization. On one hand, the common idea of our preconditioners is inspired to L-BFGS quasi-Newton updates, on the other hand we aim at explicitly approximating in some sense the inverse of the Hessian matrix. Since we deal with large scale optimization problems, we propose matrix-free approaches where the preconditioners are built using symmetric low-rank updating formulae. Our distinctive new contributions rely on using information on the objective function collected as by-product of the NCG, at previous iterations. Broadly speaking, our first approach exploits the secant equation, in order to impose interpolation conditions on the objective function. In the second proposal we adopt and ad hoc modified-secant approach, in order to possibly guarantee some additional theoretical properties.

Low-memory iterative density fitting.

PubMed

Grajciar, Lukáš

2015-07-30

A new low-memory modification of the density fitting approximation based on a combination of a continuous fast multipole method (CFMM) and a preconditioned conjugate gradient solver is presented. Iterative conjugate gradient solver uses preconditioners formed from blocks of the Coulomb metric matrix that decrease the number of iterations needed for convergence by up to one order of magnitude. The matrix-vector products needed within the iterative algorithm are calculated using CFMM, which evaluates them with the linear scaling memory requirements only. Compared with the standard density fitting implementation, up to 15-fold reduction of the memory requirements is achieved for the most efficient preconditioner at a cost of only 25% increase in computational time. The potential of the method is demonstrated by performing density functional theory calculations for zeolite fragment with 2592 atoms and 121,248 auxiliary basis functions on a single 12-core CPU workstation. © 2015 Wiley Periodicals, Inc.

Towards Seismic Tomography Based Upon Adjoint Methods

NASA Astrophysics Data System (ADS)

Tromp, J.; Liu, Q.; Tape, C.; Maggi, A.

2006-12-01

We outline the theory behind tomographic inversions based on 3D reference models, fully numerical 3D wave propagation, and adjoint methods. Our approach involves computing the Fréchet derivatives for tomographic inversions via the interaction between a forward wavefield, propagating from the source to the receivers, and an `adjoint' wavefield, propagating from the receivers back to the source. The forward wavefield is computed using a spectral-element method (SEM) and a heterogeneous wave-speed model, and stored as synthetic seismograms at particular receivers for which there is data. We specify an objective or misfit function that defines a measure of misfit between data and synthetics. For a given receiver, the differences between the data and the synthetics are time reversed and used as the source of the adjoint wavefield. For each earthquake, the interaction between the regular and adjoint wavefields is used to construct finite-frequency sensitivity kernels, which we call event kernel. These kernels may be thought of as weighted sums of measurement-specific banana-donut kernels, with weights determined by the measurements. The overall sensitivity is simply the sum of event kernels, which defines the misfit kernel. The misfit kernel is multiplied by convenient orthonormal basis functions that are embedded in the SEM code, resulting in the gradient of the misfit function, i.e., the Fréchet derivatives. The misfit kernel is multiplied by convenient orthonormal basis functions that are embedded in the SEM code, resulting in the gradient of the misfit function, i.e., the Fréchet derivatives. A conjugate gradient algorithm is used to iteratively improve the model while reducing the misfit function. Using 2D examples for Rayleigh wave phase-speed maps of southern California, we illustrate the construction of the gradient and the minimization algorithm, and consider various tomographic experiments, including source inversions, structural inversions, and joint source-structure inversions. We also illustrate the characteristics of these 3D finite-frequency kernels based upon adjoint simulations for a variety of global arrivals, e.g., Pdiff, P'P', and SKS, and we illustrate how the approach may be used to investigate body- and surface-wave anisotropy. In adjoint tomography any time segment in which the data and synthetics match reasonably well is suitable for measurement, and this implies a much greater number of phases per seismogram can be used compared to classical tomography in which the sensitivity of the measurements is determined analytically for specific arrivals, e.g., P. We use an automated picking algorithm based upon short-term/long-term averages and strict phase and amplitude anomaly criteria to determine arrivals and time windows suitable for measurement. For shallow global events the algorithm typically identifies of the order of 1000~windows suitable for measurement, whereas for a deep event the number can reach 4000. For southern California earthquakes the number of phases is of the order of 100 for a magnitude 4.0 event and up to 450 for a magnitude 5.0 event. We will show examples of event kernels for both global and regional earthquakes. These event kernels form the basis of adjoint tomography.

Self-consistent field calculations of conductance through conjugated molecules at finite bias

NASA Astrophysics Data System (ADS)

Paulsson, Magnus; Stafström, Sven

2001-03-01

Conductance through conjugated molecules have previously been calculated for a large number of systems using the Landauer formula but only a few calculations have included charging effects. In this study we present calculations in the mean field approximation of the conductance of metal-molecule-metal systems using two different kinds of molecules for a large number of configurations and applied biases. The molecules are described in the Pariser-Parr Pople model. Current-voltage (I-V) characteristics and charge distribution of the molecule connected by one dimensional leads to reservoirs is solved within the Hartree-Fock approximation. Charging of the molecule occurs when the chemical potential of the reservoirs approach the resonant tunneling levels. The ensuing potential difference, due to the charging, shifts the tunneling peaks which affects the I-V curves considerably. Asymmetrical interaction with the metal leads, e.g. molecule on a metal surface contacted with an STM-tip, also give asymmetrical I-V curves where the potential of the molecule is shown to more closely follow the potential of the surface. Negative differential conductance is discussed in systems consisting of two weakly coupled molecules.

Finite-element simulation of ceramic drying processes

NASA Astrophysics Data System (ADS)

Keum, Y. T.; Jeong, J. H.; Auh, K. H.

2000-07-01

A finite-element simulation for the drying process of ceramics is performed. The heat and moisture movements in green ceramics caused by the temperature gradient, moisture gradient, conduction, convection and evaporation are considered. The finite-element formulation for solving the temperature and moisture distributions, which not only change the volume but also induce the hygro-thermal stress, is carried out. Employing the internally discontinuous interface elements, the numerical divergence problem arising from sudden changes in heat capacity in the phase zone is solved. In order to verify the reliability of the formulation, the drying process of a coal and the wetting process of a graphite epoxy are simulated and the results are compared with the analytical solution and another investigator's result. Finally, the drying process of a ceramic electric insulator is simulated.

Boundary-layer transition on a plate subjected to simultaneous spanwise and chordwise pressure gradients

NASA Technical Reports Server (NTRS)

Boldman, D. R.; Brinich, P. F.

1974-01-01

The boundary-layer transition on a short plate was studied by means of the china-clay visual technique. The plate model was mounted in a wind tunnel so that it was subjected to small simultaneous spanwise and chordwise pressure gradients. Results of the experimental study, which was performed at three subsonic velocities, indicated that the transition pattern was appreciably curved in the spanwise direction but quite smooth and well behaved. Reasonable comparisons between predictions of transition and experiment were obtained from two finite-difference two-dimensional boundary-layer calculation methods which incorporated transition models based on the concept of a transition intermittency factor.

Characterization of the thermal conductivity for Advanced Toughened Uni-piece Fibrous Insulations

NASA Technical Reports Server (NTRS)

Stewart, David A.; Leiser, Daniel B.

1993-01-01

Advanced Toughened Uni-piece Fibrous Insulations (TUFI) is discussed in terms of their thermal response to an arc-jet air stream. A modification of the existing Ames thermal conductivity program to predict the thermal response of these functionally gradient materials is described in the paper. The modified program was used to evaluate the effect of density, surface porosity, and density gradient through the TUFI materials on the thermal response of these insulations. Predictions using a finite-difference code and calculated thermal conductivity values from the modified program were compared with in-depth temperature measurements taken from TUFI insulations during short exposures to arc-jet hypersonic air streams.

A split finite element algorithm for the compressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Baker, A. J.

1979-01-01

An accurate and efficient numerical solution algorithm is established for solution of the high Reynolds number limit of the Navier-Stokes equations governing the multidimensional flow of a compressible essentially inviscid fluid. Finite element interpolation theory is used within a dissipative formulation established using Galerkin criteria within the Method of Weighted Residuals. An implicit iterative solution algorithm is developed, employing tensor product bases within a fractional steps integration procedure, that significantly enhances solution economy concurrent with sharply reduced computer hardware demands. The algorithm is evaluated for resolution of steep field gradients and coarse grid accuracy using both linear and quadratic tensor product interpolation bases. Numerical solutions for linear and nonlinear, one, two and three dimensional examples confirm and extend the linearized theoretical analyses, and results are compared to competitive finite difference derived algorithms.

Eddy current simulation in thick cylinders of finite length induced by coils of arbitrary geometry.

PubMed

Sanchez Lopez, Hector; Poole, Michael; Crozier, Stuart

2010-12-01

Eddy currents are inevitably induced when time-varying magnetic field gradients interact with the metallic structures of a magnetic resonance imaging (MRI) scanner. The secondary magnetic field produced by this induced current degrades the spatial and temporal performance of the primary field generated by the gradient coils. Although this undesired effect can be minimized by using actively and/or passively shielded gradient coils and current pre-emphasis techniques, a residual eddy current still remains in the MRI scanner structure. Accurate simulation of these eddy currents is important in the successful design of gradient coils and magnet cryostat vessels. Efficient methods for simulating eddy currents are currently restricted to cylindrical-symmetry. The approach presented in this paper divides thick conducting cylinders into thin layers (thinner than the skin depth) and expresses the current density on each as a Fourier series. The coupling between each mode of the Fourier series with every other is modeled with an inductive network method. In this way, the eddy currents induced in realistic cryostat surfaces by coils of arbitrary geometry can be simulated. The new method was validated by simulating a canonical problem and comparing the results against a commercially available software package. An accurate skin depth of 2.76 mm was calculated in 6 min with the new method. The currents induced by an actively shielded x-gradient coil were simulated assuming a finite length cylindrical cryostat consisting of three different conducting materials. Details of the temporal-spatial induced current diffusion process were simulated through all cryostat layers, which could not be efficiently simulated with any other method. With this data, all quantities that depend on the current density, such as the secondary magnetic field, are simply evaluated. Copyright © 2010 Elsevier Inc. All rights reserved.

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

NASA Technical Reports Server (NTRS)

Chew, W. C.; Song, J. M.; Lu, C. C.; Weedon, W. H.

1995-01-01

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

3D Inversion of Induced Polarization Data From Borehole Measurements to Map Subsurface Contaminations of Tetrachloroethylene and Trichloroethylene.

NASA Astrophysics Data System (ADS)

Briggs, V. A.; Sogade, J.; Minsley, B.; Lambert, M.; Coles, D.; Repert, P.; Morgan, F.; Rossabi, J.; Riha, B.

2003-12-01

The purpose of this study is to image contaminant plumes of tetrachloroethylene (PCE) and Trichloroethylene (TCE) in a subsurface environment. PCE and TCE have been used in the metals fabrication industry since the start of the second word war and subsequently millions of tons of these chemicals have been released in to the environment. Once in the water supply these contaminants are difficult to remove and can be toxic at the part per billion level. Remediation at the source of many of these contaminated sites, in the form of vapour extraction, can effectively remove alot of the chemicals but without techniques to delineate the size and shape of the contaminated zone, or to monitor the effectiveness of the remediation effort, it is difficult to quantify the remediation success. Using complex resistivity methods it is possible to determine the spatial extent and concentration of these chemicals due to their effect on the pore space chemistry. Even at parts per billion the contaminantas can significantly alter the IP signature enabling detection. Data were collected from a site in South Carolina where these chemcals are known to have been released in large quantities from the 1950's through to the 1980's. Induced Polarization data were measured in a multi-borehole environment to ensure good data coverage. Data is inverted using a 3D finite difference bi-conjugate gradient method and correlated to ground truth boreholes within the region of interest.

Multigrid and Krylov Subspace Methods for the Discrete Stokes Equations

NASA Technical Reports Server (NTRS)

Elman, Howard C.

1996-01-01

Discretization of the Stokes equations produces a symmetric indefinite system of linear equations. For stable discretizations, a variety of numerical methods have been proposed that have rates of convergence independent of the mesh size used in the discretization. In this paper, we compare the performance of four such methods: variants of the Uzawa, preconditioned conjugate gradient, preconditioned conjugate residual, and multigrid methods, for solving several two-dimensional model problems. The results indicate that where it is applicable, multigrid with smoothing based on incomplete factorization is more efficient than the other methods, but typically by no more than a factor of two. The conjugate residual method has the advantage of being both independent of iteration parameters and widely applicable.

Velocity Gradient Power Functional for Brownian Dynamics.

PubMed

de Las Heras, Daniel; Schmidt, Matthias

2018-01-12

We present an explicit and simple approximation for the superadiabatic excess (over ideal gas) free power functional, admitting the study of the nonequilibrium dynamics of overdamped Brownian many-body systems. The functional depends on the local velocity gradient and is systematically obtained from treating the microscopic stress distribution as a conjugate field. The resulting superadiabatic forces are beyond dynamical density functional theory and are of a viscous nature. Their high accuracy is demonstrated by comparison to simulation results.

Velocity Gradient Power Functional for Brownian Dynamics

NASA Astrophysics Data System (ADS)

de las Heras, Daniel; Schmidt, Matthias

2018-01-01

We present an explicit and simple approximation for the superadiabatic excess (over ideal gas) free power functional, admitting the study of the nonequilibrium dynamics of overdamped Brownian many-body systems. The functional depends on the local velocity gradient and is systematically obtained from treating the microscopic stress distribution as a conjugate field. The resulting superadiabatic forces are beyond dynamical density functional theory and are of a viscous nature. Their high accuracy is demonstrated by comparison to simulation results.

Analysis of the sound field in finite length infinite baffled cylindrical ducts with vibrating walls of finite impedance.

PubMed

Shao, Wei; Mechefske, Chris K

2005-04-01

This paper describes an analytical model of finite cylindrical ducts with infinite flanges. This model is used to investigate the sound radiation characteristics of the gradient coil system of a magnetic resonance imaging (MRI) scanner. The sound field in the duct satisfies both the boundary conditions at the wall and at the open ends. The vibrating cylindrical wall of the duct is assumed to be the only sound source. Different acoustic conditions for the wall (rigid and absorptive) are used in the simulations. The wave reflection phenomenon at the open ends of the finite duct is described by general radiation impedance. The analytical model is validated by the comparison with its counterpart in a commercial code based on the boundary element method (BEM). The analytical model shows significant advantages over the BEM model with better numerical efficiency and a direct relation between the design parameters and the sound field inside the duct.

A New Linearized Crank-Nicolson Mixed Element Scheme for the Extended Fisher-Kolmogorov Equation

PubMed Central

Wang, Jinfeng; Li, Hong; He, Siriguleng; Gao, Wei

2013-01-01

We present a new mixed finite element method for solving the extended Fisher-Kolmogorov (EFK) equation. We first decompose the EFK equation as the two second-order equations, then deal with a second-order equation employing finite element method, and handle the other second-order equation using a new mixed finite element method. In the new mixed finite element method, the gradient ∇u belongs to the weaker (L 2(Ω))2 space taking the place of the classical H(div; Ω) space. We prove some a priori bounds for the solution for semidiscrete scheme and derive a fully discrete mixed scheme based on a linearized Crank-Nicolson method. At the same time, we get the optimal a priori error estimates in L 2 and H 1-norm for both the scalar unknown u and the diffusion term w = −Δu and a priori error estimates in (L 2)2-norm for its gradient χ = ∇u for both semi-discrete and fully discrete schemes. PMID:23864831

A new linearized Crank-Nicolson mixed element scheme for the extended Fisher-Kolmogorov equation.

PubMed

Wang, Jinfeng; Li, Hong; He, Siriguleng; Gao, Wei; Liu, Yang

2013-01-01

We present a new mixed finite element method for solving the extended Fisher-Kolmogorov (EFK) equation. We first decompose the EFK equation as the two second-order equations, then deal with a second-order equation employing finite element method, and handle the other second-order equation using a new mixed finite element method. In the new mixed finite element method, the gradient ∇u belongs to the weaker (L²(Ω))² space taking the place of the classical H(div; Ω) space. We prove some a priori bounds for the solution for semidiscrete scheme and derive a fully discrete mixed scheme based on a linearized Crank-Nicolson method. At the same time, we get the optimal a priori error estimates in L² and H¹-norm for both the scalar unknown u and the diffusion term w = -Δu and a priori error estimates in (L²)²-norm for its gradient χ = ∇u for both semi-discrete and fully discrete schemes.

Simulated Design Strategies for SPECT Collimators to Reduce the Eddy Currents Induced by MRI Gradient Fields

NASA Astrophysics Data System (ADS)

Samoudi, Amine M.; Van Audenhaege, Karen; Vermeeren, Günter; Verhoyen, Gregory; Martens, Luc; Van Holen, Roel; Joseph, Wout

2015-10-01

Combining single photon emission computed tomography (SPECT) with magnetic resonance imaging (MRI) requires the insertion of highly conductive SPECT collimators inside the MRI scanner, resulting in an induced eddy current disturbing the combined system. We reduced the eddy currents due to the insert of a novel tungsten collimator inside transverse and longitudinal gradient coils. The collimator was produced with metal additive manufacturing, that is part of a microSPECT insert for a preclinical SPECT/MRI scanner. We characterized the induced magnetic field due to the gradient field and adapted the collimators to reduce the induced eddy currents. We modeled the x-, y-, and z-gradient coil and the different collimator designs and simulated them with FEKO, a three-dimensional method of moments / finite element methods (MoM/FEM) full-wave simulation tool. We used a time analysis approach to generate the pulsed magnetic field gradient. Simulation results show that the maximum induced field can be reduced by 50.82% in the final design bringing the maximum induced magnetic field to less than 2% of the applied gradient for all the gradient coils. The numerical model was validated with measurements and was proposed as a tool for studying the effect of a SPECT collimator within the MRI gradient coils.

Nanoscale multiphase phase field approach for stress- and temperature-induced martensitic phase transformations with interfacial stresses at finite strains

NASA Astrophysics Data System (ADS)

Basak, Anup; Levitas, Valery I.

2018-04-01

A thermodynamically consistent, novel multiphase phase field approach for stress- and temperature-induced martensitic phase transformations at finite strains and with interfacial stresses has been developed. The model considers a single order parameter to describe the austenite↔martensitic transformations, and another N order parameters describing N variants and constrained to a plane in an N-dimensional order parameter space. In the free energy model coexistence of three or more phases at a single material point (multiphase junction), and deviation of each variant-variant transformation path from a straight line have been penalized. Some shortcomings of the existing models are resolved. Three different kinematic models (KMs) for the transformation deformation gradient tensors are assumed: (i) In KM-I the transformation deformation gradient tensor is a linear function of the Bain tensors for the variants. (ii) In KM-II the natural logarithms of the transformation deformation gradient is taken as a linear combination of the natural logarithm of the Bain tensors multiplied with the interpolation functions. (iii) In KM-III it is derived using the twinning equation from the crystallographic theory. The instability criteria for all the phase transformations have been derived for all the kinematic models, and their comparative study is presented. A large strain finite element procedure has been developed and used for studying the evolution of some complex microstructures in nanoscale samples under various loading conditions. Also, the stresses within variant-variant boundaries, the sample size effect, effect of penalizing the triple junctions, and twinned microstructures have been studied. The present approach can be extended for studying grain growth, solidifications, para↔ferro electric transformations, and diffusive phase transformations.

Conjugate problems of transport phenomena under quasi-steady microaccelerations in realistic spaceflight.

PubMed

Polezhaev, V I; Nikitin, S A

2009-04-01

A new model for spatial convective transport processes conjugated with the measured or calculated realistic quasi-steady microaccelerations is presented. Rotation around the mass center, including accelerated rotation, gravity gradient, and aerodynamical drag are taken into account. New results of the effect on mixing and concentration inhomogeneities of the elementary convective processes are presented. The mixing problem in spacecraft enclosures, concentration inhomogeneities due to convection induced by body forces in realistic spaceflight, and the coupling of this kind of convection with thermocapillary convection on the basis of this model are discussed.

Modeling of field-aligned guided echoes in the plasmasphere

NASA Astrophysics Data System (ADS)

Fung, Shing F.; Green, James L.

2005-01-01

Ray tracing modeling is used to investigate the plasma conditions under which high-frequency (f ≫ fuh) extraordinary mode waves can be guided along geomagnetic field lines. These guided signals have often been observed as long-range discrete echoes in the plasmasphere by the Radio Plasma Imager (RPI) onboard the Imager for Magnetopause-to-Aurora Global Exploration satellite. Field-aligned discrete echoes are most commonly observed by RPI in the plasmasphere, although they are also observed over the polar cap region. The plasmasphere field-aligned echoes appearing as multiple echo traces at different virtual ranges are attributed to signals reflected successively between conjugate hemispheres that propagate along or nearly along closed geomagnetic field lines. The ray tracing simulations show that field-aligned ducts with as little as 1% density perturbations (depletions) and <10 wavelengths wide can guide nearly field-aligned propagating high-frequency X mode waves. Effective guidance of a wave at a given frequency and wave normal angle (Ψ) depends on the cross-field density scale of the duct, such that ducts with stronger density depletions need to be wider in order to maintain the same gradient of refractive index across the magnetic field. While signal guidance by field aligned density gradient without ducting is possible only over the polar region, conjugate field-aligned echoes that have traversed through the equatorial region are most likely guided by ducting.

A new leakage measurement method for damaged seal material

NASA Astrophysics Data System (ADS)

Wang, Shen; Yao, Xue Feng; Yang, Heng; Yuan, Li; Dong, Yi Feng

2018-07-01

In this paper, a new leakage measurement method based on the temperature field and temperature gradient field is proposed for detecting the leakage location and measuring the leakage rate in damaged seal material. First, a heat transfer leakage model is established, which can calculate the leakage rate based on the temperature gradient field near the damaged zone. Second, a finite element model of an infinite plate with a damaged zone is built to calculate the leakage rate, which fits the simulated leakage rate well. Finally, specimens in a tubular rubber seal with different damage shapes are used to conduct the leakage experiment, validating the correctness of this new measurement principle for the leakage rate and the leakage position. The results indicate the feasibility of the leakage measurement method for damaged seal material based on the temperature gradient field from infrared thermography.

Suppression of Electron Thermal Conduction by Whistler Turbulence in a Sustained Thermal Gradient

NASA Astrophysics Data System (ADS)

Roberg-Clark, G. T.; Drake, J. F.; Reynolds, C. S.; Swisdak, M.

2018-01-01

The dynamics of weakly magnetized collisionless plasmas in the presence of an imposed temperature gradient along an ambient magnetic field is explored with particle-in-cell simulations and modeling. Two thermal reservoirs at different temperatures drive an electron heat flux that destabilizes off-angle whistler-type modes. The whistlers grow to large amplitude, δ B /B0≃1 , and resonantly scatter the electrons, significantly reducing the heat flux. Surprisingly, the resulting steady-state heat flux is largely independent of the thermal gradient. The rate of thermal conduction is instead controlled by the finite propagation speed of the whistlers, which act as mobile scattering centers that convect the thermal energy of the hot reservoir. The results are relevant to thermal transport in high-β astrophysical plasmas such as hot accretion flows and the intracluster medium of galaxy clusters.

Preclinical manufacture of anti-HER2 liposome-inserting, scFv-PEG-lipid conjugate. 2. Conjugate micelle identity, purity, stability, and potency analysis.

PubMed

Nellis, David F; Giardina, Steven L; Janini, George M; Shenoy, Shilpa R; Marks, James D; Tsai, Richard; Drummond, Daryl C; Hong, Keelung; Park, John W; Ouellette, Thomas F; Perkins, Shelley C; Kirpotin, Dmitri B

2005-01-01

Analytical methods optimized for micellar F5cys-MP-PEG(2000)-DPSE protein-lipopolymer conjugate are presented. The apparent micelle molecular weight, determined by size exclusion chromatography, ranged from 330 to 960 kDa. The F5cys antibody and conjugate melting points, determined by differential scanning calorimetry, were near 82 degrees C. Traditional methods for characterizing monodisperse protein species were inapplicable to conjugate analysis. The isoelectric point of F5cys (9.2) and the conjugate (8.9) were determined by capillary isoelectric focusing (cIEF) after addition of the zwitterionic detergent CHAPS to the buffer. Conjugate incubation with phospholipase B selectively removed DSPE lipid groups and dispersed the conjugate prior to separation by chromatographic methods. Alternatively, adding 2-propanol (29.4 vol %) and n-butanol (4.5 vol %) to buffers for salt-gradient cation exchange chromatography provided gentler, nonenzymatic dispersion, resulting in well-resolved peaks. This method was used to assess stability, identify contaminants, establish lot-to-lot comparability, and determine the average chromatographic purity (93%) for conjugate lots, described previously. The F5cys amino acid content was confirmed after conjugation. The expected conjugate avidity for immobilized HER-2/neu was measured by bimolecular interaction analysis (BIAcore). Mock therapeutic assemblies were made by conjugate insertion into preformed doxorubicin-encapsulating liposomes for antibody-directed uptake of doxorubicin by HER2-overexpressing cancer cells in vitro. Together these developed assays established that the manufacturing method as described in the first part of this study consistently produced F5cys-MP-PEG(2000)-DSPE having sufficient purity, stability, and functionality for use in preclinical toxicology investigations.

Secondary subharmonic instability of boundary layers with pressure gradient and suction

NASA Technical Reports Server (NTRS)

El-Hady, Nabil M.

1988-01-01

Three-dimensional linear secondary instability is investigated for boundary layers with pressure gradient and suction in the presence of a finite amplitude TS wave. The focus is on principal parametric resonance responsible for a strong growth of subharmonics in a low disturbance environment. Calculations are presented for the effect of pressure gradients and suction on controlling the onset and amplification of the secondary instability.

Domain Derivatives in Dielectric Rough Surface Scattering

DTIC Science & Technology

2015-01-01

and require the gradient of the objective function in the unknown model parameter vector at each stage of iteration. For large N, finite...differencing becomes numerically intensive, and an efficient alternative is domain differentiation in which the full gradient is obtained by solving a single...derivative calculation of the gradient for a locally perturbed dielectric interface. The method is non-variational, and algebraic in nature in that it

Ames Optimized TCA Configuration

NASA Technical Reports Server (NTRS)

Cliff, Susan E.; Reuther, James J.; Hicks, Raymond M.

1999-01-01

Configuration design at Ames was carried out with the SYN87-SB (single block) Euler code using a 193 x 49 x 65 C-H grid. The Euler solver is coupled to the constrained (NPSOL) and the unconstrained (QNMDIF) optimization packages. Since the single block grid is able to model only wing-body configurations, the nacelle/diverter effects were included in the optimization process by SYN87's option to superimpose the nacelle/diverter interference pressures on the wing. These interference pressures were calculated using the AIRPLANE code. AIRPLANE is an Euler solver that uses a unstructured tetrahedral mesh and is capable of computations about arbitrary complete configurations. In addition, the buoyancy effects of the nacelle/diverters were also included in the design process by imposing the pressure field obtained during the design process onto the triangulated surfaces of the nacelle/diverter mesh generated by AIRPLANE. The interference pressures and nacelle buoyancy effects are added to the final forces after each flow field calculation. Full details of the (recently enhanced) ghost nacelle capability are given in a related talk. The pseudo nacelle corrections were greatly improved during this design cycle. During the Ref H and Cycle 1 design activities, the nacelles were only translated and pitched. In the cycle 2 design effort the nacelles can translate vertically, and pitch to accommodate the changes in the lower surface geometry. The diverter heights (between their leading and trailing edges) were modified during design as the shape of the lower wing changed, with the drag of the diverter changing accordingly. Both adjoint and finite difference gradients were used during optimization. The adjoint-based gradients were found to give good direction in the design space for configurations near the starting point, but as the design approached a minimum, the finite difference gradients were found to be more accurate. Use of finite difference gradients was limited by the CPU time limit available on the Cray machines. A typical optimization run using finite difference gradients can use only 30 to 40 design variables and one optimization iteration within the 8 hour queue limit for the chosen grid size and convergence level. The efficiency afforded by the adjoint method allowed for 50-120 design variables and 5-10 optimization iterations in the 8 hour queue. Geometric perturbations to the wing and fuselage were made using the Hicks/Henne (HH) shape functions. The HH functions were distributed uniformly along the chords of the wing defining sections and lofted linearly. During single-surface design, constraints on thickness and volume at selected wing stations were imposed. Both fuselage camber and cross-sectional area distributions were permitted to change during design. The major disadvantage to the use of these functions is the inherent surface waviness produced by repeated use of such functions. Many smoothing operations were required following optimization runs to produce a configuration with reasonable smoothness. Wagner functions were also used on the wing sections but were never used on the fuselage. The Wagner functions are a family of increasingly oscillatory functions that have also been used extensively in airfoil design. The leading and trailing edge regions of the wing were designed by use of polynomial and monomial functions respectively. Twist was attempted but was abandoned because of little performance improvement available from changing the baseline twist.

Relaxation and Preconditioning for High Order Discontinuous Galerkin Methods with Applications to Aeroacoustics and High Speed Flows

NASA Technical Reports Server (NTRS)

Shu, Chi-Wang

2004-01-01

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. Other related issues in high order WENO finite difference and finite volume methods have also been investigated. methods are two classes of high order, high resolution methods suitable for convection dominated simulations with possible discontinuous or sharp gradient solutions. In [18], we first review these two classes of methods, pointing out their similarities and differences in algorithm formulation, theoretical properties, implementation issues, applicability, and relative advantages. We then present some quantitative comparisons of the third order finite volume WENO methods and discontinuous Galerkin methods for a series of test problems to assess their relative merits in accuracy and CPU timing. In [3], we review the development of the Runge-Kutta discontinuous Galerkin (RKDG) methods for non-linear convection-dominated problems. These robust and accurate methods have made their way into the main stream of computational fluid dynamics and are quickly finding use in a wide variety of applications. They combine a special class of Runge-Kutta time discretizations, that allows the method to be non-linearly stable regardless of its accuracy, with a finite element space discretization by discontinuous approximations, that incorporates the ideas of numerical fluxes and slope limiters coined during the remarkable development of the high-resolution finite difference and finite volume schemes. The resulting RKDG methods are stable, high-order accurate, and highly parallelizable schemes that can easily handle complicated geometries and boundary conditions. We review the theoretical and algorithmic aspects of these methods and show several applications including nonlinear conservation laws, the compressible and incompressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Multiple-source multiple-harmonic active vibration control of variable section cylindrical structures: A numerical study

NASA Astrophysics Data System (ADS)

Liu, Jinxin; Chen, Xuefeng; Gao, Jiawei; Zhang, Xingwu

2016-12-01

Air vehicles, space vehicles and underwater vehicles, the cabins of which can be viewed as variable section cylindrical structures, have multiple rotational vibration sources (e.g., engines, propellers, compressors and motors), making the spectrum of noise multiple-harmonic. The suppression of such noise has been a focus of interests in the field of active vibration control (AVC). In this paper, a multiple-source multiple-harmonic (MSMH) active vibration suppression algorithm with feed-forward structure is proposed based on reference amplitude rectification and conjugate gradient method (CGM). An AVC simulation scheme called finite element model in-loop simulation (FEMILS) is also proposed for rapid algorithm verification. Numerical studies of AVC are conducted on a variable section cylindrical structure based on the proposed MSMH algorithm and FEMILS scheme. It can be seen from the numerical studies that: (1) the proposed MSMH algorithm can individually suppress each component of the multiple-harmonic noise with an unified and improved convergence rate; (2) the FEMILS scheme is convenient and straightforward for multiple-source simulations with an acceptable loop time. Moreover, the simulations have similar procedure to real-life control and can be easily extended to physical model platform.

Numerical Simulation of Response Characteristics of Audio-magnetotelluric for Gas Hydrate in the Qilian Mountain Permafrost, China

NASA Astrophysics Data System (ADS)

Xiao, Kun; Zou, Changchun; Yu, Changqing; Pi, Jinyun

2015-10-01

Audio-magnetotelluric (AMT) method is a kind of frequency-domain sounding technique, which can be applied to gas hydrate prospecting and assessments in the permafrost region due to its high frequency band. Based on the geological conditions of gas hydrate reservoir in the Qilian Mountain permafrost, by establishing high-resistance abnormal model for gas hydrate and carrying out numerical simulation using finite element method (FEM) and nonlinear conjugate gradient (NLCG) method, this paper analyzed the application range of AMT method and the best acquisition parameters setting scheme. When porosity of gas hydrate reservoir is less than 5%, gas hydrate saturation is greater than 70%, occurrence scale is less than 50 m, or bury depth is greater than 500 m, AMT technique cannot identify and delineate the favorable gas hydrate reservoir. Survey line should be more than twice the length of probable occurrence scale, while tripling the length will make the best result. The number of stations should be no less than 6, and 11 stations are optimal. At the high frequency section (10˜1000 Hz), there should be no less than 3 frequency points, 4 being the best number.

The Mobius domain wall fermion algorithm

DOE PAGES

Brower, Richard C.; Neff, Harmut; Orginos, Kostas

2017-07-22

We present a review of the properties of generalized domain wall Fermions, based on a (real) Möbius transformation on the Wilson overlap kernel, discussing their algorithmic efficiency, the degree of explicit chiral violations measured by the residual mass (m res) and the Ward–Takahashi identities. The Möbius class interpolates between Shamir’s domain wall operator and Boriçi’s domain wall implementation of Neuberger’s overlap operator without increasing the number of Dirac applications per conjugate gradient iteration. A new scaling parameter (α) reduces chiral violations at finite fifth dimension (L s) but yields exactly the same overlap action in the limit L s →more » ∞ . Through the use of 4d Red/Black preconditioning and optimal tuning for the scaling α(L s), we show that chiral symmetry violations are typically reduced by an order of magnitude at fixed Ls . Here, we argue that the residual mass for a tuned Möbius algorithm with α = O(1/L s γ) for γ < 1 will eventually fall asymptotically as m res = O(1/L s 1+γ) in the case of a 5D Hamiltonian with out a spectral gap.« less

Automatic 3D Moment tensor inversions for southern California earthquakes

NASA Astrophysics Data System (ADS)

Liu, Q.; Tape, C.; Friberg, P.; Tromp, J.

2008-12-01

We present a new source mechanism (moment-tensor and depth) catalog for about 150 recent southern California earthquakes with Mw ≥ 3.5. We carefully select the initial solutions from a few available earthquake catalogs as well as our own preliminary 3D moment tensor inversion results. We pick useful data windows by assessing the quality of fits between the data and synthetics using an automatic windowing package FLEXWIN (Maggi et al 2008). We compute the source Fréchet derivatives of moment-tensor elements and depth for a recent 3D southern California velocity model inverted based upon finite-frequency event kernels calculated by the adjoint methods and a nonlinear conjugate gradient technique with subspace preconditioning (Tape et al 2008). We then invert for the source mechanisms and event depths based upon the techniques introduced by Liu et al 2005. We assess the quality of this new catalog, as well as the other existing ones, by computing the 3D synthetics for the updated 3D southern California model. We also plan to implement the moment-tensor inversion methods to automatically determine the source mechanisms for earthquakes with Mw ≥ 3.5 in southern California.

The Mobius domain wall fermion algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brower, Richard C.; Neff, Harmut; Orginos, Kostas

We present a review of the properties of generalized domain wall Fermions, based on a (real) Möbius transformation on the Wilson overlap kernel, discussing their algorithmic efficiency, the degree of explicit chiral violations measured by the residual mass (m res) and the Ward–Takahashi identities. The Möbius class interpolates between Shamir’s domain wall operator and Boriçi’s domain wall implementation of Neuberger’s overlap operator without increasing the number of Dirac applications per conjugate gradient iteration. A new scaling parameter (α) reduces chiral violations at finite fifth dimension (L s) but yields exactly the same overlap action in the limit L s →more » ∞ . Through the use of 4d Red/Black preconditioning and optimal tuning for the scaling α(L s), we show that chiral symmetry violations are typically reduced by an order of magnitude at fixed Ls . Here, we argue that the residual mass for a tuned Möbius algorithm with α = O(1/L s γ) for γ < 1 will eventually fall asymptotically as m res = O(1/L s 1+γ) in the case of a 5D Hamiltonian with out a spectral gap.« less

An implicit numerical scheme for the simulation of internal viscous flows on unstructured grids

NASA Technical Reports Server (NTRS)

Jorgenson, Philip C. E.; Pletcher, Richard H.

1994-01-01

The Navier-Stokes equations are solved numerically for two-dimensional steady viscous laminar flows. The grids are generated based on the method of Delaunay triangulation. A finite-volume approach is used to discretize the conservation law form of the compressible flow equations written in terms of primitive variables. A preconditioning matrix is added to the equations so that low Mach number flows can be solved economically. The equations are time marched using either an implicit Gauss-Seidel iterative procedure or a solver based on a conjugate gradient like method. A four color scheme is employed to vectorize the block Gauss-Seidel relaxation procedure. This increases the memory requirements minimally and decreases the computer time spent solving the resulting system of equations substantially. A factor of 7.6 speed up in the matrix solver is typical for the viscous equations. Numerical results are obtained for inviscid flow over a bump in a channel at subsonic and transonic conditions for validation with structured solvers. Viscous results are computed for developing flow in a channel, a symmetric sudden expansion, periodic tandem cylinders in a cross-flow, and a four-port valve. Comparisons are made with available results obtained by other investigators.

Emergence of currents as a transient quantum effect in nonequilibrium systems

NASA Astrophysics Data System (ADS)

Granot, Er'El; Marchewka, Avi

2011-09-01

Most current calculations are based on equilibrium or semi-equilibrium models. However, except for very special scenarios (like ring configuration), the current cannot exist in equilibrium. Moreover, unlike with equilibrium scenarios, there is no generic approach to confront out-of-equilibrium currents. In this paper we used recent studies on transient quantum mechanics to solve the current, which appears in the presence of very high density gradients and fast transients. It shows that the emerging current appears instantaneously, and although the density beyond the discontinuity is initially negligible the currents there have a finite value, and remain constant for a finite period. It is shown that this nonequilibrium effect can be measured in real experiments (such as cooled rubidium atoms), where the discontinuity is replaced with a finite width (hundreds of nanometers) gradient.

Manufacture of gradient micro-structures of magnesium alloys using two stage extrusion dies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hwang, Yeong-Maw; Huang, Tze-Hui; Alexandrov, Sergei

2013-12-16

This paper aims to manufacture magnesium alloy metals with gradient micro-structures using hot extrusion process. The extrusion die was designed to have a straight channel part combined with a conical part. Materials pushed through this specially-designed die generate a non-uniform velocity distribution at cross sections inside the die and result in different strain and strain rate distributions. Accordingly, a gradient microstructure product can be obtained. Using the finite element analysis, the forming temperature, effective strain, and effective strain rate distributions at the die exit were firstly discussed for various inclination angles in the conical die. Then, hot extrusion experiments withmore » a two stage die were conducted to obtain magnesium alloy products with gradient micro-structures. The effects of the inclination angle on the grain size distribution at cross sections of the products were also discussed. Using a die of an inclination angle of 15°, gradient micro-structures of the grain size decreasing gradually from 17 μm at the center to 4 μm at the edge of product were achieved.« less

Aerodynamic Shape Sensitivity Analysis and Design Optimization of Complex Configurations Using Unstructured Grids

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Newman, James C., III; Barnwell, Richard W.

1997-01-01

A three-dimensional unstructured grid approach to aerodynamic shape sensitivity analysis and design optimization has been developed and is extended to model geometrically complex configurations. The advantage of unstructured grids (when compared with a structured-grid approach) is their inherent ability to discretize irregularly shaped domains with greater efficiency and less effort. Hence, this approach is ideally suited for geometrically complex configurations of practical interest. In this work the nonlinear Euler equations are solved using an upwind, cell-centered, finite-volume scheme. The discrete, linearized systems which result from this scheme are solved iteratively by a preconditioned conjugate-gradient-like algorithm known as GMRES for the two-dimensional geometry and a Gauss-Seidel algorithm for the three-dimensional; similar procedures are used to solve the accompanying linear aerodynamic sensitivity equations in incremental iterative form. As shown, this particular form of the sensitivity equation makes large-scale gradient-based aerodynamic optimization possible by taking advantage of memory efficient methods to construct exact Jacobian matrix-vector products. Simple parameterization techniques are utilized for demonstrative purposes. Once the surface has been deformed, the unstructured grid is adapted by considering the mesh as a system of interconnected springs. Grid sensitivities are obtained by differentiating the surface parameterization and the grid adaptation algorithms with ADIFOR (which is an advanced automatic-differentiation software tool). To demonstrate the ability of this procedure to analyze and design complex configurations of practical interest, the sensitivity analysis and shape optimization has been performed for a two-dimensional high-lift multielement airfoil and for a three-dimensional Boeing 747-200 aircraft.

Magnon localization and Bloch oscillations in finite Heisenberg spin chains in an inhomogeneous magnetic field.

PubMed

Kosevich, Yuriy A; Gann, Vladimir V

2013-06-19

We study the localization of magnon states in finite defect-free Heisenberg spin-1/2 ferromagnetic chains placed in an inhomogeneous magnetic field with a constant spatial gradient. Continuous transformation from the extended magnon states to the localized Wannier-Zeeman states in a finite spin chain placed in an inhomogeneous field is described both analytically and numerically. We describe for the first time the non-monotonic dependence of the energy levels of magnons, both long and short wavelength, on the magnetic field gradient, which is a consequence of magnon localization in a finite spin chain. We show that, in contrast to the destruction of the magnon band and the establishment of the Wannier-Stark ladder in a vanishingly small field gradient in an infinite chain, the localization of magnon states at the chain ends preserves the memory of the magnon band. Essentially, the localization at the lower- or higher-field chain end resembles the localization of the positive- or negative-effective-mass band quasiparticles. We also show how the beat dynamics of coherent superposition of extended spin waves in a finite chain in a homogeneous or weakly inhomogeneous field transforms into magnon Bloch oscillations of the superposition of localized Wannier-Zeeman states in a strongly inhomogeneous field. We provide a semiclassical description of the magnon Bloch oscillations and show that the correspondence between the quantum and semiclassical descriptions is most accurate for Bloch oscillations of the magnon coherent states, which are built from a coherent superposition of a large number of the nearest-neighbour Wannier-Zeeman states.

Cell-centered high-order hyperbolic finite volume method for diffusion equation on unstructured grids

NASA Astrophysics Data System (ADS)

Lee, Euntaek; Ahn, Hyung Taek; Luo, Hong

2018-02-01

We apply a hyperbolic cell-centered finite volume method to solve a steady diffusion equation on unstructured meshes. This method, originally proposed by Nishikawa using a node-centered finite volume method, reformulates the elliptic nature of viscous fluxes into a set of augmented equations that makes the entire system hyperbolic. We introduce an efficient and accurate solution strategy for the cell-centered finite volume method. To obtain high-order accuracy for both solution and gradient variables, we use a successive order solution reconstruction: constant, linear, and quadratic (k-exact) reconstruction with an efficient reconstruction stencil, a so-called wrapping stencil. By the virtue of the cell-centered scheme, the source term evaluation was greatly simplified regardless of the solution order. For uniform schemes, we obtain the same order of accuracy, i.e., first, second, and third orders, for both the solution and its gradient variables. For hybrid schemes, recycling the gradient variable information for solution variable reconstruction makes one order of additional accuracy, i.e., second, third, and fourth orders, possible for the solution variable with less computational work than needed for uniform schemes. In general, the hyperbolic method can be an effective solution technique for diffusion problems, but instability is also observed for the discontinuous diffusion coefficient cases, which brings necessity for further investigation about the monotonicity preserving hyperbolic diffusion method.

Evading the strength–ductility trade-off dilemma in steel through gradient hierarchical nanotwins

PubMed Central

Wei, Yujie; Li, Yongqiang; Zhu, Lianchun; Liu, Yao; Lei, Xianqi; Wang, Gang; Wu, Yanxin; Mi, Zhenli; Liu, Jiabin; Wang, Hongtao; Gao, Huajian

2014-01-01

The strength–ductility trade-off has been a long-standing dilemma in materials science. This has limited the potential of many structural materials, steels in particular. Here we report a way of enhancing the strength of twinning-induced plasticity steel at no ductility trade-off. After applying torsion to cylindrical twinning-induced plasticity steel samples to generate a gradient nanotwinned structure along the radial direction, we find that the yielding strength of the material can be doubled at no reduction in ductility. It is shown that this evasion of strength–ductility trade-off is due to the formation of a gradient hierarchical nanotwinned structure during pre-torsion and subsequent tensile deformation. A series of finite element simulations based on crystal plasticity are performed to understand why the gradient twin structure can cause strengthening and ductility retention, and how sequential torsion and tension lead to the observed hierarchical nanotwinned structure through activation of different twinning systems. PMID:24686581

Simulation and Optimization of an Airfoil with Leading Edge Slat

NASA Astrophysics Data System (ADS)

Schramm, Matthias; Stoevesandt, Bernhard; Peinke, Joachim

2016-09-01

A gradient-based optimization is used in order to improve the shape of a leading edge slat upstream of a DU 91-W2-250 airfoil. The simulations are performed by solving the Reynolds-Averaged Navier-Stokes equations (RANS) using the open source CFD code OpenFOAM. Gradients are computed via the adjoint approach, which is suitable to deal with many design parameters, but keeping the computational costs low. The implementation is verified by comparing the gradients from the adjoint method with gradients obtained by finite differences for a NACA 0012 airfoil. The simulations of the leading edge slat are validated against measurements from the acoustic wind tunnel of Oldenburg University at a Reynolds number of Re = 6 • 105. The shape of the slat is optimized using the adjoint approach resulting in a drag reduction of 2%. Although the optimization is done for Re = 6 • 105, the improvements also hold for a higher Reynolds number of Re = 7.9 • 106, which is more realistic at modern wind turbines.

Polyamine-iron chelator conjugate.

PubMed

Bergeron, Raymond J; McManis, James S; Franklin, April M; Yao, Hua; Weimar, William R

2003-12-04

The current study demonstrates unequivocally that polyamines can serve as vectors for the intracellular delivery of the bidentate chelator 1,2-dimethyl-3-hydroxypyridin-4-one (L1). The polyamine-hydroxypyridinone conjugate 1-(12-amino-4,9-diazadodecyl)-2-methyl-3-hydroxy-4(1H)-pyridinone is assembled from spermine and 3-O-benzylmaltol. The conjugate is shown to form a 3:1 complex with Fe(III) and to be taken up by the polyamine transporter 1900-fold against a concentration gradient. The K(i) of the conjugate is 3.7 microM vs spermidine for the polyamine transporter. The conjugate is also at least 230 times more active in suppressing the growth of L1210 murine leukemia cells than is the parent ligand, decreases the activities of the polyamine biosynthetic enzymes ornithine decarboxylase and S-adenosylmethionine decarboxylase, and upregulates spermidine-spermine N (1)-acetyltransferase. However, the effect on native polyamine pools is a moderate one. These findings are in keeping with the idea that polyamines can also serve as efficient vectors for the intracellular delivery of other iron chelators.

Primal-dual and forward gradient implementation for quantitative susceptibility mapping.

PubMed

Kee, Youngwook; Deh, Kofi; Dimov, Alexey; Spincemaille, Pascal; Wang, Yi

2017-12-01

To investigate the computational aspects of the prior term in quantitative susceptibility mapping (QSM) by (i) comparing the Gauss-Newton conjugate gradient (GNCG) algorithm that uses numerical conditioning (ie, modifies the prior term) with a primal-dual (PD) formulation that avoids this, and (ii) carrying out a comparison between a central and forward difference scheme for the discretization of the prior term. A spatially continuous formulation of the regularized QSM inversion problem and its PD formulation were derived. The Chambolle-Pock algorithm for PD was implemented and its convergence behavior was compared with that of GNCG for the original QSM. Forward and central difference schemes were compared in terms of the presence of checkerboard artifacts. All methods were tested and validated on a gadolinium phantom, ex vivo brain blocks, and in vivo brain MRI data with respect to COSMOS. The PD approach provided a faster convergence rate than GNCG. The GNCG convergence rate slowed considerably with smaller (more accurate) values of the conditioning parameter. Using a forward difference suppressed the checkerboard artifacts in QSM, as compared with the central difference. The accuracy of PD and GNCG were validated based on excellent correlation with COSMOS. The PD approach with forward difference for the gradient showed improved convergence and accuracy over the GNCG method using central difference. Magn Reson Med 78:2416-2427, 2017. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Nonlinear susceptibilities of finite conjugated organic polymers

NASA Technical Reports Server (NTRS)

Beratan, David N.; Onuchic, Jose Nelson; Perry, Joseph W.

1987-01-01

Tight-binding calculations of the length dependence of the third-order molecular hyperpolarizability for polyenes and polyynes are reported. The pi-electron wave functions were determined by exploiting the limited translational symmetry of the molecules. Perturbation theory was used to calculate the longitudinal component of the electronic nonresonant hyperpolarizability. This is the first two-'band' calculation of third-order hyperpolarizabilities on finite pi-electron systems of varying length. In contrast to the results of the one-'band' models, the hyperpolarizability densities increase rapidly and then, after about 10-15 repeating units, approach an asymptotic value.

Computation of Laminar and Turbulent Flow in 90-Degree Square-Duct and Pipe Bends Using the Navier-Stokes Equations

DTIC Science & Technology

1982-04-01

R.M. and Warming, R.F.: An Implicit Finite - Difference Algorithm for Hyperbolic Systems in Conservation Law Form. Journal of Computational Physics...Quincy Street C-40) Arlington, VA 22217 D 82 05-.10 I0, S4CURITY CLASSIFICATION OF THIS ’E(Wha, Doae Entotwed) Slength scale. Six different flow cases...forces upstream have produced a non-zero velocity gradient normal to the plane of curvature. Fluid with above (/below) average nioiiiei.tuili migrates

Modeling coupled sorption and transformation of 17β-estradiol-17-sulfate in soil-water systems

NASA Astrophysics Data System (ADS)

Bai, Xuelian; Shrestha, Suman L.; Casey, Francis X. M.; Hakk, Heldur; Fan, Zhaosheng

2014-11-01

Animal manure is the primary source of exogenous free estrogens in the environment, which are known endocrine-disrupting chemicals to disorder the reproduction system of organisms. Conjugated estrogens can act as precursors to free estrogens, which may increase the total estrogenicity in the environment. In this study, a comprehensive model was used to simultaneously simulate the coupled sorption and transformation of a sulfate estrogen conjugate, 17β-estradiol-17-sulfate (E2-17S), in various soil-water systems (non-sterile/sterile; topsoil/subsoil). The simulated processes included multiple transformation pathways (i.e. hydroxylation, hydrolysis, and oxidation) and mass transfer between the aqueous, reversibly sorbed, and irreversibly sorbed phases of all soils for E2-17S and its metabolites. The conceptual model was conceived based on a series of linear sorption and first-order transformation expressions. The model was inversely solved using finite difference to estimate process parameters. A global optimization method was applied for the inverse analysis along with variable model restrictions to estimate 36 parameters. The model provided a satisfactory simultaneous fit (R2adj = 0.93 and d = 0.87) of all the experimental data and reliable parameter estimates. This modeling study improved the understanding on fate and transport of estrogen conjugates under various soil-water conditions.

Energy minimization in medical image analysis: Methodologies and applications.

PubMed

Zhao, Feng; Xie, Xianghua

2016-02-01

Energy minimization is of particular interest in medical image analysis. In the past two decades, a variety of optimization schemes have been developed. In this paper, we present a comprehensive survey of the state-of-the-art optimization approaches. These algorithms are mainly classified into two categories: continuous method and discrete method. The former includes Newton-Raphson method, gradient descent method, conjugate gradient method, proximal gradient method, coordinate descent method, and genetic algorithm-based method, while the latter covers graph cuts method, belief propagation method, tree-reweighted message passing method, linear programming method, maximum margin learning method, simulated annealing method, and iterated conditional modes method. We also discuss the minimal surface method, primal-dual method, and the multi-objective optimization method. In addition, we review several comparative studies that evaluate the performance of different minimization techniques in terms of accuracy, efficiency, or complexity. These optimization techniques are widely used in many medical applications, for example, image segmentation, registration, reconstruction, motion tracking, and compressed sensing. We thus give an overview on those applications as well. Copyright © 2015 John Wiley & Sons, Ltd.

Layer-oriented multigrid wavefront reconstruction algorithms for multi-conjugate adaptive optics

NASA Astrophysics Data System (ADS)

Gilles, Luc; Ellerbroek, Brent L.; Vogel, Curtis R.

2003-02-01

Multi-conjugate adaptive optics (MCAO) systems with 104-105 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront control algorithms for these systems is impractical, since the number of calculations required to compute and apply the reconstruction matrix scales respectively with the cube and the square of the number of AO degrees of freedom. In this paper, we develop an iterative sparse matrix implementation of minimum variance wavefront reconstruction for telescope diameters up to 32m with more than 104 actuators. The basic approach is the preconditioned conjugate gradient method, using a multigrid preconditioner incorporating a layer-oriented (block) symmetric Gauss-Seidel iterative smoothing operator. We present open-loop numerical simulation results to illustrate algorithm convergence.

Numerical Study on Density Gradient Carbon-Carbon Composite for Vertical Launching System

NASA Astrophysics Data System (ADS)

Yoon, Jin-Young; Kim, Chun-Gon; Lim, Juhwan

2018-04-01

This study presents new carbon-carbon (C/C) composite that has a density gradient within single material, and estimates its heat conduction performance by a numerical method. To address the high heat conduction of a high-density C/C, which can cause adhesion separation in the steel structures of vertical launching systems, density gradient carbon-carbon (DGCC) composite is proposed due to its exhibiting low thermal conductivity as well as excellent ablative resistance. DGCC is manufactured by hybridizing two different carbonization processes into a single carbon preform. One part exhibits a low density using phenolic resin carbonization to reduce heat conduction, and the other exhibits a high density using thermal gradient-chemical vapor infiltration for excellent ablative resistance. Numerical analysis for DGCC is performed with a heat conduction problem, and internal temperature distributions are estimated by the forward finite difference method. Material properties of the transition density layer, which is inevitably formed during DGCC manufacturing, are assumed to a combination of two density layers for numerical analysis. By comparing numerical results with experimental data, we validate that DGCC exhibits a low thermal conductivity, and it can serve as highly effective ablative material for vertical launching systems.

Smooth particle hydrodynamics: theory and application to the origin of the moon

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benz, W.

1986-01-01

The origin of the moon is modeled by the so-called smooth particle hydrodynamics (SPH) method (Lucy, 1977, Monaghan 1985) which substitutes to the fluid a finite set of extended particles, the hydrodynamics equations reduce to the equation of motion of individual particles. These equations of motion differ only from the standard gravitational N-body problem insofar that pressure gradients and viscosity terms have to be added to the gradient of the potential to derive the forces between the particles. The numerical tools developed for ''classical'' N-body problems can therefore be readily applied to solve 3 dimensional hydroynamical problems. 12 refs., 1more » fig.« less

Theory of even-parity states and two-photon spectra of conjugated polymers

NASA Astrophysics Data System (ADS)

McWilliams, P. C. M.; Hayden, G. W.; Soos, Z. G.

1991-04-01

The two-photon absorption (TPA) spectrum of interacting π electrons in conjugated polymers is shown to be qualitatively different from any single-particle description, including the Hartree-Fock limit. Alternating transfer integrals t(1+/-δ) along the backbone lead to a weak TPA below the one-photon gap Eg for arbitrarily weak correlations at δ=0, for intermediate correlations at δ=0.07 in polyenes, and for strong correlations at any δ<1. More intense TPA is derived from two-electron transfer across Eg; this even-parity state shifts from 2Eg in single-particle theory to Eg in the limit of strong correlations in Hubbard models and is around 1.5Eg for Pariser-Parr-Pople (PPP) parameters. The PPP model, which accounts for one- and two-photon excitations of finite polyenes, is extended to even-parity states in polydiacetylenes (PDA's), polyacetylene (PA), and polysilanes (PS's). Previous experimental data for PDA and PS support both the strong TPA above Eg and weak TPA slightly below Eg for δ=0.15 in PDA and above Eg for δ~0.3 in PS. The strong TPA expected around 1.5Eg in isolated PA strands shifts to ~Eg due to interchain π-electron dispersion forces. TPA intensities in correlated states are shown to reflect both ionicity and mean-square charge separation. The even-parity states of conjugated polymers, like those of polyenes, show qualitatively different features associated with electron-electron correlations.

Using Adjoint Methods to Improve 3-D Velocity Models of Southern California

NASA Astrophysics Data System (ADS)

Liu, Q.; Tape, C.; Maggi, A.; Tromp, J.

2006-12-01

We use adjoint methods popular in climate and ocean dynamics to calculate Fréchet derivatives for tomographic inversions in southern California. The Fréchet derivative of an objective function χ(m), where m denotes the Earth model, may be written in the generic form δχ=int Km(x) δln m(x) d3x, where δln m=δ m/m denotes the relative model perturbation. For illustrative purposes, we construct the 3-D finite-frequency banana-doughnut kernel Km, corresponding to the misfit of a single traveltime measurement, by simultaneously computing the 'adjoint' wave field s† forward in time and reconstructing the regular wave field s backward in time. The adjoint wave field is produced by using the time-reversed velocity at the receiver as a fictitious source, while the regular wave field is reconstructed on the fly by propagating the last frame of the wave field saved by a previous forward simulation backward in time. The approach is based upon the spectral-element method, and only two simulations are needed to produce density, shear-wave, and compressional-wave sensitivity kernels. This method is applied to the SCEC southern California velocity model. Various density, shear-wave, and compressional-wave sensitivity kernels are presented for different phases in the seismograms. We also generate 'event' kernels for Pnl, S and surface waves, which are the Fréchet kernels of misfit functions that measure the P, S or surface wave traveltime residuals at all the receivers simultaneously for one particular event. Effectively, an event kernel is a sum of weighted Fréchet kernels, with weights determined by the associated traveltime anomalies. By the nature of the 3-D simulation, every event kernel is also computed based upon just two simulations, i.e., its construction costs the same amount of computation time as an individual banana-doughnut kernel. One can think of the sum of the event kernels for all available earthquakes, called the 'misfit' kernel, as a graphical representation of the gradient of the misfit function. With the capability of computing both the value of the misfit function and its gradient, which assimilates the traveltime anomalies, we are ready to use a non-linear conjugate gradient algorithm to iteratively improve velocity models of southern California.

Finite-volume scheme for anisotropic diffusion

DOE Office of Scientific and Technical Information (OSTI.GOV)

Es, Bram van, E-mail: bramiozo@gmail.com; FOM Institute DIFFER, Dutch Institute for Fundamental Energy Research, The Netherlands"1; Koren, Barry

In this paper, we apply a special finite-volume scheme, limited to smooth temperature distributions and Cartesian grids, to test the importance of connectivity of the finite volumes. The area of application is nuclear fusion plasma with field line aligned temperature gradients and extreme anisotropy. We apply the scheme to the anisotropic heat-conduction equation, and compare its results with those of existing finite-volume schemes for anisotropic diffusion. Also, we introduce a general model adaptation of the steady diffusion equation for extremely anisotropic diffusion problems with closed field lines.

Edge gradients evaluation for 2D hybrid finite volume method model

USDA-ARS?s Scientific Manuscript database

In this study, a two-dimensional depth-integrated hydrodynamic model was developed using FVM on a hybrid unstructured collocated mesh system. To alleviate the negative effects of mesh irregularity and non-uniformity, a conservative evaluation method for edge gradients based on the second-order Tayl...

ACCURATE SOLUTION AND GRADIENT COMPUTATION FOR ELLIPTIC INTERFACE PROBLEMS WITH VARIABLE COEFFICIENTS

PubMed Central

LI, ZHILIN; JI, HAIFENG; CHEN, XIAOHONG

2016-01-01

A new augmented method is proposed for elliptic interface problems with a piecewise variable coefficient that has a finite jump across a smooth interface. The main motivation is not only to get a second order accurate solution but also a second order accurate gradient from each side of the interface. The key of the new method is to introduce the jump in the normal derivative of the solution as an augmented variable and re-write the interface problem as a new PDE that consists of a leading Laplacian operator plus lower order derivative terms near the interface. In this way, the leading second order derivatives jump relations are independent of the jump in the coefficient that appears only in the lower order terms after the scaling. An upwind type discretization is used for the finite difference discretization at the irregular grid points near or on the interface so that the resulting coefficient matrix is an M-matrix. A multi-grid solver is used to solve the linear system of equations and the GMRES iterative method is used to solve the augmented variable. Second order convergence for the solution and the gradient from each side of the interface has also been proved in this paper. Numerical examples for general elliptic interface problems have confirmed the theoretical analysis and efficiency of the new method. PMID:28983130

The temporal distribution of directional gradients under selection for an optimum.

PubMed

Chevin, Luis-Miguel; Haller, Benjamin C

2014-12-01

Temporal variation in phenotypic selection is often attributed to environmental change causing movements of the adaptive surface relating traits to fitness, but this connection is rarely established empirically. Fluctuating phenotypic selection can be measured by the variance and autocorrelation of directional selection gradients through time. However, the dynamics of these gradients depend not only on environmental changes altering the fitness surface, but also on evolution of the phenotypic distribution. Therefore, it is unclear to what extent variability in selection gradients can inform us about the underlying drivers of their fluctuations. To investigate this question, we derive the temporal distribution of directional gradients under selection for a phenotypic optimum that is either constant or fluctuates randomly in various ways in a finite population. Our analytical results, combined with population- and individual-based simulations, show that although some characteristic patterns can be distinguished, very different types of change in the optimum (including a constant optimum) can generate similar temporal distributions of selection gradients, making it difficult to infer the processes underlying apparent fluctuating selection. Analyzing changes in phenotype distributions together with changes in selection gradients should prove more useful for inferring the mechanisms underlying estimated fluctuating selection. © 2014 The Author(s). Evolution © 2014 The Society for the Study of Evolution.

Asynchronous variational integration using continuous assumed gradient elements.

PubMed

Wolff, Sebastian; Bucher, Christian

2013-03-01

Asynchronous variational integration (AVI) is a tool which improves the numerical efficiency of explicit time stepping schemes when applied to finite element meshes with local spatial refinement. This is achieved by associating an individual time step length to each spatial domain. Furthermore, long-term stability is ensured by its variational structure. This article presents AVI in the context of finite elements based on a weakened weak form (W2) Liu (2009) [1], exemplified by continuous assumed gradient elements Wolff and Bucher (2011) [2]. The article presents the main ideas of the modified AVI, gives implementation notes and a recipe for estimating the critical time step.

Efficient evaluation of the Coulomb force in the Gaussian and finite-element Coulomb method.

PubMed

Kurashige, Yuki; Nakajima, Takahito; Sato, Takeshi; Hirao, Kimihiko

2010-06-28

We propose an efficient method for evaluating the Coulomb force in the Gaussian and finite-element Coulomb (GFC) method, which is a linear-scaling approach for evaluating the Coulomb matrix and energy in large molecular systems. The efficient evaluation of the analytical gradient in the GFC is not straightforward as well as the evaluation of the energy because the SCF procedure with the Coulomb matrix does not give a variational solution for the Coulomb energy. Thus, an efficient approximate method is alternatively proposed, in which the Coulomb potential is expanded in the Gaussian and finite-element auxiliary functions as done in the GFC. To minimize the error in the gradient not just in the energy, the derived functions of the original auxiliary functions of the GFC are used additionally for the evaluation of the Coulomb gradient. In fact, the use of the derived functions significantly improves the accuracy of this approach. Although these additional auxiliary functions enlarge the size of the discretized Poisson equation and thereby increase the computational cost, it maintains the near linear scaling as the GFC and does not affects the overall efficiency of the GFC approach.

On a model of three-dimensional bursting and its parallel implementation

NASA Astrophysics Data System (ADS)

Tabik, S.; Romero, L. F.; Garzón, E. M.; Ramos, J. I.

2008-04-01

A mathematical model for the simulation of three-dimensional bursting phenomena and its parallel implementation are presented. The model consists of four nonlinearly coupled partial differential equations that include fast and slow variables, and exhibits bursting in the absence of diffusion. The differential equations have been discretized by means of a second-order accurate in both space and time, linearly-implicit finite difference method in equally-spaced grids. The resulting system of linear algebraic equations at each time level has been solved by means of the Preconditioned Conjugate Gradient (PCG) method. Three different parallel implementations of the proposed mathematical model have been developed; two of these implementations, i.e., the MPI and the PETSc codes, are based on a message passing paradigm, while the third one, i.e., the OpenMP code, is based on a shared space address paradigm. These three implementations are evaluated on two current high performance parallel architectures, i.e., a dual-processor cluster and a Shared Distributed Memory (SDM) system. A novel representation of the results that emphasizes the most relevant factors that affect the performance of the paralled implementations, is proposed. The comparative analysis of the computational results shows that the MPI and the OpenMP implementations are about twice more efficient than the PETSc code on the SDM system. It is also shown that, for the conditions reported here, the nonlinear dynamics of the three-dimensional bursting phenomena exhibits three stages characterized by asynchronous, synchronous and then asynchronous oscillations, before a quiescent state is reached. It is also shown that the fast system reaches steady state in much less time than the slow variables.

A critical analysis of some popular methods for the discretisation of the gradient operator in finite volume methods

NASA Astrophysics Data System (ADS)

Syrakos, Alexandros; Varchanis, Stylianos; Dimakopoulos, Yannis; Goulas, Apostolos; Tsamopoulos, John

2017-12-01

Finite volume methods (FVMs) constitute a popular class of methods for the numerical simulation of fluid flows. Among the various components of these methods, the discretisation of the gradient operator has received less attention despite its fundamental importance with regards to the accuracy of the FVM. The most popular gradient schemes are the divergence theorem (DT) (or Green-Gauss) scheme and the least-squares (LS) scheme. Both are widely believed to be second-order accurate, but the present study shows that in fact the common variant of the DT gradient is second-order accurate only on structured meshes whereas it is zeroth-order accurate on general unstructured meshes, and the LS gradient is second-order and first-order accurate, respectively. This is explained through a theoretical analysis and is confirmed by numerical tests. The schemes are then used within a FVM to solve a simple diffusion equation on unstructured grids generated by several methods; the results reveal that the zeroth-order accuracy of the DT gradient is inherited by the FVM as a whole, and the discretisation error does not decrease with grid refinement. On the other hand, use of the LS gradient leads to second-order accurate results, as does the use of alternative, consistent, DT gradient schemes, including a new iterative scheme that makes the common DT gradient consistent at almost no extra cost. The numerical tests are performed using both an in-house code and the popular public domain partial differential equation solver OpenFOAM.

Transfer-function-parameter estimation from frequency response data: A FORTRAN program

NASA Technical Reports Server (NTRS)

Seidel, R. C.

1975-01-01

A FORTRAN computer program designed to fit a linear transfer function model to given frequency response magnitude and phase data is presented. A conjugate gradient search is used that minimizes the integral of the absolute value of the error squared between the model and the data. The search is constrained to insure model stability. A scaling of the model parameters by their own magnitude aids search convergence. Efficient computer algorithms result in a small and fast program suitable for a minicomputer. A sample problem with different model structures and parameter estimates is reported.

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Di Pietro, Daniele A.; Droniou, Jérôme; Manzini, Gianmarco

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novelmore » DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.« less

Gradient-index phononic crystal lens-based enhancement of elastic wave energy harvesting

NASA Astrophysics Data System (ADS)

Tol, S.; Degertekin, F. L.; Erturk, A.

2016-08-01

We explore the enhancement of structure-borne elastic wave energy harvesting, both numerically and experimentally, by exploiting a Gradient-Index Phononic Crystal Lens (GRIN-PCL) structure. The proposed GRIN-PCL is formed by an array of blind holes with different diameters on an aluminum plate, where the blind hole distribution is tailored to obtain a hyperbolic secant gradient profile of refractive index guided by finite-element simulations of the lowest asymmetric mode Lamb wave band diagrams. Under plane wave excitation from a line source, experimentally measured wave field validates the numerical simulation of wave focusing within the GRIN-PCL domain. A piezoelectric energy harvester disk located at the first focus of the GRIN-PCL yields an order of magnitude larger power output as compared to the baseline case of energy harvesting without the GRIN-PCL on the uniform plate counterpart.

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

DOE PAGES

Di Pietro, Daniele A.; Droniou, Jérôme; Manzini, Gianmarco

2017-11-21

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novelmore » DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.« less

Application of COMSOL to Acoustic Imaging

DTIC Science & Technology

2010-10-01

Marquardt (LM) (2 epochs), followed by Broyden, Fletcher, Goldfarb, and Shannon (BFGS) (2 epochs) followed by scaled conjugate gradient ( SCG )(100...Use Matlab’s excellent Neural Network Toolbox  Optimization techniques considered:  Scaled‏Con jugate‏ Gradient‏ (“ SCG ”)‏ - fast  One‏Step

Aircraft symmetric flight optimization. [gradient techniques for supersonic aircraft control

NASA Technical Reports Server (NTRS)

Falco, M.; Kelley, H. J.

1973-01-01

Review of the development of gradient techniques and their application to aircraft optimal performance computations in the vertical plane of flight. Results obtained using the method of gradients are presented for attitude- and throttle-control programs which extremize the fuel, range, and time performance indices subject to various trajectory and control constraints, including boundedness of engine throttle control. A penalty function treatment of state inequality constraints which generally appear in aircraft performance problems is outlined. Numerical results for maximum-range, minimum-fuel, and minimum-time climb paths for a hypothetical supersonic turbojet interceptor are presented and discussed. In addition, minimum-fuel climb paths subject to various levels of ground overpressure intensity constraint are indicated for a representative supersonic transport. A variant of the Gel'fand-Tsetlin 'method of ravines' is reviewed, and two possibilities for further development of continuous gradient processes are cited - namely, a projection version of conjugate gradients and a curvilinear search.

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

NASA Technical Reports Server (NTRS)

Saxena, N. K.

1974-01-01

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

A new modified conjugate gradient coefficient for solving system of linear equations

NASA Astrophysics Data System (ADS)

Hajar, N.; ‘Aini, N.; Shapiee, N.; Abidin, Z. Z.; Khadijah, W.; Rivaie, M.; Mamat, M.

2017-09-01

Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations

Cosmic Microwave Background Mapmaking with a Messenger Field

NASA Astrophysics Data System (ADS)

Huffenberger, Kevin M.; Næss, Sigurd K.

2018-01-01

We apply a messenger field method to solve the linear minimum-variance mapmaking equation in the context of Cosmic Microwave Background (CMB) observations. In simulations, the method produces sky maps that converge significantly faster than those from a conjugate gradient descent algorithm with a diagonal preconditioner, even though the computational cost per iteration is similar. The messenger method recovers large scales in the map better than conjugate gradient descent, and yields a lower overall χ2. In the single, pencil beam approximation, each iteration of the messenger mapmaking procedure produces an unbiased map, and the iterations become more optimal as they proceed. A variant of the method can handle differential data or perform deconvolution mapmaking. The messenger method requires no preconditioner, but a high-quality solution needs a cooling parameter to control the convergence. We study the convergence properties of this new method and discuss how the algorithm is feasible for the large data sets of current and future CMB experiments.

Vacuolar transport of the glutathione conjugate of trans-cinnamic acid.

PubMed

Walczak, H A; Dean, J V

2000-02-01

Red beet (Beta vulgaris L.) tonoplast membrane vesicles and [14C]trans-cinnamic acid-glutatione were used to study the vacuolar transport of phynylpropanoid-glutathione conjugates which are formed in peroxidase-mediated reactions. It was determined that the uptake of [14C]trans-cinnamic acid-glutathione into the tonoplast membrane vesicles was MgATP dependent and was 10-fold faster than the uptake of non-conjugated [14C]trans-cinnamic acid. Uptake of the conjugate in the presence of MgATP was not dependent on a trans-tonoblast H+-electrochemical gradient, because uptake was not affected by the addition of NH4Cl (1 mM; 0% inhibition) and was only slightly affected by gramicidin-D (5 microM; 14% inhibition). Uptake of the conjugate was inhibited 92% by the addition of vanadate (1 mM) and 71% by the addition of the model substrate S-(2,4-dinitrophenyl) glutathione (500 microM). Uptake did not occur when a nonhydrolyzable analog of ATP was used in place of MgATP. The calculated Km and Vmax values for uptake were 142 microM amd 5.95 nmol mg(-1) min(-1), respectively. Based on these results, phenylpropanoid-glutation conjugates formed in peroxidase-mediated reactions appear to be transported into the vacuole by the glutathione S-conjugate pump(s) located in the tonoplast membrane.

A gradient enhanced plasticity-damage microplane model for concrete

NASA Astrophysics Data System (ADS)

Zreid, Imadeddin; Kaliske, Michael

2018-03-01

Computational modeling of concrete poses two main types of challenges. The first is the mathematical description of local response for such a heterogeneous material under all stress states, and the second is the stability and efficiency of the numerical implementation in finite element codes. The paper at hand presents a comprehensive approach addressing both issues. Adopting the microplane theory, a combined plasticity-damage model is formulated and regularized by an implicit gradient enhancement. The plasticity part introduces a new microplane smooth 3-surface cap yield function, which provides a stable numerical solution within an implicit finite element algorithm. The damage part utilizes a split, which can describe the transition of loading between tension and compression. Regularization of the model by the implicit gradient approach eliminates the mesh sensitivity and numerical instabilities. Identification methods for model parameters are proposed and several numerical examples of plain and reinforced concrete are carried out for illustration.

Trailing edge flow conditions as a factor in airfoil design

NASA Technical Reports Server (NTRS)

Ormsbee, A. I.; Maughmer, M. D.

1984-01-01

Some new developments relevant to the design of single-element airfoils using potential flow methods are presented. In particular, the role played by the non-dimensional trailing edge velocity in design is considered and the relationship between the specified value and the resulting airfoil geometry is explored. In addition, the ramifications of the unbounded trailing edge pressure gradients generally present in the potential flow solution of the flow over an airfoil are examined, and the conditions necessary to obtain a class of airfoils having finite trailing edge pressure gradients developed. The incorporation of these conditions into the inverse method of Eppler is presented and the modified scheme employed to generate a number of airfoils for consideration. The detailed viscous analysis of airfoils having finite trailing edge pressure gradients demonstrates a reduction in the strong inviscid-viscid interactions generally present near the trailing edge of an airfoil.

The lowest-order weak Galerkin finite element method for the Darcy equation on quadrilateral and hybrid meshes

NASA Astrophysics Data System (ADS)

Liu, Jiangguo; Tavener, Simon; Wang, Zhuoran

2018-04-01

This paper investigates the lowest-order weak Galerkin finite element method for solving the Darcy equation on quadrilateral and hybrid meshes consisting of quadrilaterals and triangles. In this approach, the pressure is approximated by constants in element interiors and on edges. The discrete weak gradients of these constant basis functions are specified in local Raviart-Thomas spaces, specifically RT0 for triangles and unmapped RT[0] for quadrilaterals. These discrete weak gradients are used to approximate the classical gradient when solving the Darcy equation. The method produces continuous normal fluxes and is locally mass-conservative, regardless of mesh quality, and has optimal order convergence in pressure, velocity, and normal flux, when the quadrilaterals are asymptotically parallelograms. Implementation is straightforward and results in symmetric positive-definite discrete linear systems. We present numerical experiments and comparisons with other existing methods.

On the irradiation history and origin of gas-rich meteorites

NASA Technical Reports Server (NTRS)

Rajan, R. S.

1974-01-01

Transmission electron microscope study of the track density gradients and irradiation geometries of track-rich grains and chondrules in sections of Fayetteville and Kapoeta, and in sections of lunar breccias and grains from lunar soil. A substantial fraction (50 to 90%) of the meteoritic track-rich grains and chondrules show evidence of having been irradiated anisotropically in their different faces, as would be expected for irradiation on the surface of a parent body. The observations thus support the hypothesis that the irradiation of these grains and chondrules took place on the regoliths of asteroidal-sized bodies. Measurements of steepest track density gradients indicate that, while there are finite differences between spectra exhibited by individual gas-rich meteorites, the average solar flare spectral shapes have been similar over the last 4 b.y. or so.

X-ray computed tomography imaging of a tumor with high sensitivity using gold nanoparticles conjugated to a cancer-specific antibody via polyethylene glycol chains on their surface

NASA Astrophysics Data System (ADS)

Nakagawa, Tomohiko; Gonda, Kohsuke; Kamei, Takashi; Cong, Liman; Hamada, Yoh; Kitamura, Narufumi; Tada, Hiroshi; Ishida, Takanori; Aimiya, Takuji; Furusawa, Naoko; Nakano, Yasushi; Ohuchi, Noriaki

2016-01-01

Contrast agents are often used to enhance the contrast of X-ray computed tomography (CT) imaging of tumors to improve diagnostic accuracy. However, because the iodine-based contrast agents currently used in hospitals are of low molecular weight, the agent is rapidly excreted from the kidney or moves to extravascular tissues through the capillary vessels, depending on its concentration gradient. This leads to nonspecific enhancement of contrast images for tissues. Here, we created gold (Au) nanoparticles as a new contrast agent to specifically image tumors with CT using an enhanced permeability and retention (EPR) effect. Au has a higher X-ray absorption coefficient than does iodine. Au nanoparticles were supported with polyethylene glycol (PEG) chains on their surface to increase the blood retention and were conjugated with a cancer-specific antibody via terminal PEG chains. The developed Au nanoparticles were injected into tumor-bearing mice, and the distribution of Au was examined with CT imaging, transmission electron microscopy, and elemental analysis using inductively coupled plasma optical emission spectrometry. The results show that specific localization of the developed Au nanoparticles in the tumor is affected by a slight difference in particle size and enhanced by the conjugation of a specific antibody against the tumor.

Reliability analysis of laminated CMC components through shell subelement techniques

NASA Technical Reports Server (NTRS)

Starlinger, Alois; Duffy, Stephen F.; Gyekenyesi, John P.

1992-01-01

An updated version of the integrated design program Composite Ceramics Analysis and Reliability Evaluation of Structures (C/CARES) was developed for the reliability evaluation of ceramic matrix composites (CMC) laminated shell components. The algorithm is now split into two modules: a finite-element data interface program and a reliability evaluation algorithm. More flexibility is achieved, allowing for easy implementation with various finite-element programs. The interface program creates a neutral data base which is then read by the reliability module. This neutral data base concept allows easy data transfer between different computer systems. The new interface program from the finite-element code Matrix Automated Reduction and Coupling (MARC) also includes the option of using hybrid laminates (a combination of plies of different materials or different layups) and allows for variations in temperature fields throughout the component. In the current version of C/CARES, a subelement technique was implemented, enabling stress gradients within an element to be taken into account. The noninteractive reliability function is now evaluated at each Gaussian integration point instead of using averaging techniques. As a result of the increased number of stress evaluation points, considerable improvements in the accuracy of reliability analyses were realized.

An RBF-FD closest point method for solving PDEs on surfaces

NASA Astrophysics Data System (ADS)

Petras, A.; Ling, L.; Ruuth, S. J.

2018-10-01

Partial differential equations (PDEs) on surfaces appear in many applications throughout the natural and applied sciences. The classical closest point method (Ruuth and Merriman (2008) [17]) is an embedding method for solving PDEs on surfaces using standard finite difference schemes. In this paper, we formulate an explicit closest point method using finite difference schemes derived from radial basis functions (RBF-FD). Unlike the orthogonal gradients method (Piret (2012) [22]), our proposed method uses RBF centers on regular grid nodes. This formulation not only reduces the computational cost but also avoids the ill-conditioning from point clustering on the surface and is more natural to couple with a grid based manifold evolution algorithm (Leung and Zhao (2009) [26]). When compared to the standard finite difference discretization of the closest point method, the proposed method requires a smaller computational domain surrounding the surface, resulting in a decrease in the number of sampling points on the surface. In addition, higher-order schemes can easily be constructed by increasing the number of points in the RBF-FD stencil. Applications to a variety of examples are provided to illustrate the numerical convergence of the method.

Mixed finite-element formulations in piezoelectricity and flexoelectricity

PubMed Central

2016-01-01

Flexoelectricity, the linear coupling of strain gradient and electric polarization, is inherently a size-dependent phenomenon. The energy storage function for a flexoelectric material depends not only on polarization and strain, but also strain-gradient. Thus, conventional finite-element methods formulated solely on displacement are inadequate to treat flexoelectric solids since gradients raise the order of the governing differential equations. Here, we introduce a computational framework based on a mixed formulation developed previously by one of the present authors and a colleague. This formulation uses displacement and displacement-gradient as separate variables which are constrained in a ‘weighted integral sense’ to enforce their known relation. We derive a variational formulation for boundary-value problems for piezo- and/or flexoelectric solids. We validate this computational framework against available exact solutions. Our new computational method is applied to more complex problems, including a plate with an elliptical hole, stationary cracks, as well as tension and shear of solids with a repeating unit cell. Our results address several issues of theoretical interest, generate predictions of experimental merit and reveal interesting flexoelectric phenomena with potential for application. PMID:27436967

Mixed finite-element formulations in piezoelectricity and flexoelectricity.

PubMed

Mao, Sheng; Purohit, Prashant K; Aravas, Nikolaos

2016-06-01

Flexoelectricity, the linear coupling of strain gradient and electric polarization, is inherently a size-dependent phenomenon. The energy storage function for a flexoelectric material depends not only on polarization and strain, but also strain-gradient. Thus, conventional finite-element methods formulated solely on displacement are inadequate to treat flexoelectric solids since gradients raise the order of the governing differential equations. Here, we introduce a computational framework based on a mixed formulation developed previously by one of the present authors and a colleague. This formulation uses displacement and displacement-gradient as separate variables which are constrained in a 'weighted integral sense' to enforce their known relation. We derive a variational formulation for boundary-value problems for piezo- and/or flexoelectric solids. We validate this computational framework against available exact solutions. Our new computational method is applied to more complex problems, including a plate with an elliptical hole, stationary cracks, as well as tension and shear of solids with a repeating unit cell. Our results address several issues of theoretical interest, generate predictions of experimental merit and reveal interesting flexoelectric phenomena with potential for application.

Local deformation gradients in epitaxial Pb(Zr0.2Ti0.8)O3 layers investigated by transmission electron microscopy

NASA Astrophysics Data System (ADS)

Denneulin, T.; Wollschläger, N.; Everhardt, A. S.; Farokhipoor, S.; Noheda, B.; Snoeck, E.; Hÿtch, M.

2018-05-01

Lead zirconate titanate samples are used for their piezoelectric and ferroelectric properties in various types of micro-devices. Epitaxial layers of tetragonal perovskites have a tendency to relax by forming ferroelastic domains. The accommodation of the a/c/a/c polydomain structure on a flat substrate leads to nanoscale deformation gradients which locally influence the polarization by flexoelectric effect. Here, we investigated the deformation fields in epitaxial layers of Pb(Zr0.2Ti0.8)O3 grown on SrTiO3 substrates using transmission electron microscopy (TEM). We found that the deformation gradients depend on the domain walls inclination ( or to the substrate interface) of the successive domains and we describe three different a/c/a domain configurations: one configuration with parallel a-domains and two configurations with perpendicular a-domains (V-shaped and hat--shaped). In the parallel configuration, the c-domains contain horizontal and vertical gradients of out-of-plane deformation. In the V-shaped and hat--shaped configurations, the c-domains exhibit a bending deformation field with vertical gradients of in-plane deformation. Each of these configurations is expected to have a different influence on the polarization and so the local properties of the film. The deformation gradients were measured using dark-field electron holography, a TEM technique, which offers a good sensitivity (0.1%) and a large field-of-view (hundreds of nanometers). The measurements are compared with finite element simulations.

A new implementation of the programming system for structural synthesis (PROSSS-2)

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.

1984-01-01

This new implementation of the PROgramming System for Structural Synthesis (PROSSS-2) combines a general-purpose finite element computer program for structural analysis, a state-of-the-art optimization program, and several user-supplied, problem-dependent computer programs. The results are flexibility of the optimization procedure, organization, and versatility of the formulation of constraints and design variables. The analysis-optimization process results in a minimized objective function, typically the mass. The analysis and optimization programs are executed repeatedly by looping through the system until the process is stopped by a user-defined termination criterion. However, some of the analysis, such as model definition, need only be one time and the results are saved for future use. The user must write some small, simple FORTRAN programs to interface between the analysis and optimization programs. One of these programs, the front processor, converts the design variables output from the optimizer into the suitable format for input into the analyzer. Another, the end processor, retrieves the behavior variables and, optionally, their gradients from the analysis program and evaluates the objective function and constraints and optionally their gradients. These quantities are output in a format suitable for input into the optimizer. These user-supplied programs are problem-dependent because they depend primarily upon which finite elements are being used in the model. PROSSS-2 differs from the original PROSSS in that the optimizer and front and end processors have been integrated into the finite element computer program. This was done to reduce the complexity and increase portability of the system, and to take advantage of the data handling features found in the finite element program.

A finite-element toolbox for the stationary Gross-Pitaevskii equation with rotation

NASA Astrophysics Data System (ADS)

Vergez, Guillaume; Danaila, Ionut; Auliac, Sylvain; Hecht, Frédéric

2016-12-01

We present a new numerical system using classical finite elements with mesh adaptivity for computing stationary solutions of the Gross-Pitaevskii equation. The programs are written as a toolbox for FreeFem++ (www.freefem.org), a free finite-element software available for all existing operating systems. This offers the advantage to hide all technical issues related to the implementation of the finite element method, allowing to easily code various numerical algorithms. Two robust and optimized numerical methods were implemented to minimize the Gross-Pitaevskii energy: a steepest descent method based on Sobolev gradients and a minimization algorithm based on the state-of-the-art optimization library Ipopt. For both methods, mesh adaptivity strategies are used to reduce the computational time and increase the local spatial accuracy when vortices are present. Different run cases are made available for 2D and 3D configurations of Bose-Einstein condensates in rotation. An optional graphical user interface is also provided, allowing to easily run predefined cases or with user-defined parameter files. We also provide several post-processing tools (like the identification of quantized vortices) that could help in extracting physical features from the simulations. The toolbox is extremely versatile and can be easily adapted to deal with different physical models.

Local gravity field modeling using spherical radial basis functions and a genetic algorithm

NASA Astrophysics Data System (ADS)

Mahbuby, Hany; Safari, Abdolreza; Foroughi, Ismael

2017-05-01

Spherical Radial Basis Functions (SRBFs) can express the local gravity field model of the Earth if they are parameterized optimally on or below the Bjerhammar sphere. This parameterization is generally defined as the shape of the base functions, their number, center locations, bandwidths, and scale coefficients. The number/location and bandwidths of the base functions are the most important parameters for accurately representing the gravity field; once they are determined, the scale coefficients can then be computed accordingly. In this study, the point-mass kernel, as the simplest shape of SRBFs, is chosen to evaluate the synthesized free-air gravity anomalies over the rough area in Auvergne and GNSS/Leveling points (synthetic height anomalies) are used to validate the results. A two-step automatic approach is proposed to determine the optimum distribution of the base functions. First, the location of the base functions and their bandwidths are found using the genetic algorithm; second, the conjugate gradient least squares method is employed to estimate the scale coefficients. The proposed methodology shows promising results. On the one hand, when using the genetic algorithm, the base functions do not need to be set to a regular grid and they can move according to the roughness of topography. In this way, the models meet the desired accuracy with a low number of base functions. On the other hand, the conjugate gradient method removes the bias between derived quasigeoid heights from the model and from the GNSS/leveling points; this means there is no need for a corrector surface. The numerical test on the area of interest revealed an RMS of 0.48 mGal for the differences between predicted and observed gravity anomalies, and a corresponding 9 cm for the differences in GNSS/leveling points.

Symmetry restoring bifurcations and quasiperiodic chaos induced by a new intermittency in a vibro-impact system.

PubMed

Yue, Yuan; Miao, Pengcheng; Xie, Jianhua; Celso, Grebogi

2016-11-01

Quasiperiodic chaos (QC), which is a combination of quasiperiodic sets and a chaotic set, is uncovered in the six dimensional Poincaré map of a symmetric three-degree of freedom vibro-impact system. Accompanied by symmetry restoring bifurcation, this QC is the consequence of a novel intermittency that occurs between two conjugate quasiperiodic sets and a chaotic set. The six dimensional Poincaré map P is the 2-fold composition of another virtual implicit map Q, yielding the symmetry of the system. Map Q can capture two conjugate attractors, which is at the core of the dynamics of the vibro-impact system. Three types of symmetry restoring bifurcations are analyzed in detail. First, if two conjugate chaotic attractors join together, the chaos-chaos intermittency induced by attractor-merging crisis takes place. Second, if two conjugate quasiperiodic sets are suddenly embedded in a chaotic one, QC is induced by a new intermittency between the three attractors. Third, if two conjugate quasiperiodic attractors connect with each other directly, they merge to form a single symmetric quasiperiodic one. For the second case, the new intermittency is caused by the collision of two conjugate quasiperiodic attractors with an unstable symmetric limit set. As the iteration number is increased, the largest finite-time Lyapunov exponent of the QC does not converge to a constant, but fluctuates in the positive region.

Accuracy of Gradient Reconstruction on Grids with High Aspect Ratio

NASA Technical Reports Server (NTRS)

Thomas, James

2008-01-01

Gradient approximation methods commonly used in unstructured-grid finite-volume schemes intended for solutions of high Reynolds number flow equations are studied comprehensively. The accuracy of gradients within cells and within faces is evaluated systematically for both node-centered and cell-centered formulations. Computational and analytical evaluations are made on a series of high-aspect-ratio grids with different primal elements, including quadrilateral, triangular, and mixed element grids, with and without random perturbations to the mesh. Both rectangular and cylindrical geometries are considered; the latter serves to study the effects of geometric curvature. The study shows that the accuracy of gradient reconstruction on high-aspect-ratio grids is determined by a combination of the grid and the solution. The contributors to the error are identified and approaches to reduce errors are given, including the addition of higher-order terms in the direction of larger mesh spacing. A parameter GAMMA characterizing accuracy on curved high-aspect-ratio grids is discussed and an approximate-mapped-least-square method using a commonly-available distance function is presented; the method provides accurate gradient reconstruction on general grids. The study is intended to be a reference guide accompanying the construction of accurate and efficient methods for high Reynolds number applications

GVVPT2 energy gradient using a Lagrangian formulation.

PubMed

Theis, Daniel; Khait, Yuriy G; Hoffmann, Mark R

2011-07-28

A Lagrangian based approach was used to obtain analytic formulas for GVVPT2 energy nuclear gradients. The formalism can use either complete or incomplete model (or reference) spaces, and is limited, in this regard, only by the capabilities of the MCSCF program. An efficient means of evaluating the gradient equations is described. Demonstrative calculations were performed and compared with finite difference calculations on several molecules and show that the GVVPT2 gradients are accurate. Of particular interest, the suggested formalism can straightforwardly use state-averaged MCSCF descriptions of the reference space in which the states have arbitrary weights. This capability is demonstrated by some calculations on the ground and first excited singlet states of LiH, including calculations near an avoided crossing. The accuracy and usefulness of the GVVPT2 method and its gradient are highlighted by comparing the geometry of the near-C(2v) minimum on the conical intersection seam between the 1 (1)A(1) and 2 (1)A(1) surfaces of O(3) with values that were calculated at the multireference configuration interaction, including single and double excitations (MRCISD), level of theory. © 2011 American Institute of Physics

3-D Magnetotelluric Forward Modeling And Inversion Incorporating Topography By Using Vector Finite-Element Method Combined With Divergence Corrections Based On The Magnetic Field (VFEH++)

NASA Astrophysics Data System (ADS)

Shi, X.; Utada, H.; Jiaying, W.

2009-12-01

The vector finite-element method combined with divergence corrections based on the magnetic field H, referred to as VFEH++ method, is developed to simulate the magnetotelluric (MT) responses of 3-D conductivity models. The advantages of the new VFEH++ method are the use of edge-elements to eliminate the vector parasites and the divergence corrections to explicitly guarantee the divergence-free conditions in the whole modeling domain. 3-D MT topographic responses are modeling using the new VFEH++ method, and are compared with those calculated by other numerical methods. The results show that MT responses can be modeled highly accurate using the VFEH+ +method. The VFEH++ algorithm is also employed for the 3-D MT data inversion incorporating topography. The 3-D MT inverse problem is formulated as a minimization problem of the regularized misfit function. In order to avoid the huge memory requirement and very long time for computing the Jacobian sensitivity matrix for Gauss-Newton method, we employ the conjugate gradient (CG) approach to solve the inversion equation. In each iteration of CG algorithm, the cost computation is the product of the Jacobian sensitivity matrix with a model vector x or its transpose with a data vector y, which can be transformed into two pseudo-forwarding modeling. This avoids the full explicitly Jacobian matrix calculation and storage which leads to considerable savings in the memory required by the inversion program in PC computer. The performance of CG algorithm will be illustrated by several typical 3-D models with horizontal earth surface and topographic surfaces. The results show that the VFEH++ and CG algorithms can be effectively employed to 3-D MT field data inversion.

Electrical Resistivity Tomography using a finite element based BFGS algorithm with algebraic multigrid preconditioning

NASA Astrophysics Data System (ADS)

Codd, A. L.; Gross, L.

2018-03-01

We present a new inversion method for Electrical Resistivity Tomography which, in contrast to established approaches, minimizes the cost function prior to finite element discretization for the unknown electric conductivity and electric potential. Minimization is performed with the Broyden-Fletcher-Goldfarb-Shanno method (BFGS) in an appropriate function space. BFGS is self-preconditioning and avoids construction of the dense Hessian which is the major obstacle to solving large 3-D problems using parallel computers. In addition to the forward problem predicting the measurement from the injected current, the so-called adjoint problem also needs to be solved. For this problem a virtual current is injected through the measurement electrodes and an adjoint electric potential is obtained. The magnitude of the injected virtual current is equal to the misfit at the measurement electrodes. This new approach has the advantage that the solution process of the optimization problem remains independent to the meshes used for discretization and allows for mesh adaptation during inversion. Computation time is reduced by using superposition of pole loads for the forward and adjoint problems. A smoothed aggregation algebraic multigrid (AMG) preconditioned conjugate gradient is applied to construct the potentials for a given electric conductivity estimate and for constructing a first level BFGS preconditioner. Through the additional reuse of AMG operators and coarse grid solvers inversion time for large 3-D problems can be reduced further. We apply our new inversion method to synthetic survey data created by the resistivity profile representing the characteristics of subsurface fluid injection. We further test it on data obtained from a 2-D surface electrode survey on Heron Island, a small tropical island off the east coast of central Queensland, Australia.

Numerical model of thermo-mechanical coupling for the tensile failure process of brittle materials

NASA Astrophysics Data System (ADS)

Fu, Yu; Wang, Zhe; Ren, Fengyu; Wang, Daguo

2017-10-01

A numerical model of thermal cracking with a thermo-mechanical coupling effect was established. The theory of tensile failure and heat conduction is used to study the tensile failure process of brittle materials, such as rock and concrete under high temperature environment. The validity of the model is verified by thick-wall cylinders with analytical solutions. The failure modes of brittle materials under thermal stresses caused by temperature gradient and different thermal expansion coefficient were studied by using a thick-wall cylinder model and an embedded particle model, respectively. In the thick-wall cylinder model, different forms of cracks induced by temperature gradient were obtained under different temperature boundary conditions. In the embedded particle model, radial cracks were produced in the medium part with lower tensile strength when temperature increased because of the different thermal expansion coefficient. Model results are in good agreement with the experimental results, thereby providing a new finite element method for analyzing the thermal damage process and mechanism of brittle materials.

Thermodynamic stability of nanosized multicomponent bubbles/droplets: the square gradient theory and the capillary approach.

PubMed

Wilhelmsen, Øivind; Bedeaux, Dick; Kjelstrup, Signe; Reguera, David

2014-01-14

Formation of nanosized droplets/bubbles from a metastable bulk phase is connected to many unresolved scientific questions. We analyze the properties and stability of multicomponent droplets and bubbles in the canonical ensemble, and compare with single-component systems. The bubbles/droplets are described on the mesoscopic level by square gradient theory. Furthermore, we compare the results to a capillary model which gives a macroscopic description. Remarkably, the solutions of the square gradient model, representing bubbles and droplets, are accurately reproduced by the capillary model except in the vicinity of the spinodals. The solutions of the square gradient model form closed loops, which shows the inherent symmetry and connected nature of bubbles and droplets. A thermodynamic stability analysis is carried out, where the second variation of the square gradient description is compared to the eigenvalues of the Hessian matrix in the capillary description. The analysis shows that it is impossible to stabilize arbitrarily small bubbles or droplets in closed systems and gives insight into metastable regions close to the minimum bubble/droplet radii. Despite the large difference in complexity, the square gradient and the capillary model predict the same finite threshold sizes and very similar stability limits for bubbles and droplets, both for single-component and two-component systems.

Thermodynamic stability of nanosized multicomponent bubbles/droplets: The square gradient theory and the capillary approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilhelmsen, Øivind, E-mail: oivind.wilhelmsen@ntnu.no; Bedeaux, Dick; Kjelstrup, Signe

Formation of nanosized droplets/bubbles from a metastable bulk phase is connected to many unresolved scientific questions. We analyze the properties and stability of multicomponent droplets and bubbles in the canonical ensemble, and compare with single-component systems. The bubbles/droplets are described on the mesoscopic level by square gradient theory. Furthermore, we compare the results to a capillary model which gives a macroscopic description. Remarkably, the solutions of the square gradient model, representing bubbles and droplets, are accurately reproduced by the capillary model except in the vicinity of the spinodals. The solutions of the square gradient model form closed loops, which showsmore » the inherent symmetry and connected nature of bubbles and droplets. A thermodynamic stability analysis is carried out, where the second variation of the square gradient description is compared to the eigenvalues of the Hessian matrix in the capillary description. The analysis shows that it is impossible to stabilize arbitrarily small bubbles or droplets in closed systems and gives insight into metastable regions close to the minimum bubble/droplet radii. Despite the large difference in complexity, the square gradient and the capillary model predict the same finite threshold sizes and very similar stability limits for bubbles and droplets, both for single-component and two-component systems.« less

HEATING 7. 1 user's manual

DOE Office of Scientific and Technical Information (OSTI.GOV)

Childs, K.W.

1991-07-01

HEATING is a FORTRAN program designed to solve steady-state and/or transient heat conduction problems in one-, two-, or three- dimensional Cartesian, cylindrical, or spherical coordinates. A model may include multiple materials, and the thermal conductivity, density, and specific heat of each material may be both time- and temperature-dependent. The thermal conductivity may be anisotropic. Materials may undergo change of phase. Thermal properties of materials may be input or may be extracted from a material properties library. Heating generation rates may be dependent on time, temperature, and position, and boundary temperatures may be time- and position-dependent. The boundary conditions, which maymore » be surface-to-boundary or surface-to-surface, may be specified temperatures or any combination of prescribed heat flux, forced convection, natural convection, and radiation. The boundary condition parameters may be time- and/or temperature-dependent. General graybody radiation problems may be modeled with user-defined factors for radiant exchange. The mesh spacing may be variable along each axis. HEATING is variably dimensioned and utilizes free-form input. Three steady-state solution techniques are available: point-successive-overrelaxation iterative method with extrapolation, direct-solution (for one-dimensional or two-dimensional problems), and conjugate gradient. Transient problems may be solved using one of several finite-difference schemes: Crank-Nicolson implicit, Classical Implicit Procedure (CIP), Classical Explicit Procedure (CEP), or Levy explicit method (which for some circumstances allows a time step greater than the CEP stability criterion). The solution of the system of equations arising from the implicit techniques is accomplished by point-successive-overrelaxation iteration and includes procedures to estimate the optimum acceleration parameter.« less

Compact high order schemes with gradient-direction derivatives for absorbing boundary conditions

NASA Astrophysics Data System (ADS)

Gordon, Dan; Gordon, Rachel; Turkel, Eli

2015-09-01

We consider several compact high order absorbing boundary conditions (ABCs) for the Helmholtz equation in three dimensions. A technique called "the gradient method" (GM) for ABCs is also introduced and combined with the high order ABCs. GM is based on the principle of using directional derivatives in the direction of the wavefront propagation. The new ABCs are used together with the recently introduced compact sixth order finite difference scheme for variable wave numbers. Experiments on problems with known analytic solutions produced very accurate results, demonstrating the efficacy of the high order schemes, particularly when combined with GM. The new ABCs are then applied to the SEG/EAGE Salt model, showing the advantages of the new schemes.

Broiler weight estimation based on machine vision and artificial neural network.

PubMed

Amraei, S; Abdanan Mehdizadeh, S; Salari, S

2017-04-01

1. Machine vision and artificial neural network (ANN) procedures were used to estimate live body weight of broiler chickens in 30 1-d-old broiler chickens reared for 42 d. 2. Imaging was performed two times daily. To localise chickens within the pen, an ellipse fitting algorithm was used and the chickens' head and tail removed using the Chan-Vese method. 3. The correlations between the body weight and 6 physical extracted features indicated that there were strong correlations between body weight and the 5 features including area, perimeter, convex area, major and minor axis length. 5. According to statistical analysis there was no significant difference between morning and afternoon data over 42 d. 6. In an attempt to improve the accuracy of live weight approximation different ANN techniques, including Bayesian regulation, Levenberg-Marquardt, Scaled conjugate gradient and gradient descent were used. Bayesian regulation with R 2 value of 0.98 was the best network for prediction of broiler weight. 7. The accuracy of the machine vision technique was examined and most errors were less than 50 g.

Second order finite-difference ghost-point multigrid methods for elliptic problems with discontinuous coefficients on an arbitrary interface

NASA Astrophysics Data System (ADS)

Coco, Armando; Russo, Giovanni

2018-05-01

In this paper we propose a second-order accurate numerical method to solve elliptic problems with discontinuous coefficients (with general non-homogeneous jumps in the solution and its gradient) in 2D and 3D. The method consists of a finite-difference method on a Cartesian grid in which complex geometries (boundaries and interfaces) are embedded, and is second order accurate in the solution and the gradient itself. In order to avoid the drop in accuracy caused by the discontinuity of the coefficients across the interface, two numerical values are assigned on grid points that are close to the interface: a real value, that represents the numerical solution on that grid point, and a ghost value, that represents the numerical solution extrapolated from the other side of the interface, obtained by enforcing the assigned non-homogeneous jump conditions on the solution and its flux. The method is also extended to the case of matrix coefficient. The linear system arising from the discretization is solved by an efficient multigrid approach. Unlike the 1D case, grid points are not necessarily aligned with the normal derivative and therefore suitable stencils must be chosen to discretize interface conditions in order to achieve second order accuracy in the solution and its gradient. A proper treatment of the interface conditions will allow the multigrid to attain the optimal convergence factor, comparable with the one obtained by Local Fourier Analysis for rectangular domains. The method is robust enough to handle large jump in the coefficients: order of accuracy, monotonicity of the errors and good convergence factor are maintained by the scheme.

Analyzing signal attenuation in PFG anomalous diffusion via a non-Gaussian phase distribution approximation approach by fractional derivatives.

PubMed

Lin, Guoxing

2016-11-21

Anomalous diffusion exists widely in polymer and biological systems. Pulsed-field gradient (PFG) techniques have been increasingly used to study anomalous diffusion in nuclear magnetic resonance and magnetic resonance imaging. However, the interpretation of PFG anomalous diffusion is complicated. Moreover, the exact signal attenuation expression including the finite gradient pulse width effect has not been obtained based on fractional derivatives for PFG anomalous diffusion. In this paper, a new method, a Mainardi-Luchko-Pagnini (MLP) phase distribution approximation, is proposed to describe PFG fractional diffusion. MLP phase distribution is a non-Gaussian phase distribution. From the fractional derivative model, both the probability density function (PDF) of a spin in real space and the PDF of the spin's accumulating phase shift in virtual phase space are MLP distributions. The MLP phase distribution leads to a Mittag-Leffler function based PFG signal attenuation, which differs significantly from the exponential attenuation for normal diffusion and from the stretched exponential attenuation for fractional diffusion based on the fractal derivative model. A complete signal attenuation expression E α (-D f b α,β * ) including the finite gradient pulse width effect was obtained and it can handle all three types of PFG fractional diffusions. The result was also extended in a straightforward way to give a signal attenuation expression of fractional diffusion in PFG intramolecular multiple quantum coherence experiments, which has an n β dependence upon the order of coherence which is different from the familiar n 2 dependence in normal diffusion. The results obtained in this study are in agreement with the results from the literature. The results in this paper provide a set of new, convenient approximation formalisms to interpret complex PFG fractional diffusion experiments.

FORTRAN program for calculating velocities and streamlines on the hub-shroud mid-channel flow surface of an axial- or mixed-flow turbomachine. 1: User's manual

NASA Technical Reports Server (NTRS)

Katsanis, T.

1973-01-01

A FORTRAN 4 computer program has been developed that obtains a subsonic or shock-free transonic flow solution on the hub-shroud mid-channel flow surface of a turbomachine. The blade row may be fixed or rotating, and may be twisted and leaned. Flow may be axial or mixed, up to 45 deg from axial. Upstream and downstream flow variables may vary from hub to shroud, and provision is made to correct for loss of stagnation pressure. The results include velocities, streamlines, and flow angles on the flow surface; and approximate blade surface velocities. Subsonic solutions are obtained by a finite-difference stream-function solution. Transonic solutions are obtained by a velocity-gradient method, using information from a finite-difference stream-function solution at a reduced mass flow.

Size validity of plasma-metamaterial cloaking monitored by scattering wave in finite-difference time-domain method

NASA Astrophysics Data System (ADS)

Bambina, Alexandre; Yamaguchi, Shuhei; Iwai, Akinori; Miyagi, Shigeyuki; Sakai, Osamu

2018-01-01

Limitation of the cloak-size reduction is investigated numerically by a finite-difference time-domain (FDTD) method. A metallic pole that imitates an antenna is cloaked with an anisotropic and parameter-gradient medium against electromagnetic-wave propagation in microwave range. The cloaking structure is a metamaterial submerged in a plasma confined in a vacuum chamber made of glass. The smooth-permittivity plasma can be compressed in the radial direction, which enables us to decrease the size of the cloak. Theoretical analysis is performed numerically by comparing scattering waves in various cases; there exists a high reduction of the scattering wave when the radius of the cloak is larger than a quarter of one wavelength. This result indicates that the required size of the cloaking layer is more than an object scale in the Rayleigh scattering regime.

FORTRAN program for calculating velocities and streamlines on the hub-shroud mid-channel flow surface of an axial-or mixed-flow turbomachine. 2: Programmer's manual

NASA Technical Reports Server (NTRS)

Katsanis, T.; Mcnally, W. D.

1974-01-01

A FORTRAN-IV computer program, MERIDL, has been developed that obtains a subsonic or shock-free transonic flow solution on the hub-shroud mid-channel flow surface of a turbomachine. The blade row may be fixed or rotating and may be twisted and leaned. Flow may be axial or mixed, up to 45 deg from axial. Upstream and downstream flow variables can vary from hub to shroud, and provision is made to correct for loss of stagnation pressure. The results include velocities, streamlines, and flow angles on the flow surface and approximate blade surface velocities. Subsonic solutions are obtained by a finite-difference stream-function solution. Transonic solutions are obtained by a velocity-gradient method, using information from a finite-difference stream-function solution at a reduced mass flow.

A projection gradient method for computing ground state of spin-2 Bose–Einstein condensates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, Hanquan, E-mail: hanquan.wang@gmail.com; Yunnan Tongchang Scientific Computing and Data Mining Research Center, Kunming, Yunnan Province, 650221

In this paper, a projection gradient method is presented for computing ground state of spin-2 Bose–Einstein condensates (BEC). We first propose the general projection gradient method for solving energy functional minimization problem under multiple constraints, in which the energy functional takes real functions as independent variables. We next extend the method to solve a similar problem, where the energy functional now takes complex functions as independent variables. We finally employ the method into finding the ground state of spin-2 BEC. The key of our method is: by constructing continuous gradient flows (CGFs), the ground state of spin-2 BEC can bemore » computed as the steady state solution of such CGFs. We discretized the CGFs by a conservative finite difference method along with a proper way to deal with the nonlinear terms. We show that the numerical discretization is normalization and magnetization conservative and energy diminishing. Numerical results of the ground state and their energy of spin-2 BEC are reported to demonstrate the effectiveness of the numerical method.« less

Upscaling from particle models to entropic gradient flows

NASA Astrophysics Data System (ADS)

Dirr, Nicolas; Laschos, Vaios; Zimmer, Johannes

2012-06-01

We prove that, for the case of Gaussians on the real line, the functional derived by a time discretization of the diffusion equation as entropic gradient flow is asymptotically equivalent to the rate functional derived from the underlying microscopic process. This result strengthens a conjecture that the same statement is actually true for all measures with second finite moment.

Drift and Behavior of E. coli Cells

NASA Astrophysics Data System (ADS)

Micali, Gabriele; Colin, Rémy; Sourjik, Victor; Endres, Robert G.

2017-12-01

Chemotaxis of the bacterium Escherichia coli is well understood in shallow chemical gradients, but its swimming behavior remains difficult to interpret in steep gradients. By focusing on single-cell trajectories from simulations, we investigated the dependence of the chemotactic drift velocity on attractant concentration in an exponential gradient. While maxima of the average drift velocity can be interpreted within analytical linear-response theory of chemotaxis in shallow gradients, limits in drift due to steep gradients and finite number of receptor-methylation sites for adaptation go beyond perturbation theory. For instance, we found a surprising pinning of the cells to the concentration in the gradient at which cells run out of methylation sites. To validate the positions of maximal drift, we recorded single-cell trajectories in carefully designed chemical gradients using microfluidics.

Bessel smoothing filter for spectral-element mesh

NASA Astrophysics Data System (ADS)

Trinh, P. T.; Brossier, R.; Métivier, L.; Virieux, J.; Wellington, P.

2017-06-01

Smoothing filters are extremely important tools in seismic imaging and inversion, such as for traveltime tomography, migration and waveform inversion. For efficiency, and as they can be used a number of times during inversion, it is important that these filters can easily incorporate prior information on the geological structure of the investigated medium, through variable coherent lengths and orientation. In this study, we promote the use of the Bessel filter to achieve these purposes. Instead of considering the direct application of the filter, we demonstrate that we can rely on the equation associated with its inverse filter, which amounts to the solution of an elliptic partial differential equation. This enhances the efficiency of the filter application, and also its flexibility. We apply this strategy within a spectral-element-based elastic full waveform inversion framework. Taking advantage of this formulation, we apply the Bessel filter by solving the associated partial differential equation directly on the spectral-element mesh through the standard weak formulation. This avoids cumbersome projection operators between the spectral-element mesh and a regular Cartesian grid, or expensive explicit windowed convolution on the finite-element mesh, which is often used for applying smoothing operators. The associated linear system is solved efficiently through a parallel conjugate gradient algorithm, in which the matrix vector product is factorized and highly optimized with vectorized computation. Significant scaling behaviour is obtained when comparing this strategy with the explicit convolution method. The theoretical numerical complexity of this approach increases linearly with the coherent length, whereas a sublinear relationship is observed practically. Numerical illustrations are provided here for schematic examples, and for a more realistic elastic full waveform inversion gradient smoothing on the SEAM II benchmark model. These examples illustrate well the efficiency and flexibility of the approach proposed.

Cochlear pharmacokinetics with local inner ear drug delivery using a three-dimensional finite-element computer model.

PubMed

Plontke, Stefan K; Siedow, Norbert; Wegener, Raimund; Zenner, Hans-Peter; Salt, Alec N

2007-01-01

Cochlear fluid pharmacokinetics can be better represented by three-dimensional (3D) finite-element simulations of drug dispersal. Local drug deliveries to the round window membrane are increasingly being used to treat inner ear disorders. Crucial to the development of safe therapies is knowledge of drug distribution in the inner ear with different delivery methods. Computer simulations allow application protocols and drug delivery systems to be evaluated, and may permit animal studies to be extrapolated to the larger cochlea of the human. A finite-element 3D model of the cochlea was constructed based on geometric dimensions of the guinea pig cochlea. Drug propagation along and between compartments was described by passive diffusion. To demonstrate the potential value of the model, methylprednisolone distribution in the cochlea was calculated for two clinically relevant application protocols using pharmacokinetic parameters derived from a prior one-dimensional (1D) model. In addition, a simplified geometry was used to compare results from 3D with 1D simulations. For the simplified geometry, calculated concentration profiles with distance were in excellent agreement between the 1D and the 3D models. Different drug delivery strategies produce very different concentration time courses, peak concentrations and basal-apical concentration gradients of drug. In addition, 3D computations demonstrate the existence of substantial gradients across the scalae in the basal turn. The 3D model clearly shows the presence of drug gradients across the basal scalae of guinea pigs, demonstrating the necessity of a 3D approach to predict drug movements across and between scalae with larger cross-sectional areas, such as the human, with accuracy. This is the first model to incorporate the volume of the spiral ligament and to calculate diffusion through this structure. Further development of the 3D model will have to incorporate a more accurate geometry of the entire inner ear and incorporate more of the specific processes that contribute to drug removal from the inner ear fluids. Appropriate computer models may assist in both drug and drug delivery system design and can thus accelerate the development of a rationale-based local drug delivery to the inner ear and its successful establishment in clinical practice. Copyright 2007 S. Karger AG, Basel.

Cochlear Pharmacokinetics with Local Inner Ear Drug Delivery Using a Three-Dimensional Finite-Element Computer Model

PubMed Central

Plontke, Stefan K.; Siedow, Norbert; Wegener, Raimund; Zenner, Hans-Peter; Salt, Alec N.

2006-01-01

Hypothesis: Cochlear fluid pharmacokinetics can be better represented by three-dimensional (3D) finite-element simulations of drug dispersal. Background: Local drug deliveries to the round window membrane are increasingly being used to treat inner ear disorders. Crucial to the development of safe therapies is knowledge of drug distribution in the inner ear with different delivery methods. Computer simulations allow application protocols and drug delivery systems to be evaluated, and may permit animal studies to be extrapolated to the larger cochlea of the human. Methods: A finite-element 3D model of the cochlea was constructed based on geometric dimensions of the guinea pig cochlea. Drug propagation along and between compartments was described by passive diffusion. To demonstrate the potential value of the model, methylprednisolone distribution in the cochlea was calculated for two clinically relevant application protocols using pharmacokinetic parameters derived from a prior one-dimensional (1D) model. In addition, a simplified geometry was used to compare results from 3D with 1D simulations. Results: For the simplified geometry, calculated concentration profiles with distance were in excellent agreement between the 1D and the 3D models. Different drug delivery strategies produce very different concentration time courses, peak concentrations and basal-apical concentration gradients of drug. In addition, 3D computations demonstrate the existence of substantial gradients across the scalae in the basal turn. Conclusion: The 3D model clearly shows the presence of drug gradients across the basal scalae of guinea pigs, demonstrating the necessity of a 3D approach to predict drug movements across and between scalae with larger cross-sectional areas, such as the human, with accuracy. This is the first model to incorporate the volume of the spiral ligament and to calculate diffusion through this structure. Further development of the 3D model will have to incorporate a more accurate geometry of the entire inner ear and incorporate more of the specific processes that contribute to drug removal from the inner ear fluids. Appropriate computer models may assist in both drug and drug delivery system design and can thus accelerate the development of a rationale-based local drug delivery to the inner ear and its successful establishment in clinical practice. PMID:17119332

Inversion of potential field data using the finite element method on parallel computers

NASA Astrophysics Data System (ADS)

Gross, L.; Altinay, C.; Shaw, S.

2015-11-01

In this paper we present a formulation of the joint inversion of potential field anomaly data as an optimization problem with partial differential equation (PDE) constraints. The problem is solved using the iterative Broyden-Fletcher-Goldfarb-Shanno (BFGS) method with the Hessian operator of the regularization and cross-gradient component of the cost function as preconditioner. We will show that each iterative step requires the solution of several PDEs namely for the potential fields, for the adjoint defects and for the application of the preconditioner. In extension to the traditional discrete formulation the BFGS method is applied to continuous descriptions of the unknown physical properties in combination with an appropriate integral form of the dot product. The PDEs can easily be solved using standard conforming finite element methods (FEMs) with potentially different resolutions. For two examples we demonstrate that the number of PDE solutions required to reach a given tolerance in the BFGS iteration is controlled by weighting regularization and cross-gradient but is independent of the resolution of PDE discretization and that as a consequence the method is weakly scalable with the number of cells on parallel computers. We also show a comparison with the UBC-GIF GRAV3D code.

[Research on respiration course of human at different postures by electrical impedance tomography].

PubMed

Chen, Xiaoyan; Wu, Jun; Wang, Huaxiang; Li, Da

2010-10-01

In this paper, the respiration courses of human at different postures are reconstructed by electrical impedance tomography (EIT). Conjugate gradient least squares (CGLS) algorithm is applied to reconstruct the resistivity distribution during respiration courses, and the EIT images taken from human at flat lying, left lying, right lying, sitting and prone postures are reconstructed and compared. The relative changes of the resistivity in region of interest (ROI) are analyzed to evidence the influences caused by different postures. Results show that the changes in postures are the most influential factors for the reconstructions, and the EIT images vary with the postures. In human at flat-lying posture, the left and right lungs have larger pulmonary ventilation volume simultaneously, and the EIT-measured data are of lower variability.

Hydrodynamic Influence Dabanhu River Bridge Holes Widening Based on Two-Dimensional Finite Element Numerical Model

NASA Astrophysics Data System (ADS)

Li, Dong Feng; Bai, Fu Qing; Nie, Hui

2018-06-01

In order to analyze the influence of bridge holes widening on hydrodynamic such as water level, a two-dimensional mathematical model was used to calculate the hydrodynamic factors, river network flow velocity vector distribution is given, water level and difference of bridge widening before and after is calculated and charted, water surface gradient in seven different river sections near the upper reaches of bridges is counted and revealed. The results of hydrodynamic calculation indicate that The Maximum and the minimum deducing numerical value of the water level after bridge widening is 0.028m, and 0.018m respective. the seven sections water surface gradient becomes smaller until it becomes negative, the influence of bridge widening on the upstream is basically over, the range of influence is about 450m from the bridge to the upstream. reach

Method of Lines Transpose an Implicit Vlasov Maxwell Solver for Plasmas

DTIC Science & Technology

2015-04-17

boundary crossings should be rare. Numerical results for the Bennett pinch are given in Figure 9. In order to resolve large gradients near the center of the...contributing to the large error at the center of the beam due to large gradients there) and with the finite beam cut-off radius and the outflow boundary...usable time step size can be limited by the numerical accuracy of the method when there are large gradients (high-frequency content) in the solution. We

Finite Element Analysis of Multilayered and Functionally Gradient Tribological Coatings With Measured Material Properties (Preprint)

DTIC Science & Technology

2006-11-01

gradient coatings with diamond like carbon (DLC) coating on 440C stainless steel substrate were assumed as a series of perfectly bonded layers with...resistance and low friction. Ti1-xCx (0≤ x ≤1) gradient coatings with diamond like carbon (DLC) coating on 440C stainless steel substrate were...indenter tip was used for the FEA model. Each coating sample consists of 1 μm thick coating and 440C stainless steel substrate. The area function for

Solution of Eshelby's inclusion problem with a bounded domain and Eshelby's tensor for a spherical inclusion in a finite spherical matrix based on a simplified strain gradient elasticity theory

NASA Astrophysics Data System (ADS)

Gao, X.-L.; Ma, H. M.

2010-05-01

A solution for Eshelby's inclusion problem of a finite homogeneous isotropic elastic body containing an inclusion prescribed with a uniform eigenstrain and a uniform eigenstrain gradient is derived in a general form using a simplified strain gradient elasticity theory (SSGET). An extended Betti's reciprocal theorem and an extended Somigliana's identity based on the SSGET are proposed and utilized to solve the finite-domain inclusion problem. The solution for the disturbed displacement field is expressed in terms of the Green's function for an infinite three-dimensional elastic body in the SSGET. It contains a volume integral term and a surface integral term. The former is the same as that for the infinite-domain inclusion problem based on the SSGET, while the latter represents the boundary effect. The solution reduces to that of the infinite-domain inclusion problem when the boundary effect is not considered. The problem of a spherical inclusion embedded concentrically in a finite spherical elastic body is analytically solved by applying the general solution, with the Eshelby tensor and its volume average obtained in closed forms. This Eshelby tensor depends on the position, inclusion size, matrix size, and material length scale parameter, and, as a result, can capture the inclusion size and boundary effects, unlike existing Eshelby tensors. It reduces to the classical Eshelby tensor for the spherical inclusion in an infinite matrix if both the strain gradient and boundary effects are suppressed. Numerical results quantitatively show that the inclusion size effect can be quite large when the inclusion is very small and that the boundary effect can dominate when the inclusion volume fraction is very high. However, the inclusion size effect is diminishing as the inclusion becomes large enough, and the boundary effect is vanishing as the inclusion volume fraction gets sufficiently low.

Deflection monitoring for a box girder based on a modified conjugate beam method

NASA Astrophysics Data System (ADS)

Chen, Shi-Zhi; Wu, Gang; Xing, Tuo

2017-08-01

After several years of operation, a box girder bridge would commonly experience excessive deflection, which endangers the bridge’s life span as well as the safety of vehicles travelling on it. In order to avoid potential risks, it is essential to constantly monitor the defection of box girders. However, currently, the direct deflection monitoring methods are limited by the complicated environments beneath the bridges, such as rivers or other traffic lanes, which severely impede the layouts of the sensors. The other indirect deflection monitoring methods mostly do not thoroughly consider the inherent shear lag effect and shear deformation in the box girder, resulting in a rather large error. Under these circumstances, a deflection monitoring method suiting box girders is proposed in this article, based on the conjugate beam method and distributed long-gauge fibre Bragg grating (FBG) sensor. A lab experiment was conducted to verify the reliability and feasibility of this method under practical application. Further, the serviceability under different span-depth ratios and web thicknesses was examined through a finite element model.

A viscoelastic higher-order beam finite element

NASA Technical Reports Server (NTRS)

Johnson, Arthur R.; Tressler, Alexander

1996-01-01

A viscoelastic internal variable constitutive theory is applied to a higher-order elastic beam theory and finite element formulation. The behavior of the viscous material in the beam is approximately modeled as a Maxwell solid. The finite element formulation requires additional sets of nodal variables for each relaxation time constant needed by the Maxwell solid. Recent developments in modeling viscoelastic material behavior with strain variables that are conjugate to the elastic strain measures are combined with advances in modeling through-the-thickness stresses and strains in thick beams. The result is a viscous thick-beam finite element that possesses superior characteristics for transient analysis since its nodal viscous forces are not linearly dependent an the nodal velocities, which is the case when damping matrices are used. Instead, the nodal viscous forces are directly dependent on the material's relaxation spectrum and the history of the nodal variables through a differential form of the constitutive law for a Maxwell solid. The thick beam quasistatic analysis is explored herein as a first step towards developing more complex viscoelastic models for thick plates and shells, and for dynamic analyses. The internal variable constitutive theory is derived directly from the Boltzmann superposition theorem. The mechanical strains and the conjugate internal strains are shown to be related through a system of first-order, ordinary differential equations. The total time-dependent stress is the superposition of its elastic and viscous components. Equations of motion for the solid are derived from the virtual work principle using the total time-dependent stress. Numerical examples for the problems of relaxation, creep, and cyclic creep are carried out for a beam made from an orthotropic Maxwell solid.

Integrated Tsunami Database: simulation and identification of seismic tsunami sources, 3D visualization and post-disaster assessment on the shore

NASA Astrophysics Data System (ADS)

Krivorot'ko, Olga; Kabanikhin, Sergey; Marinin, Igor; Karas, Adel; Khidasheli, David

2013-04-01

One of the most important problems of tsunami investigation is the problem of seismic tsunami source reconstruction. Non-profit organization WAPMERR (http://wapmerr.org) has provided a historical database of alleged tsunami sources around the world that obtained with the help of information about seaquakes. WAPMERR also has a database of observations of the tsunami waves in coastal areas. The main idea of presentation consists of determining of the tsunami source parameters using seismic data and observations of the tsunami waves on the shore, and the expansion and refinement of the database of presupposed tsunami sources for operative and accurate prediction of hazards and assessment of risks and consequences. Also we present 3D visualization of real-time tsunami wave propagation and loss assessment, characterizing the nature of the building stock in cities at risk, and monitoring by satellite images using modern GIS technology ITRIS (Integrated Tsunami Research and Information System) developed by WAPMERR and Informap Ltd. The special scientific plug-in components are embedded in a specially developed GIS-type graphic shell for easy data retrieval, visualization and processing. The most suitable physical models related to simulation of tsunamis are based on shallow water equations. We consider the initial-boundary value problem in Ω := {(x,y) ?R2 : x ?(0,Lx ), y ?(0,Ly ), Lx,Ly > 0} for the well-known linear shallow water equations in the Cartesian coordinate system in terms of the liquid flow components in dimensional form Here ?(x,y,t) defines the free water surface vertical displacement, i.e. amplitude of a tsunami wave, q(x,y) is the initial amplitude of a tsunami wave. The lateral boundary is assumed to be a non-reflecting boundary of the domain, that is, it allows the free passage of the propagating waves. Assume that the free surface oscillation data at points (xm, ym) are given as a measured output data from tsunami records: fm(t) := ? (xm, ym,t), (xm,ym ) ?Ω, t ?(Tm1, Tm2), m = 1,2,...,M, M ?N (2) The problem of tsunami source reconstruction (inverse tsunami problem) consists of determining the unknown initial perturbation q(x,y) of the free surface defied in (1) from knowledge of the free surface oscillation data fm(t) given by (2). We present a numerical method to determine the tsunami source using measurements of the height of a passing tsunami wave. Proposed approach based on the weak solution theory for hyperbolic PDEs and adjoint problem method for minimization of the corresponding cost functional 2 J(q) = ?Aq - F? , F = (f1,...,fM ). (3) The adjoint problem is defined to obtain an explicit gradient formula for the cost functional (3). Different numerical algorithms (finite-difference approach and finite volume method) are proposed for the direct as well as adjoint problem. Conjugate gradient algorithm based on explicit gradient formula is used for numerical solution of the inverse problem (1)-(2). This work was partially supported by the Russian Foundation for Basic Research (project No. 12-01-00773) and by SB RAS interdisciplinary project 14 "Inverse Problems and Applications: Theory, Algorithms, Software".

Modelling Near-Surface Metallic Clutter Without the Excruciating Pain

NASA Astrophysics Data System (ADS)

Downs, C. M.; Weiss, C. J.; Bach, J.; Williams, J. T.

2016-12-01

An ongoing problem in modeling electromagnetic (EM) interactions with the near-surface and related anthropogenic metal clutter is the large difference in length scale between the clutter dimensions and their resulting EM response. For example, observational evidence shows that cables, pipes and rail lines can have a strong influence far from where they are located, even in situations where these artefacts are volumetrically insignificant over the scale of the model. This poses a significant modeling problem for understanding geohazards in urban environments, for example, because of the very fine numerical discretization required for accurate representation of an artefact embedded in a larger computational domain. We adopt a sub-grid approximation and impose a boundary condition along grid edges to capture the vanishing fields of a perfect conductor. We work in a Cartesian system where the EM fields are solved via finite volumes in the frequency domain in terms of the Lorenz gauged magnetic vector (A) and electric scalar (Phi) potentials. The electric fied is given simply by A-grad(Phi), and set identically to zero along edges of the mesh that coincide with the center of long, slender metallic conductors. A simple extension to bulky artefacts like blocks or slabs involves endowing all such edges in their interior with the same "internal" boundary condition. In essence, we apply the "perfect electric conductor" boundary condition to select edges interior to the modeling domain. We note a few minor numerical consequences of this approach, namely: the zero-E field internal boundary condition destroys the symmetry of the finite volume coefficient matrix; and, the accuracy of the representation of the conducting artefact is restricted by the relatively coarse discretization mesh. The former is overcome with the use of preconditioned bi-conjugate gradient methods instead of the quasi-minimal-residual method. Both are matrix-free iterative solvers - thus avoiding unnecessary storage- and both exhibit generally good convergence for well-posed problems. The latter is more difficult to overcome without either modifying the mesh (potentially degrading the condition number of the coefficient matrix) or with novel mesh sub-gridding. Initial results show qualitative agreement with the expected physics.

Development of iterative techniques for the solution of unsteady compressible viscous flows

NASA Technical Reports Server (NTRS)

Sankar, Lakshmi N.; Hixon, Duane

1991-01-01

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Directed Self-Assembly of Gradient Concentric Carbon Nanotube Rings

NASA Astrophysics Data System (ADS)

Hong, Suck Won; Jeong, Wonje; Ko, Hyunhyub; Tsukruk, Vladimir; Kessler, Michael; Lin, Zhiqun

2008-03-01

Hundreds of gradient concentric rings of linear conjugated polymer, (poly[2-methoxy-5-(2-ethylhexyloxy)-1,4- phenylenevinylene], i.e., MEH-PPV) with remarkable regularity over large areas were produced by controlled, repetitive ``stick- slip'' motions of the contact line in a confined geometry consisting of a sphere on a flat substrate (i.e., sphere-on-flat geometry). Subsequently, MEH-PPV rings exploited as template to direct the formation of gradient concentric rings of multiwalled carbon nanotubes (MWNTs) with controlled density. This method is simple, cost effective, and robust, combining two consecutive self-assembly processes, namely, evaporation-induced self- assembly of polymers in a sphere-on-flat geometry, followed by subsequent directed self-assembly of MWNTs on the polymer- templated surfaces.

Low to high confinement transition theory of finite-beta drift-wave driven shear flow and its comparison with data from DIII-D

NASA Astrophysics Data System (ADS)

Guzdar, P. N.; Kleva, R. G.; Groebner, R. J.; Gohil, P.

2004-03-01

Shear flow stabilization of edge turbulence in tokamaks has been the accepted paradigm for the improvement in confinement observed in high (H) confinement mode plasmas. Results on the generation of zonal flow and fields in finite β plasmas are presented. This theory yields a criterion for bifurcation from low to high (L-H) confinement mode, proportional to Te/√Ln , where Te is the electron temperature and Ln is the density scale-length at the steepest part of the density gradient. When this parameter exceeds a critical value (mostly determined by the strength of the toroidal magnetic field), the transition occurs. The predicted threshold based on this parameter shows good agreement with edge measurements on discharges undergoing L-H transitions in DIII-D [J. L. Luxon, R. Anderson, F. Batty et al., in Proceedings of the 11th Conference on Plasma Physics and Controlled Fusion Research, 1986 (International Atomic Energy Agency, Vienna, 1987), Vol. I, p. 159]. The observed differences in the transitions with the reversal of the toroidal magnetic field are reconciled in terms of this critical parameter due to the differences in the density gradient scale-lengths in the edge. The theory also provides a possible explanation for lowered threshold power, pellet injection H modes in DIII-D, thereby providing a unified picture of the varied observations on the L-H transition.

Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information.

DTIC Science & Technology

1987-08-01

of the absolute difference between the random variable and its mean.Gassmann and Ziemba 119861 provide a weaker bound that does not require...2.8284, and EX4tV) -12 EX’iX) = -42. Hence C = -2 -€t* i-4’]= I-- . 1213. £1 2 5 COMPARISONS OF BOUNDS IN IIn Gassmann and Ziemba 11986) extend an idea...solution of the foLLowing Linear program: (see Gassmann, Ziemba (1986),Theorem 1) m m m-GZ=max(XT(vi) I: z. 1=1,Z vo=x io (5.1hk i-l i=i i=1 I I where 0

Large reflector antenna study

NASA Technical Reports Server (NTRS)

Christodoulou, C. G.

1986-01-01

In some applications, the wires used to construct the grids are plated over with highly conducting materials such as gold or silver. In those cases, depending on the frequency of operation, the coating may not be thick enough to prevent currents from flowing in the substrate. The conjugate gradient method, in conjunction with the fast Fourier transform is employed to solve the problem of scattering from such rectangular grids. An internal impedance is utilized to account for the effects of the substrate conductivity on the induced current densities. Calculated values of the reflection coefficient and induced currents from different coating thicknesses, angles of incidence and polarizations are presented and discussed.

Measurement of the gravity-field curvature by atom interferometry.

PubMed

Rosi, G; Cacciapuoti, L; Sorrentino, F; Menchetti, M; Prevedelli, M; Tino, G M

2015-01-09

We present the first direct measurement of the gravity-field curvature based on three conjugated atom interferometers. Three atomic clouds launched in the vertical direction are simultaneously interrogated by the same atom interferometry sequence and used to probe the gravity field at three equally spaced positions. The vertical component of the gravity-field curvature generated by nearby source masses is measured from the difference between adjacent gravity gradient values. Curvature measurements are of interest in geodesy studies and for the validation of gravitational models of the surrounding environment. The possibility of using such a scheme for a new determination of the Newtonian constant of gravity is also discussed.

Computation of rapidly varied unsteady, free-surface flow

USGS Publications Warehouse

Basco, D.R.

1987-01-01

Many unsteady flows in hydraulics occur with relatively large gradients in free surface profiles. The assumption of hydrostatic pressure distribution with depth is no longer valid. These are rapidly-varied unsteady flows (RVF) of classical hydraulics and also encompass short wave propagation of coastal hydraulics. The purpose of this report is to present an introductory review of the Boussinnesq-type differential equations that describe these flows and to discuss methods for their numerical integration. On variable slopes and for large scale (finite-amplitude) disturbances, three independent derivational methods all gave differences in the motion equation for higher order terms. The importance of these higher-order terms for riverine applications must be determined by numerical experiments. Care must be taken in selection of the appropriate finite-difference scheme to minimize truncation error effects and the possibility of diverging (double mode) numerical solutions. It is recommended that practical hydraulics cases be established and tested numerically to demonstrate the order of differences in solution with those obtained from the long wave equations of St. Venant. (USGS)

On finite element methods for the Helmholtz equation

NASA Technical Reports Server (NTRS)

Aziz, A. K.; Werschulz, A. G.

1979-01-01

The numerical solution of the Helmholtz equation is considered via finite element methods. A two-stage method which gives the same accuracy in the computed gradient as in the computed solution is discussed. Error estimates for the method using a newly developed proof are given, and the computational considerations which show this method to be computationally superior to previous methods are presented.

Detailed Study of BSA Adsorption on Micro- and Nanocrystalline Diamond/β-SiC Composite Gradient Films by Time-Resolved Fluorescence Microscopy.

PubMed

Handschuh-Wang, Stephan; Wang, Tao; Druzhinin, Sergey I; Wesner, Daniel; Jiang, Xin; Schönherr, Holger

2017-01-24

The adsorption of bovine serum albumin (BSA) on micro- and nanocrystalline diamond/β-SiC composite films synthesized using the hot filament chemical vapor deposition (HFCVD) technique has been investigated by confocal fluorescence lifetime imaging microscopy. BSA labeled with fluorescein isothiocyanate (FITC) was employed as a probe. The BSA FITC conjugate was found to preferentially adsorb on both O-/OH-terminated microcrystalline and nanocrystalline diamond compared to the OH-terminated β-SiC, resulting in an increasing amount of BSA adsorbed to the gradient surfaces with an increasing diamond/β-SiC ratio. The different strength of adsorption (>30 times for diamond with a grain size of 570 nm) coincides with different surface energy parameters and differing conformational changes upon adsorption. Fluorescence data of the adsorbed BSA FITC on the gradient film with different diamond coverage show a four-exponential decay with decay times of 3.71, 2.54, 0.66, and 0.13 ns for a grain size of 570 nm. The different decay times are attributed to the fluorescence of thiourea fluorescein residuals of linked FITC distributed in BSA with different dye-dye and dye-surface distances. The longest decay time was found to correlate linearly with the diamond grain size. The fluorescence of BSA FITC undergoes external dynamic fluorescence quenching on the diamond surface by H- and/or sp 2 -defects and/or by amorphous carbon or graphite phases. An acceleration of the internal fluorescence concentration quenching in BSA FITC because of structural changes of albumin due to adsorption, is concluded to be a secondary contributor. These results suggest that the micro- and nanocrystalline diamond/β-SiC composite gradient films can be utilized to spatially control protein adsorption and diamond crystallite size, which facilitates systematic studies at these interesting (bio)interfaces.

Wavelet methods in multi-conjugate adaptive optics

NASA Astrophysics Data System (ADS)

Helin, T.; Yudytskiy, M.

2013-08-01

The next generation ground-based telescopes rely heavily on adaptive optics for overcoming the limitation of atmospheric turbulence. In the future adaptive optics modalities, like multi-conjugate adaptive optics (MCAO), atmospheric tomography is the major mathematical and computational challenge. In this severely ill-posed problem, a fast and stable reconstruction algorithm is needed that can take into account many real-life phenomena of telescope imaging. We introduce a novel reconstruction method for the atmospheric tomography problem and demonstrate its performance and flexibility in the context of MCAO. Our method is based on using locality properties of compactly supported wavelets, both in the spatial and frequency domains. The reconstruction in the atmospheric tomography problem is obtained by solving the Bayesian MAP estimator with a conjugate-gradient-based algorithm. An accelerated algorithm with preconditioning is also introduced. Numerical performance is demonstrated on the official end-to-end simulation tool OCTOPUS of European Southern Observatory.

Conjugate Heat Transfer Analyses on the Manifold for Ramjet Fuel Injectors

NASA Technical Reports Server (NTRS)

Wang, Xiao-Yen J.

2006-01-01

Three-dimensional conjugate heat transfer analyses on the manifold located upstream of the ramjet fuel injector are performed using CFdesign, a finite-element computational fluid dynamics (CFD) software. The flow field of the hot fuel (JP-7) flowing through the manifold is simulated and the wall temperature of the manifold is computed. The three-dimensional numerical results of the fuel temperature are compared with those obtained using a one-dimensional analysis based on empirical equations, and they showed a good agreement. The numerical results revealed that it takes around 30 to 40 sec to reach the equilibrium where the fuel temperature has dropped about 3 F from the inlet to the exit of the manifold.

Conjugate Heat Transfer in Rayleigh-Bénard Convection in a Square Enclosure

PubMed Central

Hashim, Ishak

2014-01-01

Conjugate natural convection-conduction heat transfer in a square enclosure with a finite wall thickness is studied numerically in the present paper. The governing parameters considered are the Rayleigh number (5 × 103 ≤ Ra ≤ 106), the wall-to-fluid thermal conductivity ratio (0.5 ≤ Kr ≤ 10), and the ratio of wall thickness to its height (0.2 ≤ D ≤ 0.4). The staggered grid arrangement together with MAC method was employed to solve the governing equations. It is found that the fluid flow and the heat transfer can be controlled by the thickness of the bottom wall, the thermal conductivity ratio, and the Rayleigh number. PMID:24971390

Double diffusive conjugate heat transfer: Part II

NASA Astrophysics Data System (ADS)

Azeem, Soudagar, Manzoor Elahi M.

2018-05-01

Conjugate heat transfer in porous medium is an important study involved in many practical applications. The current study is aimed to investigate the double diffusive flow in a square porous cavity subjected to left vertical surface heating and right vertical surface cooling respectively along with left and right surfaces maintained at high and low concentration. The three governing equations are converted into algebraic form of equations by applying finite element method and solved in iterative manner. The study is focused to investigate the effect of presence of solid inside the cavity with respect to varying buoyancy ratio. It is found that the local heat and mass transfer rate decreases along the height of cavity.

Finite elements: Theory and application

NASA Technical Reports Server (NTRS)

Dwoyer, D. L. (Editor); Hussaini, M. Y. (Editor); Voigt, R. G. (Editor)

1988-01-01

Recent advances in FEM techniques and applications are discussed in reviews and reports presented at the ICASE/LaRC workshop held in Hampton, VA in July 1986. Topics addressed include FEM approaches for partial differential equations, mixed FEMs, singular FEMs, FEMs for hyperbolic systems, iterative methods for elliptic finite-element equations on general meshes, mathematical aspects of FEMS for incompressible viscous flows, and gradient weighted moving finite elements in two dimensions. Consideration is given to adaptive flux-corrected FEM transport techniques for CFD, mixed and singular finite elements and the field BEM, p and h-p versions of the FEM, transient analysis methods in computational dynamics, and FEMs for integrated flow/thermal/structural analysis.

Hybrid-finite-element analysis of some nonlinear and 3-dimensional problems of engineering fracture mechanics

NASA Technical Reports Server (NTRS)

Atluri, S. N.; Nakagaki, M.; Kathiresan, K.

1980-01-01

In this paper, efficient numerical methods for the analysis of crack-closure effects on fatigue-crack-growth-rates, in plane stress situations, and for the solution of stress-intensity factors for arbitrary shaped surface flaws in pressure vessels, are presented. For the former problem, an elastic-plastic finite element procedure valid for the case of finite deformation gradients is developed and crack growth is simulated by the translation of near-crack-tip elements with embedded plastic singularities. For the latter problem, an embedded-elastic-singularity hybrid finite element method, which leads to a direct evaluation of K-factors, is employed.

Local deformation gradients in epitaxial Pb(Zr0.2Ti0.8)O3 layers investigated by transmission electron microscopy.

PubMed

Denneulin, T; Wollschläger, N; Everhardt, A S; Farokhipoor, S; Noheda, B; Snoeck, E; Hÿtch, M

2018-05-31

Lead zirconate titanate samples are used for their piezoelectric and ferroelectric properties in various types of micro-devices. Epitaxial layers of tetragonal perovskites have a tendency to relax by forming [Formula: see text] ferroelastic domains. The accommodation of the a/c/a/c polydomain structure on a flat substrate leads to nanoscale deformation gradients which locally influence the polarization by flexoelectric effect. Here, we investigated the deformation fields in epitaxial layers of Pb(Zr 0.2 Ti 0.8 )O 3 grown on SrTiO 3 substrates using transmission electron microscopy (TEM). We found that the deformation gradients depend on the domain walls inclination ([Formula: see text] or [Formula: see text] to the substrate interface) of the successive [Formula: see text] domains and we describe three different a/c/a domain configurations: one configuration with parallel a-domains and two configurations with perpendicular a-domains (V-shaped and hat-[Formula: see text]-shaped). In the parallel configuration, the c-domains contain horizontal and vertical gradients of out-of-plane deformation. In the V-shaped and hat-[Formula: see text]-shaped configurations, the c-domains exhibit a bending deformation field with vertical gradients of in-plane deformation. Each of these configurations is expected to have a different influence on the polarization and so the local properties of the film. The deformation gradients were measured using dark-field electron holography, a TEM technique, which offers a good sensitivity (0.1%) and a large field-of-view (hundreds of nanometers). The measurements are compared with finite element simulations.

Finite gradient elasticity and plasticity: a constitutive thermodynamical framework

NASA Astrophysics Data System (ADS)

Bertram, Albrecht

2016-05-01

In Bertram (Continuum Mech Thermodyn. doi: 10.1007/s00161-014-0387-0 , 2015), a mechanical framework for finite gradient elasticity and plasticity has been given. In the present paper, this is extended to thermodynamics. The mechanical theory is only briefly repeated here. A format for a rather general constitutive theory including all thermodynamic fields is given in a Euclidian invariant setting. The plasticity theory is rate-independent and unconstrained. The Clausius-Duhem inequality is exploited to find necessary and sufficient conditions for thermodynamic consistency. The residual dissipation inequality restricts the flow and hardening rules in combination with the yield criterion.

Sparse matrix methods based on orthogonality and conjugacy

NASA Technical Reports Server (NTRS)

Lawson, C. L.

1973-01-01

A matrix having a high percentage of zero elements is called spares. In the solution of systems of linear equations or linear least squares problems involving large sparse matrices, significant saving of computer cost can be achieved by taking advantage of the sparsity. The conjugate gradient algorithm and a set of related algorithms are described.

An Introduction to the Conjugate Gradient Method that Even an Idiot Can Understand

DTIC Science & Technology

1994-03-07

to Omar Ghattas, who taught me much of what I know about numerical methods, and provided me with extensive comments on the first draft of this article...Dongarra, Victor Eijkhout, Roldan Pozo, Charles Romine, and Henk van der Vorst, Templates for the solution of linear systems: Building blocks for iterative

Self-calibrated multiple-echo acquisition with radial trajectories using the conjugate gradient method (SMART-CG).

PubMed

Jung, Youngkyoo; Samsonov, Alexey A; Bydder, Mark; Block, Walter F

2011-04-01

To remove phase inconsistencies between multiple echoes, an algorithm using a radial acquisition to provide inherent phase and magnitude information for self correction was developed. The information also allows simultaneous support for parallel imaging for multiple coil acquisitions. Without a separate field map acquisition, a phase estimate from each echo in multiple echo train was generated. When using a multiple channel coil, magnitude and phase estimates from each echo provide in vivo coil sensitivities. An algorithm based on the conjugate gradient method uses these estimates to simultaneously remove phase inconsistencies between echoes, and in the case of multiple coil acquisition, simultaneously provides parallel imaging benefits. The algorithm is demonstrated on single channel, multiple channel, and undersampled data. Substantial image quality improvements were demonstrated. Signal dropouts were completely removed and undersampling artifacts were well suppressed. The suggested algorithm is able to remove phase cancellation and undersampling artifacts simultaneously and to improve image quality of multiecho radial imaging, the important technique for fast three-dimensional MRI data acquisition. Copyright © 2011 Wiley-Liss, Inc.

Self-calibrated Multiple-echo Acquisition with Radial Trajectories using the Conjugate Gradient Method (SMART-CG)

PubMed Central

Jung, Youngkyoo; Samsonov, Alexey A; Bydder, Mark; Block, Walter F.

2011-01-01

Purpose To remove phase inconsistencies between multiple echoes, an algorithm using a radial acquisition to provide inherent phase and magnitude information for self correction was developed. The information also allows simultaneous support for parallel imaging for multiple coil acquisitions. Materials and Methods Without a separate field map acquisition, a phase estimate from each echo in multiple echo train was generated. When using a multiple channel coil, magnitude and phase estimates from each echo provide in-vivo coil sensitivities. An algorithm based on the conjugate gradient method uses these estimates to simultaneously remove phase inconsistencies between echoes, and in the case of multiple coil acquisition, simultaneously provides parallel imaging benefits. The algorithm is demonstrated on single channel, multiple channel, and undersampled data. Results Substantial image quality improvements were demonstrated. Signal dropouts were completely removed and undersampling artifacts were well suppressed. Conclusion The suggested algorithm is able to remove phase cancellation and undersampling artifacts simultaneously and to improve image quality of multiecho radial imaging, the important technique for fast 3D MRI data acquisition. PMID:21448967