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.

TV-based conjugate gradient method and discrete L-curve for few-view CT reconstruction of X-ray in vivo data

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

Yang, Xiaoli; Hofmann, Ralf; Dapp, Robin

2015-01-01

High-resolution, three-dimensional (3D) imaging of soft tissues requires the solution of two inverse problems: phase retrieval and the reconstruction of the 3D image from a tomographic stack of two-dimensional (2D) projections. The number of projections per stack should be small to accommodate fast tomography of rapid processes and to constrain X-ray radiation dose to optimal levels to either increase the duration of in vivo time-lapse series at a given goal for spatial resolution and/or the conservation of structure under X-ray irradiation. In pursuing the 3D reconstruction problem in the sense of compressive sampling theory, we propose to reduce the numbermore » of projections by applying an advanced algebraic technique subject to the minimisation of the total variation (TV) in the reconstructed slice. This problem is formulated in a Lagrangian multiplier fashion with the parameter value determined by appealing to a discrete L-curve in conjunction with a conjugate gradient method. The usefulness of this reconstruction modality is demonstrated for simulated and in vivo data, the latter acquired in parallel-beam imaging experiments using synchrotron radiation. (C) 2015 Optical Society of America« less

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.

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.

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.

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.

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.

Iterative methods for elliptic finite element equations on general meshes

NASA Technical Reports Server (NTRS)

Nicolaides, R. A.; Choudhury, Shenaz

1986-01-01

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

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.

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

Iterative solution of the inverse Cauchy problem for an elliptic equation by the conjugate gradient method

NASA Astrophysics Data System (ADS)

Vasil'ev, V. I.; Kardashevsky, A. M.; Popov, V. V.; Prokopev, G. A.

2017-10-01

This article presents results of computational experiment carried out using a finite-difference method for solving the inverse Cauchy problem for a two-dimensional elliptic equation. The computational algorithm involves an iterative determination of the missing boundary condition from the override condition using the conjugate gradient method. The results of calculations are carried out on the examples with exact solutions as well as at specifying an additional condition with random errors are presented. Results showed a high efficiency of the iterative method of conjugate gradients for numerical solution

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.

Reconstruction of electrical impedance tomography (EIT) images based on the expectation maximum (EM) method.

PubMed

Wang, Qi; Wang, Huaxiang; Cui, Ziqiang; Yang, Chengyi

2012-11-01

Electrical impedance tomography (EIT) calculates the internal conductivity distribution within a body using electrical contact measurements. The image reconstruction for EIT is an inverse problem, which is both non-linear and ill-posed. The traditional regularization method cannot avoid introducing negative values in the solution. The negativity of the solution produces artifacts in reconstructed images in presence of noise. A statistical method, namely, the expectation maximization (EM) method, is used to solve the inverse problem for EIT in this paper. The mathematical model of EIT is transformed to the non-negatively constrained likelihood minimization problem. The solution is obtained by the gradient projection-reduced Newton (GPRN) iteration method. This paper also discusses the strategies of choosing parameters. Simulation and experimental results indicate that the reconstructed images with higher quality can be obtained by the EM method, compared with the traditional Tikhonov and conjugate gradient (CG) methods, even with non-negative processing. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.

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.

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.

Fourier domain preconditioned conjugate gradient algorithm for atmospheric tomography.

PubMed

Yang, Qiang; Vogel, Curtis R; Ellerbroek, Brent L

2006-07-20

By 'atmospheric tomography' we mean the estimation of a layered atmospheric turbulence profile from measurements of the pupil-plane phase (or phase gradients) corresponding to several different guide star directions. We introduce what we believe to be a new Fourier domain preconditioned conjugate gradient (FD-PCG) algorithm for atmospheric tomography, and we compare its performance against an existing multigrid preconditioned conjugate gradient (MG-PCG) approach. Numerical results indicate that on conventional serial computers, FD-PCG is as accurate and robust as MG-PCG, but it is from one to two orders of magnitude faster for atmospheric tomography on 30 m class telescopes. Simulations are carried out for both natural guide stars and for a combination of finite-altitude laser guide stars and natural guide stars to resolve tip-tilt uncertainty.

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.

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.

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.

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.

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.

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.

An M-step preconditioned conjugate gradient method for parallel computation

NASA Technical Reports Server (NTRS)

Adams, L.

1983-01-01

This paper describes a preconditioned conjugate gradient method that can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systems of linear equations. The implementation on the CYBER 203/205 and on the Finite Element Machine is discussed and results obtained using the method on these machines are given.

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.

Forward model with space-variant of source size for reconstruction on X-ray radiographic image

NASA Astrophysics Data System (ADS)

Liu, Jin; Liu, Jun; Jing, Yue-feng; Xiao, Bo; Wei, Cai-hua; Guan, Yong-hong; Zhang, Xuan

2018-03-01

The Forward Imaging Technique is a method to solve the inverse problem of density reconstruction in radiographic imaging. In this paper, we introduce the forward projection equation (IFP model) for the radiographic system with areal source blur and detector blur. Our forward projection equation, based on X-ray tracing, is combined with the Constrained Conjugate Gradient method to form a new method for density reconstruction. We demonstrate the effectiveness of the new technique by reconstructing density distributions from simulated and experimental images. We show that for radiographic systems with source sizes larger than the pixel size, the effect of blur on the density reconstruction is reduced through our method and can be controlled within one or two pixels. The method is also suitable for reconstruction of non-homogeneousobjects.

Computational alternatives to obtain time optimal jet engine control. M.S. Thesis

NASA Technical Reports Server (NTRS)

Basso, R. J.; Leake, R. J.

1976-01-01

Two computational methods to determine an open loop time optimal control sequence for a simple single spool turbojet engine are described by a set of nonlinear differential equations. Both methods are modifications of widely accepted algorithms which can solve fixed time unconstrained optimal control problems with a free right end. Constrained problems to be considered have fixed right ends and free time. Dynamic programming is defined on a standard problem and it yields a successive approximation solution to the time optimal problem of interest. A feedback control law is obtained and it is then used to determine the corresponding open loop control sequence. The Fletcher-Reeves conjugate gradient method has been selected for adaptation to solve a nonlinear optimal control problem with state variable and control constraints.

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.

Crustal wavespeed structure of North Texas and Oklahoma based on ambient noise cross-correlation functions and adjoint tomography

NASA Astrophysics Data System (ADS)

Zhu, H.

2017-12-01

Recently, seismologists observed increasing seismicity in North Texas and Oklahoma. Based on seismic observations and other geophysical measurements, some studies suggested possible links between the increasing seismicity and wastewater injection during unconventional oil and gas exploration. To better monitor seismic events and investigate their mechanisms, we need an accurate 3D crustal wavespeed model for North Texas and Oklahoma. Considering the uneven distribution of earthquakes in this region, seismic tomography with local earthquake records have difficulties to achieve good illumination. To overcome this limitation, in this study, ambient noise cross-correlation functions are used to constrain subsurface variations in wavespeeds. I use adjoint tomography to iteratively fit frequency-dependent phase differences between observed and predicted band-limited Green's functions. The spectral-element method is used to numerically calculate the band-limited Green's functions and the adjoint method is used to calculate misfit gradients with respect to wavespeeds. 25 preconditioned conjugate gradient iterations are used to update model parameters and minimize data misfits. Features in the new crustal model M25 correlates with geological units in the study region, including the Llano uplift, the Anadarko basin and the Ouachita orogenic front. In addition, these seismic anomalies correlate with gravity and magnetic observations. This new model can be used to better constrain earthquake source parameters in North Texas and Oklahoma, such as epicenter location and moment tensor solutions, which are important for investigating potential relations between seismicity and unconventional oil and gas exploration.

An interior-point method for total variation regularized positron emission tomography image reconstruction

NASA Astrophysics Data System (ADS)

Bai, Bing

2012-03-01

There has been a lot of work on total variation (TV) regularized tomographic image reconstruction recently. Many of them use gradient-based optimization algorithms with a differentiable approximation of the TV functional. In this paper we apply TV regularization in Positron Emission Tomography (PET) image reconstruction. We reconstruct the PET image in a Bayesian framework, using Poisson noise model and TV prior functional. The original optimization problem is transformed to an equivalent problem with inequality constraints by adding auxiliary variables. Then we use an interior point method with logarithmic barrier functions to solve the constrained optimization problem. In this method, a series of points approaching the solution from inside the feasible region are found by solving a sequence of subproblems characterized by an increasing positive parameter. We use preconditioned conjugate gradient (PCG) algorithm to solve the subproblems directly. The nonnegativity constraint is enforced by bend line search. The exact expression of the TV functional is used in our calculations. Simulation results show that the algorithm converges fast and the convergence is insensitive to the values of the regularization and reconstruction parameters.

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.

M-step preconditioned conjugate gradient methods

NASA Technical Reports Server (NTRS)

Adams, L.

1983-01-01

Preconditioned conjugate gradient methods for solving sparse symmetric and positive finite systems of linear equations are described. Necessary and sufficient conditions are given for when these preconditioners can be used and an analysis of their effectiveness is given. Efficient computer implementations of these methods are discussed and results on the CYBER 203 and the Finite Element Machine under construction at NASA Langley Research Center are included.

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

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.

Application of Conjugate Gradient methods to tidal simulation

USGS Publications Warehouse

Barragy, E.; Carey, G.F.; Walters, R.A.

1993-01-01

A harmonic decomposition technique is applied to the shallow water equations to yield a complex, nonsymmetric, nonlinear, Helmholtz type problem for the sea surface and an accompanying complex, nonlinear diagonal problem for the velocities. The equation for the sea surface is linearized using successive approximation and then discretized with linear, triangular finite elements. The study focuses on applying iterative methods to solve the resulting complex linear systems. The comparative evaluation includes both standard iterative methods for the real subsystems and complex versions of the well known Bi-Conjugate Gradient and Bi-Conjugate Gradient Squared methods. Several Incomplete LU type preconditioners are discussed, and the effects of node ordering, rejection strategy, domain geometry and Coriolis parameter (affecting asymmetry) are investigated. Implementation details for the complex case are discussed. Performance studies are presented and comparisons made with a frontal solver. ?? 1993.

On the electromagnetic scattering from infinite rectangular grids with finite conductivity

NASA Technical Reports Server (NTRS)

Christodoulou, C. G.; Kauffman, J. F.

1986-01-01

A variety of methods can be used in constructing solutions to the problem of mesh scattering. However, each of these methods has certain drawbacks. The present paper is concerned with a new technique which is valid for all spacings. The new method involved, called the fast Fourier transform-conjugate gradient method (FFT-CGM), represents an iterative technique which employs the conjugate gradient method to improve upon each iterate, utilizing the fast Fourier transform. The FFT-CGM method provides a new accurate model which can be extended and applied to the more difficult problems of woven mesh surfaces. The formulation of the FFT-conjugate gradient method for aperture fields and current densities for a planar periodic structure is considered along with singular operators, the formulation of the FFT-CG method for thin wires with finite conductivity, and reflection coefficients.

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

The U.S. Geological Survey Modular Ground-Water Model - PCGN: A Preconditioned Conjugate Gradient Solver with Improved Nonlinear Control

USGS Publications Warehouse

Naff, Richard L.; Banta, Edward R.

2008-01-01

The preconditioned conjugate gradient with improved nonlinear control (PCGN) package provides addi-tional means by which the solution of nonlinear ground-water flow problems can be controlled as compared to existing solver packages for MODFLOW. Picard iteration is used to solve nonlinear ground-water flow equations by iteratively solving a linear approximation of the nonlinear equations. The linear solution is provided by means of the preconditioned conjugate gradient algorithm where preconditioning is provided by the modi-fied incomplete Cholesky algorithm. The incomplete Cholesky scheme incorporates two levels of fill, 0 and 1, in which the pivots can be modified so that the row sums of the preconditioning matrix and the original matrix are approximately equal. A relaxation factor is used to implement the modified pivots, which determines the degree of modification allowed. The effects of fill level and degree of pivot modification are briefly explored by means of a synthetic, heterogeneous finite-difference matrix; results are reported in the final section of this report. The preconditioned conjugate gradient method is coupled with Picard iteration so as to efficiently solve the nonlinear equations associated with many ground-water flow problems. The description of this coupling of the linear solver with Picard iteration is a primary concern of this document.

FeRh ground state and martensitic transformation

DOE PAGES

Zarkevich, Nikolai A.; Johnson, Duane D.

2018-01-09

Cubic B2 FeRh exhibits a metamagnetic transition [(111) antiferromagnet (AFM) to ferromagnet (FM)] around 353 K and remains structurally stable at higher temperatures. However, the calculated zero-Kelvin phonons of AFM FeRh exhibit imaginary modes at M points in the Brillouin zone, indicating a premartensitic instability, which is a precursor to a martensitic transformation at low temperatures. Combining electronic-structure calculations with ab initio molecular dynamics, conjugate gradient relaxation, and the solid-state nudged-elastic band methods, we predict that AFM B2 FeRh becomes unstable at ambient pressure and transforms without a barrier to an AFM(111) orthorhombic (martensitic) ground state below 90±10K. In conclusion,more » we also consider competing structures, in particular, a tetragonal AFM(100) phase that is not the global ground state, as proposed, but a constrained solution.« less

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

Zarkevich, Nikolai A.; Johnson, Duane D.

Cubic B2 FeRh exhibits a metamagnetic transition [(111) antiferromagnet (AFM) to ferromagnet (FM)] around 353 K and remains structurally stable at higher temperatures. However, the calculated zero-Kelvin phonons of AFM FeRh exhibit imaginary modes at M points in the Brillouin zone, indicating a premartensitic instability, which is a precursor to a martensitic transformation at low temperatures. Combining electronic-structure calculations with ab initio molecular dynamics, conjugate gradient relaxation, and the solid-state nudged-elastic band methods, we predict that AFM B2 FeRh becomes unstable at ambient pressure and transforms without a barrier to an AFM(111) orthorhombic (martensitic) ground state below 90±10K. In conclusion,more » we also consider competing structures, in particular, a tetragonal AFM(100) phase that is not the global ground state, as proposed, but a constrained solution.« less

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.

PRECONDITIONED CONJUGATE-GRADIENT 2 (PCG2), a computer program for solving ground-water flow equations

USGS Publications Warehouse

Hill, Mary C.

1990-01-01

This report documents PCG2 : a numerical code to be used with the U.S. Geological Survey modular three-dimensional, finite-difference, ground-water flow model . PCG2 uses the preconditioned conjugate-gradient method to solve the equations produced by the model for hydraulic head. Linear or nonlinear flow conditions may be simulated. PCG2 includes two reconditioning options : modified incomplete Cholesky preconditioning, which is efficient on scalar computers; and polynomial preconditioning, which requires less computer storage and, with modifications that depend on the computer used, is most efficient on vector computers . Convergence of the solver is determined using both head-change and residual criteria. Nonlinear problems are solved using Picard iterations. This documentation provides a description of the preconditioned conjugate gradient method and the two preconditioners, detailed instructions for linking PCG2 to the modular model, sample data inputs, a brief description of PCG2, and a FORTRAN listing.

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

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

NASA Technical Reports Server (NTRS)

Freund, Roland

1988-01-01

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

Crustal wavespeed structure of North Texas and Oklahoma based on ambient noise cross-correlation functions and adjoint tomography

NASA Astrophysics Data System (ADS)

Zhu, Hejun

2018-04-01

Recently, seismologists observed increasing seismicity in North Texas and Oklahoma. Based on seismic observations and other geophysical measurements, numerous studies suggested links between the increasing seismicity and wastewater injection during unconventional oil and gas exploration. To better monitor seismic events and investigate their triggering mechanisms, we need an accurate 3D crustal wavespeed model for the study region. Considering the uneven distribution of earthquakes in this area, seismic tomography with local earthquake records have difficulties achieving even illumination. To overcome this limitation, in this study, ambient noise cross-correlation functions are used to constrain subsurface variations in wavespeeds. I use adjoint tomography to iteratively fit frequency-dependent phase differences between observed and predicted band-limited Green's functions. The spectral-element method is used to numerically calculate the band-limited Green's functions and the adjoint method is used to calculate misfit gradients with respect to wavespeeds. Twenty five preconditioned conjugate gradient iterations are used to update model parameters and minimize data misfits. Features in the new crustal model TO25 correlates well with geological provinces in the study region, including the Llano uplift, the Anadarko basin and the Ouachita orogenic front, etc. In addition, there are relatively good correlations between seismic results with gravity and magnetic observations. This new crustal model can be used to better constrain earthquake source parameters in North Texas and Oklahoma, such as epicenter location as well as moment tensor solutions, which are important for investigating triggering mechanisms between these induced earthquakes and unconventional oil and gas exploration activities.

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

Three-dimensional Gravity Inversion with a New Gradient Scheme on Unstructured Grids

NASA Astrophysics Data System (ADS)

Sun, S.; Yin, C.; Gao, X.; Liu, Y.; Zhang, B.

2017-12-01

Stabilized gradient-based methods have been proved to be efficient for inverse problems. Based on these methods, setting gradient close to zero can effectively minimize the objective function. Thus the gradient of objective function determines the inversion results. By analyzing the cause of poor resolution on depth in gradient-based gravity inversion methods, we find that imposing depth weighting functional in conventional gradient can improve the depth resolution to some extent. However, the improvement is affected by the regularization parameter and the effect of the regularization term becomes smaller with increasing depth (shown as Figure 1 (a)). In this paper, we propose a new gradient scheme for gravity inversion by introducing a weighted model vector. The new gradient can improve the depth resolution more efficiently, which is independent of the regularization parameter, and the effect of regularization term will not be weakened when depth increases. Besides, fuzzy c-means clustering method and smooth operator are both used as regularization terms to yield an internal consecutive inverse model with sharp boundaries (Sun and Li, 2015). We have tested our new gradient scheme with unstructured grids on synthetic data to illustrate the effectiveness of the algorithm. Gravity forward modeling with unstructured grids is based on the algorithm proposed by Okbe (1979). We use a linear conjugate gradient inversion scheme to solve the inversion problem. The numerical experiments show a great improvement in depth resolution compared with regular gradient scheme, and the inverse model is compact at all depths (shown as Figure 1 (b)). AcknowledgeThis research is supported by Key Program of National Natural Science Foundation of China (41530320), China Natural Science Foundation for Young Scientists (41404093), and Key National Research Project of China (2016YFC0303100, 2017YFC0601900). ReferencesSun J, Li Y. 2015. Multidomain petrophysically constrained inversion and geology differentiation using guided fuzzy c-means clustering. Geophysics, 80(4): ID1-ID18. Okabe M. 1979. Analytical expressions for gravity anomalies due to homogeneous polyhedral bodies and translations into magnetic anomalies. Geophysics, 44(4), 730-741.

FeRh ground state and martensitic transformation

NASA Astrophysics Data System (ADS)

Zarkevich, Nikolai A.; Johnson, Duane D.

2018-01-01

Cubic B 2 FeRh exhibits a metamagnetic transition [(111) antiferromagnet (AFM) to ferromagnet (FM)] around 353 K and remains structurally stable at higher temperatures. However, the calculated zero-Kelvin phonons of AFM FeRh exhibit imaginary modes at M points in the Brillouin zone, indicating a premartensitic instability, which is a precursor to a martensitic transformation at low temperatures. Combining electronic-structure calculations with ab initio molecular dynamics, conjugate gradient relaxation, and the solid-state nudged-elastic band methods, we predict that AFM B 2 FeRh becomes unstable at ambient pressure and transforms without a barrier to an AFM(111) orthorhombic (martensitic) ground state below 90 ±10 K . We also consider competing structures, in particular, a tetragonal AFM(100) phase that is not the global ground state, as proposed [Phys. Rev. B 94, 180407(R) (2016), 10.1103/PhysRevB.94.180407], but a constrained solution.

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.

On the constrained minimization of smooth Kurdyka—Łojasiewicz functions with the scaled gradient projection method

NASA Astrophysics Data System (ADS)

Prato, Marco; Bonettini, Silvia; Loris, Ignace; Porta, Federica; Rebegoldi, Simone

2016-10-01

The scaled gradient projection (SGP) method is a first-order optimization method applicable to the constrained minimization of smooth functions and exploiting a scaling matrix multiplying the gradient and a variable steplength parameter to improve the convergence of the scheme. For a general nonconvex function, the limit points of the sequence generated by SGP have been proved to be stationary, while in the convex case and with some restrictions on the choice of the scaling matrix the sequence itself converges to a constrained minimum point. In this paper we extend these convergence results by showing that the SGP sequence converges to a limit point provided that the objective function satisfies the Kurdyka-Łojasiewicz property at each point of its domain and its gradient is Lipschitz continuous.

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

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.

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.

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.

Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

NASA Astrophysics Data System (ADS)

Lavery, N.; Taylor, C.

1999-07-01

Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time-independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi-Babuska condition. The k-l model is used to complete the turbulence closure problem. The non-symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a V-cycling schedule. These methods are all compared to the non-symmetric frontal solver. Copyright

Finite elements and the method of conjugate gradients on a concurrent processor

NASA Technical Reports Server (NTRS)

Lyzenga, G. A.; Raefsky, A.; Hager, G. H.

1985-01-01

An algorithm for the iterative solution of finite element problems on a concurrent processor is presented. The method of conjugate gradients is used to solve the system of matrix equations, which is distributed among the processors of a MIMD computer according to an element-based spatial decomposition. This algorithm is implemented in a two-dimensional elastostatics program on the Caltech Hypercube concurrent processor. The results of tests on up to 32 processors show nearly linear concurrent speedup, with efficiencies over 90 percent for sufficiently large problems.

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.

Finite elements and the method of conjugate gradients on a concurrent processor

NASA Technical Reports Server (NTRS)

Lyzenga, G. A.; Raefsky, A.; Hager, B. H.

1984-01-01

An algorithm for the iterative solution of finite element problems on a concurrent processor is presented. The method of conjugate gradients is used to solve the system of matrix equations, which is distributed among the processors of a MIMD computer according to an element-based spatial decomposition. This algorithm is implemented in a two-dimensional elastostatics program on the Caltech Hypercube concurrent processor. The results of tests on up to 32 processors show nearly linear concurrent speedup, with efficiencies over 90% for sufficiently large problems.

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).

A SEMI-LAGRANGIAN TWO-LEVEL PRECONDITIONED NEWTON-KRYLOV SOLVER FOR CONSTRAINED DIFFEOMORPHIC IMAGE REGISTRATION.

PubMed

Mang, Andreas; Biros, George

2017-01-01

We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20 × speedup for a two dimensional, real world multi-subject medical image registration problem.

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.

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.

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

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.

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.

AIDA: an adaptive image deconvolution algorithm with application to multi-frame and three-dimensional data

PubMed Central

Hom, Erik F. Y.; Marchis, Franck; Lee, Timothy K.; Haase, Sebastian; Agard, David A.; Sedat, John W.

2011-01-01

We describe an adaptive image deconvolution algorithm (AIDA) for myopic deconvolution of multi-frame and three-dimensional data acquired through astronomical and microscopic imaging. AIDA is a reimplementation and extension of the MISTRAL method developed by Mugnier and co-workers and shown to yield object reconstructions with excellent edge preservation and photometric precision [J. Opt. Soc. Am. A 21, 1841 (2004)]. Written in Numerical Python with calls to a robust constrained conjugate gradient method, AIDA has significantly improved run times over the original MISTRAL implementation. Included in AIDA is a scheme to automatically balance maximum-likelihood estimation and object regularization, which significantly decreases the amount of time and effort needed to generate satisfactory reconstructions. We validated AIDA using synthetic data spanning a broad range of signal-to-noise ratios and image types and demonstrated the algorithm to be effective for experimental data from adaptive optics–equipped telescope systems and wide-field microscopy. PMID:17491626

On the inversion of geodetic integrals defined over the sphere using 1-D FFT

NASA Astrophysics Data System (ADS)

García, R. V.; Alejo, C. A.

2005-08-01

An iterative method is presented which performs inversion of integrals defined over the sphere. The method is based on one-dimensional fast Fourier transform (1-D FFT) inversion and is implemented with the projected Landweber technique, which is used to solve constrained least-squares problems reducing the associated 1-D cyclic-convolution error. The results obtained are as precise as the direct matrix inversion approach, but with better computational efficiency. A case study uses the inversion of Hotine’s integral to obtain gravity disturbances from geoid undulations. Numerical convergence is also analyzed and comparisons with respect to the direct matrix inversion method using conjugate gradient (CG) iteration are presented. Like the CG method, the number of iterations needed to get the optimum (i.e., small) error decreases as the measurement noise increases. Nevertheless, for discrete data given over a whole parallel band, the method can be applied directly without implementing the projected Landweber method, since no cyclic convolution error exists.

Simultaneous travel time tomography for updating both velocity and reflector geometry in triangular/tetrahedral cell model

NASA Astrophysics Data System (ADS)

Bai, Chao-ying; He, Lei-yu; Li, Xing-wang; Sun, Jia-yu

2018-05-01

To conduct forward and simultaneous inversion in a complex geological model, including an irregular topography (or irregular reflector or velocity anomaly), we in this paper combined our previous multiphase arrival tracking method (referred as triangular shortest-path method, TSPM) in triangular (2D) or tetrahedral (3D) cell model and a linearized inversion solver (referred to as damped minimum norms and constrained least squares problem solved using the conjugate gradient method, DMNCLS-CG) to formulate a simultaneous travel time inversion method for updating both velocity and reflector geometry by using multiphase arrival times. In the triangular/tetrahedral cells, we deduced the partial derivative of velocity variation with respective to the depth change of reflector. The numerical simulation results show that the computational accuracy can be tuned to a high precision in forward modeling and the irregular velocity anomaly and reflector geometry can be accurately captured in the simultaneous inversion, because the triangular/tetrahedral cell can be easily used to stitch the irregular topography or subsurface interface.

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

Simultaneous travel time tomography for updating both velocity and reflector geometry in triangular/tetrahedral cell model

NASA Astrophysics Data System (ADS)

Bai, Chao-ying; He, Lei-yu; Li, Xing-wang; Sun, Jia-yu

2017-12-01

To conduct forward and simultaneous inversion in a complex geological model, including an irregular topography (or irregular reflector or velocity anomaly), we in this paper combined our previous multiphase arrival tracking method (referred as triangular shortest-path method, TSPM) in triangular (2D) or tetrahedral (3D) cell model and a linearized inversion solver (referred to as damped minimum norms and constrained least squares problem solved using the conjugate gradient method, DMNCLS-CG) to formulate a simultaneous travel time inversion method for updating both velocity and reflector geometry by using multiphase arrival times. In the triangular/tetrahedral cells, we deduced the partial derivative of velocity variation with respective to the depth change of reflector. The numerical simulation results show that the computational accuracy can be tuned to a high precision in forward modeling and the irregular velocity anomaly and reflector geometry can be accurately captured in the simultaneous inversion, because the triangular/tetrahedral cell can be easily used to stitch the irregular topography or subsurface interface.

Microbial decomposers not constrained by climate history along a Mediterranean climate gradient in southern California.

PubMed

Baker, Nameer R; Khalili, Banafshe; Martiny, Jennifer B H; Allison, Steven D

2018-06-01

Microbial decomposers mediate the return of CO 2 to the atmosphere by producing extracellular enzymes to degrade complex plant polymers, making plant carbon available for metabolism. Determining if and how these decomposer communities are constrained in their ability to degrade plant litter is necessary for predicting how carbon cycling will be affected by future climate change. We analyzed mass loss, litter chemistry, microbial biomass, extracellular enzyme activities, and enzyme temperature sensitivities in grassland litter transplanted along a Mediterranean climate gradient in southern California. Microbial community composition was manipulated by caging litter within bags made of nylon membrane that prevent microbial immigration. To test whether grassland microbes were constrained by climate history, half of the bags were inoculated with local microbial communities native to each gradient site. We determined that temperature and precipitation likely interact to limit microbial decomposition in the extreme sites along our gradient. Despite their unique climate history, grassland microbial communities were not restricted in their ability to decompose litter under different climate conditions across the gradient, although microbial communities across our gradient may be restricted in their ability to degrade different types of litter. We did find some evidence that local microbial communities were optimized based on climate, but local microbial taxa that proliferated after inoculation into litterbags did not enhance litter decomposition. Our results suggest that microbial community composition does not constrain C-cycling rates under climate change in our system, but optimization to particular resource environments may act as more general constraints on microbial communities. © 2018 by the Ecological Society of America.

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.

Performance of Nonlinear Finite-Difference Poisson-Boltzmann Solvers

PubMed Central

Cai, Qin; Hsieh, Meng-Juei; Wang, Jun; Luo, Ray

2014-01-01

We implemented and optimized seven finite-difference solvers for the full nonlinear Poisson-Boltzmann equation in biomolecular applications, including four relaxation methods, one conjugate gradient method, and two inexact Newton methods. The performance of the seven solvers was extensively evaluated with a large number of nucleic acids and proteins. Worth noting is the inexact Newton method in our analysis. We investigated the role of linear solvers in its performance by incorporating the incomplete Cholesky conjugate gradient and the geometric multigrid into its inner linear loop. We tailored and optimized both linear solvers for faster convergence rate. In addition, we explored strategies to optimize the successive over-relaxation method to reduce its convergence failures without too much sacrifice in its convergence rate. Specifically we attempted to adaptively change the relaxation parameter and to utilize the damping strategy from the inexact Newton method to improve the successive over-relaxation method. Our analysis shows that the nonlinear methods accompanied with a functional-assisted strategy, such as the conjugate gradient method and the inexact Newton method, can guarantee convergence in the tested molecules. Especially the inexact Newton method exhibits impressive performance when it is combined with highly efficient linear solvers that are tailored for its special requirement. PMID:24723843

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.

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.

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

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.

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.

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.

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.

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.

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.

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.

Mini-batch optimized full waveform inversion with geological constrained gradient filtering

NASA Astrophysics Data System (ADS)

Yang, Hui; Jia, Junxiong; Wu, Bangyu; Gao, Jinghuai

2018-05-01

High computation cost and generating solutions without geological sense have hindered the wide application of Full Waveform Inversion (FWI). Source encoding technique is a way to dramatically reduce the cost of FWI but subject to fix-spread acquisition setup requirement and slow convergence for the suppression of cross-talk. Traditionally, gradient regularization or preconditioning is applied to mitigate the ill-posedness. An isotropic smoothing filter applied on gradients generally gives non-geological inversion results, and could also introduce artifacts. In this work, we propose to address both the efficiency and ill-posedness of FWI by a geological constrained mini-batch gradient optimization method. The mini-batch gradient descent optimization is adopted to reduce the computation time by choosing a subset of entire shots for each iteration. By jointly applying the structure-oriented smoothing to the mini-batch gradient, the inversion converges faster and gives results with more geological meaning. Stylized Marmousi model is used to show the performance of the proposed method on realistic synthetic model.

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.

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.

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.

Full-waveform inversion for the Iranian plateau

NASA Astrophysics Data System (ADS)

Masouminia, N.; Fichtner, A.; Rahimi, H.

2017-12-01

We aim to obtain a detailed tomographic model for the Iranian plateau facilitated by full-waveform inversion. By using this method, we intend to better constrain the 3-D structure of the crust and the upper mantle in the region. The Iranian plateau is a complex tectonic area resulting from the collision of the Arabian and Eurasian tectonic plates. This region is subject to complex tectonic processes such as Makran subduction zone, which runs along the southeastern coast of Iran, and the convergence of the Arabian and- Eurasian plates, which itself led to another subduction under Central Iran. This continent-continent collision has also caused shortening and crustal thickening, which can be seen today as Zagros mountain range in the south and Kopeh Dagh mountain range in the northeast. As a result of such a tectonic activity, the crust and the mantle beneath the region are expected to be highly heterogeneous. To further our understanding of the region and its tectonic history, a detailed 3-D velocity model is required.To construct a 3-D model, we propose to use full-waveform inversion, which allows us to incorporate all types of waves recorded in the seismogram, including body waves as well as fundamental- and higher-mode surface waves. Exploiting more information from the observed data using this approach is likely to constrain features which have not been found by classical tomography studies so far. We address the forward problem using Salvus - a numerical wave propagation solver, based on spectral-element method and run on high-performance computers. The solver allows us to simulate wave field propagating in highly heterogeneous, attenuating and anisotropic media, respecting the surface topography. To improve the model, we solve the optimization problem. Solution of this optimization problem is based on an iterative approach which employs adjoint methods to calculate the gradient and uses steepest descent and conjugate-gradient methods to minimize the objective function. Each iteration of such an approach is expected to bring the model closer to the true model.Our model domain extends between 25°N and 40°N in latitude and 42°E and 63°E in longitude. To constrain the 3-D structure of the area we use 83 broadband seismic stations and 146 earthquakes with magnitude Mw>4.5 -that occurred in the region between 2012 and 2017.

CPDES3: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in three dimensions

NASA Astrophysics Data System (ADS)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on three-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES3 allows each spatial operator to have 7, 15, 19, or 27 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect induces which is vectorizable on some of the newer scientific computers.

CPDES2: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in two dimensions

NASA Astrophysics Data System (ADS)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on two-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES2 allows each spatial operator to have 5 or 9 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect indices which is vectorizable on some of the newer scientific computers.

Optimal and fast E/B separation with a dual messenger field

NASA Astrophysics Data System (ADS)

Kodi Ramanah, Doogesh; Lavaux, Guilhem; Wandelt, Benjamin D.

2018-05-01

We adapt our recently proposed dual messenger algorithm for spin field reconstruction and showcase its efficiency and effectiveness in Wiener filtering polarized cosmic microwave background (CMB) maps. Unlike conventional preconditioned conjugate gradient (PCG) solvers, our preconditioner-free technique can deal with high-resolution joint temperature and polarization maps with inhomogeneous noise distributions and arbitrary mask geometries with relative ease. Various convergence diagnostics illustrate the high quality of the dual messenger reconstruction. In contrast, the PCG implementation fails to converge to a reasonable solution for the specific problem considered. The implementation of the dual messenger method is straightforward and guarantees numerical stability and convergence. We show how the algorithm can be modified to generate fluctuation maps, which, combined with the Wiener filter solution, yield unbiased constrained signal realizations, consistent with observed data. This algorithm presents a pathway to exact global analyses of high-resolution and high-sensitivity CMB data for a statistically optimal separation of E and B modes. It is therefore relevant for current and next-generation CMB experiments, in the quest for the elusive primordial B-mode signal.

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.

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.

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

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

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.

Local structure of equality constrained NLP problems

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

Mari, J.

We show that locally around a feasible point, the behavior of an equality constrained nonlinear program is described by the gradient and the Hessian of the Lagrangian on the tangent subspace. In particular this holds true for reduced gradient approaches. Applying the same ideas to the control of nonlinear ODE:s, one can device first and second order methods that can be applied also to stiff problems. We finally describe an application of these ideas to the optimization of the production of human growth factor by fed-batch fermentation.

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

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.

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.

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.

Myocardial perfusion magnetic resonance imaging using sliding-window conjugate-gradient HYPR methods in canine with stenotic coronary arteries.

PubMed

Ge, Lan; Kino, Aya; Lee, Daniel; Dharmakumar, Rohan; Carr, James C; Li, Debiao

2010-01-01

First-pass perfusion magnetic resonance imaging (MRI) is a promising technique for detecting ischemic heart disease. However, the diagnostic value of the method is limited by the low spatial coverage, resolution, signal-to-noise ratio (SNR), and cardiac motion-related image artifacts. A combination of sliding window and conjugate-gradient HighlY constrained back-PRojection reconstruction (SW-CG-HYPR) method has been proposed in healthy volunteer studies to reduce the acquisition window for each slice while maintaining the temporal resolution of 1 frame per heartbeat in myocardial perfusion MRI. This method allows for improved spatial coverage, resolution, and SNR. In this study, we use a controlled animal model to test whether the myocardial territory supplied by a stenotic coronary artery can be detected accurately by SW-CG-HYPR perfusion method under pharmacological stress. Results from 6 mongrel dogs (15-25 kg) studies demonstrate the feasibility of SW-CG-HYPR to detect regional perfusion defects. Using this method, the acquisition time per cardiac cycle was reduced by a factor of 4, and the spatial coverage was increased from 2 to 3 slices to 6 slices as compared with the conventional techniques including both turbo-Fast Low Angle Short (FLASH) and echoplanar imaging (EPI). The SNR of the healthy myocardium at peak enhancement with SW-CG-HYPR (12.68 ± 2.46) is significantly higher (P < 0.01) than the turbo-FLASH (8.65 ± 1.93) and EPI (5.48 ± 1.24). The spatial resolution of SW-CG-HYPR images is 1.2 × 1.2 × 8.0 mm, which is better than the turbo-FLASH (1.8 × 1.8 × 8.0 mm) and EPI (2.0 × 1.8 × 8.0 mm). Sliding-window CG-HYPR is a promising technique for myocardial perfusion MRI. This technique provides higher image quality with respect to significantly improved SNR and spatial resolution of the myocardial perfusion images, which might improve myocardial perfusion imaging in a clinical setting.

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.

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.

Semismooth Newton method for gradient constrained minimization problem

NASA Astrophysics Data System (ADS)

Anyyeva, Serbiniyaz; Kunisch, Karl

2012-08-01

In this paper we treat a gradient constrained minimization problem, particular case of which is the elasto-plastic torsion problem. In order to get the numerical approximation to the solution we have developed an algorithm in an infinite dimensional space framework using the concept of the generalized (Newton) differentiation. Regularization was done in order to approximate the problem with the unconstrained minimization problem and to make the pointwise maximum function Newton differentiable. Using semismooth Newton method, continuation method was developed in function space. For the numerical implementation the variational equations at Newton steps are discretized using finite elements method.

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.

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.

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.

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.

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.

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.

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.

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.

2D Unstructured Grid Based Constrained Inversion of Magnetic Data Using Fuzzy C Means Clustering and Lithology Classification

NASA Astrophysics Data System (ADS)

Kumar, V.; Singh, A.; Sharma, S. P.

2016-12-01

Regular grid discretization is often utilized to define complex geological models. However, this subdivision strategy performs at lower precision to represent the topographical observation surface. We have developed a new 2D unstructured grid based inversion for magnetic data for models including topography. It will consolidate prior parametric information into a deterministic inversion system to enhance the boundary between the different lithology based on recovered magnetic susceptibility distribution from the inversion. The presented susceptibility model will satisfy both the observed magnetic data and parametric information and therefore can represent the earth better than geophysical inversion models that only honor the observed magnetic data. Geophysical inversion and lithology classification are generally treated as two autonomous methodologies and connected in a serial way. The presented inversion strategy integrates these two parts into a unified scheme. To reduce the storage space and computation time, the conjugate gradient method is used. It results in feasible and practical imaging inversion of magnetic data to deal with large number of triangular grids. The efficacy of the presented inversion is demonstrated using two synthetic examples and one field data example.

Adjoint-Baed Optimal Control on the Pitch Angle of a Single-Bladed Vertical-Axis Wind Turbine

NASA Astrophysics Data System (ADS)

Tsai, Hsieh-Chen; Colonius, Tim

2017-11-01

Optimal control on the pitch angle of a NACA0018 single-bladed vertical-axis wind turbine (VAWT) is numerically investigated at a low Reynolds number of 1500. With fixed tip-speed ratio, the input power is minimized and mean tangential force is maximized over a specific time horizon. The immersed boundary method is used to simulate the two-dimensional, incompressible flow around a horizontal cross section of the VAWT. The problem is formulated as a PDE constrained optimization problem and an iterative solution is obtained using adjoint-based conjugate gradient methods. By the end of the longest control horizon examined, two controls end up with time-invariant pitch angles of about the same magnitude but with the opposite signs. The results show that both cases lead to a reduction in the input power but not necessarily an enhancement in the mean tangential force. These reductions in input power are due to the removal of a power-damaging phenomenon that occurs when a vortex pair is captured by the blade in the upwind-half region of a cycle. This project was supported by Caltech FLOWE center/Gordon and Betty Moore Foundation.

Spectral edge: gradient-preserving spectral mapping for image fusion.

PubMed

Connah, David; Drew, Mark S; Finlayson, Graham D

2015-12-01

This paper describes a novel approach to image fusion for color display. Our goal is to generate an output image whose gradient matches that of the input as closely as possible. We achieve this using a constrained contrast mapping paradigm in the gradient domain, where the structure tensor of a high-dimensional gradient representation is mapped exactly to that of a low-dimensional gradient field which is then reintegrated to form an output. Constraints on output colors are provided by an initial RGB rendering. Initially, we motivate our solution with a simple "ansatz" (educated guess) for projecting higher-D contrast onto color gradients, which we expand to a more rigorous theorem to incorporate color constraints. The solution to these constrained optimizations is closed-form, allowing for simple and hence fast and efficient algorithms. The approach can map any N-D image data to any M-D output and can be used in a variety of applications using the same basic algorithm. In this paper, we focus on the problem of mapping N-D inputs to 3D color outputs. We present results in five applications: hyperspectral remote sensing, fusion of color and near-infrared or clear-filter images, multilighting imaging, dark flash, and color visualization of magnetic resonance imaging diffusion-tensor imaging.

Solving constrained minimum-time robot problems using the sequential gradient restoration algorithm

NASA Technical Reports Server (NTRS)

Lee, Allan Y.

1991-01-01

Three constrained minimum-time control problems of a two-link manipulator are solved using the Sequential Gradient and Restoration Algorithm (SGRA). The inequality constraints considered are reduced via Valentine-type transformations to nondifferential path equality constraints. The SGRA is then used to solve these transformed problems with equality constraints. The results obtained indicate that at least one of the two controls is at its limits at any instant in time. The remaining control then adjusts itself so that none of the system constraints is violated. Hence, the minimum-time control is either a pure bang-bang control or a combined bang-bang/singular control.

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.

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.

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.

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.

Microbial Decomposers Not Constrained by Climate History Along a Mediterranean Climate Gradient

NASA Astrophysics Data System (ADS)

Baker, N. R.; Khalili, B.; Martiny, J. B. H.; Allison, S. D.

2017-12-01

The return of organic carbon to the atmosphere through terrestrial decomposition is mediated through the breakdown of complex organic polymers by extracellular enzymes produced by microbial decomposer communities. Determining if and how these decomposer communities are constrained in their ability to degrade plant litter is necessary for predicting how carbon cycling will be affected by future climate change. To address this question, we deployed fine-pore nylon mesh "microbial cage" litterbags containing grassland litter with and without local inoculum across five sites in southern California, spanning a gradient of 10.3-22.8° C in mean annual temperature and 100-400+ mm mean annual precipitation. Litterbags were deployed in October 2014 and collected four times over the course of 14 months. Recovered litter was assayed for mass loss, litter chemistry, microbial biomass, extracellular enzymes (Vmax and Km­), and enzyme temperature sensitivities. We hypothesized that grassland litter would decompose most rapidly in the grassland site, and that access to local microbial communities would enhance litter decomposition rates and microbial activity in the other sites along the gradient. We determined that temperature and precipitation likely interact to limit microbial decomposition in the extreme sites along our gradient. Despite their unique climate history, grassland microbes were not restricted in their ability to decompose litter under different climate conditions. Although we observed a strong correlation between bacterial biomass and mass loss across the gradient, litter that was inoculated with local microbial communities lost less mass despite having greater bacterial biomass and potentially accumulating more microbial residues. Our results suggest that microbial community composition may not constrain C-cycling rates under climate change in our system. However, there may be community constraints on decomposition if climate change alters litter chemistry, a mechanism only indirectly addressed by our design.

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.

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.

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.

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.

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

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.

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.

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.

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.

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.

The Spatial Distribution of Attention within and across Objects

PubMed Central

Hollingworth, Andrew; Maxcey-Richard, Ashleigh M.; Vecera, Shaun P.

2011-01-01

Attention operates to select both spatial locations and perceptual objects. However, the specific mechanism by which attention is oriented to objects is not well understood. We examined the means by which object structure constrains the distribution of spatial attention (i.e., a “grouped array”). Using a modified version of the Egly et al. object cuing task, we systematically manipulated within-object distance and object boundaries. Four major findings are reported: 1) spatial attention forms a gradient across the attended object; 2) object boundaries limit the distribution of this gradient, with the spread of attention constrained by a boundary; 3) boundaries within an object operate similarly to across-object boundaries: we observed object-based effects across a discontinuity within a single object, without the demand to divide or switch attention between discrete object representations; and 4) the gradient of spatial attention across an object directly modulates perceptual sensitivity, implicating a relatively early locus for the grouped array representation. PMID:21728455

Bulk diffusion in a kinetically constrained lattice gas

NASA Astrophysics Data System (ADS)

Arita, Chikashi; Krapivsky, P. L.; Mallick, Kirone

2018-03-01

In the hydrodynamic regime, the evolution of a stochastic lattice gas with symmetric hopping rules is described by a diffusion equation with density-dependent diffusion coefficient encapsulating all microscopic details of the dynamics. This diffusion coefficient is, in principle, determined by a Green-Kubo formula. In practice, even when the equilibrium properties of a lattice gas are analytically known, the diffusion coefficient cannot be computed except when a lattice gas additionally satisfies the gradient condition. We develop a procedure to systematically obtain analytical approximations for the diffusion coefficient for non-gradient lattice gases with known equilibrium. The method relies on a variational formula found by Varadhan and Spohn which is a version of the Green-Kubo formula particularly suitable for diffusive lattice gases. Restricting the variational formula to finite-dimensional sub-spaces allows one to perform the minimization and gives upper bounds for the diffusion coefficient. We apply this approach to a kinetically constrained non-gradient lattice gas in two dimensions, viz. to the Kob-Andersen model on the square lattice.

Analysis of polarization in hydrogen bonded complexes: An asymptotic projection approach

NASA Astrophysics Data System (ADS)

Drici, Nedjoua

2018-03-01

The asymptotic projection technique is used to investigate the polarization effect that arises from the interaction between the relaxed, and frozen monomeric charge densities of a set of neutral and charged hydrogen bonded complexes. The AP technique based on the resolution of the original Kohn-Sham equations can give an acceptable qualitative description of the polarization effect in neutral complexes. The significant overlap of the electron densities, in charged and π-conjugated complexes, impose further development of a new functional, describing the coupling between constrained and non-constrained electron densities within the AP technique to provide an accurate representation of the polarization effect.

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).

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.

Concentration-Driven Assembly and Sol–Gel Transition of π-Conjugated Oligopeptides

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

Zhou, Yuecheng; Li, Bo; Li, Songsong

Advances in supramolecular assembly have enabled the design and synthesis of functional materials with well-defined structures across multiple length scales. Biopolymer-synthetic hybrid materials can assemble into supramolecular structures with a broad range of structural and functional diversity through precisely controlled noncovalent interactions between subunits. Despite recent progress, there is a need to understand the mechanisms underlying the assembly of biohybrid/synthetic molecular building blocks, which ultimately control the emergent properties of hierarchical assemblies. Here in this work, we study the concentration-driven self-assembly and gelation of π-conjugated synthetic oligopeptides containing different π-conjugated cores (quaterthiophene and perylene diimide) using a combination of particlemore » tracking microrheology, confocal fluorescence microscopy, optical spectroscopy, and electron microscopy. Our results show that π-conjugated oligopeptides self-assemble into β-sheet-rich fiber-like structures at neutral pH, even in the absence of electrostatic screening of charged residues. A critical fiber formation concentration c fiber and a critical gel concentration c gel are determined for fiber-forming π-conjugated oligopeptides, and the linear viscoelastic moduli (storage modulus G' and loss modulus G") are determined across a wide range of peptide concentrations. These results suggest that the underlying chemical structure of the synthetic π-conjugated cores greatly influences the self-assembly process, such that oligopeptides appended to π-conjugated cores with greater torsional flexibility tend to form more robust fibers upon increasing peptide concentration compared to oligopeptides with sterically constrained cores. Overall, our work focuses on the molecular assembly of π-conjugated oligopeptides driven by concentration, which is controlled by a combination of enthalpic and entropic interactions between oligopeptide subunits.« less

Concentration-Driven Assembly and Sol–Gel Transition of π-Conjugated Oligopeptides

DOE PAGES

Zhou, Yuecheng; Li, Bo; Li, Songsong; ...

2017-08-17

Advances in supramolecular assembly have enabled the design and synthesis of functional materials with well-defined structures across multiple length scales. Biopolymer-synthetic hybrid materials can assemble into supramolecular structures with a broad range of structural and functional diversity through precisely controlled noncovalent interactions between subunits. Despite recent progress, there is a need to understand the mechanisms underlying the assembly of biohybrid/synthetic molecular building blocks, which ultimately control the emergent properties of hierarchical assemblies. Here in this work, we study the concentration-driven self-assembly and gelation of π-conjugated synthetic oligopeptides containing different π-conjugated cores (quaterthiophene and perylene diimide) using a combination of particlemore » tracking microrheology, confocal fluorescence microscopy, optical spectroscopy, and electron microscopy. Our results show that π-conjugated oligopeptides self-assemble into β-sheet-rich fiber-like structures at neutral pH, even in the absence of electrostatic screening of charged residues. A critical fiber formation concentration c fiber and a critical gel concentration c gel are determined for fiber-forming π-conjugated oligopeptides, and the linear viscoelastic moduli (storage modulus G' and loss modulus G") are determined across a wide range of peptide concentrations. These results suggest that the underlying chemical structure of the synthetic π-conjugated cores greatly influences the self-assembly process, such that oligopeptides appended to π-conjugated cores with greater torsional flexibility tend to form more robust fibers upon increasing peptide concentration compared to oligopeptides with sterically constrained cores. Overall, our work focuses on the molecular assembly of π-conjugated oligopeptides driven by concentration, which is controlled by a combination of enthalpic and entropic interactions between oligopeptide subunits.« less

Experimental design to optimize an Haemophilus influenzae type b conjugate vaccine made with hydrazide-derivatized tetanus toxoid.

PubMed

Laferriere, Craig; Ravenscroft, Neil; Wilson, Seanette; Combrink, Jill; Gordon, Lizelle; Petre, Jean

2011-10-01

The introduction of type b Haemophilus influenzae conjugate vaccines into routine vaccination schedules has significantly reduced the burden of this disease; however, widespread use in developing countries is constrained by vaccine costs, and there is a need for a simple and high-yielding manufacturing process. The vaccine is composed of purified capsular polysaccharide conjugated to an immunogenic carrier protein. To improve the yield and rate of the reductive amination conjugation reaction used to make this vaccine, some of the carboxyl groups of the carrier protein, tetanus toxoid, were modified to hydrazides, which are more reactive than the ε -amine of lysine. Other reaction parameters, including the ratio of the reactants, the size of the polysaccharide, the temperature and the salt concentration, were also investigated. Experimental design was used to minimize the number of experiments required to optimize all these parameters to obtain conjugate in high yield with target characteristics. It was found that increasing the reactant ratio and decreasing the size of the polysaccharide increased the polysaccharide:protein mass ratio in the product. Temperature and salt concentration did not improve this ratio. These results are consistent with a diffusion controlled rate limiting step in the conjugation reaction. Excessive modification of tetanus toxoid with hydrazide was correlated with reduced yield and lower free polysaccharide. This was attributed to a greater tendency for precipitation, possibly due to changes in the isoelectric point. Experimental design and multiple regression helped identify key parameters to control and thereby optimize this conjugation reaction.

Evaluation of gravitational gradients generated by Earth's crustal structures

NASA Astrophysics Data System (ADS)

Novák, Pavel; Tenzer, Robert; Eshagh, Mehdi; Bagherbandi, Mohammad

2013-02-01

Spectral formulas for the evaluation of gravitational gradients generated by upper Earth's mass components are presented in the manuscript. The spectral approach allows for numerical evaluation of global gravitational gradient fields that can be used to constrain gravitational gradients either synthesised from global gravitational models or directly measured by the spaceborne gradiometer on board of the GOCE satellite mission. Gravitational gradients generated by static atmospheric, topographic and continental ice masses are evaluated numerically based on available global models of Earth's topography, bathymetry and continental ice sheets. CRUST2.0 data are then applied for the numerical evaluation of gravitational gradients generated by mass density contrasts within soft and hard sediments, upper, middle and lower crust layers. Combined gravitational gradients are compared to disturbing gravitational gradients derived from a global gravitational model and an idealised Earth's model represented by the geocentric homogeneous biaxial ellipsoid GRS80. The methodology could be used for improved modelling of the Earth's inner structure.

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.

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.

Constraints on Lateral S Wave Velocity Gradients around the Pacific Superplume

NASA Astrophysics Data System (ADS)

To, A.; Romanowicz, B.

2006-12-01

Global shear velocity tomographic models show two large-scale low velocity structures in the lower mantle, under southern Africa and under the mid-Pacific. While tomographic models show the shape of the structures, the gradient and amplitude of the anomalies are yet to be constrained. By forward modelling of Sdiffracted phases using the Coupled Spectral ELement Method (C-SEM, Capdeville et al., 2003), we have previously shown that observed secondary phases following the Sdiff can be explained by interaction of the wavefield with sharp boundaries of the superplumes in the south Indian and south Pacific ocean (To et al., 2005). Here, we search for further constrains on velocity gradients at the border of the Pacific superplume all around the Pacific using a multi-step approach applied to a large dataset of Sdiffracted travel times and waveforms which are sensitive to the lower most mantle. We first apply our finite frequency tomographic inversion methodology (NACT, Li and Romanowicz, 1996) which provides a good starting 3D model, which in particular allows us to position the fast and slow anomalies and their boundaries quite well, as has been shown previously, but underestimates the gradients and velocity contrasts. We then perform forward modelling of Sdiff travel times, taking into account finite frequency effects, to refine the velocity contrasts and gradients and provides the next iteration 3D model. We then perform forward modelling of waveforms, down to a frequency of 0.06Hz, using C-SEM which provides final adjustments to the model. We present a model which shows that we can constrain sharp gradients on the southern and northern edges of the Pacific Superplume. To, A., B. Romanowicz, Y. Capdeville and N. Takeuchi (2005) 3D effects of sharp boundaries at the borders of the African and Pacific Superplumes: Observation and modeling. Earth and Planetary Sceince Letters, 233: 137-153 Capdeville, Y., A. To and B. Romanowicz (2003) Coupling spectral elements and modes in a spherical earth: an extension to the "sandwich" case. Geophys. J. Int., 154: 44-57 Li, X.D. and B. Romanowicz (1996) Global mantle shear velocity model developed using nonlinear asymptotic coupling theory, J. Geophys. Res., 101, 22,245-22,273

2D magnetotelluric inversion using reflection seismic images as constraints and application in the COSC project

NASA Astrophysics Data System (ADS)

Kalscheuer, Thomas; Yan, Ping; Hedin, Peter; Garcia Juanatey, Maria d. l. A.

2017-04-01

We introduce a new constrained 2D magnetotelluric (MT) inversion scheme, in which the local weights of the regularization operator with smoothness constraints are based directly on the envelope attribute of a reflection seismic image. The weights resemble those of a previously published seismic modification of the minimum gradient support method introducing a global stabilization parameter. We measure the directional gradients of the seismic envelope to modify the horizontal and vertical smoothness constraints separately. An appropriate choice of the new stabilization parameter is based on a simple trial-and-error procedure. Our proposed constrained inversion scheme was easily implemented in an existing Gauss-Newton inversion package. From a theoretical perspective, we compare our new constrained inversion to similar constrained inversion methods, which are based on image theory and seismic attributes. Successful application of the proposed inversion scheme to the MT field data of the Collisional Orogeny in the Scandinavian Caledonides (COSC) project using constraints from the envelope attribute of the COSC reflection seismic profile (CSP) helped to reduce the uncertainty of the interpretation of the main décollement. Thus, the new model gave support to the proposed location of a future borehole COSC-2 which is supposed to penetrate the main décollement and the underlying Precambrian basement.

A finite element conjugate gradient FFT method for scattering

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Ross, Dan; Jin, J.-M.; Chatterjee, A.; Volakis, John L.

1991-01-01

Validated results are presented for the new 3D body of revolution finite element boundary integral code. A Fourier series expansion of the vector electric and mangnetic fields is employed to reduce the dimensionality of the system, and the exact boundary condition is employed to terminate the finite element mesh. The mesh termination boundary is chosen such that is leads to convolutional boundary operatores of low O(n) memory demand. Improvements of this code are discussed along with the proposed formulation for a full 3D implementation of the finite element boundary integral method in conjunction with a conjugate gradiant fast Fourier transformation (CGFFT) solution.

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.

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.

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.

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.

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

Sensitivity calculations for iteratively solved problems

NASA Technical Reports Server (NTRS)

Haftka, R. T.

1985-01-01

The calculation of sensitivity derivatives of solutions of iteratively solved systems of algebraic equations is investigated. A modified finite difference procedure is presented which improves the accuracy of the calculated derivatives. The procedure is demonstrated for a simple algebraic example as well as an element-by-element preconditioned conjugate gradient iterative solution technique applied to truss examples.

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

Two-step reconstruction method using global optimization and conjugate gradient for ultrasound-guided diffuse optical tomography.

PubMed

Tavakoli, Behnoosh; Zhu, Quing

2013-01-01

Ultrasound-guided diffuse optical tomography (DOT) is a promising method for characterizing malignant and benign lesions in the female breast. We introduce a new two-step algorithm for DOT inversion in which the optical parameters are estimated with the global optimization method, genetic algorithm. The estimation result is applied as an initial guess to the conjugate gradient (CG) optimization method to obtain the absorption and scattering distributions simultaneously. Simulations and phantom experiments have shown that the maximum absorption and reduced scattering coefficients are reconstructed with less than 10% and 25% errors, respectively. This is in contrast with the CG method alone, which generates about 20% error for the absorption coefficient and does not accurately recover the scattering distribution. A new measure of scattering contrast has been introduced to characterize benign and malignant breast lesions. The results of 16 clinical cases reconstructed with the two-step method demonstrates that, on average, the absorption coefficient and scattering contrast of malignant lesions are about 1.8 and 3.32 times higher than the benign cases, respectively.

A modified three-term PRP conjugate gradient algorithm for optimization models.

PubMed

Wu, Yanlin

2017-01-01

The nonlinear conjugate gradient (CG) algorithm is a very effective method for optimization, especially for large-scale problems, because of its low memory requirement and simplicity. Zhang et al. (IMA J. Numer. Anal. 26:629-649, 2006) firstly propose a three-term CG algorithm based on the well known Polak-Ribière-Polyak (PRP) formula for unconstrained optimization, where their method has the sufficient descent property without any line search technique. They proved the global convergence of the Armijo line search but this fails for the Wolfe line search technique. Inspired by their method, we will make a further study and give a modified three-term PRP CG algorithm. The presented method possesses the following features: (1) The sufficient descent property also holds without any line search technique; (2) the trust region property of the search direction is automatically satisfied; (3) the steplengh is bounded from below; (4) the global convergence will be established under the Wolfe line search. Numerical results show that the new algorithm is more effective than that of the normal method.

A fast mass spring model solver for high-resolution elastic objects

NASA Astrophysics Data System (ADS)

Zheng, Mianlun; Yuan, Zhiyong; Zhu, Weixu; Zhang, Guian

2017-03-01

Real-time simulation of elastic objects is of great importance for computer graphics and virtual reality applications. The fast mass spring model solver can achieve visually realistic simulation in an efficient way. Unfortunately, this method suffers from resolution limitations and lack of mechanical realism for a surface geometry model, which greatly restricts its application. To tackle these problems, in this paper we propose a fast mass spring model solver for high-resolution elastic objects. First, we project the complex surface geometry model into a set of uniform grid cells as cages through *cages mean value coordinate method to reflect its internal structure and mechanics properties. Then, we replace the original Cholesky decomposition method in the fast mass spring model solver with a conjugate gradient method, which can make the fast mass spring model solver more efficient for detailed surface geometry models. Finally, we propose a graphics processing unit accelerated parallel algorithm for the conjugate gradient method. Experimental results show that our method can realize efficient deformation simulation of 3D elastic objects with visual reality and physical fidelity, which has a great potential for applications in computer animation.

Microbial community diversity, structure and assembly across oxygen gradients in meromictic marine lakes, Palau.

PubMed

Meyerhof, Matthew S; Wilson, Jesse M; Dawson, Michael N; Michael Beman, J

2016-12-01

Microbial communities consume oxygen, alter biogeochemistry and compress habitat in aquatic ecosystems, yet our understanding of these microbial-biogeochemical-ecological interactions is limited by a lack of systematic analyses of low-oxygen ecosystems. Marine lakes provide an ideal comparative system, as they range from well-mixed holomictic lakes to stratified, anoxic, meromictic lakes that vary in their vertical extent of anoxia. We examined microbial communities inhabiting six marine lakes and one ocean site using pyrosequencing of 16S rRNA genes. Microbial richness and evenness was typically highest in the anoxic monimolimnion of meromictic lakes, with common marine bacteria present in mixolimnion communities replaced by anoxygenic phototrophs, sulfate-reducing bacteria and SAR406 in the monimolimnion. These sharp changes in community structure were linked to environmental gradients (constrained variation in redundancy analysis = 68%-76%) - particularly oxygen and pH. However, in those lakes with the steepest oxygen gradients, salinity and dissolved nutrients were important secondary constraining variables, indicating that subtle but substantive differences in microbial communities occur within similar low-oxygen habitats. Deterministic processes were a dominant influence on whole community assembly (all nearest taxon index values >4), demonstrating that the strong environmental gradients present in meromictic marine lakes drive microbial community assembly. © 2016 Society for Applied Microbiology and John Wiley & Sons Ltd.

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

Li, Xiao-Dong; Park, Changbom; Forero-Romero, J. E.

We propose a method based on the redshift dependence of the Alcock-Paczynski (AP) test to measure the expansion history of the universe. It uses the isotropy of the galaxy density gradient field to constrain cosmological parameters. If the density parameter Ω {sub m} or the dark energy equation of state w are incorrectly chosen, the gradient field appears to be anisotropic with the degree of anisotropy varying with redshift. We use this effect to constrain the cosmological parameters governing the expansion history of the universe. Although redshift-space distortions (RSD) induced by galaxy peculiar velocities also produce anisotropies in the gradientmore » field, these effects are close to uniform in magnitude over a large range of redshift. This makes the redshift variation of the gradient field anisotropy relatively insensitive to the RSD. By testing the method on mock surveys drawn from the Horizon Run 3 cosmological N-body simulations, we demonstrate that the cosmological parameters can be estimated without bias. Our method is complementary to the baryon acoustic oscillation or topology methods as it depends on D{sub AH} , the product of the angular diameter distance and the Hubble parameter.« less

Preparation of nanocrystals and nanocomposites of nanocrystal-conjugated polymer, and their photophysical properties in confined geometries

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

Xu, Jun

2007-01-01

Semiconductors nanocrystals (NCs), also called quantum dots (QDs), have attracted tremendous interest over the past decade in the fields of physics, chemistry, and engineering. Due to the quantum-confined nature of QDs, the variation of particle size provides continuous and predictable changes in fluorescence emission. On the other hand, conjugated polymers (CPs) have been extensively studied for two decades due to their semiconductor-like optical and electronic properties. The electron and energy transfer between NCs and CPs occur in solar cells and light emitting diodes (LEDs), respectively. Placing CPs in direct contact with a NC (i.e., preparing NC-CP nanocomposites) carries advantage overmore » cases where NC aggregation dominates. Such NC-CP nanocomposites possess a well-defined interface that significantly promotes the charge or energy transfer between these two components. However, very few studies have centered on such direct integration. We prepared NCs and NC-CP nanocomposites based on heck coupling and investigated the energy and charge transfer between semiconductor NCs (i.e., CdSe QDs), CPs (i.e., poly(3-hexyl thiophene) (P3HT)) in the nanocomposites in confined geometries. Two novel strategies were used to confine NC and/or NC-CP nanocomposites: (a) directly immobilizing nanohybrids, QDs and nanorods in nanoscopic porous alumina membrane (PAM) , and (b) confining the QDs and CPs in sphere-on-flat geometry to induce self-assembly. While investigating the confinement effect, gradient concentric ring patterns of high regularity form spontaneously simply by allowing a droplet of solution containing either conjugated polymer or semiconductor nanocrystal in a consecutive stick-slip mothion in a confined geometry. Such constrained evaporation can be utilized as a simple, cheap, and robust strategy for self-assembling various materials with easily tailored optical and electronic properties into spatially ordered, two-dimensional patterns. These self-organized patterns of functional nanoscale materials over large areas offer a tremendous potential for applications in optoelectronic devices, LEDs, solar cells, and biosensors. Meanwhile, spherical nanocrystals (i.e. CdSe/ZnS core/shell QDs) were placed in a hexagonal array of highly ordered cylindrical nanopores of PAMs by a simple dip-coating method and vacuum suction process, respectively. The fluorescence of CdSe/ZnS QD was retained after being filled inside PAMs and the filling contents were obtained via transmission UV-vis measurements.« 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.

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.

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

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.

GOCE gravity gradient data for lithospheric modeling - From well surveyed to frontier areas

NASA Astrophysics Data System (ADS)

Bouman, J.; Ebbing, J.; Gradmann, S.; Fuchs, M.; Fattah, R. Abdul; Meekes, S.; Schmidt, M.; Lieb, V.; Haagmans, R.

2012-04-01

We explore how GOCE gravity gradient data can improve modeling of the Earth's lithosphere and thereby contribute to a better understanding of the Earth's dynamic processes. The idea is to invert satellite gravity gradients and terrestrial gravity data in the well explored and understood North-East Atlantic Margin and to compare the results of this inversion, providing improved information about the lithosphere and upper mantle, with results obtained by means of models based upon other sources like seismics and magnetic field information. Transfer of the obtained knowledge to the less explored Rub' al Khali desert is foreseen. We present a case study for the North-East Atlantic margin, where we analyze the use of satellite gravity gradients by comparison with a well-constrained 3D density model that provides a detailed picture from the upper mantle to the top basement (base of sediments). The latter horizon is well resolved from gravity and especially magnetic data, whereas sedimentary layers are mainly constrained from seismic studies, but do in general not show a prominent effect in the gravity and magnetic field. We analyze how gravity gradients can increase confidence in the modeled structures by calculating a sensitivity matrix for the existing 3D model. This sensitivity matrix describes the relation between calculated gravity gradient data and geological structures with respect to their depth, extent and relative density contrast. As the sensitivity of the modeled bodies varies for different tensor components, we can use this matrix for a weighted inversion of gradient data to optimize the model. This sensitivity analysis will be used as input to study the Rub' al Khali desert in Saudi Arabia. In terms of modeling and data availability this is a frontier area. Here gravity gradient data will be used to better identify the extent of anomalous structures within the basin, with the goal to improve the modeling for hydrocarbon exploration purposes.

South Virgin-White Hills detachment fault system of SE Nevada and NW Arizona: Applying apatite fission track thermochronology to constrain the tectonic evolution of a major continental detachment fault

NASA Astrophysics Data System (ADS)

Fitzgerald, Paul G.; Duebendorfer, Ernest M.; Faulds, James E.; O'Sullivan, Paul

2009-04-01

The South Virgin-White Hills detachment (SVWHD) in the central Basin and Range province with an along-strike extent of ˜60 km is a major continental detachment fault system. Displacement on the SVWHD decreases north to south from ˜17 to <6 km. This is accompanied by a change in fault and footwall rock type from mylonite overprinted by cataclasite to chlorite cataclasite and then fault breccia reflecting decreasing fault displacement and footwall exhumation. Apatite fission track (AFT) thermochronology was applied both along-strike and across-strike to assess this displacement gradient. The overall thermal history reflects Laramide cooling (˜75 Ma) and then rapid cooling beginning in the late early Miocene. Age patterns reflect some complexity but extension along the SVWHD appears synchronous with rapid cooling initiated at ˜17 Ma due to tectonic exhumation. Slip rate is more rapid (˜8.6 km/Ma) in the north compared to ˜1 km/Ma in the south. The displacement gradient results from penecontemporaneous along-strike motion and formation of the SVWHD by linkage of originally separate fault segments that have differential displacements and hence differential slip rates. East-west transverse structures likely play a role in linkage of different fault segments. The preextension paleogeothermal gradient is well constrained in the Gold Butte block as 18-20°C/km. We present a new thermochronologic approach to constrain fault dip during slip, treating the vertical exhumation rate and the slip as vectors, with the angle between them used to constrain fault dip during slip through the closure temperature of a particular thermochronometer. AFT data from the western rim of the Colorado Plateau constrain the initiation of timing of cooling associated with the Laramide Orogeny at ˜75 Ma, and a reheating event in the late Eocene/early Oligocene associated with burial by sediments ("rim gravels") most likely shed from the Kingman High to the west of the plateau.

Simultaneous Measurements of Substorm-Related Electron Energization in the Ionosphere and the Plasma Sheet

NASA Astrophysics Data System (ADS)

Sivadas, N.; Semeter, J.; Nishimura, Y.; Kero, A.

2017-10-01

On 26 March 2008, simultaneous measurements of a large substorm were made using the Poker Flat Incoherent Scatter Radar, Time History of Events and Macroscale Interactions during Substorm (THEMIS) spacecraft, and all sky cameras. After the onset, electron precipitation reached energies ≳100 keV leading to intense D region ionization. Identifying the source of energetic precipitation has been a challenge because of lack of quantitative and magnetically conjugate measurements of loss cone electrons. In this study, we use the maximum entropy inversion technique to invert altitude profiles of ionization measured by the radar to estimate the loss cone energy spectra of primary electrons. By comparing them with magnetically conjugate measurements from THEMIS-D spacecraft in the nightside plasma sheet, we constrain the source location and acceleration mechanism of precipitating electrons of different energy ranges. Our analysis suggests that the observed electrons ≳100 keV are a result of pitch angle scattering of electrons originating from or tailward of the inner plasma sheet at 9RE, possibly through interaction with electromagnetic ion cyclotron waves. The electrons of energy 10-100 keV are produced by pitch angle scattering due to a potential drop of ≲10 kV in the auroral acceleration region (AAR) as well as wave-particle interactions in and tailward of the AAR. This work demonstrates the utility of magnetically conjugate ground- and space-based measurements in constraining the source of energetic electron precipitation. Unlike in situ spacecraft measurements, ground-based incoherent scatter radars combined with an appropriate inversion technique can be used to provide remote and continuous-time estimates of loss cone electrons in the plasma sheet.

Ferritin conjugates as specific magnetic labels. Implications for cell separation.

PubMed Central

Odette, L L; McCloskey, M A; Young, S H

1984-01-01

Concanavalin A coupled to the naturally occurring iron storage protein ferritin is used to label rat erythrocytes and increase the cells' magnetic susceptibility. Labeled cells are introduced into a chamber containing spherical iron particles and the chamber is placed in a uniform 5.2 kG (gauss) magnetic field. The trajectory of cells in the inhomogeneous magnetic field around the iron particles and the polar distributions of cells bound to the iron particles compare well with the theoretical predictions for high gradient magnetic systems. On the basis of these findings we suggest that ferritin conjugated ligands can be used for selective magnetic separation of labeled cells. Images FIGURE 2 PMID:6743752

The design of multirate digital control systems

NASA Technical Reports Server (NTRS)

Berg, M. C.

1986-01-01

The successive loop closures synthesis method is the only method for multirate (MR) synthesis in common use. A new method for MR synthesis is introduced which requires a gradient-search solution to a constrained optimization problem. Some advantages of this method are that the control laws for all control loops are synthesized simultaneously, taking full advantage of all cross-coupling effects, and that simple, low-order compensator structures are easily accomodated. The algorithm and associated computer program for solving the constrained optimization problem are described. The successive loop closures , optimal control, and constrained optimization synthesis methods are applied to two example design problems. A series of compensator pairs are synthesized for each example problem. The succesive loop closure, optimal control, and constrained optimization synthesis methods are compared, in the context of the two design problems.

Research in computer science

NASA Technical Reports Server (NTRS)

Ortega, J. M.

1984-01-01

The research efforts of University of Virginia students under a NASA sponsored program are summarized and the status of the program is reported. The research includes: testing method evaluations for N version programming; a representation scheme for modeling three dimensional objects; fault tolerant protocols for real time local area networks; performance investigation of Cyber network; XFEM implementation; and vectorizing incomplete Cholesky conjugate gradients.

An iterative method for the Helmholtz equation

NASA Technical Reports Server (NTRS)

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

1983-01-01

An iterative algorithm for the solution of the Helmholtz equation is developed. The algorithm is based on a preconditioned conjugate gradient iteration for the normal equations. The preconditioning is based on an SSOR sweep for the discrete Laplacian. Numerical results are presented for a wide variety of problems of physical interest and demonstrate the effectiveness of the algorithm.

Optimal Control of Evolution Mixed Variational Inclusions

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

Alduncin, Gonzalo, E-mail: alduncin@geofisica.unam.mx

2013-12-15

Optimal control problems of primal and dual evolution mixed variational inclusions, in reflexive Banach spaces, are studied. The solvability analysis of the mixed state systems is established via duality principles. The optimality analysis is performed in terms of perturbation conjugate duality methods, and proximation penalty-duality algorithms to mixed optimality conditions are further presented. Applications to nonlinear diffusion constrained problems as well as quasistatic elastoviscoplastic bilateral contact problems exemplify the theory.

Edge remap for solids

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

Kamm, James R.; Love, Edward; Robinson, Allen C.

We review the edge element formulation for describing the kinematics of hyperelastic solids. This approach is used to frame the problem of remapping the inverse deformation gradient for Arbitrary Lagrangian-Eulerian (ALE) simulations of solid dynamics. For hyperelastic materials, the stress state is completely determined by the deformation gradient, so remapping this quantity effectively updates the stress state of the material. A method, inspired by the constrained transport remap in electromagnetics, is reviewed, according to which the zero-curl constraint on the inverse deformation gradient is implicitly satisfied. Open issues related to the accuracy of this approach are identified. An optimization-based approachmore » is implemented to enforce positivity of the determinant of the deformation gradient. The efficacy of this approach is illustrated with numerical examples.« less

Performance analysis of structured gradient algorithm. [for adaptive beamforming linear arrays

NASA Technical Reports Server (NTRS)

Godara, Lal C.

1990-01-01

The structured gradient algorithm uses a structured estimate of the array correlation matrix (ACM) to estimate the gradient required for the constrained least-mean-square (LMS) algorithm. This structure reflects the structure of the exact array correlation matrix for an equispaced linear array and is obtained by spatial averaging of the elements of the noisy correlation matrix. In its standard form the LMS algorithm does not exploit the structure of the array correlation matrix. The gradient is estimated by multiplying the array output with the receiver outputs. An analysis of the two algorithms is presented to show that the covariance of the gradient estimated by the structured method is less sensitive to the look direction signal than that estimated by the standard method. The effect of the number of elements on the signal sensitivity of the two algorithms is studied.

Dependence of image quality on image operator and noise for optical diffusion tomography

NASA Astrophysics Data System (ADS)

Chang, Jenghwa; Graber, Harry L.; Barbour, Randall L.

1998-04-01

By applying linear perturbation theory to the radiation transport equation, the inverse problem of optical diffusion tomography can be reduced to a set of linear equations, W(mu) equals R, where W is the weight function, (mu) are the cross- section perturbations to be imaged, and R is the detector readings perturbations. We have studied the dependence of image quality on added systematic error and/or random noise in W and R. Tomographic data were collected from cylindrical phantoms, with and without added inclusions, using Monte Carlo methods. Image reconstruction was accomplished using a constrained conjugate gradient descent method. Result show that accurate images containing few artifacts are obtained when W is derived from a reference states whose optical thickness matches that of the unknown teste medium. Comparable image quality was also obtained for unmatched W, but the location of the target becomes more inaccurate as the mismatch increases. Results of the noise study show that image quality is much more sensitive to noise in W than in R, and the impact of noise increase with the number of iterations. Images reconstructed after pure noise was substituted for R consistently contain large peaks clustered about the cylinder axis, which was an initially unexpected structure. In other words, random input produces a non- random output. This finding suggests that algorithms sensitive to the evolution of this feature could be developed to suppress noise effects.

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.

The role of polymerase III in conjugation between E. coli K12 donor and recipient strains carrying dnaE ts mutation.

PubMed

Blinkowa, A

1976-01-01

The possible role of DNA polimerase III in conjugation was studied in a series of mutants temperature-sensitive for DNA polymerase III synthesis. The temperature-sensitive DNA mutation called dnaE 486 (ts) prohibits vegetative DNA replication at 41-45 degrees. Transfer of episome and chromosome from temperature-sensitive donor, carrying dnaE mutation to wild-type recipient strains, revertants and dnaE recipients was investigated. In the first two cases the number of Lac+ sexductants being even slightly higher at 43 degrees. Conjugational synthesis accompanying transfer involving the combination of dnaE (ts) thymine dependent and thymine independent donor and recipient strains measured by incorporation of 14C thymine was observed at the restrictive temperature. In the case of conjugation with temperaturesensitive recipient strains a drop of Lac+ sexductants and Pro+ recombinants may be as a result of disturbances in the synthesis of complementary strand in recipient, known to be dependent on pol III. However, the episome investigated by centrifugation in neutral CsC1 gradient after its transfer to the recipient with faulty polymerase III was double stranded (replicated) at the restrictive temperature.

Efficient geostatistical inversion of transient groundwater flow using preconditioned nonlinear conjugate gradients

NASA Astrophysics Data System (ADS)

Klein, Ole; Cirpka, Olaf A.; Bastian, Peter; Ippisch, Olaf

2017-04-01

In the geostatistical inverse problem of subsurface hydrology, continuous hydraulic parameter fields, in most cases hydraulic conductivity, are estimated from measurements of dependent variables, such as hydraulic heads, under the assumption that the parameter fields are autocorrelated random space functions. Upon discretization, the continuous fields become large parameter vectors with O (104 -107) elements. While cokriging-like inversion methods have been shown to be efficient for highly resolved parameter fields when the number of measurements is small, they require the calculation of the sensitivity of each measurement with respect to all parameters, which may become prohibitive with large sets of measured data such as those arising from transient groundwater flow. We present a Preconditioned Conjugate Gradient method for the geostatistical inverse problem, in which a single adjoint equation needs to be solved to obtain the gradient of the objective function. Using the autocovariance matrix of the parameters as preconditioning matrix, expensive multiplications with its inverse can be avoided, and the number of iterations is significantly reduced. We use a randomized spectral decomposition of the posterior covariance matrix of the parameters to perform a linearized uncertainty quantification of the parameter estimate. The feasibility of the method is tested by virtual examples of head observations in steady-state and transient groundwater flow. These synthetic tests demonstrate that transient data can reduce both parameter uncertainty and time spent conducting experiments, while the presented methods are able to handle the resulting large number of measurements.

Prenatal Development of Interlimb Motor Learning in the Rat Fetus

PubMed Central

Robinson, Scott R.; Kleven, Gale A.; Brumley, Michele R.

2010-01-01

The role of sensory feedback in the early ontogeny of motor coordination remains a topic of speculation and debate. On E20 of gestation (the 20th day after conception, 2 days before birth), rat fetuses can alter interlimb coordination after a period of training with an interlimb yoke, which constrains limb movement and promotes synchronized, conjugate movement of the yoked limbs. The aim of this study was to determine how the ability to express this form of motor learning may change during prenatal development. Fetal rats were prepared for in vivo study at 4 ages (E18–21) and tested in a 65-min training-and-testing session examining hind limb motor learning. A significant increase in conjugate hind limb activity was expressed by E19, but not E18 fetuses, with further increases in conjugate hind limb activity on E20 and E21. These findings suggest substantial development of the ability of fetal rats to modify patterns of interlimb coordination in response to kinesthetic feedback during motor training before birth. PMID:20198121

A new approach to blind deconvolution of astronomical images

NASA Astrophysics Data System (ADS)

Vorontsov, S. V.; Jefferies, S. M.

2017-05-01

We readdress the strategy of finding approximate regularized solutions to the blind deconvolution problem, when both the object and the point-spread function (PSF) have finite support. Our approach consists in addressing fixed points of an iteration in which both the object x and the PSF y are approximated in an alternating manner, discarding the previous approximation for x when updating x (similarly for y), and considering the resultant fixed points as candidates for a sensible solution. Alternating approximations are performed by truncated iterative least-squares descents. The number of descents in the object- and in the PSF-space play a role of two regularization parameters. Selection of appropriate fixed points (which may not be unique) is performed by relaxing the regularization gradually, using the previous fixed point as an initial guess for finding the next one, which brings an approximation of better spatial resolution. We report the results of artificial experiments with noise-free data, targeted at examining the potential capability of the technique to deconvolve images of high complexity. We also show the results obtained with two sets of satellite images acquired using ground-based telescopes with and without adaptive optics compensation. The new approach brings much better results when compared with an alternating minimization technique based on positivity-constrained conjugate gradients, where the iterations stagnate when addressing data of high complexity. In the alternating-approximation step, we examine the performance of three different non-blind iterative deconvolution algorithms. The best results are provided by the non-negativity-constrained successive over-relaxation technique (+SOR) supplemented with an adaptive scheduling of the relaxation parameter. Results of comparable quality are obtained with steepest descents modified by imposing the non-negativity constraint, at the expense of higher numerical costs. The Richardson-Lucy (or expectation-maximization) algorithm fails to locate stable fixed points in our experiments, due apparently to inappropriate regularization properties.

The use of singular value gradients and optimization techniques to design robust controllers for multiloop systems

NASA Technical Reports Server (NTRS)

Newsom, J. R.; Mukhopadhyay, V.

1983-01-01

A method for designing robust feedback controllers for multiloop systems is presented. Robustness is characterized in terms of the minimum singular value of the system return difference matrix at the plant input. Analytical gradients of the singular values with respect to design variables in the controller are derived. A cumulative measure of the singular values and their gradients with respect to the design variables is used with a numerical optimization technique to increase the system's robustness. Both unconstrained and constrained optimization techniques are evaluated. Numerical results are presented for a two-input/two-output drone flight control system.

The use of singular value gradients and optimization techniques to design robust controllers for multiloop systems

NASA Technical Reports Server (NTRS)

Newsom, J. R.; Mukhopadhyay, V.

1983-01-01

A method for designing robust feedback controllers for multiloop systems is presented. Robustness is characterized in terms of the minimum singular value of the system return difference matrix at the plant input. Analytical gradients of the singular values with respect to design variables in the controller are derived. A cumulative measure of the singular values and their gradients with respect to the design variables is used with a numerical optimization technique to increase the system's robustness. Both unconstrained and constrained optimization techniques are evaluated. Numerical results are presented for a two output drone flight control system.

Quantitative Experimental Determination of Primer-Dimer Formation Risk by Free-Solution Conjugate Electrophoresis

PubMed Central

Desmarais, Samantha M.; Leitner, Thomas; Barron, Annelise E.

2012-01-01

DNA barcodes are short, unique ssDNA primers that “mark” individual biomolecules. To gain better understanding of biophysical parameters constraining primer-dimer formation between primers that incorporate barcode sequences, we have developed a capillary electrophoresis method that utilizes drag-tag-DNA conjugates to quantify dimerization risk between primer-barcode pairs. Results obtained with this unique free-solution conjugate electrophoresis (FSCE) approach are useful as quantitatively precise input data to parameterize computation models of dimerization risk. A set of fluorescently labeled, model primer-barcode conjugates were designed with complementary regions of differing lengths to quantify heterodimerization as a function of temperature. Primer-dimer cases comprised two 30-mer primers, one of which was covalently conjugated to a lab-made, chemically synthesized poly-N-methoxyethylglycine drag-tag, which reduced electrophoretic mobility of ssDNA to distinguish it from ds primer-dimers. The drag-tags also provided a shift in mobility for the dsDNA species, which allowed us to quantitate primer-dimer formation. In the experimental studies, pairs of oligonucleotide primer-barcodes with fully or partially complementary sequences were annealed, and then separated by free-solution conjugate CE at different temperatures, to assess effects on primer-dimer formation. When less than 30 out of 30 basepairs were bonded, dimerization was inversely correlated to temperature. Dimerization occurred when more than 15 consecutive basepairs formed, yet non-consecutive basepairs did not create stable dimers even when 20 out of 30 possible basepairs bonded. The use of free-solution electrophoresis in combination with a peptoid drag-tag and different fluorophores enabled precise separation of short DNA fragments to establish a new mobility shift assay for detection of primer-dimer formation. PMID:22331820

Ptychographic overlap constraint errors and the limits of their numerical recovery using conjugate gradient descent methods.

PubMed

Tripathi, Ashish; McNulty, Ian; Shpyrko, Oleg G

2014-01-27

Ptychographic coherent x-ray diffractive imaging is a form of scanning microscopy that does not require optics to image a sample. A series of scanned coherent diffraction patterns recorded from multiple overlapping illuminated regions on the sample are inverted numerically to retrieve its image. The technique recovers the phase lost by detecting the diffraction patterns by using experimentally known constraints, in this case the measured diffraction intensities and the assumed scan positions on the sample. The spatial resolution of the recovered image of the sample is limited by the angular extent over which the diffraction patterns are recorded and how well these constraints are known. Here, we explore how reconstruction quality degrades with uncertainties in the scan positions. We show experimentally that large errors in the assumed scan positions on the sample can be numerically determined and corrected using conjugate gradient descent methods. We also explore in simulations the limits, based on the signal to noise of the diffraction patterns and amount of overlap between adjacent scan positions, of just how large these errors can be and still be rendered tractable by this method.

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.

Algorithms for the optimization of RBE-weighted dose in particle therapy.

PubMed

Horcicka, M; Meyer, C; Buschbacher, A; Durante, M; Krämer, M

2013-01-21

We report on various algorithms used for the nonlinear optimization of RBE-weighted dose in particle therapy. Concerning the dose calculation carbon ions are considered and biological effects are calculated by the Local Effect Model. Taking biological effects fully into account requires iterative methods to solve the optimization problem. We implemented several additional algorithms into GSI's treatment planning system TRiP98, like the BFGS-algorithm and the method of conjugated gradients, in order to investigate their computational performance. We modified textbook iteration procedures to improve the convergence speed. The performance of the algorithms is presented by convergence in terms of iterations and computation time. We found that the Fletcher-Reeves variant of the method of conjugated gradients is the algorithm with the best computational performance. With this algorithm we could speed up computation times by a factor of 4 compared to the method of steepest descent, which was used before. With our new methods it is possible to optimize complex treatment plans in a few minutes leading to good dose distributions. At the end we discuss future goals concerning dose optimization issues in particle therapy which might benefit from fast optimization solvers.

Algorithms for the optimization of RBE-weighted dose in particle therapy

NASA Astrophysics Data System (ADS)

Horcicka, M.; Meyer, C.; Buschbacher, A.; Durante, M.; Krämer, M.

2013-01-01

We report on various algorithms used for the nonlinear optimization of RBE-weighted dose in particle therapy. Concerning the dose calculation carbon ions are considered and biological effects are calculated by the Local Effect Model. Taking biological effects fully into account requires iterative methods to solve the optimization problem. We implemented several additional algorithms into GSI's treatment planning system TRiP98, like the BFGS-algorithm and the method of conjugated gradients, in order to investigate their computational performance. We modified textbook iteration procedures to improve the convergence speed. The performance of the algorithms is presented by convergence in terms of iterations and computation time. We found that the Fletcher-Reeves variant of the method of conjugated gradients is the algorithm with the best computational performance. With this algorithm we could speed up computation times by a factor of 4 compared to the method of steepest descent, which was used before. With our new methods it is possible to optimize complex treatment plans in a few minutes leading to good dose distributions. At the end we discuss future goals concerning dose optimization issues in particle therapy which might benefit from fast optimization solvers.

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.

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.

Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method

NASA Astrophysics Data System (ADS)

Kaporin, I. E.

2012-02-01

In order to precondition a sparse symmetric positive definite matrix, its approximate inverse is examined, which is represented as the product of two sparse mutually adjoint triangular matrices. In this way, the solution of the corresponding system of linear algebraic equations (SLAE) by applying the preconditioned conjugate gradient method (CGM) is reduced to performing only elementary vector operations and calculating sparse matrix-vector products. A method for constructing the above preconditioner is described and analyzed. The triangular factor has a fixed sparsity pattern and is optimal in the sense that the preconditioned matrix has a minimum K-condition number. The use of polynomial preconditioning based on Chebyshev polynomials makes it possible to considerably reduce the amount of scalar product operations (at the cost of an insignificant increase in the total number of arithmetic operations). The possibility of an efficient massively parallel implementation of the resulting method for solving SLAEs is discussed. For a sequential version of this method, the results obtained by solving 56 test problems from the Florida sparse matrix collection (which are large-scale and ill-conditioned) are presented. These results show that the method is highly reliable and has low computational costs.

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.

Molybdenum and Phosphorus Interact to Constrain Asymbiotic Nitrogen Fixation in Tropical Forests

PubMed Central

Wurzburger, Nina; Bellenger, Jean Philippe; Kraepiel, Anne M. L.; Hedin, Lars O.

2012-01-01

Biological di-nitrogen fixation (N2) is the dominant natural source of new nitrogen to land ecosystems. Phosphorus (P) is thought to limit N2 fixation in many tropical soils, yet both molybdenum (Mo) and P are crucial for the nitrogenase reaction (which catalyzes N2 conversion to ammonia) and cell growth. We have limited understanding of how and when fixation is constrained by these nutrients in nature. Here we show in tropical forests of lowland Panama that the limiting element on asymbiotic N2 fixation shifts along a broad landscape gradient in soil P, where Mo limits fixation in P-rich soils while Mo and P co-limit in P-poor soils. In no circumstance did P alone limit fixation. We provide and experimentally test a mechanism that explains how Mo and P can interact to constrain asymbiotic N2 fixation. Fixation is uniformly favored in surface organic soil horizons - a niche characterized by exceedingly low levels of available Mo relative to P. We show that soil organic matter acts to reduce molybdate over phosphate bioavailability, which, in turn, promotes Mo limitation in sites where P is sufficient. Our findings show that asymbiotic N2 fixation is constrained by the relative availability and dynamics of Mo and P in soils. This conceptual framework can explain shifts in limitation status across broad landscape gradients in soil fertility and implies that fixation depends on Mo and P in ways that are more complex than previously thought. PMID:22470462

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.

Nonadiabatic excited-state molecular dynamics: modeling photophysics in organic conjugated materials.

PubMed

Nelson, Tammie; Fernandez-Alberti, Sebastian; Roitberg, Adrian E; Tretiak, Sergei

2014-04-15

To design functional photoactive materials for a variety of technological applications, researchers need to understand their electronic properties in detail and have ways to control their photoinduced pathways. When excited by photons of light, organic conjugated materials (OCMs) show dynamics that are often characterized by large nonadiabatic (NA) couplings between multiple excited states through a breakdown of the Born-Oppenheimer (BO) approximation. Following photoexcitation, various nonradiative intraband relaxation pathways can lead to a number of complex processes. Therefore, computational simulation of nonadiabatic molecular dynamics is an indispensable tool for understanding complex photoinduced processes such as internal conversion, energy transfer, charge separation, and spatial localization of excitons. Over the years, we have developed a nonadiabatic excited-state molecular dynamics (NA-ESMD) framework that efficiently and accurately describes photoinduced phenomena in extended conjugated molecular systems. We use the fewest-switches surface hopping (FSSH) algorithm to treat quantum transitions among multiple adiabatic excited state potential energy surfaces (PESs). Extended molecular systems often contain hundreds of atoms and involve large densities of excited states that participate in the photoinduced dynamics. We can achieve an accurate description of the multiple excited states using the configuration interaction single (CIS) formalism with a semiempirical model Hamiltonian. Analytical techniques allow the trajectory to be propagated "on the fly" using the complete set of NA coupling terms and remove computational bottlenecks in the evaluation of excited-state gradients and NA couplings. Furthermore, the use of state-specific gradients for propagation of nuclei on the native excited-state PES eliminates the need for simplifications such as the classical path approximation (CPA), which only uses ground-state gradients. Thus, the NA-ESMD methodology offers a computationally tractable route for simulating hundreds of atoms on ~10 ps time scales where multiple coupled excited states are involved. In this Account, we review recent developments in the NA-ESMD modeling of photoinduced dynamics in extended conjugated molecules involving multiple coupled electronic states. We have successfully applied the outlined NA-ESMD framework to study ultrafast conformational planarization in polyfluorenes where the rate of torsional relaxation can be controlled based on the initial excitation. With the addition of the state reassignment algorithm to identify instances of unavoided crossings between noninteracting PESs, NA-ESMD can now be used to study systems in which these so-called trivial unavoided crossings are expected to predominate. We employ this technique to analyze the energy transfer between poly(phenylene vinylene) (PPV) segments where conformational fluctuations give rise to numerous instances of unavoided crossings leading to multiple pathways and complex energy transfer dynamics that cannot be described using a simple Förster model. In addition, we have investigated the mechanism of ultrafast unidirectional energy transfer in dendrimers composed of poly(phenylene ethynylene) (PPE) chromophores and have demonstrated that differential nuclear motion favors downhill energy transfer in dendrimers. The use of native excited-state gradients allows us to observe this feature.

Combinational concentration gradient confinement through stagnation flow.

PubMed

Alicia, Toh G G; Yang, Chun; Wang, Zhiping; Nguyen, Nam-Trung

2016-01-21

Concentration gradient generation in microfluidics is typically constrained by two conflicting mass transport requirements: short characteristic times (τ) for precise temporal control of concentration gradients but at the expense of high flow rates and hence, high flow shear stresses (σ). To decouple the limitations from these parameters, here we propose the use of stagnation flows to confine concentration gradients within large velocity gradients that surround the stagnation point. We developed a modified cross-slot (MCS) device capable of feeding binary and combinational concentration sources in stagnation flows. We show that across the velocity well, source-sink pairs can form permanent concentration gradients. As source-sink concentration pairs are continuously supplied to the MCS, a permanently stable concentration gradient can be generated. Tuning the flow rates directly controls the velocity gradients, and hence the stagnation point location, allowing the confined concentration gradient to be focused. In addition, the flow rate ratio within the MCS rapidly controls (τ ∼ 50 ms) the location of the stagnation point and the confined combinational concentration gradients at low flow shear (0.2 Pa < σ < 2.9 Pa). The MCS device described in this study establishes the method for using stagnation flows to rapidly generate and position low shear combinational concentration gradients for shear sensitive biological assays.

Atmospheric gradients from very long baseline interferometry observations

NASA Technical Reports Server (NTRS)

Macmillan, D. S.

1995-01-01

Azimuthal asymmetries in the atmospheric refractive index can lead to errors in estimated vertical and horizontal station coordinates. Daily average gradient effects can be as large as 50 mm of delay at a 7 deg elevation. To model gradients, the constrained estimation of gradient paramters was added to the standard VLBI solution procedure. Here the analysis of two sets of data is summarized: the set of all geodetic VLBI experiments from 1990-1993 and a series of 12 state-of-the-art R&D experiments run on consecutive days in January 1994. In both cases, when the gradient parameters are estimated, the overall fit of the geodetic solution is improved at greater than the 99% confidence level. Repeatabilities of baseline lengths ranging up to 11,000 km are improved by 1 to 8 mm in a root-sum-square sense. This varies from about 20% to 40% of the total baseline length scatter without gradient modeling for the 1990-1993 series and 40% to 50% for the January series. Gradients estimated independently for each day as a piecewise linear function are mostly continuous from day to day within their formal uncertainties.

Research in computer science

NASA Technical Reports Server (NTRS)

Ortega, J. M.

1986-01-01

Various graduate research activities in the field of computer science are reported. Among the topics discussed are: (1) failure probabilities in multi-version software; (2) Gaussian Elimination on parallel computers; (3) three dimensional Poisson solvers on parallel/vector computers; (4) automated task decomposition for multiple robot arms; (5) multi-color incomplete cholesky conjugate gradient methods on the Cyber 205; and (6) parallel implementation of iterative methods for solving linear equations.

A Fast Deep Learning System Using GPU

DTIC Science & Technology

2014-06-01

hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and...widely used in data modeling until three decades later when efficient training algorithm for RBM is invented by Hinton [3] and the computing power is...be trained using most of optimization algorithms , such as BP, conjugate gradient descent (CGD) or Levenberg-Marquardt (LM). The advantage of this

Conference Proceedings: 7th Annual Review of Progress in Applied Computational Electromagnetics at the Naval Postgraduate School, Monterey, California, March 18-22, 1991

DTIC Science & Technology

1991-03-01

34Volume integral Equations and Conjugate Gradient Methods in Electromagnetic Non destructive Evaluation’ by Dr. Harold P.. Sabbagh, Sabbagh Associates...8217 Experimental Demonstrations far teaching Electroamgnetic Folods and Energy’ M. Zathn, J. Mectrer...8217-....................................... . ...................................................... 329 ’PoalarimetrIc Scattering and Control at Radar Crass Section of Chirat Targets at Simple

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.

Solution of nonlinear multivariable constrained systems using a gradient projection digital algorithm that is insensitive to the initial state

NASA Technical Reports Server (NTRS)

Hargrove, A.

1982-01-01

Optimal digital control of nonlinear multivariable constrained systems was studied. The optimal controller in the form of an algorithm was improved and refined by reducing running time and storage requirements. A particularly difficult system of nine nonlinear state variable equations was chosen as a test problem for analyzing and improving the controller. Lengthy analysis, modeling, computing and optimization were accomplished. A remote interactive teletype terminal was installed. Analysis requiring computer usage of short duration was accomplished using Tuskegee's VAX 11/750 system.

A biconjugate gradient type algorithm on massively parallel architectures

NASA Technical Reports Server (NTRS)

Freund, Roland W.; Hochbruck, Marlis

1991-01-01

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. Recently, Freund and Nachtigal have proposed a novel BCG type approach, the quasi-minimal residual method (QMR), which overcomes the problems of BCG. Here, an implementation is presented of QMR based on an s-step version of the nonsymmetric look-ahead Lanczos algorithm. The main feature of the s-step Lanczos algorithm is that, in general, all inner products, except for one, can be computed in parallel at the end of each block; this is unlike the other standard Lanczos process where inner products are generated sequentially. The resulting implementation of QMR is particularly attractive on massively parallel SIMD architectures, such as the Connection Machine.

QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems

NASA Technical Reports Server (NTRS)

Freund, Roland W.; Nachtigal, Noel M.

1990-01-01

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.

Constraints on Southern Ocean CO2 Fluxes and Seasonality from Atmospheric Vertical Gradients Observed on Multiple Airborne Campaigns

NASA Astrophysics Data System (ADS)

McKain, K.; Sweeney, C.; Stephens, B. B.; Long, M. C.; Jacobson, A. R.; Basu, S.; Chatterjee, A.; Weir, B.; Wofsy, S. C.; Atlas, E. L.; Blake, D. R.; Montzka, S. A.; Stern, R.

2017-12-01

The Southern Ocean plays an important role in the global carbon cycle and climate system, but net CO2 flux into the Southern Ocean is difficult to measure and model because it results from large opposing and seasonally-varying fluxes due to thermal forcing, biological uptake, and deep-water mixing. We present an analysis to constrain the seasonal cycle of net CO2 exchange with the Southern Ocean, and the magnitude of summer uptake, using the vertical gradients in atmospheric CO2 observed during three aircraft campaigns in the southern polar region. The O2/N2 Ratio and CO2 Airborne Southern Ocean Study (ORCAS) was an airborne campaign that intensively sampled the atmosphere at 0-13 km altitude and 45-75 degrees south latitude in the austral summer (January-February) of 2016. The global airborne campaigns, the HIAPER Pole-to-Pole Observations (HIPPO) study and the Atmospheric Tomography Mission (ATom), provide additional measurements over the Southern Ocean from other seasons and multiple years (2009-2011, 2016-2017). Derivation of fluxes from measured vertical gradients requires robust estimates of the residence time of air in the polar tropospheric domain, and of the contribution of long-range transport from northern latitudes outside the domain to the CO2 gradient. We use diverse independent approaches to estimate both terms, including simulations using multiple transport and flux models, and observed gradients of shorter-lived tracers with specific sources regions and well-known loss processes. This study demonstrates the utility of aircraft profile measurements for constraining large-scale air-sea fluxes for the Southern Ocean, in contrast to those derived from the extrapolation of sparse ocean and atmospheric measurements and uncertain flux parameterizations.

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.

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.

Slab Geometry and Segmentation on Seismogenic Subduction Zone; Insight from gravity gradients

NASA Astrophysics Data System (ADS)

Saraswati, A. T.; Mazzotti, S.; Cattin, R.; Cadio, C.

2017-12-01

Slab geometry is a key parameter to improve seismic hazard assessment in subduction zones. In many cases, information about structures beneath subduction are obtained from geophysical dedicated studies, including geodetic and seismic measurements. However, due to the lack of global information, both geometry and segmentation in seismogenic zone of many subductions remain badly-constrained. Here we propose an alternative approach based on satellite gravity observations. The GOCE (Gravity field and steady-state Ocean Circulation Explorer) mission enables to probe Earth deep mass structures from gravity gradients, which are more sensitive to spatial structure geometry and directional properties than classical gravitational data. Gravity gradients forward modeling of modeled slab is performed by using horizontal and vertical gravity gradient components to better determine slab geophysical model rather than vertical gradient only. Using polyhedron method, topography correction on gravity gradient signal is undertaken to enhance the anomaly signal of lithospheric structures. Afterward, we compare residual gravity gradients with the calculated signals associated with slab geometry. In this preliminary study, straightforward models are used to better understand the characteristic of gravity gradient signals due to deep mass sources. We pay a special attention to the delineation of slab borders and dip angle variations.

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].

Cannibalism and activity rate in larval damselflies increase along a latitudinal gradient as a consequence of time constraints.

PubMed

Sniegula, Szymon; Golab, Maria J; Johansson, Frank

2017-07-14

Predation is ubiquitous in nature. One form of predation is cannibalism, which is affected by many factors such as size structure and resource density. However, cannibalism may also be influenced by abiotic factors such as seasonal time constraints. Since time constraints are greater at high latitudes, cannibalism could be stronger at such latitudes, but we know next to nothing about latitudinal variation in cannibalism. In this study, we examined cannibalism and activity in larvae of the damselfly Lestes sponsa along a latitudinal gradient across Europe. We did this by raising larvae from the egg stage at different temperatures and photoperiods corresponding to different latitudes. We found that the more seasonally time-constrained populations in northern latitudes and individuals subjected to greater seasonal time constraints exhibited a higher level of cannibalism. We also found that activity was higher at north latitude conditions, and thus correlated with cannibalism, suggesting that this behaviour mediates higher levels of cannibalism in time-constrained animals. Our results go counter to the classical latitude-predation pattern which predicts higher predation at lower latitudes, since we found that predation was stronger at higher latitudes. The differences in cannibalism might have implications for population dynamics along the latitudinal gradients, but further experiments are needed to explore this.

A method to stabilize linear systems using eigenvalue gradient information

NASA Technical Reports Server (NTRS)

Wieseman, C. D.

1985-01-01

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

L-Valine appended PLGA nanoparticles for oral insulin delivery.

PubMed

Jain, Ashish; Jain, Sanjay K

2015-08-01

Oral insulin delivery has been the major research issue, since many decades, due to several obvious advantages over other routes. However, this route poses several constraints for the delivery of peptides and proteins which are to be worked upon. The small intestine has been shown to be able to transport the L-forms of amino acids against a concentration gradient and that they compete for the mechanism concerned. So, L-valine was used as a ligand for carrier-mediated transport of insulin-loaded polylactic-co-glycolic acid (PLGA) nanoparticles (NPs). L-Valine-conjugated PLGA nanoparticles were prepared using double emulsion solvent evaporation method. The NPs and conjugated NPs were characterized for their size, drug entrapment efficiency, zeta potential, polydispersity index and in vitro insulin release. Ex vivo studies on intestine revealed that conjugated nanoparticles showed greater insulin uptake as compared to non-conjugated nanoparticles. In vivo studies were performed on streptozotocin-induced diabetic rabbits. Oral suspension of insulin-loaded PLGA nanoparticles reduced blood glucose level from 265.4 ± 8.5 to 246.6 ± 2.4 mg/dL within 4 h which further decreased to 198.7 ± 7.1 mg/dL value after 8 h. The ligand-conjugated formulation on oral administration produced hypoglycaemic effect (216.9 ± 1.9 mg/dL) within 4 h of administration, and the hypoglycaemic effect prolonged till 12 h of oral administration. Simultaneously, the insulin concentration in withdrawn samples was also assessed and found that profile of insulin level is in compliance with the blood glucose reduction profile. Hence, it is concluded that the L-valine-conjugated NPs bearing insulin are the promising carrier for the transportation of insulin across the intestine on oral administration.

Engineering calculations for communications satellite systems planning

NASA Technical Reports Server (NTRS)

Martin, C. H.; Gonsalvez, D. J.; Levis, C. A.; Wang, C. W.

1983-01-01

Progress is reported on a computer code to improve the efficiency of spectrum and orbit utilization for the Broadcasting Satellite Service in the 12 GHz band for Region 2. It implements a constrained gradient search procedure using an exponential objective function based on aggregate signal to noise ratio and an extended line search in the gradient direction. The procedure is tested against a manually generated initial scenario and appears to work satisfactorily. In this test it was assumed that alternate channels use orthogonal polarizations at any one satellite location.

Staging optics considerations for a plasma wakefield acceleration linear collider

NASA Astrophysics Data System (ADS)

Lindstrøm, C. A.; Adli, E.; Allen, J. M.; Delahaye, J. P.; Hogan, M. J.; Joshi, C.; Muggli, P.; Raubenheimer, T. O.; Yakimenko, V.

2016-09-01

Plasma wakefield acceleration offers acceleration gradients of several GeV/m, ideal for a next-generation linear collider. The beam optics requirements between plasma cells include injection and extraction of drive beams, matching the main beam beta functions into the next cell, canceling dispersion as well as constraining bunch lengthening and chromaticity. To maintain a high effective acceleration gradient, this must be accomplished in the shortest distance possible. A working example is presented, using novel methods to correct chromaticity, as well as scaling laws for a high energy regime.

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.

Density Functional Theory Calculations of the Dissociation of H[2] on (100) 2H-MoS[2] Surfaces: A Key Step in the Hydroprocessing of Crude Oil

ERIC Educational Resources Information Center

Todorova, Teodora; Alexiev, Valentin; Weber, Thomas

2006-01-01

Hydrogen activation on the (100) surface of MoS[2] structures was investigated by means of density functional theory calculations. Linear and quadratic synchronous transit methods with a conjugate gradient refinement of the saddle point were used to localize transition states. The calculations include heterolytic and homolytic dissociation of…

A technique for accelerating the convergence of restarted GMRES

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

Baker, A H; Jessup, E R; Manteuffel, T

2004-03-09

We have observed that the residual vectors at the end of each restart cycle of restarted GMRES often alternate direction in a cyclic fashion, thereby slowing convergence. We present a new technique for accelerating the convergence of restarted GMRES by disrupting this alternating pattern. The new algorithm resembles a full conjugate gradient method with polynomial preconditioning, and its implementation requires minimal changes to the standard restarted GMRES algorithm.

Conformationally constrained dipeptide surrogates with aromatic side-chains: synthesis of 4-aryl indolizidin-9-one amino acids by conjugate addition to a common alpha,omega-diaminoazelate enone intermediate.

PubMed

Cluzeau, Jérôme; Lubell, William D

2004-03-05

Four methyl 9-oxo-8-(N-(Boc)-amino)-4-phenyl-1-azabicyclo[4.3.0]nonane carboxylates (11, 4-Ph-I(9)aa-OMe) were synthesized from (2S,8S,5E)-di-tert-butyl-4-oxo-5-ene-2,8-bis[N-(PhF)amino]azelate [(5E)-7, PhF = 9-(9-phenylfluorenyl)] via a seven-step process featuring a conjugate addition/reductive amination/lactam cyclization sequence. Various nucleophiles were used in the conjugate addition reactions on enone (5E)-7 as a general route for making alpha,omega-diaminoazelates possessing different substituents in good yield albeit low diastereoselectivity except in the case of aryl Grignard reagents (9/1 to 15/1 drs). 6-Phenylazelates (6S)-8d and (6R)-8d were separated by chromatography and diastereoselective precipitation and independently transformed into 4-Ph-I(9)aa-OMe. From (6S)-8d, (2S,4R,6R,8S)-4-Ph-I(9)aa-OMe 11 was prepared selectively in 51% yield. Reductive amination of (6R)-8d provided the desired pipecolates 9 along with desamino compound 10, which was minimized by performing the hydrogenation in the presence of ammonium acetate. Subsequent ester exchange, lactam cyclization, and amine protection provided three products (2R,4S,6S,8R)-, (2R,4S,6S,8S)-, and (2S,4S,6R,8S)-4-Ph-I(9)aa-OMe 11 in 10, 6, and 6% yields, respectively, from (6R)-8d. Ester hydrolysis of (2S,4R,6R,8S)-11 furnished 4-phenyl indolizidin-9-one N-(Boc)amino acid 3 as a novel constrained Ala-Phe dipeptide surrogate for studying conformation-activity relationships of biologically active peptides.

Motion-compensated cone beam computed tomography using a conjugate gradient least-squares algorithm and electrical impedance tomography imaging motion data.

PubMed

Pengpen, T; Soleimani, M

2015-06-13

Cone beam computed tomography (CBCT) is an imaging modality that has been used in image-guided radiation therapy (IGRT). For applications such as lung radiation therapy, CBCT images are greatly affected by the motion artefacts. This is mainly due to low temporal resolution of CBCT. Recently, a dual modality of electrical impedance tomography (EIT) and CBCT has been proposed, in which the high temporal resolution EIT imaging system provides motion data to a motion-compensated algebraic reconstruction technique (ART)-based CBCT reconstruction software. High computational time associated with ART and indeed other variations of ART make it less practical for real applications. This paper develops a motion-compensated conjugate gradient least-squares (CGLS) algorithm for CBCT. A motion-compensated CGLS offers several advantages over ART-based methods, including possibilities for explicit regularization, rapid convergence and parallel computations. This paper for the first time demonstrates motion-compensated CBCT reconstruction using CGLS and reconstruction results are shown in limited data CBCT considering only a quarter of the full dataset. The proposed algorithm is tested using simulated motion data in generic motion-compensated CBCT as well as measured EIT data in dual EIT-CBCT imaging. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

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.

Solving groundwater flow problems by conjugate-gradient methods and the strongly implicit procedure

USGS Publications Warehouse

Hill, Mary C.

1990-01-01

The performance of the preconditioned conjugate-gradient method with three preconditioners is compared with the strongly implicit procedure (SIP) using a scalar computer. The preconditioners considered are the incomplete Cholesky (ICCG) and the modified incomplete Cholesky (MICCG), which require the same computer storage as SIP as programmed for a problem with a symmetric matrix, and a polynomial preconditioner (POLCG), which requires less computer storage than SIP. Although POLCG is usually used on vector computers, it is included here because of its small storage requirements. In this paper, published comparisons of the solvers are evaluated, all four solvers are compared for the first time, and new test cases are presented to provide a more complete basis by which the solvers can be judged for typical groundwater flow problems. Based on nine test cases, the following conclusions are reached: (1) SIP is actually as efficient as ICCG for some of the published, linear, two-dimensional test cases that were reportedly solved much more efficiently by ICCG; (2) SIP is more efficient than other published comparisons would indicate when common convergence criteria are used; and (3) for problems that are three-dimensional, nonlinear, or both, and for which common convergence criteria are used, SIP is often more efficient than ICCG, and is sometimes more efficient than MICCG.

Bundle block adjustment of large-scale remote sensing data with Block-based Sparse Matrix Compression combined with Preconditioned Conjugate Gradient

NASA Astrophysics Data System (ADS)

Zheng, Maoteng; Zhang, Yongjun; Zhou, Shunping; Zhu, Junfeng; Xiong, Xiaodong

2016-07-01

In recent years, new platforms and sensors in photogrammetry, remote sensing and computer vision areas have become available, such as Unmanned Aircraft Vehicles (UAV), oblique camera systems, common digital cameras and even mobile phone cameras. Images collected by all these kinds of sensors could be used as remote sensing data sources. These sensors can obtain large-scale remote sensing data which consist of a great number of images. Bundle block adjustment of large-scale data with conventional algorithm is very time and space (memory) consuming due to the super large normal matrix arising from large-scale data. In this paper, an efficient Block-based Sparse Matrix Compression (BSMC) method combined with the Preconditioned Conjugate Gradient (PCG) algorithm is chosen to develop a stable and efficient bundle block adjustment system in order to deal with the large-scale remote sensing data. The main contribution of this work is the BSMC-based PCG algorithm which is more efficient in time and memory than the traditional algorithm without compromising the accuracy. Totally 8 datasets of real data are used to test our proposed method. Preliminary results have shown that the BSMC method can efficiently decrease the time and memory requirement of large-scale data.

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.

Optimization of computations for adjoint field and Jacobian needed in 3D CSEM inversion

NASA Astrophysics Data System (ADS)

Dehiya, Rahul; Singh, Arun; Gupta, Pravin K.; Israil, M.

2017-01-01

We present the features and results of a newly developed code, based on Gauss-Newton optimization technique, for solving three-dimensional Controlled-Source Electromagnetic inverse problem. In this code a special emphasis has been put on representing the operations by block matrices for conjugate gradient iteration. We show how in the computation of Jacobian, the matrix formed by differentiation of system matrix can be made independent of frequency to optimize the operations at conjugate gradient step. The coarse level parallel computing, using OpenMP framework, is used primarily due to its simplicity in implementation and accessibility of shared memory multi-core computing machine to almost anyone. We demonstrate how the coarseness of modeling grid in comparison to source (comp`utational receivers) spacing can be exploited for efficient computing, without compromising the quality of the inverted model, by reducing the number of adjoint calls. It is also demonstrated that the adjoint field can even be computed on a grid coarser than the modeling grid without affecting the inversion outcome. These observations were reconfirmed using an experiment design where the deviation of source from straight tow line is considered. Finally, a real field data inversion experiment is presented to demonstrate robustness of the code.

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

Fine-scale features in the far-field of a turbulent jet

NASA Astrophysics Data System (ADS)

Buxton, Oliver; Ganapathisubramani, Bharathram

2008-11-01

The structure of a fully turbulent axisymmetric jet, at Reynolds number based on jet exit conditions of 5000, is investigated with cinematographic (1 kHz) stereoscopic PIV in a plane normal to the jet axis. Taylor's hypothesis is employed to calculate all three velocity gradients in the axial direction. The technique's resolution allows all terms of the velocity gradient tensor, hence strain rate tensor and kinetic energy dissipation, to be computed at each point within the plane. The data reveals that the vorticity field is dominated by high enstrophy tube-like structures. Conversely, the dissipation field appears to consist of sheet-like structures. Several criteria for isolating these strongly swirling vortical structures from the background turbulence were employed. One such technique involves isolating points in which the velocity gradient tensor has a real and a pair of complex conjugate eigenvectors. Once identified, the alignment of the various structures with relation to the vorticity vector and the real velocity gradient tensor eigenvector is investigated. The effect of the strain field on the geometry of the structures is also examined.

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

Sediment classification using neural networks: An example from the site-U1344A of IODP Expedition 323 in the Bering Sea

NASA Astrophysics Data System (ADS)

Ojha, Maheswar; Maiti, Saumen

2016-03-01

A novel approach based on the concept of Bayesian neural network (BNN) has been implemented for classifying sediment boundaries using downhole log data obtained during Integrated Ocean Drilling Program (IODP) Expedition 323 in the Bering Sea slope region. The Bayesian framework in conjunction with Markov Chain Monte Carlo (MCMC)/hybrid Monte Carlo (HMC) learning paradigm has been applied to constrain the lithology boundaries using density, density porosity, gamma ray, sonic P-wave velocity and electrical resistivity at the Hole U1344A. We have demonstrated the effectiveness of our supervised classification methodology by comparing our findings with a conventional neural network and a Bayesian neural network optimized by scaled conjugate gradient method (SCG), and tested the robustness of the algorithm in the presence of red noise in the data. The Bayesian results based on the HMC algorithm (BNN.HMC) resolve detailed finer structures at certain depths in addition to main lithology such as silty clay, diatom clayey silt and sandy silt. Our method also recovers the lithology information from a depth ranging between 615 and 655 m Wireline log Matched depth below Sea Floor of no core recovery zone. Our analyses demonstrate that the BNN based approach renders robust means for the classification of complex lithology successions at the Hole U1344A, which could be very useful for other studies and understanding the oceanic crustal inhomogeneity and structural discontinuities.

Molecular Diagnostics of the Internal Motions of Massive Cores

NASA Astrophysics Data System (ADS)

Pineda, Jorge; Velusamy, T.; Goldsmith, P.; Li, D.; Peng, R.; Langer, W.

2009-12-01

We present models of the internal kinematics of massive cores in the Orion molecular cloud. We use a sample of cores studied by Velusamy et al. (2008) that show red, blue, and no asymmetry in their HCO+ line profiles in equal proportion, and which therefore may represent a sample of cores in different kinematic states. We use the radiative transfer code RATRAN (Hogerheijde & van der Tak 2000) to model several transitions of HCO+ and H13CO+ as well as the dust continuum emission, of a spherical model cloud with radial density, temperature, and velocity gradients. We find that an excitation and velocity gradients are prerequisites to reproduce the observed line profiles. We use the dust continuum emission to constrain the density and temperature gradients. This allows us to narrow down the functional forms of the velocity gradient giving us the opportunity to test several theoretical predictions of velocity gradients produced by the effect of magnetic fields (e.g. Tassis et. al. 2007) and turbulence (e.g. Vasquez-Semanedi et al 2007).

Matter coupling in partially constrained vielbein formulation of massive gravity

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

Felice, Antonio De; Mukohyama, Shinji; Gümrükçüoğlu, A. Emir

2016-01-01

We consider a linear effective vielbein matter coupling without introducing the Boulware-Deser ghost in ghost-free massive gravity. This is achieved in the partially constrained vielbein formulation. We first introduce the formalism and prove the absence of ghost at all scales. As next we investigate the cosmological application of this coupling in this new formulation. We show that even if the background evolution accords with the metric formulation, the perturbations display important different features in the partially constrained vielbein formulation. We study the cosmological perturbations of the two branches of solutions separately. The tensor perturbations coincide with those in the metricmore » formulation. Concerning the vector and scalar perturbations, the requirement of absence of ghost and gradient instabilities yields slightly different allowed parameter space.« less

Matter coupling in partially constrained vielbein formulation of massive gravity

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

Felice, Antonio De; Gümrükçüoğlu, A. Emir; Heisenberg, Lavinia

2016-01-04

We consider a linear effective vielbein matter coupling without introducing the Boulware-Deser ghost in ghost-free massive gravity. This is achieved in the partially constrained vielbein formulation. We first introduce the formalism and prove the absence of ghost at all scales. As next we investigate the cosmological application of this coupling in this new formulation. We show that even if the background evolution accords with the metric formulation, the perturbations display important different features in the partially constrained vielbein formulation. We study the cosmological perturbations of the two branches of solutions separately. The tensor perturbations coincide with those in the metricmore » formulation. Concerning the vector and scalar perturbations, the requirement of absence of ghost and gradient instabilities yields slightly different allowed parameter space.« less

The mid-cretaceous water bearer: Isotope mass balance quantification of the Albian hydrologic cycle

USGS Publications Warehouse

Ufnar, David F.; Gonzalez, Luis A.; Ludvigson, Greg A.; Brenner, Richard L.; Witzke, B.J.

2002-01-01

A latitudinal gradient in meteoric ??18O compositions compiled from paleosol sphaerosiderites throughout the Cretaceous Western Interior Basin (KWIB) (34-75??N paleolatitude) exhibits a steeper, more depleted trend than modern (predicted) values (3.0??? [34??N latitude] to 9.7??? [75??N] lighter). Furthermore, the sphaerosiderite meteoric ??18O latitudinal gradient is significantly steeper and more depleted (5.8??? [34??N] to 13.8??? [75??N] lighter) than a predicted gradient for the warm mid-Cretaceous using modern empirical temperature-??18O precipitation relationships. We have suggested that the steeper and more depleted (relative to the modern theoretical gradient) meteoric sphaerosiderite ??18O latitudinal gradient resulted from increased air mass rainout effects in coastal areas of the KWIB during the mid-Cretaceous. The sphaerosiderite isotopic data have been used to constrain a mass balance model of the hydrologic cycle in the northern hemisphere and to quantify precipitation rates of the equable 'greenhouse' Albian Stage in the KWIB. The mass balance model tracks the evolving isotopic composition of an air mass and its precipitation, and is driven by latitudinal temperature gradients. Our simulations indicate that significant increases in Albian precipitation (34-52%) and evaporation fluxes (76-96%) are required to reproduce the difference between modern and Albian meteoric siderite ??18O latitudinal gradients. Calculations of precipitation rates from model outputs suggest mid-high latitude precipitation rates greatly exceeded modern rates (156-220% greater in mid latitudes [2600-3300 mm/yr], 99% greater at high latitudes [550 mm/yr]). The calculated precipitation rates are significantly different from the precipitation rates predicted by some recent general circulation models (GCMs) for the warm Cretaceous, particularly in the mid to high latitudes. Our mass balance model by no means replaces GCMs. However, it is a simple and effective means of obtaining quantitative data regarding the mid-Cretaceous hydrologic cycle in the KWIB. Our goal is to encourage the incorporation of isotopic tracers into GCM simulations of the mid-Cretaceous, and to show how our empirical data and mass balance model estimates help constrain the boundary conditions. ?? 2002 Elsevier Science B.V. All rights reserved.

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.

METALLICITY GRADIENTS THROUGH DISK INSTABILITY: A SIMPLE MODEL FOR THE MILKY WAY'S BOXY BULGE

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

Martinez-Valpuesta, Inma; Gerhard, Ortwin, E-mail: imv@mpe.mpg.de, E-mail: gerhard@mpe.mpg.de

2013-03-20

Observations show a clear vertical metallicity gradient in the Galactic bulge, which is often taken as a signature of dissipative processes in the formation of a classical bulge. Various evidence shows, however, that the Milky Way is a barred galaxy with a boxy bulge representing the inner three-dimensional part of the bar. Here we show with a secular evolution N-body model that a boxy bulge formed through bar and buckling instabilities can show vertical metallicity gradients similar to the observed gradient if the initial axisymmetric disk had a comparable radial metallicity gradient. In this framework, the range of metallicities inmore » bulge fields constrains the chemical structure of the Galactic disk at early times before bar formation. Our secular evolution model was previously shown to reproduce inner Galaxy star counts and we show here that it also has cylindrical rotation. We use it to predict a full mean metallicity map across the Galactic bulge from a simple metallicity model for the initial disk. This map shows a general outward gradient on the sky as well as longitudinal perspective asymmetries. We also briefly comment on interpreting metallicity gradient observations in external boxy bulges.« less

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.

Toward an Integrated Framwork for Data-Efficient Parametric Adaptive Detection

DTIC Science & Technology

2012-02-27

any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a ...SUBJECT TERMS 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT 18. NUMBER OF PAGES 19a. NAME OF RESPONSIBLE PERSON a . REPORT...2012-0534 Distribution A - Approved for Public Release The conjugate-gradient (CG) algorithm is investigated for reduced-rank STAP detection. A family

Conjugate Gradient Parametric Detection of Multichannel Signals (Preprint)

DTIC Science & Technology

2012-05-01

aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information...if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. 1. REPORT DATE (DD-MM-YY) 2...processing (STAP) detection is re- examined in this paper. Originally, the PAMF detector was introduced by using a multichannel autoregressive (AR

Estimation of the zeta potential and the dielectric constant using velocity measurements in the electroosmotic flows.

PubMed

Park, H M; Hong, S M

2006-12-15

In this paper we develop a method for the determination of the zeta potential zeta and the dielectric constant epsilon by exploiting velocity measurements of the electroosmotic flow in microchannels. The inverse problem is solved through the minimization of a performance function utilizing the conjugate gradient method. The present method is found to estimate zeta and epsilon with reasonable accuracy even with noisy velocity measurements.

Benchmarking and tuning the MILC code on clusters and supercomputers

NASA Astrophysics Data System (ADS)

Gottlieb, Steven

2002-03-01

Recently, we have benchmarked and tuned the MILC code on a number of architectures including Intel Itanium and Pentium IV (PIV), dual-CPU Athlon, and the latest Compaq Alpha nodes. Results will be presented for many of these, and we shall discuss some simple code changes that can result in a very dramatic speedup of the KS conjugate gradient on processors with more advanced memory systems such as PIV, IBM SP and Alpha.

Benchmarking and tuning the MILC code on clusters and supercomputers

NASA Astrophysics Data System (ADS)

Gottlieb, Steven

Recently, we have benchmarked and tuned the MILC code on a number of architectures including Intel Itanium and Pentium IV (PIV), dual-CPU Athlon, and the latest Compaq Alpha nodes. Results will be presented for many of these, and we shall discuss some simple code changes that can result in a very dramatic speedup of the KS conjugate gradient on processors with more advanced memory systems such as PIV, IBM SP and Alpha.

2-D weighted least-squares phase unwrapping

DOEpatents

Ghiglia, Dennis C.; Romero, Louis A.

1995-01-01

Weighted values of interferometric signals are unwrapped by determining the least squares solution of phase unwrapping for unweighted values of the interferometric signals; and then determining the least squares solution of phase unwrapping for weighted values of the interferometric signals by preconditioned conjugate gradient methods using the unweighted solutions as preconditioning values. An output is provided that is representative of the least squares solution of phase unwrapping for weighted values of the interferometric signals.

2-D weighted least-squares phase unwrapping

DOEpatents

Ghiglia, D.C.; Romero, L.A.

1995-06-13

Weighted values of interferometric signals are unwrapped by determining the least squares solution of phase unwrapping for unweighted values of the interferometric signals; and then determining the least squares solution of phase unwrapping for weighted values of the interferometric signals by preconditioned conjugate gradient methods using the unweighted solutions as preconditioning values. An output is provided that is representative of the least squares solution of phase unwrapping for weighted values of the interferometric signals. 6 figs.

Fast alternating projection methods for constrained tomographic reconstruction

PubMed Central

Liu, Li; Han, Yongxin

2017-01-01

The alternating projection algorithms are easy to implement and effective for large-scale complex optimization problems, such as constrained reconstruction of X-ray computed tomography (CT). A typical method is to use projection onto convex sets (POCS) for data fidelity, nonnegative constraints combined with total variation (TV) minimization (so called TV-POCS) for sparse-view CT reconstruction. However, this type of method relies on empirically selected parameters for satisfactory reconstruction and is generally slow and lack of convergence analysis. In this work, we use a convex feasibility set approach to address the problems associated with TV-POCS and propose a framework using full sequential alternating projections or POCS (FS-POCS) to find the solution in the intersection of convex constraints of bounded TV function, bounded data fidelity error and non-negativity. The rationale behind FS-POCS is that the mathematically optimal solution of the constrained objective function may not be the physically optimal solution. The breakdown of constrained reconstruction into an intersection of several feasible sets can lead to faster convergence and better quantification of reconstruction parameters in a physical meaningful way than that in an empirical way of trial-and-error. In addition, for large-scale optimization problems, first order methods are usually used. Not only is the condition for convergence of gradient-based methods derived, but also a primal-dual hybrid gradient (PDHG) method is used for fast convergence of bounded TV. The newly proposed FS-POCS is evaluated and compared with TV-POCS and another convex feasibility projection method (CPTV) using both digital phantom and pseudo-real CT data to show its superior performance on reconstruction speed, image quality and quantification. PMID:28253298

Constrained Burn Optimization for the International Space Station

NASA Technical Reports Server (NTRS)

Brown, Aaron J.; Jones, Brandon A.

2017-01-01

In long-term trajectory planning for the International Space Station (ISS), translational burns are currently targeted sequentially to meet the immediate trajectory constraints, rather than simultaneously to meet all constraints, do not employ gradient-based search techniques, and are not optimized for a minimum total deltav (v) solution. An analytic formulation of the constraint gradients is developed and used in an optimization solver to overcome these obstacles. Two trajectory examples are explored, highlighting the advantage of the proposed method over the current approach, as well as the potential v and propellant savings in the event of propellant shortages.

Natural convection in binary gases driven by combined horizontal thermal and vertical solutal gradients

NASA Technical Reports Server (NTRS)

Weaver, J. A.; Viskanta, Raymond

1992-01-01

An investigation of natural convection is presented to examine the influence of a horizontal temperature gradient and a concentration gradient occurring from the bottom to the cold wall in a cavity. As the solutal buoyancy force changes from augmenting to opposing the thermal buoyancy force, the fluid motion switches from unicellular to multicellular flow (fluid motion is up the cold wall and down the hot wall for the bottom counterrotating flow cell). Qualitatively, the agreement between predicted streamlines and smoke flow patterns is generally good. In contrast, agreement between measured and predicted temperature and concentration distributions ranges from fair to poor. Part of the discrepancy can be attributed to experimental error. However, there remains considerable discrepancy between data and predictions due to the idealizations of the mathematical model, which examines only first-order physical effects. An unsteady flow, variable thermophysical properties, conjugate effects, species interdiffusion, and radiation were not accounted for in the model.

Eruption Constraints for a Young Channelized Lava Flow, Marte Vallis, Mars

NASA Technical Reports Server (NTRS)

Therkelsen, J. P.; Santiago, S. S.; Grosfils, E. B.; Sakimoto, S. E. H.; Mendelson, C. V.; Bleacher, J. E.

2001-01-01

This study constrains flow rates for a specific channelized lava flow in Marte Vallis, Mars. We measured slope-gradient, channel width, and channel depth. Our results are similar to other recent studies which suggests similarities to long, terrestrial basaltic flow. Additional information is contained in the original extended abstract.

Seed availability constrains plant species sorting along a soil fertility gradient

Treesearch

Bryan L. Foster; Erin J. Questad; Cathy D. Collins; Cheryl A. Murphy; Timothy L. Dickson; Val H. Smith

2011-01-01

1. Spatial variation in species composition within and among communities may be caused by deterministic, niche-based species sorting in response to underlying environmental heterogeneity as well as by stochastic factors such as dispersal limitation and variable species pools. An important goal in ecology is to reconcile deterministic and stochastic perspectives of...

Why convective heat transport in the solar nebula was inefficient

NASA Technical Reports Server (NTRS)

Cassen, P.

1993-01-01

The radial distributions of the effective temperatures of circumstellar disks associated with pre-main sequence (T Tauri) stars are relatively well-constrained by ground-based and spacecraft infrared photometry and radio continuum observations. If the mechanisms by which energy is transported vertically in the disks are understood, these data can be used to constrain models of the thermal structure and evolution of solar nebula. Several studies of the evolution of the solar nebula have included the calculation of the vertical transport of heat by convection. Such calculations rely on a mixing length theory of transport and some assumption regarding the vertical distribution of internal dissipation. In all cases, the results of these calculations indicate that transport by radiation dominates that by convection, even when the nebula is convectively unstable. A simple argument that demonstrates the generality (and limits) of this result, regardless of the details of mixing length theory or the precise distribution of internal heating is presented. It is based on the idea that the radiative gradient in an optically thick nebula generally does not greatly exceed the adiabatic gradient.

Digital robust control law synthesis using constrained optimization

NASA Technical Reports Server (NTRS)

Mukhopadhyay, Vivekananda

1989-01-01

Development of digital robust control laws for active control of high performance flexible aircraft and large space structures is a research area of significant practical importance. The flexible system is typically modeled by a large order state space system of equations in order to accurately represent the dynamics. The active control law must satisy multiple conflicting design requirements and maintain certain stability margins, yet should be simple enough to be implementable on an onboard digital computer. Described here is an application of a generic digital control law synthesis procedure for such a system, using optimal control theory and constrained optimization technique. A linear quadratic Gaussian type cost function is minimized by updating the free parameters of the digital control law, while trying to satisfy a set of constraints on the design loads, responses and stability margins. Analytical expressions for the gradients of the cost function and the constraints with respect to the control law design variables are used to facilitate rapid numerical convergence. These gradients can be used for sensitivity study and may be integrated into a simultaneous structure and control optimization scheme.

Conjugate observations of electromagnetic ion cyclotron waves associated with traveling convection vortex events

NASA Astrophysics Data System (ADS)

Kim, Hyomin; Clauer, C. Robert; Gerrard, Andrew J.; Engebretson, Mark J.; Hartinger, Michael D.; Lessard, Marc R.; Matzka, Jürgen; Sibeck, David G.; Singer, Howard J.; Stolle, Claudia; Weimer, Daniel R.; Xu, Zhonghua

2017-07-01

We report on simultaneous observations of electromagnetic ion cyclotron (EMIC) waves associated with traveling convection vortex (TCV) events caused by transient solar wind dynamic pressure (Pd) impulse events. The Time History of Events and Macroscale Interactions during Substorms (THEMIS) spacecraft located near the magnetopause observed radial fluctuations of the magnetopause, and the GOES spacecraft measured sudden compressions of the magnetosphere in response to sudden increases in Pd. During the transient events, EMIC waves were observed by interhemispheric conjugate ground-based magnetometer arrays as well as the GOES spacecraft. The spectral structures of the waves appear to be well correlated with the fluctuating motion of the magnetopause, showing compression-associated wave generation. In addition, the wave features are remarkably similar in conjugate hemispheres in terms of bandwidth, quasiperiodic wave power modulation, and polarization. Proton precipitation was also observed by the DMSP spacecraft during the wave events, from which the wave source region is estimated to be 72°-74° in magnetic latitude, consistent with the TCV center. The confluence of space-borne and ground instruments including the interhemispheric, high-latitude, fluxgate/induction coil magnetometer array allows us to constrain the EMIC source region while also confirming the relationship between EMIC waves and the TCV current system.

Inhibition of HIV Replication by Cyclic and Hairpin PNAs Targeting the HIV-1 TAR RNA Loop

PubMed Central

Upert, Gregory; Di Giorgio, Audrey; Upadhyay, Alok; Manvar, Dinesh; Pandey, Nootan; Pandey, Virendra N.; Patino, Nadia

2012-01-01

Human immunodeficiency virus-1 (HIV-1) replication and gene expression entails specific interaction of the viral protein Tat with its transactivation responsive element (TAR), to form a highly stable stem-bulge-loop structure. Previously, we described triphenylphosphonium (TPP) cation-based vectors that efficiently deliver nucleotide analogs (PNAs) into the cytoplasm of cells. In particular, we showed that the TPP conjugate of a linear 16-mer PNA targeting the apical stem-loop region of TAR impedes Tat-mediated transactivation of the HIV-1 LTR in vitro and also in cell culture systems. In this communication, we conjugated TPP to cyclic and hairpin PNAs targeting the loop region of HIV-1 TAR and evaluated their antiviral efficacy in a cell culture system. We found that TPP-cyclic PNAs containing only 8 residues, showed higher antiviral potency compared to hairpin PNAs of 12 or 16 residues. We further noted that the TPP-conjugates of the 8-mer cyclic PNA as well as the 16-mer linear PNA displayed similar antiviral efficacy. However, cyclic PNAs were shown to be highly specific to their target sequences. This communication emphasizes on the importance of small constrained cyclic PNAs over both linear and hairpin structures for targeting biologically relevant RNA hairpins. PMID:23029603

Four dimensional variational inversion of atmospheric chemical sources in WRFDA

NASA Astrophysics Data System (ADS)

Guerrette, J. J.

Atmospheric aerosols are known to affect health, weather, and climate, but their impacts on regional scales are uncertain due to heterogeneous source, transport, and transformation mechanisms. The Weather Research and Forecasting model with chemistry (WRF-Chem) can account for aerosol-meteorology feedbacks as it simultaneously integrates equations of dynamical and chemical processes. Here we develop and apply incremental four dimensional variational (4D-Var) data assimilation (DA) capabilities in WRF-Chem to constrain chemical emissions (WRFDA-Chem). We develop adjoint (ADM) and tangent linear (TLM) model descriptions of boundary layer mixing, emission, aging, dry deposition, and advection of black carbon (BC) aerosol. ADM and TLM model performance is verified against finite difference derivative approximations. A second order checkpointing scheme is used to reduce memory costs and enable simulations longer than six hours. We apply WRFDA-Chem to constraining anthropogenic and biomass burning sources of BC throughout California during the 2008 Arctic Research of the Composition of the Troposphere from Aircraft and Satellites (ARCTAS) field campaign. Manual corrections to the prior emissions and subsequent inverse modeling reduce the spread in total emitted BC mass between two biomass burning inventories from a factor of x10 to only x2 across three days of measurements. We quantify posterior emission variance using an eigendecomposition of the cost function Hessian matrix. We also address the limited scalability of 4D-Var, which traditionally uses a sequential optimization algorithm (e.g., conjugate gradient) to approximate these Hessian eigenmodes. The Randomized Incremental Optimal Technique (RIOT) uses an ensemble of TLM and ADM instances to perform a Hessian singular value decomposition. While RIOT requires more ensemble members than Lanczos requires iterations to converge to a comparable posterior control vector, the wall-time of RIOT is x10 shorter since the ensemble is executed in parallel. This work demonstrates that RIOT improves the scalability of 4D-Var for high-dimensional nonlinear problems. Overall, WRFDA-Chem and RIOT provide a framework for air quality forecasting, campaign planning, and emissions constraint that can be used to refine our understanding of the interplay between atmospheric chemistry, meteorology, climate, and human health.

Iterative algorithms for large sparse linear systems on parallel computers

NASA Technical Reports Server (NTRS)

Adams, L. M.

1982-01-01

Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

Research in computer science

NASA Technical Reports Server (NTRS)

Ortega, J. M.

1985-01-01

Synopses are given for NASA supported work in computer science at the University of Virginia. Some areas of research include: error seeding as a testing method; knowledge representation for engineering design; analysis of faults in a multi-version software experiment; implementation of a parallel programming environment; two computer graphics systems for visualization of pressure distribution and convective density particles; task decomposition for multiple robot arms; vectorized incomplete conjugate gradient; and iterative methods for solving linear equations on the Flex/32.

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

User intent prediction with a scaled conjugate gradient trained artificial neural network for lower limb amputees using a powered prosthesis.

PubMed

Woodward, Richard B; Spanias, John A; Hargrove, Levi J

2016-08-01

Powered lower limb prostheses have the ability to provide greater mobility for amputee patients. Such prostheses often have pre-programmed modes which can allow activities such as climbing stairs and descending ramps, something which many amputees struggle with when using non-powered limbs. Previous literature has shown how pattern classification can allow seamless transitions between modes with a high accuracy and without any user interaction. Although accurate, training and testing each subject with their own dependent data is time consuming. By using subject independent datasets, whereby a unique subject is tested against a pooled dataset of other subjects, we believe subject training time can be reduced while still achieving an accurate classification. We present here an intent recognition system using an artificial neural network (ANN) with a scaled conjugate gradient learning algorithm to classify gait intention with user-dependent and independent datasets for six unilateral lower limb amputees. We compare these results against a linear discriminant analysis (LDA) classifier. The ANN was found to have significantly lower classification error (P<;0.05) than LDA with all user-dependent step-types, as well as transitional steps for user-independent datasets. Both types of classifiers are capable of making fast decisions; 1.29 and 2.83 ms for the LDA and ANN respectively. These results suggest that ANNs can provide suitable and accurate offline classification in prosthesis gait prediction.

Practical method development for the separation of monoclonal antibodies and antibody-drug-conjugate species in hydrophobic interaction chromatography, part 1: optimization of the mobile phase.

PubMed

Rodriguez-Aller, Marta; Guillarme, Davy; Beck, Alain; Fekete, Szabolcs

2016-01-25

The goal of this work is to provide some recommendations for method development in HIC using monoclonal antibodies (mAbs) and antibody-drug conjugates (ADCs) as model drug candidates. The effects of gradient steepness, mobile phase pH, salt concentration and type, as well as organic modifier were evaluated for tuning selectivity and retention in HIC. Except the nature of the stationary phase, which was not discussed in this study, the most important parameter for modifying selectivity was the gradient steepness. The addition of organic solvent (up to 15% isopropanol) in the mobile phase was also found to be useful for mAbs analysis, since it could provide some changes in elution order, in some cases. On the contrary, isopropanol was not beneficial with ADCs, since the most hydrophobic DAR species (DAR6 and DAR8) cannot be eluted from the stationary phase under these conditions. This study also illustrates the possibility to perform HIC method development using optimization software, such as Drylab. The optimum conditions suggested by the software were tested using therapeutic mAbs and commercial cysteine linked ADC (brentuximab-vedotin) and the average retention time errors between predicted and experimental retention times were ∼ 1%. Copyright © 2015 Elsevier B.V. All rights reserved.

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.

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.

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.

Pixel-based OPC optimization based on conjugate gradients.

PubMed

Ma, Xu; Arce, Gonzalo R

2011-01-31

Optical proximity correction (OPC) methods are resolution enhancement techniques (RET) used extensively in the semiconductor industry to improve the resolution and pattern fidelity of optical lithography. In pixel-based OPC (PBOPC), the mask is divided into small pixels, each of which is modified during the optimization process. Two critical issues in PBOPC are the required computational complexity of the optimization process, and the manufacturability of the optimized mask. Most current OPC optimization methods apply the steepest descent (SD) algorithm to improve image fidelity augmented by regularization penalties to reduce the complexity of the mask. Although simple to implement, the SD algorithm converges slowly. The existing regularization penalties, however, fall short in meeting the mask rule check (MRC) requirements often used in semiconductor manufacturing. This paper focuses on developing OPC optimization algorithms based on the conjugate gradient (CG) method which exhibits much faster convergence than the SD algorithm. The imaging formation process is represented by the Fourier series expansion model which approximates the partially coherent system as a sum of coherent systems. In order to obtain more desirable manufacturability properties of the mask pattern, a MRC penalty is proposed to enlarge the linear size of the sub-resolution assistant features (SRAFs), as well as the distances between the SRAFs and the main body of the mask. Finally, a projection method is developed to further reduce the complexity of the optimized mask pattern.

Ordering effects of conjugate thermal fields in simulations of molecular liquids: Carbon dioxide and water

NASA Astrophysics Data System (ADS)

Dittmar, Harro R.; Kusalik, Peter G.

2016-10-01

As shown previously, it is possible to apply configurational and kinetic thermostats simultaneously in order to induce a steady thermal flux in molecular dynamics simulations of many-particle systems. This flux appears to promote motion along potential gradients and can be utilized to enhance the sampling of ordered arrangements, i.e., it can facilitate the formation of a critical nucleus. Here we demonstrate that the same approach can be applied to molecular systems, and report a significant enhancement of the homogeneous crystal nucleation of a carbon dioxide (EPM2 model) system. Quantitative ordering effects and reduction of the particle mobilities were observed in water (TIP4P-2005 model) and carbon dioxide systems. The enhancement of the crystal nucleation of carbon dioxide was achieved with relatively small conjugate thermal fields. The effect is many orders of magnitude bigger at milder supercooling, where the forward flux sampling method was employed, than at a lower temperature that enabled brute force simulations of nucleation events. The behaviour exhibited implies that the effective free energy barrier of nucleation must have been reduced by the conjugate thermal field in line with our interpretation of previous results for atomic systems.

Disentangling climatic versus biotic drivers of tree range constraints: Broad scale tradeoffs between climate and competion rarely explain local range boundaries

NASA Astrophysics Data System (ADS)

Anderegg, L. D. L.; Hillerislambers, J.

2016-12-01

Accurate prediction of climatically-driven range shifts requires knowledge of the dominant forces constraining species ranges, because climatically controlled range boundaries will likely behave differently from biotically controlled range boundaries in a changing climate. Yet the roles of climatic constraints (due to species physiological tolerance) versus biotic constraints (caused by species interactions) on geographic ranges are largely unknown, infusing large uncertainty into projections of future range shifts. Plant species ranges across strong climatic gradients such as elevation gradients are often assumed to represent a tradeoff between climatic constraints on the harsh side of the range and biotic constraints (often competitive constraints) on the climatically benign side. To test this assumption, we collected tree cores from across the elevational range of the three dominant tree species inhabiting each of three climatically disparate mountain slopes and assessed climatic versus competitive constraints on growth at each species' range margins. Across all species and mountains, we found evidence for a tradeoff between climatic and competitve growth constraints. We also found that some individual species did show an apparent trade-off between a climatic constraint at one range margin and a competitive constraint at the other. However, even these simple elevation gradients resulted in complex interactions between temperature, moisture, and competitive constraints such that a climate-competition tradeoff did not explain range constraints for many species. Our results suggest that tree species can be constrained by a simple trade-off between climate and competition, but that the intricacies of real world climate gradients complicate the application of this theory even in apparently harsh environments, such as near high elevation tree line.

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 frequency dependent preconditioned wavelet method for atmospheric tomography

NASA Astrophysics Data System (ADS)

Yudytskiy, Mykhaylo; Helin, Tapio; Ramlau, Ronny

2013-12-01

Atmospheric tomography, i.e. the reconstruction of the turbulence in the atmosphere, is a main task for the adaptive optics systems of the next generation telescopes. For extremely large telescopes, such as the European Extremely Large Telescope, this problem becomes overly complex and an efficient algorithm is needed to reduce numerical costs. Recently, a conjugate gradient method based on wavelet parametrization of turbulence layers was introduced [5]. An iterative algorithm can only be numerically efficient when the number of iterations required for a sufficient reconstruction is low. A way to achieve this is to design an efficient preconditioner. In this paper we propose a new frequency-dependent preconditioner for the wavelet method. In the context of a multi conjugate adaptive optics (MCAO) system simulated on the official end-to-end simulation tool OCTOPUS of the European Southern Observatory we demonstrate robustness and speed of the preconditioned algorithm. We show that three iterations are sufficient for a good reconstruction.

Rift migration explains continental margin asymmetry and crustal hyper-extension

PubMed Central

Brune, Sascha; Heine, Christian; Pérez-Gussinyé, Marta; Sobolev, Stephan V.

2014-01-01

When continents break apart, continental crust and lithosphere are thinned until break-up is achieved and an oceanic basin is formed. The most remarkable and least understood structures associated with this process are up to 200 km wide areas of hyper-extended continental crust, which are partitioned between conjugate margins with pronounced asymmetry. Here we show, using high-resolution thermo-mechanical modelling, that hyper-extended crust and margin asymmetry are produced by steady state rift migration. We demonstrate that rift migration is accomplished by sequential, oceanward-younging, upper crustal faults, and is balanced through lower crustal flow. Constraining our model with a new South Atlantic plate reconstruction, we demonstrate that larger extension velocities may account for southward increasing width and asymmetry of these conjugate magma-poor margins. Our model challenges conventional ideas of rifted margin evolution, as it implies that during rift migration large amounts of material are transferred from one side of the rift zone to the other. PMID:24905463

Development and application of a UPLC-MS/MS method for the pharmacokinetic study of 10-hydroxy camptothecin and hydroxyethyl starch conjugate in rats.

PubMed

Li, Guofei; Cai, Cuifang; Ren, Tianyang; Tang, Xing

2014-01-01

With the purpose to carry out the pharmacokinetic studies of 10-hydroxy camptothecin (10-HCPT) and hydroxyethyl starch (10-HCPT-HES) conjugate, an ultraperformance liquid chromatography tandem mass spectrometry (UPLC-MS/MS) method has been developed and validated. The analytes, 10-HCPT and the internal standard, Diphenhydramine hydrochloride were extracted with ethyl acetate-isopropanol (95:5, v/v) and separated on an ACQUITY UPLC™ BEH C18 column using a mobile phase composed of acetonitrile and water (containing 0.1% formic acid) with a linear gradient program. With positive ion electrospray ionization (ESI), the analytes were monitored on a triple quadrupole mass spectrometer in the multiple reaction monitoring (MRM) mode. Linear calibration curves were obtained over the concentration ranges of 0.5-2500ng/mL. The intra- and inter-day precisions were less than 9.8% and 10.8%, respectively. The accuracy was within 12.1%. The mean recoveries of 10-HCPT at three concentrations of 2.5, 100, 2000ng/mL were higher than 87.2%. Commercial 10-HCPT injection and 10-HCPT-HES conjugate were administered intravenously at an equal dose of 10-HCPT at 0.5mg/kg. The biological half-life of conjugate was increased significantly from 10min to 3.15h and the bioavailability was 40 times higher than 10-HCPT injection. Consequently, the proposed UPLC-ESI-MS/MS method was proved to be sensitive, specific and reliable to analyze 10-HCPT in biological samples; 10-HCPT and HES conjugate is a promising strategy for delivery of 10-HCPT with prolonged half time and improved bioavailability. Copyright © 2013 Elsevier B.V. All rights reserved.

Grafting PNIPAAm from β-barrel shaped transmembrane nanopores.

PubMed

Charan, Himanshu; Kinzel, Julia; Glebe, Ulrich; Anand, Deepak; Garakani, Tayebeh Mirzaei; Zhu, Leilei; Bocola, Marco; Schwaneberg, Ulrich; Böker, Alexander

2016-11-01

The research on protein-polymer conjugates by grafting from the surface of proteins has gained significant interest in the last decade. While there are many studies with globular proteins, membrane proteins have remained untouched to the best of our knowledge. In this study, we established the conjugate formation with a class of transmembrane proteins and grow polymer chains from the ferric hydroxamate uptake protein component A (FhuA; a β-barrel transmembrane protein of Escherichia coli). As the lysine residues of naturally occurring FhuA are distributed over the whole protein, FhuA was reengineered to have up to 11 lysines, distributed symmetrically in a rim on the membrane exposed side (outside) of the protein channel and exclusively above the hydrophobic region. Reengineering of FhuA ensures a polymer growth only on the outside of the β-barrel and prevents blockage of the channel as a result of the polymerization. A water-soluble initiator for controlled radical polymerization (CRP) was consecutively linked to the lysine residues of FhuA and N-isopropylacrylamide (NIPAAm) polymerized under copper-mediated CRP conditions. The conjugate formation was analyzed by using MALDI-ToF mass spectrometry, SDS-PAGE, circular dichroism spectroscopy, analytical ultracentrifugation, dynamic light scattering, transmission electron microscopy and size exclusion chromatography. Such conjugates combine the specific functions of the transmembrane proteins, like maintaining membrane potential gradients or translocation of substrates with the unique properties of synthetic polymers such as temperature and pH stimuli handles. FhuA-PNIPAAm conjugates will serve as functional nanosized building blocks for applications in targeted drug delivery, self-assembly systems, functional membranes and transmembrane protein gated nanoreactors. Copyright © 2016 Elsevier Ltd. All rights reserved.

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).

GOCE gravity gradient data for lithospheric modeling and geophysical exploration research

NASA Astrophysics Data System (ADS)

Bouman, Johannes; Ebbing, Jörg; Meekes, Sjef; Lieb, Verena; Fuchs, Martin; Schmidt, Michael; Fattah, Rader Abdul; Gradmann, Sofie; Haagmans, Roger

2013-04-01

GOCE gravity gradient data can improve modeling of the Earth's lithosphere and upper mantle, contributing to a better understanding of the Earth's dynamic processes. We present a method to compute user-friendly GOCE gravity gradient grids at mean satellite altitude, which are easier to use than the original GOCE gradients that are given in a rotating instrument frame. In addition, the GOCE gradients are combined with terrestrial gravity data to obtain high resolution grids of gravity field information close to the Earth's surface. We also present a case study for the North-East Atlantic margin, where we analyze the use of satellite gravity gradients by comparison with a well-constrained 3D density model that provides a detailed picture from the upper mantle to the top basement (base of sediments). We demonstrate how gravity gradients can increase confidence in the modeled structures by calculating the sensitvity of model geometry and applied densities at different observation heights; e.g. satellite height and near surface. Finally, this sensitivity analysis is used as input to study the Rub' al Khali desert in Saudi Arabia. In terms of modeling and data availability this is a frontier area. Here gravity gradient data help especially to set up the regional crustal structure, which in turn allows to refine sedimentary thickness estimates and the regional heat-flow pattern. This can have implications for hydrocarbon exploration in the region.

Leveraging 35 years of Pinus taeda research in the southeastern US to constrain forest carbon cycle predictions: regional data assimilation using ecosystem experiments

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

Thomas, R. Quinn; Brooks, Evan B.; Jersild, Annika L.

Predicting how forest carbon cycling will change in response to climate change and management depends on the collective knowledge from measurements across environmental gradients, ecosystem manipulations of global change factors, and mathematical models. Formally integrating these sources of knowledge through data assimilation, or model–data fusion, allows the use of past observations to constrain model parameters and estimate prediction uncertainty. Data assimilation (DA) focused on the regional scale has the opportunity to integrate data from both environmental gradients and experimental studies to constrain model parameters. Here, we introduce a hierarchical Bayesian DA approach (Data Assimilation to Predict Productivity for Ecosystems and Regions,more » DAPPER) that uses observations of carbon stocks, carbon fluxes, water fluxes, and vegetation dynamics from loblolly pine plantation ecosystems across the southeastern US to constrain parameters in a modified version of the Physiological Principles Predicting Growth (3-PG) forest growth model. The observations included major experiments that manipulated atmospheric carbon dioxide (CO 2) concentration, water, and nutrients, along with nonexperimental surveys that spanned environmental gradients across an 8.6 × 10 5 km 2 region. We optimized regionally representative posterior distributions for model parameters, which dependably predicted data from plots withheld from the data assimilation. While the mean bias in predictions of nutrient fertilization experiments, irrigation experiments, and CO 2 enrichment experiments was low, future work needs to focus modifications to model structures that decrease the bias in predictions of drought experiments. Predictions of how growth responded to elevated CO 2 strongly depended on whether ecosystem experiments were assimilated and whether the assimilated field plots in the CO 2 study were allowed to have different mortality parameters than the other field plots in the region. We present predictions of stem biomass productivity under elevated CO 2, decreased precipitation, and increased nutrient availability that include estimates of uncertainty for the southeastern US. Overall, we (1) demonstrated how three decades of research in southeastern US planted pine forests can be used to develop DA techniques that use multiple locations, multiple data streams, and multiple ecosystem experiment types to optimize parameters and (2) developed a tool for the development of future predictions of forest productivity for natural resource managers that leverage a rich dataset of integrated ecosystem observations across a region.« less

Leveraging 35 years of Pinus taeda research in the southeastern US to constrain forest carbon cycle predictions: regional data assimilation using ecosystem experiments

DOE PAGES

Thomas, R. Quinn; Brooks, Evan B.; Jersild, Annika L.; ...

2017-07-26

Predicting how forest carbon cycling will change in response to climate change and management depends on the collective knowledge from measurements across environmental gradients, ecosystem manipulations of global change factors, and mathematical models. Formally integrating these sources of knowledge through data assimilation, or model–data fusion, allows the use of past observations to constrain model parameters and estimate prediction uncertainty. Data assimilation (DA) focused on the regional scale has the opportunity to integrate data from both environmental gradients and experimental studies to constrain model parameters. Here, we introduce a hierarchical Bayesian DA approach (Data Assimilation to Predict Productivity for Ecosystems and Regions,more » DAPPER) that uses observations of carbon stocks, carbon fluxes, water fluxes, and vegetation dynamics from loblolly pine plantation ecosystems across the southeastern US to constrain parameters in a modified version of the Physiological Principles Predicting Growth (3-PG) forest growth model. The observations included major experiments that manipulated atmospheric carbon dioxide (CO 2) concentration, water, and nutrients, along with nonexperimental surveys that spanned environmental gradients across an 8.6 × 10 5 km 2 region. We optimized regionally representative posterior distributions for model parameters, which dependably predicted data from plots withheld from the data assimilation. While the mean bias in predictions of nutrient fertilization experiments, irrigation experiments, and CO 2 enrichment experiments was low, future work needs to focus modifications to model structures that decrease the bias in predictions of drought experiments. Predictions of how growth responded to elevated CO 2 strongly depended on whether ecosystem experiments were assimilated and whether the assimilated field plots in the CO 2 study were allowed to have different mortality parameters than the other field plots in the region. We present predictions of stem biomass productivity under elevated CO 2, decreased precipitation, and increased nutrient availability that include estimates of uncertainty for the southeastern US. Overall, we (1) demonstrated how three decades of research in southeastern US planted pine forests can be used to develop DA techniques that use multiple locations, multiple data streams, and multiple ecosystem experiment types to optimize parameters and (2) developed a tool for the development of future predictions of forest productivity for natural resource managers that leverage a rich dataset of integrated ecosystem observations across a region.« less

Leveraging 35 years of Pinus taeda research in the southeastern US to constrain forest carbon cycle predictions: regional data assimilation using ecosystem experiments

NASA Astrophysics Data System (ADS)

Quinn Thomas, R.; Brooks, Evan B.; Jersild, Annika L.; Ward, Eric J.; Wynne, Randolph H.; Albaugh, Timothy J.; Dinon-Aldridge, Heather; Burkhart, Harold E.; Domec, Jean-Christophe; Fox, Thomas R.; Gonzalez-Benecke, Carlos A.; Martin, Timothy A.; Noormets, Asko; Sampson, David A.; Teskey, Robert O.

2017-07-01

Predicting how forest carbon cycling will change in response to climate change and management depends on the collective knowledge from measurements across environmental gradients, ecosystem manipulations of global change factors, and mathematical models. Formally integrating these sources of knowledge through data assimilation, or model-data fusion, allows the use of past observations to constrain model parameters and estimate prediction uncertainty. Data assimilation (DA) focused on the regional scale has the opportunity to integrate data from both environmental gradients and experimental studies to constrain model parameters. Here, we introduce a hierarchical Bayesian DA approach (Data Assimilation to Predict Productivity for Ecosystems and Regions, DAPPER) that uses observations of carbon stocks, carbon fluxes, water fluxes, and vegetation dynamics from loblolly pine plantation ecosystems across the southeastern US to constrain parameters in a modified version of the Physiological Principles Predicting Growth (3-PG) forest growth model. The observations included major experiments that manipulated atmospheric carbon dioxide (CO2) concentration, water, and nutrients, along with nonexperimental surveys that spanned environmental gradients across an 8.6 × 105 km2 region. We optimized regionally representative posterior distributions for model parameters, which dependably predicted data from plots withheld from the data assimilation. While the mean bias in predictions of nutrient fertilization experiments, irrigation experiments, and CO2 enrichment experiments was low, future work needs to focus modifications to model structures that decrease the bias in predictions of drought experiments. Predictions of how growth responded to elevated CO2 strongly depended on whether ecosystem experiments were assimilated and whether the assimilated field plots in the CO2 study were allowed to have different mortality parameters than the other field plots in the region. We present predictions of stem biomass productivity under elevated CO2, decreased precipitation, and increased nutrient availability that include estimates of uncertainty for the southeastern US. Overall, we (1) demonstrated how three decades of research in southeastern US planted pine forests can be used to develop DA techniques that use multiple locations, multiple data streams, and multiple ecosystem experiment types to optimize parameters and (2) developed a tool for the development of future predictions of forest productivity for natural resource managers that leverage a rich dataset of integrated ecosystem observations across a region.

Infrared and visible image fusion based on total variation and augmented Lagrangian.

PubMed

Guo, Hanqi; Ma, Yong; Mei, Xiaoguang; Ma, Jiayi

2017-11-01

This paper proposes a new algorithm for infrared and visible image fusion based on gradient transfer that achieves fusion by preserving the intensity of the infrared image and then transferring gradients in the corresponding visible one to the result. The gradient transfer suffers from the problems of low dynamic range and detail loss because it ignores the intensity from the visible image. The new algorithm solves these problems by providing additive intensity from the visible image to balance the intensity between the infrared image and the visible one. It formulates the fusion task as an l 1 -l 1 -TV minimization problem and then employs variable splitting and augmented Lagrangian to convert the unconstrained problem to a constrained one that can be solved in the framework of alternating the multiplier direction method. Experiments demonstrate that the new algorithm achieves better fusion results with a high computation efficiency in both qualitative and quantitative tests than gradient transfer and most state-of-the-art methods.

Shining light on modifications of gravity

NASA Astrophysics Data System (ADS)

Brax, Philippe; Burrage, Clare; Davis, Anne-Christine

2012-10-01

Many modifications of gravity introduce new scalar degrees of freedom, and in such theories matter fields typically couple to an effective metric that depends on both the true metric of spacetime and on the scalar field and its derivatives. Scalar field contributions to the effective metric can be classified as conformal and disformal. Disformal terms introduce gradient couplings between scalar fields and the energy momentum tensor of other matter fields, and cannot be constrained by fifth force experiments because the effects of these terms are trivial around static non-relativistic sources. The use of high-precision, low-energy photon experiments to search for conformally coupled scalar fields, called axion-like particles, is well known. In this article we show that these experiments are also constraining for disformal scalar field theories, and are particularly important because of the difficulty of constraining these couplings with other laboratory experiments.

Non-classical continuum theory for fluids incorporating internal and Cosserat rotation rates

NASA Astrophysics Data System (ADS)

Surana, K. S.; Joy, A. D.; Reddy, J. N.

2017-11-01

This paper presents a non-classical continuum theory for fluent continua in which the conservation and balance laws are derived by incorporating both internal rotation rates arising from the velocity gradient tensor and the rotation rates of the Cosserats. Specifically, in this non-classical continuum theory we have (1) the usual velocities (\\bar{ ±b {\\varvec{v }}}), (2) the three internal rotation rates ({}_i^t\\bar{ ±b {\\varvec{Θ }}}) about the axes of a fixed triad whose axes are parallel to the x-frame arising from the velocity gradient tensor (\\bar{ ±b {\\varvec{L }}}) that are completely defined by the antisymmetric part of the velocity gradient tensor, and (3) three additional rotation rates ({}_e^t\\bar{ ±b {\\varvec{Θ }}}) about the axes of the same triad located at each material point as additional three unknown degrees of freedom, referred to as Cosserat rotation rates. This gives rise to \\bar{ ±b {\\varvec{v }}} and {}_e^t\\bar{ ±b {\\varvec{Θ }}} as six degrees of freedom at a material point. The internal rotation rates {}_i^t\\bar{ ±b {\\varvec{Θ }}}, often neglected in classical fluid mechanics, exist in all deforming fluent continua as these are due to velocity gradient tensor. When the internal rotation rates {}_i^t\\bar{ ±b {\\varvec{Θ }}} are resisted by deforming fluent continua, conjugate moment tensor arises that together with {}_i^t\\bar{ ±b {\\varvec{Θ }}} may result in energy storage and/or dissipation, which must be considered in the conservation and balance laws. The Cosserat rotation rations {}_e^t\\bar{ ±b {\\varvec{Θ }}} also result in conjugate moment tensor that together with {}_e^t\\bar{ ±b {\\varvec{Θ }}} may also result in energy storage and/or dissipation. The main focus of this paper is a consistent derivation of conservation and balance laws for fluent continua that incorporate the aforementioned physics and associated constitutive theories for thermofluids using the conditions resulting from the entropy inequality. The material coefficients derived in the constitutive theories are clearly defined and discussed.

New Langevin and gradient thermostats for rigid body dynamics.

PubMed

Davidchack, R L; Ouldridge, T E; Tretyakov, M V

2015-04-14

We introduce two new thermostats, one of Langevin type and one of gradient (Brownian) type, for rigid body dynamics. We formulate rotation using the quaternion representation of angular coordinates; both thermostats preserve the unit length of quaternions. The Langevin thermostat also ensures that the conjugate angular momenta stay within the tangent space of the quaternion coordinates, as required by the Hamiltonian dynamics of rigid bodies. We have constructed three geometric numerical integrators for the Langevin thermostat and one for the gradient thermostat. The numerical integrators reflect key properties of the thermostats themselves. Namely, they all preserve the unit length of quaternions, automatically, without the need of a projection onto the unit sphere. The Langevin integrators also ensure that the angular momenta remain within the tangent space of the quaternion coordinates. The Langevin integrators are quasi-symplectic and of weak order two. The numerical method for the gradient thermostat is of weak order one. Its construction exploits ideas of Lie-group type integrators for differential equations on manifolds. We numerically compare the discretization errors of the Langevin integrators, as well as the efficiency of the gradient integrator compared to the Langevin ones when used in the simulation of rigid TIP4P water model with smoothly truncated electrostatic interactions. We observe that the gradient integrator is computationally less efficient than the Langevin integrators. We also compare the relative accuracy of the Langevin integrators in evaluating various static quantities and give recommendations as to the choice of an appropriate integrator.

Bayesian Inversion of 2D Models from Airborne Transient EM Data

NASA Astrophysics Data System (ADS)

Blatter, D. B.; Key, K.; Ray, A.

2016-12-01

The inherent non-uniqueness in most geophysical inverse problems leads to an infinite number of Earth models that fit observed data to within an adequate tolerance. To resolve this ambiguity, traditional inversion methods based on optimization techniques such as the Gauss-Newton and conjugate gradient methods rely on an additional regularization constraint on the properties that an acceptable model can possess, such as having minimal roughness. While allowing such an inversion scheme to converge on a solution, regularization makes it difficult to estimate the uncertainty associated with the model parameters. This is because regularization biases the inversion process toward certain models that satisfy the regularization constraint and away from others that don't, even when both may suitably fit the data. By contrast, a Bayesian inversion framework aims to produce not a single `most acceptable' model but an estimate of the posterior likelihood of the model parameters, given the observed data. In this work, we develop a 2D Bayesian framework for the inversion of transient electromagnetic (TEM) data. Our method relies on a reversible-jump Markov Chain Monte Carlo (RJ-MCMC) Bayesian inverse method with parallel tempering. Previous gradient-based inversion work in this area used a spatially constrained scheme wherein individual (1D) soundings were inverted together and non-uniqueness was tackled by using lateral and vertical smoothness constraints. By contrast, our work uses a 2D model space of Voronoi cells whose parameterization (including number of cells) is fully data-driven. To make the problem work practically, we approximate the forward solution for each TEM sounding using a local 1D approximation where the model is obtained from the 2D model by retrieving a vertical profile through the Voronoi cells. The implicit parsimony of the Bayesian inversion process leads to the simplest models that adequately explain the data, obviating the need for explicit smoothness constraints. In addition, credible intervals in model space are directly obtained, resolving some of the uncertainty introduced by regularization. An example application shows how the method can be used to quantify the uncertainty in airborne EM soundings for imaging subglacial brine channels and groundwater systems.

Simultaneous elastic parameter inversion in 2-D/3-D TTI medium combined later arrival times

NASA Astrophysics Data System (ADS)

Bai, Chao-ying; Wang, Tao; Yang, Shang-bei; Li, Xing-wang; Huang, Guo-jiao

2016-04-01

Traditional traveltime inversion for anisotropic medium is, in general, based on a "weak" assumption in the anisotropic property, which simplifies both the forward part (ray tracing is performed once only) and the inversion part (a linear inversion solver is possible). But for some real applications, a general (both "weak" and "strong") anisotropic medium should be considered. In such cases, one has to develop a ray tracing algorithm to handle with the general (including "strong") anisotropic medium and also to design a non-linear inversion solver for later tomography. Meanwhile, it is constructive to investigate how much the tomographic resolution can be improved by introducing the later arrivals. For this motivation, we incorporated our newly developed ray tracing algorithm (multistage irregular shortest-path method) for general anisotropic media with a non-linear inversion solver (a damped minimum norm, constrained least squares problem with a conjugate gradient approach) to formulate a non-linear inversion solver for anisotropic medium. This anisotropic traveltime inversion procedure is able to combine the later (reflected) arrival times. Both 2-D/3-D synthetic inversion experiments and comparison tests show that (1) the proposed anisotropic traveltime inversion scheme is able to recover the high contrast anomalies and (2) it is possible to improve the tomographic resolution by introducing the later (reflected) arrivals, but not as expected in the isotropic medium, because the different velocity (qP, qSV and qSH) sensitivities (or derivatives) respective to the different elastic parameters are not the same but are also dependent on the inclination angle.

Terrestrial Ecosystem Science 2017 ECRP Annual Report: Tropical Forest Response to a Drier Future: Turnover Times of Soil Organic Matter, Roots, Respired CO 2, and CH 4 Across Moisture Gradients in Time and Space

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

McFarlane, Karis J.

The overall goal of my Early Career research is to constrain belowground carbon turnover times for tropical forests across a broad range in moisture regimes. My group is using 14C analysis and modeling to address two major objectives: quantify age and belowground carbon turnover times across tropical forests spanning a moisture gradient from wetlands to dry forest; and identify specific areas for focused model improvement and data needs through site-specific model-data comparison and belowground carbon modeling for tropic forests.

Interpolation algorithm for asynchronous ADC-data

NASA Astrophysics Data System (ADS)

Bramburger, Stefan; Zinke, Benny; Killat, Dirk

2017-09-01

This paper presents a modified interpolation algorithm for signals with variable data rate from asynchronous ADCs. The Adaptive weights Conjugate gradient Toeplitz matrix (ACT) algorithm is extended to operate with a continuous data stream. An additional preprocessing of data with constant and linear sections and a weighted overlap of step-by-step into spectral domain transformed signals improve the reconstruction of the asycnhronous ADC signal. The interpolation method can be used if asynchronous ADC data is fed into synchronous digital signal processing.

Identification of the Thermal Conductivity Coefficient for Quasi-Stationary Two-Dimensional Heat Conduction Equations

NASA Astrophysics Data System (ADS)

Matsevityi, Yu. M.; Alekhina, S. V.; Borukhov, V. T.; Zayats, G. M.; Kostikov, A. O.

2017-11-01

The problem of identifying the time-dependent thermal conductivity coefficient in the initial-boundary-value problem for the quasi-stationary two-dimensional heat conduction equation in a bounded cylinder is considered. It is assumed that the temperature field in the cylinder is independent of the angular coordinate. To solve the given problem, which is related to a class of inverse problems, a mathematical approach based on the method of conjugate gradients in a functional form is being developed.

Curved-line search algorithm for ab initio atomic structure relaxation

NASA Astrophysics Data System (ADS)

Chen, Zhanghui; Li, Jingbo; Li, Shushen; Wang, Lin-Wang

2017-09-01

Ab initio atomic relaxations often take large numbers of steps and long times to converge, especially when the initial atomic configurations are far from the local minimum or there are curved and narrow valleys in the multidimensional potentials. An atomic relaxation method based on on-the-flight force learning and a corresponding curved-line search algorithm is presented to accelerate this process. Results demonstrate the superior performance of this method for metal and magnetic clusters when compared with the conventional conjugate-gradient method.

D4Z - a new renumbering for iterative solution of ground-water flow and solute- transport equations

USGS Publications Warehouse

Kipp, K.L.; Russell, T.F.; Otto, J.S.

1992-01-01

D4 zig-zag (D4Z) is a new renumbering scheme for producing a reduced matrix to be solved by an incomplete LU preconditioned, restarted conjugate-gradient iterative solver. By renumbering alternate diagonals in a zig-zag fashion, a very low sensitivity of convergence rate to renumbering direction is obtained. For two demonstration problems involving groundwater flow and solute transport, iteration counts are related to condition numbers and spectra of the reduced matrices.

Mapping the Conjugate Gradient Algorithm onto High Performance Heterogeneous Computers

DTIC Science & Technology

2014-05-01

Matrix Storage Formats According to J . Dongarra (Dongerra 2000), the efficiency of most iterative methods, such as CG, can be attributed to the...valh = aij) ⇒ (colh = j ). The ptr integer vector is of length n + 1 and contains the index in val where each matrix row starts. For example, the...first nonzero element of matrix rowm is found at index ptrm of val. By convention, ptrn+1 ≡ nz + 1. Notice that (aij) ⇒ (ptri ≤ j < ptri+1) for all i. An

Image Understanding Workshop. Proceedings of a Workshop Held in Los Angeles, California on 23-25 February 1987. Volume 2

DTIC Science & Technology

1987-02-25

Modellierung von Kanten bei unregel. Navigation within a building, to be published in IEEE mifliger Rasterung in Bildverarbeitun uand Muster...converted them into equivalent machine cycles in Table 3-1. We took into account of 100 nanosecond 0 - 0, machine cycle time of the MPP. In MPP, NON- VON ...We show the result for the conjugate gradient method in of NON- VON . We assumed that the instructions which carry Table 4-4. The computation of four

Extensional fault geometry and its flexural isostatic response during the formation of the Iberia - Newfoundland conjugate rifted margins

NASA Astrophysics Data System (ADS)

Gómez-Romeu, Júlia; Kusznir, Nick; Manatschal, Gianreto; Roberts, Alan

2017-04-01

Despite magma-poor rifted margins having been extensively studied for the last 20 years, the evolution of extensional fault geometry and the flexural isostatic response to faulting remain still debated topics. We investigate how the flexural isostatic response to faulting controls the structural development of the distal part of rifted margins in the hyper-extended domain and the resulting sedimentary record. In particular we address an important question concerning the geometry and evolution of extensional faults within distal hyper-extended continental crust; are the seismically observed extensional fault blocks in this region allochthons from the upper plate or are they autochthons of the lower plate? In order to achieve our aim we focus on the west Iberian rifted continental margin along the TGS and LG12 seismic profiles. Our strategy is to use a kinematic forward model (RIFTER) to model the tectonic and stratigraphic development of the west Iberia margin along TGS-LG12 and quantitatively test and calibrate the model against breakup paleo-bathymetry, crustal basement thickness and well data. RIFTER incorporates the flexural isostatic response to extensional faulting, crustal thinning, lithosphere thermal loads, sedimentation and erosion. The model predicts the structural and stratigraphic consequences of recursive sequential faulting and sedimentation. The target data used to constrain model predictions consists of two components: (i) gravity anomaly inversion is used to determine Moho depth, crustal basement thickness and continental lithosphere thinning and (ii) reverse post-rift subsidence modelling consisting of flexural backstripping, decompaction and reverse post-rift thermal subsidence modelling is used to give paleo-bathymetry at breakup time. We show that successful modelling of the structural and stratigraphic development of the TGS-LG12 Iberian margin transect also requires the simultaneous modelling of the Newfoundland conjugate margin, which we constrain using target data from the SCREECH 2 seismic profile. We also show that for the successful modelling and quantitative validation of the lithosphere hyper-extension stage it is necessary to first have a good calibrated model of the necking phase. Not surprisingly the evolution of a rifted continental margin cannot be modelled without modelling and calibration of its conjugate margin.

Thermochronometrically constrained anatomy and evolution of a Miocene extensional accommodation zone and tilt domain boundary: The southern Wassuk Range, Nevada

NASA Astrophysics Data System (ADS)

Gorynski, Kyle E.; Stockli, Daniel F.; Douglas Walker, J.

2013-06-01

(AHe) and Zircon (ZHe) (U-Th)/He thermochronometric data from the southern Wassuk Range (WR) coupled with 40Ar/39Ar age data from the overlying tilted Tertiary section are used to constrain the thermal evolution of an extensional accommodation zone and tilt-domain boundary. AHe and ZHe data record two episodes of rapid cooling related to the tectonic exhumation of the WR fault block beginning at ~15 and ~4 Ma. Extension was accommodated through fault-block rotation and variably tilted the southern WR to the west from ~60°-70° in the central WR to ~15°-35° in the southernmost WR and Pine Grove Hills, and minimal tilting in the Anchorite Hills and along the Mina Deflection to the south. Middle Miocene geothermal gradient estimates record heating immediately prior to large-magnitude extension that was likely coeval with the extrusion of the Lincoln Flat andesite at ~14.8 Ma. Geothermal gradients increase from ~19° ± 4°C/km to ≥ 65° ± 20°C/km toward the Mina Deflection, suggesting that it was the focus of Middle Miocene arc magmatism in the upper crust. The decreasing thickness of tilt blocks toward the south resulted from a shallowing brittle/ductile transition zone. Postmagmatic Middle Miocene extension and fault-block advection were focused in the northern and central WR and coincidentally moderated the large lateral thermal gradient within the uppermost crust.

A strongly negative shear velocity gradient and lateral variability in the lowermost mantle beneath the Pacific

NASA Astrophysics Data System (ADS)

Ritsema, Jeroen; Garnero, Edward; Lay, Thorne

1997-01-01

A new approach for constraining the seismic shear velocity structure above the core-mantle boundary is introduced, whereby SH-SKS differential travel times, amplitude ratios of SV/SKS, and Sdiff waveshapes are simultaneously modeled. This procedure is applied to the lower mantle beneath the central Pacific using da.ta from numerous deep-focus southwest Pacific earthquakes recorded in North America. We analyze 90 broadband and 248 digitized analog recordings for this source-receiver geometry. SH-SKS times are highly variable and up to 10 s larger than standard reference model predictions, indicating the presence of laterally varying low shear velocities in the study area. The travel times, however, do not constrain the depth extent or velocity gradient of the low-velocity region. SV/SKS amplitude ratios and SH waveforms are sensitive to the radial shear velocity profile, and when analyzed simultaneously with SH-SKS times, rnveal up to 3% shear velocity reductions restricted to the lowermost 190±50 km of the mantle. Our preferred model for the central-eastern Pacific region (Ml) has a strong negative gradient (with 0.5% reduction in velocity relative to the preliminary reference Earth model (PREM) at 2700 km depth and 3% reduction at 2891 km depth) and slight velocity reductions from 2000 to 2700 km depth (0-0.5% lower than PREM). Significant small-scale (100-500 km) shear velocity heterogeneity (0.5%-1%) is required to explain scatter in the differential times and amplitude ratios.

On the formation of granulites

USGS Publications Warehouse

Bohlen, S.R.

1991-01-01

The tectonic settings for the formation and evolution of regional granulite terranes and the lowermost continental crust can be deduced from pressure-temperature-time (P-T-time) paths and constrained by petrological and geophysical considerations. P-T conditions deduced for regional granulites require transient, average geothermal gradients of greater than 35??C km-1, implying minimum heat flow in excess of 100 mW m-2. Such high heat flow is probably caused by magmatic heating. Tectonic settings wherein such conditions are found include convergent plate margins, continental rifts, hot spots and at the margins of large, deep-seated batholiths. Cooling paths can be constrained by solid-solid and devolatilization equilibria and geophysical modelling. -from Author

Finding intrinsic rewards by embodied evolution and constrained reinforcement learning.

PubMed

Uchibe, Eiji; Doya, Kenji

2008-12-01

Understanding the design principle of reward functions is a substantial challenge both in artificial intelligence and neuroscience. Successful acquisition of a task usually requires not only rewards for goals, but also for intermediate states to promote effective exploration. This paper proposes a method for designing 'intrinsic' rewards of autonomous agents by combining constrained policy gradient reinforcement learning and embodied evolution. To validate the method, we use Cyber Rodent robots, in which collision avoidance, recharging from battery packs, and 'mating' by software reproduction are three major 'extrinsic' rewards. We show in hardware experiments that the robots can find appropriate 'intrinsic' rewards for the vision of battery packs and other robots to promote approach behaviors.

Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks

PubMed Central

Chen, Jianhui; Liu, Ji; Ye, Jieping

2013-01-01

We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is non-convex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose to employ the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is non-differentiable and the feasible domain is non-trivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and an Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in details. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multi-task learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multi-task learning formulation and the efficiency of the proposed projected gradient algorithms. PMID:24077658

Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks.

PubMed

Chen, Jianhui; Liu, Ji; Ye, Jieping

2012-02-01

We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is non-convex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose to employ the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is non-differentiable and the feasible domain is non-trivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and an Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in details. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multi-task learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multi-task learning formulation and the efficiency of the proposed projected gradient algorithms.

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.

Mapping interactions between the RNA chaperone FinO and its RNA targets

PubMed Central

Arthur, David C.; Tsutakawa, Susan; Tainer, John A.; Frost, Laura S.; Glover, J. N. Mark

2011-01-01

Bacterial conjugation is regulated by two-component repression comprising the antisense RNA FinP, and its protein co-factor FinO. FinO mediates base-pairing of FinP to the 5′-untranslated region (UTR) of traJ mRNA, which leads to translational inhibition of the transcriptional activator TraJ and subsequent down regulation of conjugation genes. Yet, little is known about how FinO binds to its RNA targets or how this interaction facilitates FinP and traJ mRNA pairing. Here, we use solution methods to determine how FinO binds specifically to its minimal high affinity target, FinP stem–loop II (SLII), and its complement SLIIc from traJ mRNA. Ribonuclease footprinting reveals that FinO contacts the base of the stem and the 3′ single-stranded tails of these RNAs. The phosphorylation or oxidation of the 3′-nucleotide blocks FinO binding, suggesting FinO binds the 3′-hydroxyl of its RNA targets. The collective results allow the generation of an energy-minimized model of the FinO–SLII complex, consistent with small-angle X-ray scattering data. The repression complex model was constrained using previously reported cross-linking data and newly developed footprinting results. Together, these data lead us to propose a model of how FinO mediates FinP/traJ mRNA pairing to down regulate bacterial conjugation. PMID:21278162

Defining the SUMO System in Maize: SUMOylation Is Up-Regulated during Endosperm Development and Rapidly Induced by Stress1[OPEN

PubMed Central

Augustine, Robert C.; Rytz, Thérèse C.

2016-01-01

In response to abiotic and biotic challenges, plants rapidly attach small ubiquitin-related modifier (SUMO) to a large collection of nuclear proteins, with studies in Arabidopsis (Arabidopsis thaliana) linking SUMOylation to stress tolerance via its modification of factors involved in chromatin and RNA dynamics. Despite this importance, little is known about SUMOylation in crop species. Here, we describe the plant SUMO system at the phylogenetic, biochemical, and transcriptional levels with a focus on maize (Zea mays). In addition to canonical SUMOs, land plants encode a loosely constrained noncanonical isoform and a variant containing a long extension upstream of the signature β-grasp fold, with cereals also expressing a novel diSUMO polypeptide bearing two SUMO β-grasp domains in tandem. Maize and other cereals also synthesize a unique SUMO-conjugating enzyme variant with more restricted expression patterns that is enzymatically active despite a distinct electrostatic surface. Maize SUMOylation primarily impacts nuclear substrates, is strongly induced by high temperatures, and displays a memory that suppresses subsequent conjugation. Both in-depth transcript and conjugate profiles in various maize organs point to tissue/cell-specific functions for SUMOylation, with potentially significant roles during embryo and endosperm maturation. Collectively, these studies define the organization of the maize SUMO system and imply important functions during seed development and stress defense. PMID:27208252

Intra-coil interactions in split gradient coils in a hybrid MRI-LINAC system

NASA Astrophysics Data System (ADS)

Tang, Fangfang; Freschi, Fabio; Sanchez Lopez, Hector; Repetto, Maurizio; Liu, Feng; Crozier, Stuart

2016-04-01

An MRI-LINAC system combines a magnetic resonance imaging (MRI) system with a medical linear accelerator (LINAC) to provide image-guided radiotherapy for targeting tumors in real-time. In an MRI-LINAC system, a set of split gradient coils is employed to produce orthogonal gradient fields for spatial signal encoding. Owing to this unconventional gradient configuration, eddy currents induced by switching gradient coils on and off may be of particular concern. It is expected that strong intra-coil interactions in the set will be present due to the constrained return paths, leading to potential degradation of the gradient field linearity and image distortion. In this study, a series of gradient coils with different track widths have been designed and analyzed to investigate the electromagnetic interactions between coils in a split gradient set. A driving current, with frequencies from 100 Hz to 10 kHz, was applied to study the inductive coupling effects with respect to conductor geometry and operating frequency. It was found that the eddy currents induced in the un-energized coils (hereby-referred to as passive coils) positively correlated with track width and frequency. The magnetic field induced by the eddy currents in the passive coils with wide tracks was several times larger than that induced by eddy currents in the cold shield of cryostat. The power loss in the passive coils increased with the track width. Therefore, intra-coil interactions should be included in the coil design and analysis process.

Ecological gradients within a Pennsylvanian mire forest

USGS Publications Warehouse

DiMichele, W.A.; Falcon-Lang, H. J.; Nelson, W.J.; Elrick, S.D.; Ames, P.R.

2007-01-01

Pennsylvanian coals represent remains of the earliest peat-forming rain forests, but there is no current consensus on forest ecology. Localized studies of fossil forests suggest intermixture of taxa (heterogeneity), while, in contrast, coal ball and palynological analyses imply the existence of pronounced ecological gradients. Here, we report the discovery of a spectacular fossil forest preserved over ???1000 ha on top of the Pennsylvanian (Desmoinesian) Herrin (No. 6) Coal of Illinois, United States. The forest was abruptly drowned when fault movement dropped a segment of coastal mire below sea level. In the largest study of its kind to date, forest composition is statistically analyzed within a well-constrained paleogeographic context. Findings resolve apparent conflicts in models of Pennsylvanian mire ecology by confirming the existence of forest heterogeneity at the local scale, while additionally demonstrating the emergence of ecological gradients at landscape scale. ?? 2007 The Geological Society of America.

The sodium pump in the evolution of animal cells.

PubMed

Stein, W D

1995-09-29

Plant cells and bacterial cells are surrounded by a massive cellulose wall, which constrains their high internal osmotic pressure (tens of atmospheres). Animal cells, in contrast, are in osmotic equilibrium with their environment, have no restraining surround, can take on a variety of shapes and change these from moment to moment. This osmotic balance is achieved by the action of the energy-consuming sodium pump, one of the P-type ATPase transport protein family, members of which are indeed also found in bacteria. The pump's action brings about a transmembranal electrochemical gradient of sodium ions, harnessed in a range of transport systems that couple the dissipation of this gradient to establishing a gradient of the coupled substrate. The primary role of the sodium pump as a regulator of cell volume has evolved to provide the basis for an enormous variety of physiological functions.

Inelastic scattering with Chebyshev polynomials and preconditioned conjugate gradient minimization.

PubMed

Temel, Burcin; Mills, Greg; Metiu, Horia

2008-03-27

We describe and test an implementation, using a basis set of Chebyshev polynomials, of a variational method for solving scattering problems in quantum mechanics. This minimum error method (MEM) determines the wave function Psi by minimizing the least-squares error in the function (H Psi - E Psi), where E is the desired scattering energy. We compare the MEM to an alternative, the Kohn variational principle (KVP), by solving the Secrest-Johnson model of two-dimensional inelastic scattering, which has been studied previously using the KVP and for which other numerical solutions are available. We use a conjugate gradient (CG) method to minimize the error, and by preconditioning the CG search, we are able to greatly reduce the number of iterations necessary; the method is thus faster and more stable than a matrix inversion, as is required in the KVP. Also, we avoid errors due to scattering off of the boundaries, which presents substantial problems for other methods, by matching the wave function in the interaction region to the correct asymptotic states at the specified energy; the use of Chebyshev polynomials allows this boundary condition to be implemented accurately. The use of Chebyshev polynomials allows for a rapid and accurate evaluation of the kinetic energy. This basis set is as efficient as plane waves but does not impose an artificial periodicity on the system. There are problems in surface science and molecular electronics which cannot be solved if periodicity is imposed, and the Chebyshev basis set is a good alternative in such situations.

Fast Quantitative Susceptibility Mapping with L1-Regularization and Automatic Parameter Selection

PubMed Central

Bilgic, Berkin; Fan, Audrey P.; Polimeni, Jonathan R.; Cauley, Stephen F.; Bianciardi, Marta; Adalsteinsson, Elfar; Wald, Lawrence L.; Setsompop, Kawin

2014-01-01

Purpose To enable fast reconstruction of quantitative susceptibility maps with Total Variation penalty and automatic regularization parameter selection. Methods ℓ1-regularized susceptibility mapping is accelerated by variable-splitting, which allows closed-form evaluation of each iteration of the algorithm by soft thresholding and FFTs. This fast algorithm also renders automatic regularization parameter estimation practical. A weighting mask derived from the magnitude signal can be incorporated to allow edge-aware regularization. Results Compared to the nonlinear Conjugate Gradient (CG) solver, the proposed method offers 20× speed-up in reconstruction time. A complete pipeline including Laplacian phase unwrapping, background phase removal with SHARP filtering and ℓ1-regularized dipole inversion at 0.6 mm isotropic resolution is completed in 1.2 minutes using Matlab on a standard workstation compared to 22 minutes using the Conjugate Gradient solver. This fast reconstruction allows estimation of regularization parameters with the L-curve method in 13 minutes, which would have taken 4 hours with the CG algorithm. Proposed method also permits magnitude-weighted regularization, which prevents smoothing across edges identified on the magnitude signal. This more complicated optimization problem is solved 5× faster than the nonlinear CG approach. Utility of the proposed method is also demonstrated in functional BOLD susceptibility mapping, where processing of the massive time-series dataset would otherwise be prohibitive with the CG solver. Conclusion Online reconstruction of regularized susceptibility maps may become feasible with the proposed dipole inversion. PMID:24259479

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.

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.

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)

Multi-GPU Accelerated Admittance Method for High-Resolution Human Exposure Evaluation.

PubMed

Xiong, Zubiao; Feng, Shi; Kautz, Richard; Chandra, Sandeep; Altunyurt, Nevin; Chen, Ji

2015-12-01

A multi-graphics processing unit (GPU) accelerated admittance method solver is presented for solving the induced electric field in high-resolution anatomical models of human body when exposed to external low-frequency magnetic fields. In the solver, the anatomical model is discretized as a three-dimensional network of admittances. The conjugate orthogonal conjugate gradient (COCG) iterative algorithm is employed to take advantage of the symmetric property of the complex-valued linear system of equations. Compared against the widely used biconjugate gradient stabilized method, the COCG algorithm can reduce the solving time by 3.5 times and reduce the storage requirement by about 40%. The iterative algorithm is then accelerated further by using multiple NVIDIA GPUs. The computations and data transfers between GPUs are overlapped in time by using asynchronous concurrent execution design. The communication overhead is well hidden so that the acceleration is nearly linear with the number of GPU cards. Numerical examples show that our GPU implementation running on four NVIDIA Tesla K20c cards can reach 90 times faster than the CPU implementation running on eight CPU cores (two Intel Xeon E5-2603 processors). The implemented solver is able to solve large dimensional problems efficiently. A whole adult body discretized in 1-mm resolution can be solved in just several minutes. The high efficiency achieved makes it practical to investigate human exposure involving a large number of cases with a high resolution that meets the requirements of international dosimetry guidelines.

Separation of antibody drug conjugate species by RPLC: A generic method development approach.

PubMed

Fekete, Szabolcs; Molnár, Imre; Guillarme, Davy

2017-04-15

This study reports the use of modelling software for the successful method development of IgG1 cysteine conjugated antibody drug conjugate (ADC) in RPLC. The goal of such a method is to be able to calculate the average drug to antibody ratio (DAR) of and ADC product. A generic method development strategy was proposed including the optimization of mobile phase temperature, gradient profile and mobile phase ternary composition. For the first time, a 3D retention modelling was presented for large therapeutic protein. Based on a limited number of preliminary experiments, a fast and efficient separation of the DAR species of a commercial ADC sample, namely brentuximab vedotin, was achieved. The prediction offered by the retention model was found to be highly reliable, with an average error of retention time prediction always lower than 0.5% using a 2D or 3D retention models. For routine purpose, four to six initial experiments were required to build the 2D retention models, while 12 experiments were recommended to create the 3D model. At the end, RPLC can therefore be considered as a good method for estimating the average DAR of an ADC, based on the observed peak area ratios of RPLC chromatogram of the reduced ADC sample. Copyright © 2017 Elsevier B.V. All rights reserved.

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.

A constrained-gradient method to control divergence errors in numerical MHD

NASA Astrophysics Data System (ADS)

Hopkins, Philip F.

2016-10-01

In numerical magnetohydrodynamics (MHD), a major challenge is maintaining nabla \\cdot {B}=0. Constrained transport (CT) schemes achieve this but have been restricted to specific methods. For more general (meshless, moving-mesh, ALE) methods, `divergence-cleaning' schemes reduce the nabla \\cdot {B} errors; however they can still be significant and can lead to systematic errors which converge away slowly. We propose a new constrained gradient (CG) scheme which augments these with a projection step, and can be applied to any numerical scheme with a reconstruction. This iteratively approximates the least-squares minimizing, globally divergence-free reconstruction of the fluid. Unlike `locally divergence free' methods, this actually minimizes the numerically unstable nabla \\cdot {B} terms, without affecting the convergence order of the method. We implement this in the mesh-free code GIZMO and compare various test problems. Compared to cleaning schemes, our CG method reduces the maximum nabla \\cdot {B} errors by ˜1-3 orders of magnitude (˜2-5 dex below typical errors if no nabla \\cdot {B} cleaning is used). By preventing large nabla \\cdot {B} at discontinuities, this eliminates systematic errors at jumps. Our CG results are comparable to CT methods; for practical purposes, the nabla \\cdot {B} errors are eliminated. The cost is modest, ˜30 per cent of the hydro algorithm, and the CG correction can be implemented in a range of numerical MHD methods. While for many problems, we find Dedner-type cleaning schemes are sufficient for good results, we identify a range of problems where using only Powell or `8-wave' cleaning can produce order-of-magnitude errors.

Implementation and verification of global optimization benchmark problems

NASA Astrophysics Data System (ADS)

Posypkin, Mikhail; Usov, Alexander

2017-12-01

The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its' gradient at a given point and the interval estimates of a function and its' gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

Tune-stabilized, non-scaling, fixed-field, alternating gradient accelerator

DOEpatents

Johnstone, Carol J [Warrenville, IL

2011-02-01

A FFAG is a particle accelerator having turning magnets with a linear field gradient for confinement and a large edge angle to compensate for acceleration. FODO cells contain focus magnets and defocus magnets that are specified by a number of parameters. A set of seven equations, called the FFAG equations relate the parameters to one another. A set of constraints, call the FFAG constraints, constrain the FFAG equations. Selecting a few parameters, such as injection momentum, extraction momentum, and drift distance reduces the number of unknown parameters to seven. Seven equations with seven unknowns can be solved to yield the values for all the parameters and to thereby fully specify a FFAG.

Viscous relaxation of impact crater relief on Venus - Constraints on crustal thickness and thermal gradient

NASA Technical Reports Server (NTRS)

Grimm, Robert E.; Solomon, Sean C.

1988-01-01

Models for the viscous relaxation of impact crater topography are used to constrain the crustal thickness (H) and the mean lithospheric thermal gradient beneath the craters on Venus. A general formulation for gravity-driven flow in a linearly viscous fluid has been obtained which incorporates the densities and temperature-dependent effective viscosities of distinct crust and mantle layers. An upper limit to the crustal volume of Venus of 10 to the 10th cu km is obtained which implies either that the average rate of crustal generation has been much smaller on Venus than on earth or that some form of crustal recycling has occurred on Venus.

Self-assembly of pi-conjugated peptides in aqueous environments leading to energy-transporting bioelectronic nanostructures

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

Tavor, John

The realization of new supramolecular pi-conjugated organic structures inspired and driven by peptide-based self-assembly will offer a new approach to interface with the biotic environment in a way that will help to meet many DOE-recognized grand challenges. Previously, we developed pi-conjugated peptides that undergo supramolecular self-assembly into one-dimensional (1-D) organic electronic nanomaterials under benign aqueous conditions. The intermolecular interactions among the pi-conjugated organic segments within these nanomaterials lead to defined perturbations of their optoelectronic properties and yield nanoscale conduits that support energy transport within individual nanostructures and throughout bulk macroscopic collections of nanomaterials. Our objectives for future research are tomore » construct and study biomimetic electronic materials for energy-related technology optimized for harsher non-biological environments where peptide-driven self-assembly enhances pi-stacking within nanostructured biomaterials, as detailed in the following specific tasks: (1) synthesis and detailed optoelectronic characterization of new pi-electron units to embed within homogeneous self assembling peptides, (2) molecular and data-driven modeling of the nanomaterial aggregates and their higher-order assemblies, and (3) development of new hierarchical assembly paradigms to organize multiple electronic subunits within the nanomaterials leading to heterogeneous electronic properties (i.e. gradients and localized electric fields). These intertwined research tasks will lead to the continued development and fundamental mechanistic understanding of a powerful bioinspired materials set capable of making connections between nanoscale electronic materials and macroscopic bulk interfaces, be they those of a cell, a protein or a device.« less

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.

The Influence of Wavelength-Dependent Absorption and Temperature Gradients on Temperature Determination in Laser-Heated Diamond-Anvil Cells

NASA Astrophysics Data System (ADS)

Deng, J.; Lee, K. K. M.; Du, Z.; Benedetti, L. R.

2016-12-01

In situ temperature measurements in the laser-heated diamond-anvil cell (LHDAC) are among the most fundamental experiments undertaken in high-pressure science. Despite its importance, few efforts have been made to examine the alteration of thermal radiation spectra of hot samples by wavelength-dependent absorption of the sample itself together with temperature gradients within samples while laser heating and their influence on temperature measurement. For example, iron-bearing minerals show strong wavelength dependent absorption in the wavelength range used to determine temperature, which, together with temperature gradients can account for largely aliased apparent temperatures (e.g., 1200 K deviation for a 4000 K melting temperature) in some experiments obtained by fitting of detected thermal radiation intensities. As such, conclusions of melting temperatures, phase diagrams and partitioning behavior, may be grossly incorrect for these materials. In general, wavelength-dependent absorption and temperature gradients of samples are two key factors to consider in order to rigorously constrain temperatures, which have been largely ignored in previous LHDAC studies. A reevaluation of temperatures measured in recent high-profile papers will be reviewed.

Evolutionary responses of tree phenology to the combined effects of assortative mating, gene flow and divergent selection

PubMed Central

Soularue, J-P; Kremer, A

2014-01-01

The timing of bud burst (TBB) in temperate trees is a key adaptive trait, the expression of which is triggered by temperature gradients across the landscape. TBB is strongly correlated with flowering time and is therefore probably mediated by assortative mating. We derived theoretical predictions and realized numerical simulations of evolutionary changes in TBB in response to divergent selection and gene flow in a metapopulation. We showed that the combination of the environmental gradient of TBB and assortative mating creates contrasting genetic clines, depending on the direction of divergent selection. If divergent selection acts in the same direction as the environmental gradient (cogradient settings), genetic clines are established and inflated by assortative mating. Conversely, under divergent selection of the same strength but acting in the opposite direction (countergradient selection), genetic clines are slightly constrained. We explored the consequences of these dynamics for population maladaptation, by monitoring pollen swamping. Depending on the direction of divergent selection with respect to the environmental gradient, pollen filtering owing to assortative mating either facilitates or impedes adaptation in peripheral populations. PMID:24924591

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

Reversed magnetic shear suppression of electron-scale turbulence on NSTX

NASA Astrophysics Data System (ADS)

Yuh, Howard Y.; Levinton, F. M.; Bell, R. E.; Hosea, J. C.; Kaye, S. M.; Leblanc, B. P.; Mazzucato, E.; Smith, D. R.; Domier, C. W.; Luhmann, N. C.; Park, H. K.

2009-11-01

Electron thermal internal transport barriers (e-ITBs) are observed in reversed (negative) magnetic shear NSTX discharges^1. These e-ITBs can be created with either neutral beam heating or High Harmonic Fast Wave (HHFW) RF heating. The e-ITB location occurs at the location of minimum magnetic shear determined by Motional Stark Effect (MSE) constrained equilibria. Statistical studies show a threshold condition in magnetic shear for e-ITB formation. High-k fluctuation measurements at electron turbulence wavenumbers^3 have been made under several different transport regimes, including a bursty regime that limits temperature gradients at intermediate magnetic shear. The growth rate of fluctuations has been calculated immediately following a change in the local magnetic shear, resulting in electron temperature gradient relaxation. Linear gyrokinetic simulation results for NSTX show that while measured electron temperature gradients exceed critical linear thresholds for ETG instability, growth rates can remain low under reversed shear conditions up to high electron temperatures gradients. ^1H. Yuh, et. al., PoP 16, 056120 ^2D.R. Smith, E. Mazzucato et al., RSI 75, 3840 ^3E. Mazzucato, D.R. Smith et al., PRL 101, 075001

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.

SPIDER. IV. OPTICAL AND NEAR-INFRARED COLOR GRADIENTS IN EARLY-TYPE GALAXIES: NEW INSIGHT INTO CORRELATIONS WITH GALAXY PROPERTIES

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

La Barbera, F.; De Carvalho, R. R.; De La Rosa, I. G.

2010-11-15

We present an analysis of stellar population gradients in 4546 early-type galaxies (ETGs) with photometry in grizYHJK along with optical spectroscopy. ETGs were selected as bulge-dominated systems, displaying passive spectra within the SDSS fibers. A new approach is described which utilizes color information to constrain age and metallicity gradients. Defining an effective color gradient, {nabla}{sub *}, which incorporates all of the available color indices, we investigate how {nabla}{sub *} varies with galaxy mass proxies, i.e., velocity dispersion, stellar (M{sub *}) and dynamical (M{sub dyn}) masses, as well as age, metallicity, and [{alpha}/Fe]. ETGs with M{sub dyn} larger than 8.5 xmore » 10{sup 10} M{sub sun} have increasing age gradients and decreasing metallicity gradients with respect to mass, metallicity, and enhancement. We find that velocity dispersion and [{alpha}/Fe] are the main drivers of these correlations. ETGs with 2.5 x 10{sup 10} M{sub sun} {<=} M{sub dyn} {<=} 8.5 x 10{sup 10} M{sub sun} show no correlation of age, metallicity, and color gradients with respect to mass, although color gradients still correlate with stellar population parameters, and these correlations are independent of each other. In both mass regimes, the striking anti-correlation between color gradient and {alpha}-enhancement is significant at {approx}5{sigma} and results from the fact that metallicity gradient decreases with [{alpha}/Fe]. This anti-correlation may reflect the fact that star formation and metallicity enrichment are regulated by the interplay between the energy input from supernovae, and the temperature and pressure of the hot X-ray gas in ETGs. For all mass ranges, positive age gradients are associated with old galaxies (>5-7 Gyr). For galaxies younger than {approx}5 Gyr, mostly at low mass, the age gradient tends to be anti-correlated with the Age parameter, with more positive gradients at younger ages.« less

Distributions of ectomycorrhizal and foliar endophytic fungal communities associated with Pinus ponderosa along a spatially constrained elevation gradient.

PubMed

Bowman, Elizabeth A; Arnold, A Elizabeth

2018-04-01

Understanding distributions of plant-symbiotic fungi is important for projecting responses to environmental change. Many coniferous trees host ectomycorrhizal fungi (EM) in association with roots and foliar endophytic fungi (FE) in leaves. We examined how EM and FE associated with Pinus ponderosa each vary in abundance, diversity, and community structure over a spatially constrained elevation gradient that traverses four plant communities, 4°C in mean annual temperature, and 15 cm in mean annual precipitation. We sampled 63 individuals of Pinus ponderosa in 10 sites along a 635 m elevation gradient that encompassed a geographic distance of 9.8 km. We used standard methods to characterize each fungal group (amplified and sequenced EM from root tips; isolated and sequenced FE from leaves). Abundance and diversity of EM were similar across sites, but community composition and distributions of the most common EM differed with elevation (i.e., with climate, soil chemistry, and plant communities). Abundance and composition of FE did not differ with elevation, but diversity peaked in mid-to-high elevations. Our results suggest relatively tight linkages between EM and climate, soil chemistry, and plant communities. That FE appear less linked with these factors may speak to limitations of a culture-based approach, but more likely reflects the small spatial scale encompassed by our study. Future work should consider comparable methods for characterizing these functional groups, and additional transects to understand relationships of EM and FE to environmental factors that are likely to shift as a function of climate change. © 2018 Botanical Society of America.

Thermoregulation in the lizard Psammodromus algirus along a 2200-m elevational gradient in Sierra Nevada (Spain)

NASA Astrophysics Data System (ADS)

Zamora-Camacho, Francisco Javier; Reguera, Senda; Moreno-Rueda, Gregorio

2016-05-01

Achieving optimal body temperature maximizes animal fitness. Since ambient temperature may limit ectotherm thermal performance, it can be constrained in too cold or hot environments. In this sense, elevational gradients encompass contrasting thermal environments. In thermally pauperized elevations, ectotherms may either show adaptations or suboptimal body temperatures. Also, reproductive condition may affect thermal needs. Herein, we examined different thermal ecology and physiology capabilities of the lizard Psammodromus algirus along a 2200-m elevational gradient. We measured field (Tb) and laboratory-preferred (Tpref) body temperatures of lizards with different reproductive conditions, as well as ambient (Ta) and copper-model operative temperature (Te), which we used to determine thermal quality of the habitat (de), accuracy (db), and effectiveness of thermoregulation (de-db) indexes. We detected no Tb trend in elevation, while Ta constrained Tb only at high elevations. Moreover, while Ta decreased more than 7 °C with elevation, Tpref dropped only 0.6 °C, although significantly. Notably, low-elevation lizards faced excess temperature (Te > Tpref). Notably, de was best at middle elevations, followed by high elevations, and poorest at low elevations. Nonetheless, regarding microhabitat, high-elevation de was more suitable in sun-exposed microhabitats, which may increase exposition to predators, and at midday, which may limit daily activity. As for gender, db and de-db were better in females than in males. In conclusion, P. algirus seems capable to face a wide thermal range, which probably contributes to its extensive corology and makes it adaptable to climate changes.

A nonrecursive 'Order N' preconditioned conjugate gradient/range space formulation of MDOF dynamics

NASA Technical Reports Server (NTRS)

Kurdila, A. J.; Menon, R.; Sunkel, John

1991-01-01

This paper addresses the requirements of present-day mechanical system simulations of algorithms that induce parallelism on a fine scale and of transient simulation methods which must be automatically load balancing for a wide collection of system topologies and hardware configurations. To this end, a combination range space/preconditioned conjugage gradient formulation of multidegree-of-freedon dynamics is developed, which, by employing regular ordering of the system connectivity graph, makes it possible to derive an extremely efficient preconditioner from the range space metric (as opposed to the system coefficient matrix). Because of the effectiveness of the preconditioner, the method can achieve performance rates that depend linearly on the number of substructures. The method, termed 'Order N' does not require the assembly of system mass or stiffness matrices, and is therefore amenable to implementation on work stations. Using this method, a 13-substructure model of the Space Station was constructed.

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.

Multimodal magnetic nano-carriers for cancer treatment: Challenges and advancements

NASA Astrophysics Data System (ADS)

Aadinath, W.; Ghosh, Triroopa; Anandharamakrishnan, C.

2016-03-01

Iron oxide nanoparticles (IONPs) have been a propitious topic for cancer treatment in recent years because of its multifunctional theranostic applications under magnetic field. Two such widely used applications in cancer biology are gradient magnetic field guided targeting and alternative magnetic field (AMF) induced local hyperthermia. Gradient magnetic field guided targeting is a mode of active targeting of therapeutics conjugated with iron oxide nanoparticles. These particles also dissipate heat in presence of AMF which causes thermal injury to the cells of interest, for example tumour cells and subsequent death. Clinical trials divulge the feasibility of such magnetic nano-carrier as a promising candidate in cancer biology. However, these techniques need further investigations to curtail certain limitations manifested. Recent progresses in response have shrunken the barricade to certain extent. In this context, principles, challenges associated with these applications and recent efforts made in response will be discussed.

Generation of Plasma Density Irregularities in the Midlatitude/Subauroral F Region

NASA Astrophysics Data System (ADS)

Mishin, E. V.

2017-12-01

A concise review is given of the current state of the theoretical understanding of the creation of small- and meso-scale plasma density irregularities in the midlatitude/subauroral F region during quiet and disturbed periods. The former are discussed in terms of the temperature gradient instability (TGI) in the vicinity of the ionospheric projection of the plasmapause and the Perkins instability. During active conditions some part of the midlatitude ionosphere becomes the subauroral region dominated by enhanced westward flows (SAPS and SAID) driven by poleward electric fields. Their irregular, often nonlinear wave structure leads to the formation of plasma density irregularities in the plasmasphere and conjugate ionosphere. Here, meso-scale irregularities are due to the positive feedback magnetosphere-ionosphere coupling instability, while small scales resulted from the gradient drift instability (GDI), temperature GDI, and the ion frictional heating instability. The theoretical predictions are compared with satellite observations in the perturbed subauroral geospace.

Comparison of SIRT and SQS for Regularized Weighted Least Squares Image Reconstruction

PubMed Central

Gregor, Jens; Fessler, Jeffrey A.

2015-01-01

Tomographic image reconstruction is often formulated as a regularized weighted least squares (RWLS) problem optimized by iterative algorithms that are either inherently algebraic or derived from a statistical point of view. This paper compares a modified version of SIRT (Simultaneous Iterative Reconstruction Technique), which is of the former type, with a version of SQS (Separable Quadratic Surrogates), which is of the latter type. We show that the two algorithms minimize the same criterion function using similar forms of preconditioned gradient descent. We present near-optimal relaxation for both based on eigenvalue bounds and include a heuristic extension for use with ordered subsets. We provide empirical evidence that SIRT and SQS converge at the same rate for all intents and purposes. For context, we compare their performance with an implementation of preconditioned conjugate gradient. The illustrative application is X-ray CT of luggage for aviation security. PMID:26478906

Numerical Study of Hydrothermal Wave Suppression in Thermocapillary Flow Using a Predictive Control Method

NASA Astrophysics Data System (ADS)

Muldoon, F. H.

2018-04-01

Hydrothermal waves in flows driven by thermocapillary and buoyancy effects are suppressed by applying a predictive control method. Hydrothermal waves arise in the manufacturing of crystals, including the "open boat" crystal growth process, and lead to undesirable impurities in crystals. The open boat process is modeled using the two-dimensional unsteady incompressible Navier-Stokes equations under the Boussinesq approximation and the linear approximation of the surface thermocapillary force. The flow is controlled by a spatially and temporally varying heat flux density through the free surface. The heat flux density is determined by a conjugate gradient optimization algorithm. The gradient of the objective function with respect to the heat flux density is found by solving adjoint equations derived from the Navier-Stokes ones in the Boussinesq approximation. Special attention is given to heat flux density distributions over small free-surface areas and to the maximum admissible heat flux density.

Efficient Compressed Sensing Based MRI Reconstruction using Nonconvex Total Variation Penalties

NASA Astrophysics Data System (ADS)

Lazzaro, D.; Loli Piccolomini, E.; Zama, F.

2016-10-01

This work addresses the problem of Magnetic Resonance Image Reconstruction from highly sub-sampled measurements in the Fourier domain. It is modeled as a constrained minimization problem, where the objective function is a non-convex function of the gradient of the unknown image and the constraints are given by the data fidelity term. We propose an algorithm, Fast Non Convex Reweighted (FNCR), where the constrained problem is solved by a reweighting scheme, as a strategy to overcome the non-convexity of the objective function, with an adaptive adjustment of the penalization parameter. We propose a fast iterative algorithm and we can prove that it converges to a local minimum because the constrained problem satisfies the Kurdyka-Lojasiewicz property. Moreover the adaptation of non convex l0 approximation and penalization parameters, by means of a continuation technique, allows us to obtain good quality solutions, avoiding to get stuck in unwanted local minima. Some numerical experiments performed on MRI sub-sampled data show the efficiency of the algorithm and the accuracy of the solution.

A New Continuous-Time Equality-Constrained Optimization to Avoid Singularity.

PubMed

Quan, Quan; Cai, Kai-Yuan

2016-02-01

In equality-constrained optimization, a standard regularity assumption is often associated with feasible point methods, namely, that the gradients of constraints are linearly independent. In practice, the regularity assumption may be violated. In order to avoid such a singularity, a new projection matrix is proposed based on which a feasible point method to continuous-time, equality-constrained optimization is developed. First, the equality constraint is transformed into a continuous-time dynamical system with solutions that always satisfy the equality constraint. Second, a new projection matrix without singularity is proposed to realize the transformation. An update (or say a controller) is subsequently designed to decrease the objective function along the solutions of the transformed continuous-time dynamical system. The invariance principle is then applied to analyze the behavior of the solution. Furthermore, the proposed method is modified to address cases in which solutions do not satisfy the equality constraint. Finally, the proposed optimization approach is applied to three examples to demonstrate its effectiveness.

A constrained Delaunay discretization method for adaptively meshing highly discontinuous geological media

NASA Astrophysics Data System (ADS)

Wang, Yang; Ma, Guowei; Ren, Feng; Li, Tuo

2017-12-01

A constrained Delaunay discretization method is developed to generate high-quality doubly adaptive meshes of highly discontinuous geological media. Complex features such as three-dimensional discrete fracture networks (DFNs), tunnels, shafts, slopes, boreholes, water curtains, and drainage systems are taken into account in the mesh generation. The constrained Delaunay triangulation method is used to create adaptive triangular elements on planar fractures. Persson's algorithm (Persson, 2005), based on an analogy between triangular elements and spring networks, is enriched to automatically discretize a planar fracture into mesh points with varying density and smooth-quality gradient. The triangulated planar fractures are treated as planar straight-line graphs (PSLGs) to construct piecewise-linear complex (PLC) for constrained Delaunay tetrahedralization. This guarantees the doubly adaptive characteristic of the resulted mesh: the mesh is adaptive not only along fractures but also in space. The quality of elements is compared with the results from an existing method. It is verified that the present method can generate smoother elements and a better distribution of element aspect ratios. Two numerical simulations are implemented to demonstrate that the present method can be applied to various simulations of complex geological media that contain a large number of discontinuities.

Stepwise Assembly and Characterization of DNA Linked Two-Color Quantum Dot Clusters.

PubMed

Coopersmith, Kaitlin; Han, Hyunjoo; Maye, Mathew M

2015-07-14

The DNA-mediated self-assembly of multicolor quantum dot (QD) clusters via a stepwise approach is described. The CdSe/ZnS QDs were synthesized and functionalized with an amphiphilic copolymer, followed by ssDNA conjugation. At each functionalization step, the QDs were purified via gradient ultracentrifugation, which was found to remove excess polymer and QD aggregates, allowing for improved conjugation yields and assembly reactivity. The QDs were then assembled and disassembled in a stepwise manner at a ssDNA functionalized magnetic colloid, which provided a convenient way to remove unreacted QDs and ssDNA impurities. After assembly/disassembly, the clusters' optical characteristics were studied by fluorescence spectroscopy and the assembly morphology and stoichiometry was imaged via electron microscopy. The results indicate that a significant amount of QD-to-QD energy transfer occurred in the clusters, which was studied as a function of increasing acceptor-to-donor ratios, resulting in increased QD acceptor emission intensities compared to controls.

Hamiltonian and Thermodynamic Modeling of Quantum Turbulence

NASA Astrophysics Data System (ADS)

Grmela, Miroslav

2010-10-01

The state variables in the novel model introduced in this paper are the fields playing this role in the classical Landau-Tisza model and additional fields of mass, entropy (or temperature), superfluid velocity, and gradient of the superfluid velocity, all depending on the position vector and another tree dimensional vector labeling the scale, describing the small-scale structure developed in 4He superfluid experiencing turbulent motion. The fluxes of mass, momentum, energy, and entropy in the position space as well as the fluxes of energy and entropy in scales, appear in the time evolution equations as explicit functions of the state variables and of their conjugates. The fundamental thermodynamic relation relating the fields to their conjugates is left in this paper undetermined. The GENERIC structure of the equations serves two purposes: (i) it guarantees that solutions to the governing equations, independently of the choice of the fundamental thermodynamic relation, agree with the observed compatibility with thermodynamics, and (ii) it is used as a guide in the construction of the novel model.

Constrained trajectory optimization for kinematically redundant arms

NASA Technical Reports Server (NTRS)

Carignan, Craig R.; Tarrant, Janice M.

1990-01-01

Two velocity optimization schemes for resolving redundant joint configurations are compared. The Extended Moore-Penrose Technique minimizes the joint velocities and avoids obstacles indirectly by adjoining a cost gradient to the solution. A new method can incorporate inequality constraints directly to avoid obstacles and singularities in the workspace. A four-link arm example is used to illustrate singularity avoidance while tracking desired end-effector paths.

COVARIANCE ESTIMATION USING CONJUGATE GRADIENT FOR 3D CLASSIFICATION IN CRYO-EM.

PubMed

Andén, Joakim; Katsevich, Eugene; Singer, Amit

2015-04-01

Classifying structural variability in noisy projections of biological macromolecules is a central problem in Cryo-EM. In this work, we build on a previous method for estimating the covariance matrix of the three-dimensional structure present in the molecules being imaged. Our proposed method allows for incorporation of contrast transfer function and non-uniform distribution of viewing angles, making it more suitable for real-world data. We evaluate its performance on a synthetic dataset and an experimental dataset obtained by imaging a 70S ribosome complex.

Research in computer science

NASA Technical Reports Server (NTRS)

Ortega, J. M.

1984-01-01

Several short summaries of the work performed during this reporting period are presented. Topics discussed in this document include: (1) resilient seeded errors via simple techniques; (2) knowledge representation for engineering design; (3) analysis of faults in a multiversion software experiment; (4) implementation of parallel programming environment; (5) symbolic execution of concurrent programs; (6) two computer graphics systems for visualization of pressure distribution and convective density particles; (7) design of a source code management system; (8) vectorizing incomplete conjugate gradient on the Cyber 203/205; (9) extensions of domain testing theory and; (10) performance analyzer for the pisces system.

A superlinear convergence estimate for an iterative method for the biharmonic equation

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

Horn, M.A.

In [CDH] a method for the solution of boundary value problems for the biharmonic equation using conformal mapping was investigated. The method is an implementation of the classical method of Muskhelishvili. In [CDH] it was shown, using the Hankel structure, that the linear system in [Musk] is the discretization of the identify plus a compact operator, and therefore the conjugate gradient method will converge superlinearly. The purpose of this paper is to give an estimate of the superlinear convergence in the case when the boundary curve is in a Hoelder class.

Optimal control of population and coherence in three-level Λ systems

NASA Astrophysics Data System (ADS)

Kumar, Praveen; Malinovskaya, Svetlana A.; Malinovsky, Vladimir S.

2011-08-01

Optimal control theory (OCT) implementations for an efficient population transfer and creation of maximum coherence in a three-level system are considered. We demonstrate that the half-stimulated Raman adiabatic passage scheme for creation of the maximum Raman coherence is the optimal solution according to the OCT. We also present a comparative study of several implementations of OCT applied to the complete population transfer and creation of the maximum coherence. Performance of the conjugate gradient method, the Zhu-Rabitz method and the Krotov method has been analysed.

Lattice QCD calculation using VPP500

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

Kim, Seyong; Ohta, Shigemi

1995-02-01

A new vector parallel supercomputer, Fujitsu VPP500, was installed at RIKEN earlier this year. It consists of 30 vector computers, each with 1.6 GFLOPS peak speed and 256 MB memory, connected by a crossbar switch with 400 MB/s peak data transfer rate each way between any pair of nodes. The authors developed a Fortran lattice QCD simulation code for it. It runs at about 1.1 GFLOPS sustained per node for Metropolis pure-gauge update, and about 0.8 GFLOPS sustained per node for conjugate gradient inversion of staggered fermion matrix.

News on Seeking Gaia's Astrometric Core Solution with AGIS

NASA Astrophysics Data System (ADS)

Lammers, U.; Lindegren, L.

We report on recent new developments around the Astrometric Global Iterative Solution system. This includes the availability of an efficient Conjugate Gradient solver and the Generic Astrometric Calibration scheme that had been proposed a while ago. The number of primary stars to be included in the core solution is now believed to be significantly higher than the 100 Million that served as baseline until now. Cloud computing services are being studied as a possible cost-effective alternative to running AGIS on dedicated computing hardware at ESAC during the operational phase.

Design and characterization of nanomaterial-biomolecule conjugates

NASA Astrophysics Data System (ADS)

Yim, Tae-Jin

In the field of nanobiotechnology, nanoscale dimensions result in physical properties that differ from more conventional bulk material state. The integration of nanomaterials with biomolecules has begun to be used for unique physical properties, and for biological specific recognition, thereby leading to novel nanomaterial-biomolecule conjugates. The direction of this dissertation is to develop biocatalytic nanomaterial-biomolecule conjugates and to characterize them. For this, biological catalysts are employed to combine with nanomaterials. Two large parts include functional ization of nanomaterials with biomolecules and assembly of nanomaterials using a biological catalyst. First part of this thesis work is the exploration of the biocatalytic properties of nanomaterial-biomolecule conjugates. Si nanocolumns have higher surface area which leads more amount of biocatalytis immobilization than flat Si wafer with the same projected area. The enhanced activity of soybean peroxidase (SBP) immobilized onto Si nanocolumns as novel nanostructured supports is focused. Next, the catalytic activity of immobilized DNAzyme onto multiwalled carbon nanotubes (MWNTs) is compared to that in solution phase, and multiple turnovers are examined. The relationship between hybridization efficiency and activity is investigated as a function of surface density of DNAzyme on MWNTs. Then, cellular delivery of silica nanoparticle-protein conjugates is visually confirmed and therefore the intracellular function of a protein delivered by silica nanoparticle-protein conjugates is proved. For one example of the intracellular function, stable SBP immobilized onto silica nanoparticles to activate a prodrug is demonstrated. Second part of this thesis work is the formation of nanostructured materials through the enzymatic assembly of single-walled carbon nanotubes (SWNTs). Enzymatic polymerization of a phenol compound is applied to the bridging of two or more SWNTs functionalized with phenol monomers. Next, future work based on previous works is proposed; first, the cellular delivery of DNAzyme using SWNTs is proposed to be a promising nonviral nanovehicle for gene silencing. Second, hydrophobic/hydrophilic switchable surface using DNAzyme is suggested to expand its usage to hydrophobically gradient surface. Finally, reversible assembly and disassembly of poly-L-histidine coated MWNTs can be applied to a reversible nanotube patterning on surface. And, the expansion of the works presented in this thesis to "nanomedicine" is suggested.

Structure and State of Stress of the Chilean Subduction Zone from Terrestrial and Satellite-Derived Gravity and Gravity Gradient Data

NASA Astrophysics Data System (ADS)

Gutknecht, B. D.; Götze, H.-J.; Jahr, T.; Jentzsch, G.; Mahatsente, R.; Zeumann, St.

2014-11-01

It is well known that the quality of gravity modelling of the Earth's lithosphere is heavily dependent on the limited number of available terrestrial gravity data. More recently, however, interest has grown within the geoscientific community to utilise the homogeneously measured satellite gravity and gravity gradient data for lithospheric scale modelling. Here, we present an interdisciplinary approach to determine the state of stress and rate of deformation in the Central Andean subduction system. We employed gravity data from terrestrial, satellite-based and combined sources using multiple methods to constrain stress, strain and gravitational potential energy (GPE). Well-constrained 3D density models, which were partly optimised using the combined regional gravity model IMOSAGA01C (Hosse et al. in Surv Geophys, 2014, this issue), were used as bases for the computation of stress anomalies on the top of the subducting oceanic Nazca plate and GPE relative to the base of the lithosphere. The geometries and physical parameters of the 3D density models were used for the computation of stresses and uplift rates in the dynamic modelling. The stress distributions, as derived from the static and dynamic modelling, reveal distinct positive anomalies of up to 80 MPa along the coastal Jurassic batholith belt. The anomalies correlate well with major seismicity in the shallow parts of the subduction system. Moreover, the pattern of stress distributions in the Andean convergent zone varies both along the north-south and west-east directions, suggesting that the continental fore-arc is highly segmented. Estimates of GPE show that the high Central Andes might be in a state of horizontal deviatoric tension. Models of gravity gradients from the Gravity field and steady-state Ocean Circulation Explorer (GOCE) satellite mission were used to compute Bouguer-like gradient anomalies at 8 km above sea level. The analysis suggests that data from GOCE add significant value to the interpretation of lithospheric structures, given that the appropriate topographic correction is applied.

Constraining Gas Diffusivity-Soil Water Content Relationships in Forest Soils Using Surface Chamber Fluxes and Depth Profiles of Multiple Trace Gases

NASA Astrophysics Data System (ADS)

Dore, J. E.; Kaiser, K.; Seybold, E. C.; McGlynn, B. L.

2012-12-01

Forest soils are sources of carbon dioxide (CO2) to the atmosphere and can act as either sources or sinks of methane (CH4) and nitrous oxide (N2O), depending on redox conditions and other factors. Soil moisture is an important control on microbial activity, redox conditions and gas diffusivity. Direct chamber measurements of soil-air CO2 fluxes are facilitated by the availability of sensitive, portable infrared sensors; however, corresponding CH4 and N2O fluxes typically require the collection of time-course physical samples from the chamber with subsequent analyses by gas chromatography (GC). Vertical profiles of soil gas concentrations may also be used to derive CH4 and N2O fluxes by the gradient method; this method requires much less time and many fewer GC samples than the direct chamber method, but requires that effective soil gas diffusivities are known. In practice, soil gas diffusivity is often difficult to accurately estimate using a modeling approach. In our study, we apply both the chamber and gradient methods to estimate soil trace gas fluxes across a complex Rocky Mountain forested watershed in central Montana. We combine chamber flux measurements of CO2 (by infrared sensor) and CH4 and N2O (by GC) with co-located soil gas profiles to determine effective diffusivity in soil for each gas simultaneously, over-determining the diffusion equations and providing constraints on both the chamber and gradient methodologies. We then relate these soil gas diffusivities to soil type and volumetric water content in an effort to arrive at empirical parameterizations that may be used to estimate gas diffusivities across the watershed, thereby facilitating more accurate, frequent and widespread gradient-based measurements of trace gas fluxes across our study system. Our empirical approach to constraining soil gas diffusivity is well suited for trace gas flux studies over complex landscapes in general.

CVB: the Constrained Vapor Bubble Capillary Experiment on the International Space Station MARANGONI FLOW REGION

NASA Technical Reports Server (NTRS)

Wayner, Peter C., Jr.; Kundan, Akshay; Plawsky, Joel

2014-01-01

The Constrained Vapor Bubble (CVB) is a wickless, grooved heat pipe and we report on a full- scale fluids experiment flown on the International Space Station (ISS). The CVB system consists of a relatively simple setup a quartz cuvette with sharp corners partially filled with either pentane or an ideal mixture of pentane and isohexane as the working fluids. Along with temperature and pressure measurements, the two-dimensional thickness profile of the menisci formed at the corners of the quartz cuvette was determined using the Light Microscopy Module (LMM). Even with the large, millimeter dimensions of the CVB, interfacial forces dominate in these exceedingly small Bond Number systems. The experiments were carried out at various power inputs. Although conceptually simple, the transport processes were found to be very complex with many different regions. At the heated end of the CVB, due to a high temperature gradient, we observed Marangoni flow at some power inputs. This region from the heated end to the central drop region is defined as a Marangoni dominated region. We present a simple analysis based on interfacial phenomena using only measurements from the ISS experiments that lead to a predictive equation for the thickness of the film near the heated end of the CVB. The average pressure gradient for flow in the film is assumed due to the measured capillary pressure at the two ends of the liquid film and that the pressure stress gradient due to cohesion self adjusts to a constant value over a distance L. The boundary conditions are the no slip condition at the wall interface and an interfacial shear stress at the liquid- vapor interface due to the Marangoni stress, which is due to the high temperature gradient. Although the heated end is extremely complex, since it includes three- dimensional variations in radiation, conduction, evaporation, condensation, fluid flow and interfacial forces, we find that using the above simplifying assumptions, a simple successful model can be developed.

The Weighted Burgers Vector: a new quantity for constraining dislocation densities and types using electron backscatter diffraction on 2D sections through crystalline materials.

PubMed

Wheeler, J; Mariani, E; Piazolo, S; Prior, D J; Trimby, P; Drury, M R

2009-03-01

The Weighted Burgers Vector (WBV) is defined here as the sum, over all types of dislocations, of [(density of intersections of dislocation lines with a map) x (Burgers vector)]. Here we show that it can be calculated, for any crystal system, solely from orientation gradients in a map view, unlike the full dislocation density tensor, which requires gradients in the third dimension. No assumption is made about gradients in the third dimension and they may be non-zero. The only assumption involved is that elastic strains are small so the lattice distortion is entirely due to dislocations. Orientation gradients can be estimated from gridded orientation measurements obtained by EBSD mapping, so the WBV can be calculated as a vector field on an EBSD map. The magnitude of the WBV gives a lower bound on the magnitude of the dislocation density tensor when that magnitude is defined in a coordinate invariant way. The direction of the WBV can constrain the types of Burgers vectors of geometrically necessary dislocations present in the microstructure, most clearly when it is broken down in terms of lattice vectors. The WBV has three advantages over other measures of local lattice distortion: it is a vector and hence carries more information than a scalar quantity, it has an explicit mathematical link to the individual Burgers vectors of dislocations and, since it is derived via tensor calculus, it is not dependent on the map coordinate system. If a sub-grain wall is included in the WBV calculation, the magnitude of the WBV becomes dependent on the step size but its direction still carries information on the Burgers vectors in the wall. The net Burgers vector content of dislocations intersecting an area of a map can be simply calculated by an integration round the edge of that area, a method which is fast and complements point-by-point WBV calculations.

Constrained optimization for position calibration of an NMR field camera.

PubMed

Chang, Paul; Nassirpour, Sahar; Eschelbach, Martin; Scheffler, Klaus; Henning, Anke

2018-07-01

Knowledge of the positions of field probes in an NMR field camera is necessary for monitoring the B 0 field. The typical method of estimating these positions is by switching the gradients with known strengths and calculating the positions using the phases of the FIDs. We investigated improving the accuracy of estimating the probe positions and analyzed the effect of inaccurate estimations on field monitoring. The field probe positions were estimated by 1) assuming ideal gradient fields, 2) using measured gradient fields (including nonlinearities), and 3) using measured gradient fields with relative position constraints. The fields measured with the NMR field camera were compared to fields acquired using a dual-echo gradient recalled echo B 0 mapping sequence. Comparisons were done for shim fields from second- to fourth-order shim terms. The position estimation was the most accurate when relative position constraints were used in conjunction with measured (nonlinear) gradient fields. The effect of more accurate position estimates was seen when compared to fields measured using a B 0 mapping sequence (up to 10%-15% more accurate for some shim fields). The models acquired from the field camera are sensitive to noise due to the low number of spatial sample points. Position estimation of field probes in an NMR camera can be improved using relative position constraints and nonlinear gradient fields. Magn Reson Med 80:380-390, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Intra-coil interactions in split gradient coils in a hybrid MRI-LINAC system.

PubMed

Tang, Fangfang; Freschi, Fabio; Sanchez Lopez, Hector; Repetto, Maurizio; Liu, Feng; Crozier, Stuart

2016-04-01

An MRI-LINAC system combines a magnetic resonance imaging (MRI) system with a medical linear accelerator (LINAC) to provide image-guided radiotherapy for targeting tumors in real-time. In an MRI-LINAC system, a set of split gradient coils is employed to produce orthogonal gradient fields for spatial signal encoding. Owing to this unconventional gradient configuration, eddy currents induced by switching gradient coils on and off may be of particular concern. It is expected that strong intra-coil interactions in the set will be present due to the constrained return paths, leading to potential degradation of the gradient field linearity and image distortion. In this study, a series of gradient coils with different track widths have been designed and analyzed to investigate the electromagnetic interactions between coils in a split gradient set. A driving current, with frequencies from 100 Hz to 10 kHz, was applied to study the inductive coupling effects with respect to conductor geometry and operating frequency. It was found that the eddy currents induced in the un-energized coils (hereby-referred to as passive coils) positively correlated with track width and frequency. The magnetic field induced by the eddy currents in the passive coils with wide tracks was several times larger than that induced by eddy currents in the cold shield of cryostat. The power loss in the passive coils increased with the track width. Therefore, intra-coil interactions should be included in the coil design and analysis process. Copyright © 2016 Elsevier Inc. All rights reserved.

SDSS-IV MaNGA: modelling the metallicity gradients of gas and stars - radially dependent metal outflow versus IMF

NASA Astrophysics Data System (ADS)

Lian, Jianhui; Thomas, Daniel; Maraston, Claudia; Goddard, Daniel; Parikh, Taniya; Fernández-Trincado, J. G.; Roman-Lopes, Alexandre; Rong, Yu; Tang, Baitian; Yan, Renbin

2018-05-01

In our previous work, we found that only two scenarios are capable of reproducing the observed integrated mass-metallicity relations for the gas and stellar components of local star-forming galaxies simultaneously. One scenario invokes a time-dependent metal outflow loading factor with stronger outflows at early times. The other scenario uses a time-dependent initial mass function (IMF) slope with a steeper IMF at early times. In this work, we extend our study to investigate the radial profile of gas and stellar metallicity in local star-forming galaxies using spatially resolved spectroscopic data from the SDSS-IV MaNGA survey. We find that most galaxies show negative gradients in both gas and stellar metallicity with steeper gradients in stellar metallicity. The stellar metallicity gradients tend to be mass dependent with steeper gradients in more massive galaxies while no clear mass dependence is found for the gas metallicity gradient. Then we compare the observations with the predictions from a chemical evolution model of the radial profiles of gas and stellar metallicities. We confirm that the two scenarios proposed in our previous work are also required to explain the metallicity gradients. Based on these two scenarios, we successfully reproduce the radial profiles of gas metallicity, stellar metallicity, stellar mass surface density, and star formation rate surface density simultaneously. The origin of the negative gradient in stellar metallicity turns out to be driven by either radially dependent metal outflow or IMF slope. In contrast, the radial dependence of the gas metallicity is less constrained because of the degeneracy in model parameters.

Cardiac C-arm computed tomography using a 3D + time ROI reconstruction method with spatial and temporal regularization

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

Mory, Cyril, E-mail: cyril.mory@philips.com; Philips Research Medisys, 33 rue de Verdun, 92156 Suresnes; Auvray, Vincent

2014-02-15

Purpose: Reconstruction of the beating heart in 3D + time in the catheter laboratory using only the available C-arm system would improve diagnosis, guidance, device sizing, and outcome control for intracardiac interventions, e.g., electrophysiology, valvular disease treatment, structural or congenital heart disease. To obtain such a reconstruction, the patient's electrocardiogram (ECG) must be recorded during the acquisition and used in the reconstruction. In this paper, the authors present a 4D reconstruction method aiming to reconstruct the heart from a single sweep 10 s acquisition. Methods: The authors introduce the 4D RecOnstructiOn using Spatial and TEmporal Regularization (short 4D ROOSTER) method,more » which reconstructs all cardiac phases at once, as a 3D + time volume. The algorithm alternates between a reconstruction step based on conjugate gradient and four regularization steps: enforcing positivity, averaging along time outside a motion mask that contains the heart and vessels, 3D spatial total variation minimization, and 1D temporal total variation minimization. Results: 4D ROOSTER recovers the different temporal representations of a moving Shepp and Logan phantom, and outperforms both ECG-gated simultaneous algebraic reconstruction technique and prior image constrained compressed sensing on a clinical case. It generates 3D + time reconstructions with sharp edges which can be used, for example, to estimate the patient's left ventricular ejection fraction. Conclusions: 4D ROOSTER can be applied for human cardiac C-arm CT, and potentially in other dynamic tomography areas. It can easily be adapted to other problems as regularization is decoupled from projection and back projection.« less

Revisiting Molecular Dynamics on a CPU/GPU system: Water Kernel and SHAKE Parallelization.

PubMed

Ruymgaart, A Peter; Elber, Ron

2012-11-13

We report Graphics Processing Unit (GPU) and Open-MP parallel implementations of water-specific force calculations and of bond constraints for use in Molecular Dynamics simulations. We focus on a typical laboratory computing-environment in which a CPU with a few cores is attached to a GPU. We discuss in detail the design of the code and we illustrate performance comparable to highly optimized codes such as GROMACS. Beside speed our code shows excellent energy conservation. Utilization of water-specific lists allows the efficient calculations of non-bonded interactions that include water molecules and results in a speed-up factor of more than 40 on the GPU compared to code optimized on a single CPU core for systems larger than 20,000 atoms. This is up four-fold from a factor of 10 reported in our initial GPU implementation that did not include a water-specific code. Another optimization is the implementation of constrained dynamics entirely on the GPU. The routine, which enforces constraints of all bonds, runs in parallel on multiple Open-MP cores or entirely on the GPU. It is based on Conjugate Gradient solution of the Lagrange multipliers (CG SHAKE). The GPU implementation is partially in double precision and requires no communication with the CPU during the execution of the SHAKE algorithm. The (parallel) implementation of SHAKE allows an increase of the time step to 2.0fs while maintaining excellent energy conservation. Interestingly, CG SHAKE is faster than the usual bond relaxation algorithm even on a single core if high accuracy is expected. The significant speedup of the optimized components transfers the computational bottleneck of the MD calculation to the reciprocal part of Particle Mesh Ewald (PME).

Computationally efficient algorithms for Brownian dynamics simulation of long flexible macromolecules modeled as bead-rod chains

NASA Astrophysics Data System (ADS)

Moghani, Mahdy Malekzadeh; Khomami, Bamin

2017-02-01

The computational efficiency of Brownian dynamics (BD) simulation of the constrained model of a polymeric chain (bead-rod) with n beads and in the presence of hydrodynamic interaction (HI) is reduced to the order of n2 via an efficient algorithm which utilizes the conjugate-gradient (CG) method within a Picard iteration scheme. Moreover, the utility of the Barnes and Hut (BH) multipole method in BD simulation of polymeric solutions in the presence of HI, with regard to computational cost, scaling, and accuracy, is discussed. Overall, it is determined that this approach leads to a scaling of O (n1.2) . Furthermore, a stress algorithm is developed which accurately captures the transient stress growth in the startup of flow for the bead-rod model with HI and excluded volume (EV) interaction. Rheological properties of the chains up to n =350 in the presence of EV and HI are computed via the former algorithm. The result depicts qualitative differences in shear thinning behavior of the polymeric solutions in the intermediate values of the Weissenburg number (10

Comparison of an algebraic multigrid algorithm to two iterative solvers used for modeling ground water flow and transport

USGS Publications Warehouse

Detwiler, R.L.; Mehl, S.; Rajaram, H.; Cheung, W.W.

2002-01-01

Numerical solution of large-scale ground water flow and transport problems is often constrained by the convergence behavior of the iterative solvers used to solve the resulting systems of equations. We demonstrate the ability of an algebraic multigrid algorithm (AMG) to efficiently solve the large, sparse systems of equations that result from computational models of ground water flow and transport in large and complex domains. Unlike geometric multigrid methods, this algorithm is applicable to problems in complex flow geometries, such as those encountered in pore-scale modeling of two-phase flow and transport. We integrated AMG into MODFLOW 2000 to compare two- and three-dimensional flow simulations using AMG to simulations using PCG2, a preconditioned conjugate gradient solver that uses the modified incomplete Cholesky preconditioner and is included with MODFLOW 2000. CPU times required for convergence with AMG were up to 140 times faster than those for PCG2. The cost of this increased speed was up to a nine-fold increase in required random access memory (RAM) for the three-dimensional problems and up to a four-fold increase in required RAM for the two-dimensional problems. We also compared two-dimensional numerical simulations of steady-state transport using AMG and the generalized minimum residual method with an incomplete LU-decomposition preconditioner. For these transport simulations, AMG yielded increased speeds of up to 17 times with only a 20% increase in required RAM. The ability of AMG to solve flow and transport problems in large, complex flow systems and its ready availability make it an ideal solver for use in both field-scale and pore-scale modeling.

Structure and rheology of the lithosphere below southeastern margin of India and Sri Lanka, and its conjugate segment of the east Antarctica: Implications on early breakup history and margin formation

NASA Astrophysics Data System (ADS)

Rao Gangumalla, Srinivasa; Radhakrishna, Munukutla

2014-05-01

The eastern continental margin of India has evolved as a consequence of rifting and breakup between India and east Antarctica during the early Cretaceous. Plate reconstruction models for the breakup of eastern Gondwanaland by many earlier workers have unambiguously placed the southeast margin of Sri Lanka and India together as a conjugate segment with the east Antarctica margin that extends from Gunnerus Ridge in the west to western Enderby basin in the east. In this study, we present results of integrated analysis of gravity, geoid, magnetic and seismic data from these two conjugate portions in order to examine the lithosphere structure and early seafloor spreading, style of breakup, continent-ocean boundary (COB) and rheological characteristics at these margins. The interpreted COB lies at a distance of 55-140 km on the side of southeast margin of Sri Lanka and India, whereas, it lies at a distance of 190-550 km on the side of east Antarctica margin. The seismic profiles and the constrained potential field models across these two segments do not show the existence of seaward dipping reflector sequences or magmatic underplating suggesting that these segments have not encountered major magmatic activity. While, significant crustal thinning/stretching is observed at the east Antarctic margin, the Cauvery offshore had experienced limited stretching with faulted Moho interface. Further, the conspicuous residual geoid low in the Cauvery offshore basin is inferred to be due to a continental crustal block. The modelled Lithosphere-Astenosphere Boundary (LAB) in these two margins is located around 110-120 km depth with slightly thicker lithosphere at the east Antarctica margin. In addition, the interpretation of magnetic anomalies provided structure of the oceanic crust generated through seafloor spreading processes with age and magnetization data constrained from the identified magnetic anomalies in the respective margins. Using the Bouguer coherence method, we computed spatial variations in effective elastic thickness (Te) at these margin segments. The estimated Te values at the Indian margin ranges between 5-8 km in the southeast of Sri Lanka to around 10-12 km in the Cauvery offshore which decrease further north to < 5 km in the Cauvery-Palar basin. Along the east Antarctic margin, the Te values ranges between 5-10 km in the Gunnerus ridge region, 35-40 km in the western Enderby basin which decrease further towards the central Enderby basin up to 20 km. In this study, the above results have been analyzed in terms of early breakup mechanism and subsequent evolution of these two conjugate segments.

Biodiversity patterns along ecological gradients: unifying β-diversity indices.

PubMed

Szava-Kovats, Robert C; Pärtel, Meelis

2014-01-01

Ecologists have developed an abundance of conceptions and mathematical expressions to define β-diversity, the link between local (α) and regional-scale (γ) richness, in order to characterize patterns of biodiversity along ecological (i.e., spatial and environmental) gradients. These patterns are often realized by regression of β-diversity indices against one or more ecological gradients. This practice, however, is subject to two shortcomings that can undermine the validity of the biodiversity patterns. First, many β-diversity indices are constrained to range between fixed lower and upper limits. As such, regression analysis of β-diversity indices against ecological gradients can result in regression curves that extend beyond these mathematical constraints, thus creating an interpretational dilemma. Second, despite being a function of the same measured α- and γ-diversity, the resultant biodiversity pattern depends on the choice of β-diversity index. We propose a simple logistic transformation that rids beta-diversity indices of their mathematical constraints, thus eliminating the possibility of an uninterpretable regression curve. Moreover, this transformation results in identical biodiversity patterns for three commonly used classical beta-diversity indices. As a result, this transformation eliminates the difficulties of both shortcomings, while allowing the researcher to use whichever beta-diversity index deemed most appropriate. We believe this method can help unify the study of biodiversity patterns along ecological gradients.

Biodiversity Patterns along Ecological Gradients: Unifying β-Diversity Indices

PubMed Central

Szava-Kovats, Robert C.; Pärtel, Meelis

2014-01-01

Ecologists have developed an abundance of conceptions and mathematical expressions to define β-diversity, the link between local (α) and regional-scale (γ) richness, in order to characterize patterns of biodiversity along ecological (i.e., spatial and environmental) gradients. These patterns are often realized by regression of β-diversity indices against one or more ecological gradients. This practice, however, is subject to two shortcomings that can undermine the validity of the biodiversity patterns. First, many β-diversity indices are constrained to range between fixed lower and upper limits. As such, regression analysis of β-diversity indices against ecological gradients can result in regression curves that extend beyond these mathematical constraints, thus creating an interpretational dilemma. Second, despite being a function of the same measured α- and γ-diversity, the resultant biodiversity pattern depends on the choice of β-diversity index. We propose a simple logistic transformation that rids beta-diversity indices of their mathematical constraints, thus eliminating the possibility of an uninterpretable regression curve. Moreover, this transformation results in identical biodiversity patterns for three commonly used classical beta-diversity indices. As a result, this transformation eliminates the difficulties of both shortcomings, while allowing the researcher to use whichever beta-diversity index deemed most appropriate. We believe this method can help unify the study of biodiversity patterns along ecological gradients. PMID:25330181

Development and validation of a critical gradient energetic particle driven Alfven eigenmode transport model for DIII-D tilted neutral beam experiments

DOE PAGES

Waltz, Ronald E.; Bass, Eric M.; Heidbrink, William W.; ...

2015-10-30

Recent experiments with the DIII-D tilted neutral beam injection (NBI) varying the beam energetic particle (EP) source profiles have provided strong evidence that unstable Alfven eigenmodes (AE) drive stiff EP transport at a critical EP density gradient. Here the critical gradient is identified by the local AE growth rate being equal to the local ITG/TEM growth rate at the same low toroidal mode number. The growth rates are taken from the gyrokinetic code GYRO. Simulation show that the slowing down beam-like EP distribution has a slightly lower critical gradient than the Maxwellian. The ALPHA EP density transport code, used tomore » validate the model, combines the low-n stiff EP critical density gradient AE mid-core transport with the energy independent high-n ITG/TEM density transport model controling the central core EP density profile. For the on-axis NBI heated DIII-D shot 146102, while the net loss to the edge is small, about half the birth fast ions are transported from the central core r/a < 0.5 and the central density is about half the slowing down density. Lastly, these results are in good agreement with experimental fast ion pressure profiles inferred from MSE constrained EFIT equilibria.« less

An efficient sequential strategy for realizing cross-gradient joint inversion: method and its application to 2-D cross borehole seismic traveltime and DC resistivity tomography

NASA Astrophysics Data System (ADS)

Gao, Ji; Zhang, Haijiang

2018-05-01

Cross-gradient joint inversion that enforces structural similarity between different models has been widely utilized in jointly inverting different geophysical data types. However, it is a challenge to combine different geophysical inversion systems with the cross-gradient structural constraint into one joint inversion system because they may differ greatly in the model representation, forward modelling and inversion algorithm. Here we propose a new joint inversion strategy that can avoid this issue. Different models are separately inverted using the existing inversion packages and model structure similarity is only enforced through cross-gradient minimization between two models after each iteration. Although the data fitting and structural similarity enforcing processes are decoupled, our proposed strategy is still able to choose appropriate models to balance the trade-off between geophysical data fitting and structural similarity. This is realized by using model perturbations from separate data inversions to constrain the cross-gradient minimization process. We have tested this new strategy on 2-D cross borehole synthetic seismic traveltime and DC resistivity data sets. Compared to separate geophysical inversions, our proposed joint inversion strategy fits the separate data sets at comparable levels while at the same time resulting in a higher structural similarity between the velocity and resistivity models.

Theoretical study on naphthobischalcogenadiazole conjugated polymer systems and C61 derivative as organic photovoltaic semiconductors

NASA Astrophysics Data System (ADS)

Fujita, Takehiro; Matsui, Toru; Sumita, Masato; Imamura, Yutaka; Morihashi, Kenji

2018-02-01

We investigated the charge-transfer reactions of solar cells including a quaterthiophene copolymer with naphtho-bis-thiadiazole (PNTz4T) and naphtho-bis-oxadiazole (PNOz4T) using constrained density functional theory (CDFT). According to our calculations, the high electron-transfer rate results in a highly efficient solar cell, and the stable charge-transfer state results in low energy loss. Our computations imply that the following three factors are crucial to improve the performance of semiconducting polymers: (i) large structural changes following charge-transfer, (ii) narrow band gap, and (iii) spatially delocalized lowest unoccupied molecular orbital (LUMO) of the ground state.

The use of optimization techniques to design controlled diffusion compressor blading

NASA Technical Reports Server (NTRS)

Sanger, N. L.

1982-01-01

A method for automating compressor blade design using numerical optimization, and applied to the design of a controlled diffusion stator blade row is presented. A general purpose optimization procedure is employed, based on conjugate directions for locally unconstrained problems and on feasible directions for locally constrained problems. Coupled to the optimizer is an analysis package consisting of three analysis programs which calculate blade geometry, inviscid flow, and blade surface boundary layers. The optimizing concepts and selection of design objective and constraints are described. The procedure for automating the design of a two dimensional blade section is discussed, and design results are presented.

Exciton Correlations in Intramolecular Singlet Fission

DOE PAGES

Sanders, Samuel N.; Kumarasamy, Elango; Pun, Andrew B.; ...

2016-05-16

We have synthesized a series of asymmetric pentacene-tetracene heterodimers with a variable-length conjugated bridge that undergo fast and efficient intramolecular singlet fission (iSF). These compounds have distinct singlet and triplet energies, which allow us to study the spatial dynamics of excitons during the iSF process, including the significant role of exciton correlations in promoting triplet pair generation and recombination. We demonstrate that the primary photoexcitations in conjugated dimers are delocalized singlets that enable fast and efficient iSF. However, in these asymmetric dimers, the singlet becomes more localized on the lower energy unit as the length of the bridge is increased,more » slowing down iSF relative to analogous symmetric dimers. We resolve the recombination kinetics of the inequivalent triplets produced via iSF, and find that they primarily decay via concerted processes. By identifying different decay channels, including delayed fluorescence via triplet-triplet annihilation, we can separate transient species corresponding to both correlated triplet pairs and uncorrelated triplets. Recombination of the triplet pair proceeds rapidly despite our experimental and theoretical demonstration that individual triplets are highly localized and unable to be transported across the conjugated linker. In this class of compounds, the rate of formation and yield of uncorrelated triplets increases with bridge length. Overall, these constrained, asymmetric systems provide a unique platform to isolate and study transient species essential for singlet fission, which are otherwise difficult to observe in symmetric dimers or condensed phases.« less

Distributed Kalman filtering compared to Fourier domain preconditioned conjugate gradient for laser guide star tomography on extremely large telescopes.

PubMed

Gilles, Luc; Massioni, Paolo; Kulcsár, Caroline; Raynaud, Henri-François; Ellerbroek, Brent

2013-05-01

This paper discusses the performance and cost of two computationally efficient Fourier-based tomographic wavefront reconstruction algorithms for wide-field laser guide star (LGS) adaptive optics (AO). The first algorithm is the iterative Fourier domain preconditioned conjugate gradient (FDPCG) algorithm developed by Yang et al. [Appl. Opt.45, 5281 (2006)], combined with pseudo-open-loop control (POLC). FDPCG's computational cost is proportional to N log(N), where N denotes the dimensionality of the tomography problem. The second algorithm is the distributed Kalman filter (DKF) developed by Massioni et al. [J. Opt. Soc. Am. A28, 2298 (2011)], which is a noniterative spatially invariant controller. When implemented in the Fourier domain, DKF's cost is also proportional to N log(N). Both algorithms are capable of estimating spatial frequency components of the residual phase beyond the wavefront sensor (WFS) cutoff frequency thanks to regularization, thereby reducing WFS spatial aliasing at the expense of more computations. We present performance and cost analyses for the LGS multiconjugate AO system under design for the Thirty Meter Telescope, as well as DKF's sensitivity to uncertainties in wind profile prior information. We found that, provided the wind profile is known to better than 10% wind speed accuracy and 20 deg wind direction accuracy, DKF, despite its spatial invariance assumptions, delivers a significantly reduced wavefront error compared to the static FDPCG minimum variance estimator combined with POLC. Due to its nonsequential nature and high degree of parallelism, DKF is particularly well suited for real-time implementation on inexpensive off-the-shelf graphics processing units.

Blockwise conjugate gradient methods for image reconstruction in volumetric CT.

PubMed

Qiu, W; Titley-Peloquin, D; Soleimani, M

2012-11-01

Cone beam computed tomography (CBCT) enables volumetric image reconstruction from 2D projection data and plays an important role in image guided radiation therapy (IGRT). Filtered back projection is still the most frequently used algorithm in applications. The algorithm discretizes the scanning process (forward projection) into a system of linear equations, which must then be solved to recover images from measured projection data. The conjugate gradients (CG) algorithm and its variants can be used to solve (possibly regularized) linear systems of equations Ax=b and linear least squares problems minx∥b-Ax∥2, especially when the matrix A is very large and sparse. Their applications can be found in a general CT context, but in tomography problems (e.g. CBCT reconstruction) they have not widely been used. Hence, CBCT reconstruction using the CG-type algorithm LSQR was implemented and studied in this paper. In CBCT reconstruction, the main computational challenge is that the matrix A usually is very large, and storing it in full requires an amount of memory well beyond the reach of commodity computers. Because of these memory capacity constraints, only a small fraction of the weighting matrix A is typically used, leading to a poor reconstruction. In this paper, to overcome this difficulty, the matrix A is partitioned and stored blockwise, and blockwise matrix-vector multiplications are implemented within LSQR. This implementation allows us to use the full weighting matrix A for CBCT reconstruction without further enhancing computer standards. Tikhonov regularization can also be implemented in this fashion, and can produce significant improvement in the reconstructed images. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Chiou, Jin-Chern

1990-01-01

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Preconditioned conjugate gradient wave-front reconstructors for multiconjugate adaptive optics

NASA Astrophysics Data System (ADS)

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

2003-09-01

Multiconjugate 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 wave-front 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 adaptive optics degrees of freedom. We develop scalable open-loop iterative sparse matrix implementations of minimum variance wave-front reconstruction for telescope diameters up to 32 m with more than 104 actuators. The basic approach is the preconditioned conjugate gradient method with an efficient preconditioner, whose block structure is defined by the atmospheric turbulent layers very much like the layer-oriented MCAO algorithms of current interest. Two cost-effective preconditioners are investigated: a multigrid solver and a simpler block symmetric Gauss-Seidel (BSGS) sweep. Both options require off-line sparse Cholesky factorizations of the diagonal blocks of the matrix system. The cost to precompute these factors scales approximately as the three-halves power of the number of estimated phase grid points per atmospheric layer, and their average update rate is typically of the order of 10-2 Hz, i.e., 4-5 orders of magnitude lower than the typical 103 Hz temporal sampling rate. All other computations scale almost linearly with the total number of estimated phase grid points. We present numerical simulation results to illustrate algorithm convergence. Convergence rates of both preconditioners are similar, regardless of measurement noise level, indicating that the layer-oriented BSGS sweep is as effective as the more elaborated multiresolution preconditioner.

Use of general purpose graphics processing units with MODFLOW

USGS Publications Warehouse

Hughes, Joseph D.; White, Jeremy T.

2013-01-01

To evaluate the use of general-purpose graphics processing units (GPGPUs) to improve the performance of MODFLOW, an unstructured preconditioned conjugate gradient (UPCG) solver has been developed. The UPCG solver uses a compressed sparse row storage scheme and includes Jacobi, zero fill-in incomplete, and modified-incomplete lower-upper (LU) factorization, and generalized least-squares polynomial preconditioners. The UPCG solver also includes options for sequential and parallel solution on the central processing unit (CPU) using OpenMP. For simulations utilizing the GPGPU, all basic linear algebra operations are performed on the GPGPU; memory copies between the central processing unit CPU and GPCPU occur prior to the first iteration of the UPCG solver and after satisfying head and flow criteria or exceeding a maximum number of iterations. The efficiency of the UPCG solver for GPGPU and CPU solutions is benchmarked using simulations of a synthetic, heterogeneous unconfined aquifer with tens of thousands to millions of active grid cells. Testing indicates GPGPU speedups on the order of 2 to 8, relative to the standard MODFLOW preconditioned conjugate gradient (PCG) solver, can be achieved when (1) memory copies between the CPU and GPGPU are optimized, (2) the percentage of time performing memory copies between the CPU and GPGPU is small relative to the calculation time, (3) high-performance GPGPU cards are utilized, and (4) CPU-GPGPU combinations are used to execute sequential operations that are difficult to parallelize. Furthermore, UPCG solver testing indicates GPGPU speedups exceed parallel CPU speedups achieved using OpenMP on multicore CPUs for preconditioners that can be easily parallelized.

Leveraging 35 years of Pinus taeda research in the southeastern US to constrain forest carbon cycle predictions: regional data assimilation using ecosystem experiments

Treesearch

R. Quinn Thomas; Evan B. Brooks; Annika L. Jersild; Eric J. Ward; Randolph H. Wynne; Timothy J. Albaugh; Heather Dinon-Aldridge; Harold E. Burkhart; Jean-Christophe Domec; Timothy R. Fox; Carlos A. Gonzalez-Benecke; Timothy A. Martin; Asko Noormets; David A. Sampson; Robert O. Teskey

2017-01-01

Predicting how forest carbon cycling will change in response to climate change and management depends on the collective knowledge from measurements across environmental gradients, ecosystem manipulations of global change factors, and mathematical models. Formally integrating these sources of knowledge through data assimilation, or model–data fusion, allows the use of...

Eocene greenhouse climate revealed by coupled clumped isotope-Mg/Ca thermometry.

PubMed

Evans, David; Sagoo, Navjit; Renema, Willem; Cotton, Laura J; Müller, Wolfgang; Todd, Jonathan A; Saraswati, Pratul Kumar; Stassen, Peter; Ziegler, Martin; Pearson, Paul N; Valdes, Paul J; Affek, Hagit P

2018-02-06

Past greenhouse periods with elevated atmospheric CO 2 were characterized by globally warmer sea-surface temperatures (SST). However, the extent to which the high latitudes warmed to a greater degree than the tropics (polar amplification) remains poorly constrained, in particular because there are only a few temperature reconstructions from the tropics. Consequently, the relationship between increased CO 2 , the degree of tropical warming, and the resulting latitudinal SST gradient is not well known. Here, we present coupled clumped isotope (Δ 47 )-Mg/Ca measurements of foraminifera from a set of globally distributed sites in the tropics and midlatitudes. Δ 47 is insensitive to seawater chemistry and therefore provides a robust constraint on tropical SST. Crucially, coupling these data with Mg/Ca measurements allows the precise reconstruction of Mg/Ca sw throughout the Eocene, enabling the reinterpretation of all planktonic foraminifera Mg/Ca data. The combined dataset constrains the range in Eocene tropical SST to 30-36 °C (from sites in all basins). We compare these accurate tropical SST to deep-ocean temperatures, serving as a minimum constraint on high-latitude SST. This results in a robust conservative reconstruction of the early Eocene latitudinal gradient, which was reduced by at least 32 ± 10% compared with present day, demonstrating greater polar amplification than captured by most climate models.

Characterization of a Quadrotor Unmanned Aircraft System for Aerosol-Particle-Concentration Measurements.

PubMed

Brady, James M; Stokes, M Dale; Bonnardel, Jim; Bertram, Timothy H

2016-02-02

High-spatial-resolution, near-surface vertical profiling of atmospheric chemical composition is currently limited by the availability of experimental platforms that can sample in constrained environments. As a result, measurements of near-surface gradients in trace gas and aerosol particle concentrations have been limited to studies conducted from fixed location towers or tethered balloons. Here, we explore the utility of a quadrotor unmanned aircraft system (UAS) as a sampling platform to measure vertical and horizontal concentration gradients of trace gases and aerosol particles at high spatial resolution (1 m) within the mixed layer (0-100 m). A 3D Robotics Iris+ autonomous quadrotor UAS was outfitted with a sensor package consisting of a two-channel aerosol optical particle counter and a CO2 sensor. The UAS demonstrated high precision in both vertical (±0.5 m) and horizontal positions (±1 m), highlighting the potential utility of quadrotor UAS drones for aerosol- and trace-gas measurements within complex terrain, such as the urban environment, forest canopies, and above difficult-to-access areas such as breaking surf. Vertical profiles of aerosol particle number concentrations, acquired from flights conducted along the California coastline, were used to constrain sea-spray aerosol-emission rates from coastal wave breaking.

A microfluidic chip with a staircase pH gradient generator, a packed column and a fraction collector for chromatofocusing of proteins.

PubMed

Rho, Hoon Suk; Hanke, Alexander Thomas; Ottens, Marcel; Gardeniers, Han J G E

2018-04-01

A microfluidic device for pH gradient chromatofocusing is presented, which performs creation of a micro-column, pH gradient generation, and fraction collection in a single device. Using a sieve micro-valve, anion exchange particles were packed into a microchannel in order to realize a solid-phase absorption column. To fractionate proteins according to their isoelectric points, elution buffer solutions with a stepwise pH gradient were prepared in 16 parallel mixing reactors and flowed through the micro-column, wherein a protein mixture was previously loaded. The volume of the column is only 20 nL, hence it allows extremely low sample consumption and fast analysis compared with a conventional system. We demonstrated separation of two proteins, albumin-fluorescein isothiocyanate conjugate (FITC-BSA) and R-Phycoerythrin (R-PE), by using a microcolumn of commercial charged polymeric particles (Source 15Q). The microfluidic device can be used as a rapid diagnostic tool to analyse crude mixtures of proteins or nucleic acids and determine adsorption/desorption characteristics of various biochemical products, which can be helpful for scientific fundamental understanding as well as instrumental in various industrial applications, especially in early stage screening and process development. © 2018 The Authors Electrophoresis Published by WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Functionalized Congeners of P2Y1 Receptor Antagonists:

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

de Castro, Sonia; Maruoka, Hiroshi; Hong, Kunlun

2010-01-01

The P2Y{sub 1} receptor is a prothrombotic G protein-coupled receptor (GPCR) activated by ADP. Preference for the North (N) ring conformation of the ribose moiety of adenine nucleotide 3',5'-bisphosphate antagonists of the P2Y{sub 1} receptor was established by using a ring-constrained methanocarba (a bicyclo[3.1.0]hexane) ring as a ribose substitute. A series of covalently linkable N{sup 6}-methyl-(N)-methanocarba-2'-deoxyadenosine-3',5'-bisphosphates containing extended 2-alkynyl chains was designed, and binding affinity at the human (h) P2Y{sub 1} receptor determined. The chain of these functionalized congeners contained hydrophilic moieties, a reactive substituent, or biotin, linked via an amide. Variation of the chain length and position of anmore » intermediate amide group revealed high affinity of carboxylic congener 8 (K{sub i} 23 nM) and extended amine congener 15 (K{sub i} 132 nM), both having a 2-(1-pentynoyl) group. A biotin conjugate 18 containing an extended {epsilon}-aminocaproyl spacer chain exhibited higher affinity than a shorter biotinylated analogue. Alternatively, click coupling of terminal alkynes of homologous 2-dialkynyl nucleotide derivatives to alkyl azido groups produced triazole derivatives that bound to the P2Y{sub 1} receptor following deprotection of the bisphosphate groups. The preservation of receptor affinity of the functionalized congeners was consistent with new P2Y{sub 1} receptor modeling and ligand docking. Attempted P2Y{sub 1} antagonist conjugation to PAMAM dendrimer carriers by amide formation or palladium-catalyzed reaction between an alkyne on the dendrimer and a 2-iodopurine-derivatized nucleotide was unsuccessful. A dialkynyl intermediate containing the chain length favored in receptor binding was conjugated to an azide-derivatized dendrimer, and the conjugate inhibited ADP-promoted human platelet aggregation. This is the first example of attaching a strategically functionalized P2Y receptor antagonist to a PAMAM dendrimer to produce a multivalent conjugate exhibiting a desired biological effect, i.e., antithrombotic action.« less

Structure and degree of magmatism of North and South Atlantic rifted margins

NASA Astrophysics Data System (ADS)

Faleide, Jan Inge; Breivik, Asbjørn J.; Blaich, Olav A.; Tsikalas, Filippos; Planke, Sverre; Mansour Abdelmalak, Mohamed; Mjelde, Rolf; Myklebust, Reidun

2014-05-01

The structure and evolution of conjugate rifted margins in the South and North Atlantic have been studied mainly based on seismic reflection and refraction profiles, complemented by potential field data and plate reconstructions. All margins exhibit distinct along-margin structural and magmatic changes reflecting both structural inheritance extending back to a complex pre-breakup geological history and the final breakup processes. The sedimentary basins at the conjugate margins developed as a result of multiple phases of rifting, associated with complex time-dependent thermal structure of the lithosphere. A series of conjugate crustal transects reveal tectonomagmatic asymmetry, both along-strike and across the conjugate margin systems. The continent-ocean transitional domain along the magma-dominated margin segments is characterized by a large volume of flood basalts and high-velocity/high-density lower crust emplaced during and after continental breakup. Both the volume and duration of excess magmatism varies. The extrusive and intrusive complexes make it difficult to pin down a COB to be used in plate reconstructions. The continent-ocean transition is usually well defined as a rapid increase of P-wave velocities at mid- to lower crustal levels. The transition is further constrained by comparing the mean P-wave velocity to the thickness of the crystalline crust. By this comparison we can also address the magmatic processes associated with breakup, whether they are convection dominated or temperature dominated. In the NE Atlantic there is a strong correlation between magma productivity and early plate spreading rate, suggesting a common cause. A model for the breakup-related magmatism should be able to explain this correlation, but also the magma production peak at breakup, the along-margin magmatic segmentation, and the active mantle upwelling. It is likely that mantle plumes (Iceland in the NE Atlantic, Tristan da Cunha in the South Atlantic) may have influenced the volume of magmatism but they did not necessarily alter the process of rifted margin formation, implying that parts of the margins may have much in common with more magma-poor margins. Conjugate margin segments from the North and South Atlantic will be compared and discussed with particular focus on the tectonomagmatic processes associated with continental breakup.

Parity violation constraints using cosmic microwave background polarization spectra from 2006 and 2007 observations by the QUaD polarimeter.

PubMed

Wu, E Y S; Ade, P; Bock, J; Bowden, M; Brown, M L; Cahill, G; Castro, P G; Church, S; Culverhouse, T; Friedman, R B; Ganga, K; Gear, W K; Gupta, S; Hinderks, J; Kovac, J; Lange, A E; Leitch, E; Melhuish, S J; Memari, Y; Murphy, J A; Orlando, A; Piccirillo, L; Pryke, C; Rajguru, N; Rusholme, B; Schwarz, R; O'Sullivan, C; Taylor, A N; Thompson, K L; Turner, A H; Zemcov, M

2009-04-24

We constrain parity-violating interactions to the surface of last scattering using spectra from the QUaD experiment's second and third seasons of observations by searching for a possible systematic rotation of the polarization directions of cosmic microwave background photons. We measure the rotation angle due to such a possible "cosmological birefringence" to be 0.55 degrees +/-0.82 degrees (random) +/-0.5 degrees (systematic) using QUaD's 100 and 150 GHz temperature-curl and gradient-curl spectra over the spectra over the multipole range 200

Thermoregulation in the lizard Psammodromus algirus along a 2200-m elevational gradient in Sierra Nevada (Spain).

PubMed

Zamora-Camacho, Francisco Javier; Reguera, Senda; Moreno-Rueda, Gregorio

2016-05-01

Achieving optimal body temperature maximizes animal fitness. Since ambient temperature may limit ectotherm thermal performance, it can be constrained in too cold or hot environments. In this sense, elevational gradients encompass contrasting thermal environments. In thermally pauperized elevations, ectotherms may either show adaptations or suboptimal body temperatures. Also, reproductive condition may affect thermal needs. Herein, we examined different thermal ecology and physiology capabilities of the lizard Psammodromus algirus along a 2200-m elevational gradient. We measured field (T(b)) and laboratory-preferred (T(pref)) body temperatures of lizards with different reproductive conditions, as well as ambient (T(a)) and copper-model operative temperature (T(e)), which we used to determine thermal quality of the habitat (d(e)), accuracy (d(b)), and effectiveness of thermoregulation (de-db) indexes. We detected no Tb trend in elevation, while T(a) constrained T(b) only at high elevations. Moreover, while Ta decreased more than 7 °C with elevation, T(pref) dropped only 0.6 °C, although significantly. Notably, low-elevation lizards faced excess temperature (T(e) > T(pref)). Notably, de was best at middle elevations, followed by high elevations, and poorest at low elevations. Nonetheless, regarding microhabitat, high-elevation de was more suitable in sun-exposed microhabitats, which may increase exposition to predators, and at midday, which may limit daily activity. As for gender, d(b) and d(e)-d(b) were better in females than in males. In conclusion, P. algirus seems capable to face a wide thermal range, which probably contributes to its extensive corology and makes it adaptable to climate changes.

Coastal Fish Assemblages Reflect Geological and Oceanographic Gradients Within An Australian Zootone

PubMed Central

Harvey, Euan S.; Cappo, Mike; Kendrick, Gary A.; McLean, Dianne L.

2013-01-01

Distributions of mobile animals have been shown to be heavily influenced by habitat and climate. We address the historical and contemporary context of fish habitats within a major zootone: the Recherche Archipelago, southern western Australia. Baited remote underwater video systems were set in nine habitat types within three regions to determine the species diversity and relative abundance of bony fishes, sharks and rays. Constrained ordinations and multivariate prediction and regression trees were used to examine the effects of gradients in longitude, depth, distance from islands and coast, and epibenthic habitat on fish assemblage composition. A total of 90 species from 43 families were recorded from a wide range of functional groups. Ordination accounted for 19% of the variation in the assemblage composition when constrained by spatial and epibenthic covariates, and identified redundancy in the use of distance from the nearest emergent island as a predictor. A spatial hierarchy of fourteen fish assemblages was identified using multivariate prediction and regression trees, with the primary split between assemblages on macroalgal reefs, and those on bare or sandy habitats supporting seagrass beds. The characterisation of indicator species for assemblages within the hierarchy revealed important faunal break in fish assemblages at 122.30 East at Cape Le Grand and subtle niche partitioning amongst species within the labrids and monacanthids. For example, some species of monacanthids were habitat specialists and predominantly found on seagrass (Acanthaluteres vittiger, Scobinichthys granulatus), reef (Meuschenia galii, Meuschenia hippocrepis) or sand habitats (Nelusetta ayraudi). Predatory fish that consume molluscs, crustaceans and cephalopods were dominant with evidence of habitat generalisation in reef species to cope with local disturbances by wave action. Niche separation within major genera, and a sub-regional faunal break, indicate future zootone mapping should recognise both cross-shelf and longshore environmental gradients. PMID:24278353

Compressed sensing with gradient total variation for low-dose CBCT reconstruction

NASA Astrophysics Data System (ADS)

Seo, Chang-Woo; Cha, Bo Kyung; Jeon, Seongchae; Huh, Young; Park, Justin C.; Lee, Byeonghun; Baek, Junghee; Kim, Eunyoung

2015-06-01

This paper describes the improvement of convergence speed with gradient total variation (GTV) in compressed sensing (CS) for low-dose cone-beam computed tomography (CBCT) reconstruction. We derive a fast algorithm for the constrained total variation (TV)-based a minimum number of noisy projections. To achieve this task we combine the GTV with a TV-norm regularization term to promote an accelerated sparsity in the X-ray attenuation characteristics of the human body. The GTV is derived from a TV and enforces more efficient computationally and faster in convergence until a desired solution is achieved. The numerical algorithm is simple and derives relatively fast convergence. We apply a gradient projection algorithm that seeks a solution iteratively in the direction of the projected gradient while enforcing a non-negatively of the found solution. In comparison with the Feldkamp, Davis, and Kress (FDK) and conventional TV algorithms, the proposed GTV algorithm showed convergence in ≤18 iterations, whereas the original TV algorithm needs at least 34 iterations in reducing 50% of the projections compared with the FDK algorithm in order to reconstruct the chest phantom images. Future investigation includes improving imaging quality, particularly regarding X-ray cone-beam scatter, and motion artifacts of CBCT reconstruction.

Guiding neuron development with planar surface gradients of substrate cues deposited using microfluidic devices.

PubMed

Millet, Larry J; Stewart, Matthew E; Nuzzo, Ralph G; Gillette, Martha U

2010-06-21

Wiring the nervous system relies on the interplay of intrinsic and extrinsic signaling molecules that control neurite extension, neuronal polarity, process maturation and experience-dependent refinement. Extrinsic signals establish and enrich neuron-neuron interactions during development. Understanding how such extrinsic cues direct neurons to establish neural connections in vitro will facilitate the development of organized neural networks for investigating the development and function of nervous system networks. Producing ordered networks of neurons with defined connectivity in vitro presents special technical challenges because the results must be compliant with the biological requirements of rewiring neural networks. Here we demonstrate the ability to form stable, instructive surface-bound gradients of laminin that guide postnatal hippocampal neuron development in vitro. Our work uses a three-channel, interconnected microfluidic device that permits the production of adlayers of planar substrates through the combination of laminar flow, diffusion and physisorption. Through simple flow modifications, a variety of patterns and gradients of laminin (LN) and fluorescein isothiocyanate-conjugated poly-l-lysine (FITC-PLL) were deposited to present neurons with an instructive substratum to guide neuronal development. We present three variations in substrate design that produce distinct growth regimens for postnatal neurons in dispersed cell cultures. In the first approach, diffusion-mediated gradients of LN were formed on cover slips to guide neurons toward increasing LN concentrations. In the second approach, a combined gradient of LN and FITC-PLL was produced using aspiration-driven laminar flow to restrict neuronal growth to a 15 microm wide growth zone at the center of the two superimposed gradients. The last approach demonstrates the capacity to combine binary lines of FITC-PLL in conjunction with surface gradients of LN and bovine serum albumin (BSA) to produce substrate adlayers that provide additional levels of control over growth. This work demonstrates the advantages of spatio-temporal fluid control for patterning surface-bound gradients using a simple microfluidics-based substrate deposition procedure. We anticipate that this microfluidics-based patterning approach will provide instructive patterns and surface-bound gradients to enable a new level of control in guiding neuron development and network formation.

Constrained growth flips the direction of optimal phenological responses among annual plants.

PubMed

Lindh, Magnus; Johansson, Jacob; Bolmgren, Kjell; Lundström, Niklas L P; Brännström, Åke; Jonzén, Niclas

2016-03-01

Phenological changes among plants due to climate change are well documented, but often hard to interpret. In order to assess the adaptive value of observed changes, we study how annual plants with and without growth constraints should optimize their flowering time when productivity and season length changes. We consider growth constraints that depend on the plant's vegetative mass: self-shading, costs for nonphotosynthetic structural tissue and sibling competition. We derive the optimal flowering time from a dynamic energy allocation model using optimal control theory. We prove that an immediate switch (bang-bang control) from vegetative to reproductive growth is optimal with constrained growth and constant mortality. Increasing mean productivity, while keeping season length constant and growth unconstrained, delayed the optimal flowering time. When growth was constrained and productivity was relatively high, the optimal flowering time advanced instead. When the growth season was extended equally at both ends, the optimal flowering time was advanced under constrained growth and delayed under unconstrained growth. Our results suggests that growth constraints are key factors to consider when interpreting phenological flowering responses. It can help to explain phenological patterns along productivity gradients, and links empirical observations made on calendar scales with life-history theory. © 2015 The Authors. New Phytologist © 2015 New Phytologist Trust.

An improved conjugate gradient scheme to the solution of least squares SVM.

PubMed

Chu, Wei; Ong, Chong Jin; Keerthi, S Sathiya

2005-03-01

The least square support vector machines (LS-SVM) formulation corresponds to the solution of a linear system of equations. Several approaches to its numerical solutions have been proposed in the literature. In this letter, we propose an improved method to the numerical solution of LS-SVM and show that the problem can be solved using one reduced system of linear equations. Compared with the existing algorithm for LS-SVM, the approach used in this letter is about twice as efficient. Numerical results using the proposed method are provided for comparisons with other existing algorithms.

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.

Subauditory Speech Recognition based on EMG/EPG Signals

NASA Technical Reports Server (NTRS)

Jorgensen, Charles; Lee, Diana Dee; Agabon, Shane; Lau, Sonie (Technical Monitor)

2003-01-01

Sub-vocal electromyogram/electro palatogram (EMG/EPG) signal classification is demonstrated as a method for silent speech recognition. Recorded electrode signals from the larynx and sublingual areas below the jaw are noise filtered and transformed into features using complex dual quad tree wavelet transforms. Feature sets for six sub-vocally pronounced words are trained using a trust region scaled conjugate gradient neural network. Real time signals for previously unseen patterns are classified into categories suitable for primitive control of graphic objects. Feature construction, recognition accuracy and an approach for extension of the technique to a variety of real world application areas are presented.

Numerical Simulation of Convective Heat and Mass Transfer in a Two-Layer System

NASA Astrophysics Data System (ADS)

Myznikova, B. I.; Kazaryan, V. A.; Tarunin, E. L.; Wertgeim, I. I.

The results are presented of mathematical and computer modeling of natural convection in the “liquid-gas” two-layer system, filling a vertical cylinder surrounded by solid heat conductive tract. The model describes approximately the conjugate heat and mass transfer in the underground oil product storage, filled partially by a hydrocarbon liquid, with natural gas layer above the liquid surface. The geothermal gradient in a rock mass gives rise to the intensive convection in the liquid-gas system. The consideration is worked out for laminar flows, laminar-turbulent transitional regimes, and developed turbulent flows.

3D near-to-surface conductivity reconstruction by inversion of VETEM data using the distorted Born iterative method

USGS Publications Warehouse

Wang, G.L.; Chew, W.C.; Cui, T.J.; Aydiner, A.A.; Wright, D.L.; Smith, D.V.

2004-01-01

Three-dimensional (3D) subsurface imaging by using inversion of data obtained from the very early time electromagnetic system (VETEM) was discussed. The study was carried out by using the distorted Born iterative method to match the internal nonlinear property of the 3D inversion problem. The forward solver was based on the total-current formulation bi-conjugate gradient-fast Fourier transform (BCCG-FFT). It was found that the selection of regularization parameter follow a heuristic rule as used in the Levenberg-Marquardt algorithm so that the iteration is stable.

An exterior Poisson solver using fast direct methods and boundary integral equations with applications to nonlinear potential flow

NASA Technical Reports Server (NTRS)

Young, D. P.; Woo, A. C.; Bussoletti, J. E.; Johnson, F. T.

1986-01-01

A general method is developed combining fast direct methods and boundary integral equation methods to solve Poisson's equation on irregular exterior regions. The method requires O(N log N) operations where N is the number of grid points. Error estimates are given that hold for regions with corners and other boundary irregularities. Computational results are given in the context of computational aerodynamics for a two-dimensional lifting airfoil. Solutions of boundary integral equations for lifting and nonlifting aerodynamic configurations using preconditioned conjugate gradient are examined for varying degrees of thinness.

Complexity of parallel implementation of domain decomposition techniques for elliptic partial differential equations

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

Gropp, W.D.; Keyes, D.E.

1988-03-01

The authors discuss the parallel implementation of preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions on several architectures. The complexity of these methods is described on a variety of message-passing parallel computers as a function of the size of the problem, number of processors and relative communication speeds of the processors. They show that communication startups are very important, and that even the small amount of global communication in these methods can significantly reduce the performance of many message-passing architectures.

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.

Improving Robot Locomotion Through Learning Methods for Expensive Black-Box Systems

DTIC Science & Technology

2013-11-01

development of a class of “gradient free” optimization techniques; these include local approaches, such as a Nelder- Mead simplex search (c.f. [73]), and global...1Note that this simple method differs from the Nelder Mead constrained nonlinear optimization method [73]. 39 the Non-dominated Sorting Genetic Algorithm...Kober, and Jan Peters. Model-free inverse reinforcement learning. In International Conference on Artificial Intelligence and Statistics, 2011. [12] George

Thermo-hydraulics of the Peruvian accretionary complex at 12°S

USGS Publications Warehouse

Kukowski, Nina; Pecher, Ingo

1999-01-01

The models were constrained by the thermal gradient obtained from the depth of bottomsimulating reflectors (BSRs) at the lower slope and some conventional measurements. We foundthat significant frictional heating is required to explain the observed strong landward increase ofheat flux. This is consistent with results from sandbox modelling which predict strong basalfriction at this margin. A significantly higher heat source is needed to match the observed thermalgradient in the southern line.

Gradient Projection Anti-windup Scheme on Constrained Planar LTI Systems

DTIC Science & Technology

2010-03-15

was recognized as a largely open problem in a recent survey paper . This report analyzes the properties of the GPAW scheme applied to an input...recent survey paper [2] that anti- windup compensation for nonlinear systems remains largely an open problem. To this end, [3] and relevant references...controllers, the solution of which was recognized as a largely open problem in a recent survey paper . This report analyzes the properties of the GPAW

Adaptive Constrained Optimal Control Design for Data-Based Nonlinear Discrete-Time Systems With Critic-Only Structure.

PubMed

Luo, Biao; Liu, Derong; Wu, Huai-Ning

2018-06-01

Reinforcement learning has proved to be a powerful tool to solve optimal control problems over the past few years. However, the data-based constrained optimal control problem of nonaffine nonlinear discrete-time systems has rarely been studied yet. To solve this problem, an adaptive optimal control approach is developed by using the value iteration-based Q-learning (VIQL) with the critic-only structure. Most of the existing constrained control methods require the use of a certain performance index and only suit for linear or affine nonlinear systems, which is unreasonable in practice. To overcome this problem, the system transformation is first introduced with the general performance index. Then, the constrained optimal control problem is converted to an unconstrained optimal control problem. By introducing the action-state value function, i.e., Q-function, the VIQL algorithm is proposed to learn the optimal Q-function of the data-based unconstrained optimal control problem. The convergence results of the VIQL algorithm are established with an easy-to-realize initial condition . To implement the VIQL algorithm, the critic-only structure is developed, where only one neural network is required to approximate the Q-function. The converged Q-function obtained from the critic-only VIQL method is employed to design the adaptive constrained optimal controller based on the gradient descent scheme. Finally, the effectiveness of the developed adaptive control method is tested on three examples with computer simulation.

Characterization of Thin Film Materials using SCAN meta-GGA, an Accurate Nonempirical Density Functional

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

Buda, I. G.; Lane, C.; Barbiellini, B.

We discuss self-consistently obtained ground-state electronic properties of monolayers of graphene and a number of ’beyond graphene’ compounds, including films of transition-metal dichalcogenides (TMDs), using the recently proposed strongly constrained and appropriately normed (SCAN) meta-generalized gradient approximation (meta-GGA) to the density functional theory. The SCAN meta-GGA results are compared with those based on the local density approximation (LDA) as well as the generalized gradient approximation (GGA). As expected, the GGA yields expanded lattices and softened bonds in relation to the LDA, but the SCAN meta-GGA systematically improves the agreement with experiment. Our study suggests the efficacy of the SCAN functionalmore » for accurate modeling of electronic structures of layered materials in high-throughput calculations more generally.« less

Characterization of Thin Film Materials using SCAN meta-GGA, an Accurate Nonempirical Density Functional

DOE PAGES

Buda, I. G.; Lane, C.; Barbiellini, B.; ...

2017-03-23

We discuss self-consistently obtained ground-state electronic properties of monolayers of graphene and a number of ’beyond graphene’ compounds, including films of transition-metal dichalcogenides (TMDs), using the recently proposed strongly constrained and appropriately normed (SCAN) meta-generalized gradient approximation (meta-GGA) to the density functional theory. The SCAN meta-GGA results are compared with those based on the local density approximation (LDA) as well as the generalized gradient approximation (GGA). As expected, the GGA yields expanded lattices and softened bonds in relation to the LDA, but the SCAN meta-GGA systematically improves the agreement with experiment. Our study suggests the efficacy of the SCAN functionalmore » for accurate modeling of electronic structures of layered materials in high-throughput calculations more generally.« less

Enhanced pulmonary absorption of a macromolecule through coupling to a sequence-specific phage display-derived peptide.

PubMed

Morris, Christopher J; Smith, Mathew W; Griffiths, Peter C; McKeown, Neil B; Gumbleton, Mark

2011-04-10

With the aim of identifying a peptide sequence that promotes pulmonary epithelial transport of macromolecule cargo we used a stringent peptide-phage display library screening protocol against rat lung alveolar epithelial primary cell cultures. We identified a peptide-phage clone (LTP-1) displaying the disulphide-constrained 7-mer peptide sequence, C-TSGTHPR-C, that showed significant pulmonary epithelial translocation across highly restrictive polarised cell monolayers. Cell biological data supported a differential alveolar epithelial cell interaction of the LTP-1 peptide-phage clone and the corresponding free synthetic LTP-1 peptide. Delivering select phage-clones to the intact pulmonary barrier of an isolated perfused rat lung (IPRL) resulted in 8.7% of lung deposited LTP-1 peptide-phage clone transported from the IPRL airways to the vasculature compared (p<0.05) to the cumulative transport of less than 0.004% for control phage-clone groups. To characterise phage-independent activity of LTP-1 peptide, the LTP-1 peptide was conjugated to a 53kDa anionic PAMAM dendrimer. Compared to respective peptide-dendrimer control conjugates, the LTP-1-PAMAM conjugate displayed a two-fold (bioavailability up to 31%) greater extent of absorption in the IPRL. The LTP-1 peptide-mediated enhancement of transport, when LTP-1 was either attached to the phage clone or conjugated to dendrimer, was sequence-dependent and could be competitively inhibited by co-instillation of excess synthetic free LTP-1 peptide. The specific nature of the target receptor or mechanism involved in LTP-1 lung transport remains unclear although the enhanced transport is enabled through a mechanism that is non-disruptive with respect to the pulmonary transport of hydrophilic permeability probes. This study shows proof-of principle that array technologies can be effectively exploited to identify peptides mediating enhanced transmucosal delivery of macromolecule therapeutics across an intact organ. Copyright © 2010 Elsevier B.V. All rights reserved.

Appearance and distribution of surface proteins of the human erythrocyte membrane. An electron microscope and immunochemical labeling study

PubMed Central

Shotton, D.; Thompson, K.; Wofsy, L.; Branton, D.

1978-01-01

We have used freeze-etching, before and after immunoferritin labeling, to visualize spectrin molecules and other surface proteins of the human erythrocyte membrane. After intramembrane particle aggregation was induced, spectrin molecules, identified by labeling with ferritin-conjugated antispectrin, were clustered on the cytoplasmic surface of the membrane in patches directly underlying the particle clusters. This labeling pattern confirms the involvement of spectrin in such particle aggregates, as previously inferred from indirect evidence. Ferritin-conjugated antihapten molecules, directed against external and cytoplasmic surface proteins of the erythrocyte membrane which had been covalently labeled nonspecifically with the hapten p-diazoniumphenyl-beta-D-lactoside, were similarly found in direct association with such intramembrane particle aggregates. This indicates that when spectrin and the intramembrane particles are aggregated, all the major proteins of the erythrocyte membrane are constrained to coaggregate with them. Although giving no direct information concerning the freedom of translational movement of proteins in the unperturbed erythrocyte membrane, these experiments suggest that a close dynamic association may exist between the integral and peripheral protein components of the membrane, such that immobilization of one component can restrict the lateral mobility of others. PMID:10605454

Simultaneous inhibition of key growth pathways in melanoma cells and tumor regression by a designed bidentate constrained helical peptide.

PubMed

Dhar, Amlanjyoti; Mallick, Shampa; Ghosh, Piya; Maiti, Atanu; Ahmed, Israr; Bhattacharya, Seemana; Mandal, Tapashi; Manna, Asit; Roy, Koushik; Singh, Sandeep; Nayak, Dipak Kumar; Wilder, Paul T; Markowitz, Joseph; Weber, David; Ghosh, Mrinal K; Chattopadhyay, Samit; Guha, Rajdeep; Konar, Aditya; Bandyopadhyay, Santu; Roy, Siddhartha

2014-07-01

Protein-protein interactions are part of a large number of signaling networks and potential targets for drug development. However, discovering molecules that can specifically inhibit such interactions is a major challenge. S100B, a calcium-regulated protein, plays a crucial role in the proliferation of melanoma cells through protein-protein interactions. In this article, we report the design and development of a bidentate conformationally constrained peptide against dimeric S100B based on a natural tight-binding peptide, TRTK-12. The helical conformation of the peptide was constrained by the substitution of α-amino isobutyric acid--an amino acid having high helical propensity--in positions which do not interact with S100B. A branched bidentate version of the peptide was bound to S100B tightly with a dissociation constant of 8 nM. When conjugated to a cell-penetrating peptide, it caused growth inhibition and rapid apoptosis in melanoma cells. The molecule exerts antiproliferative action through simultaneous inhibition of key growth pathways, including reactivation of wild-type p53 and inhibition of Akt and STAT3 phosphorylation. The apoptosis induced by the bidentate constrained helix is caused by direct migration of p53 to mitochondria. At moderate intravenous dose, the peptide completely inhibits melanoma growth in a mouse model without any significant observable toxicity. The specificity was shown by lack of ability of a double mutant peptide to cause tumor regression at the same dose level. The methodology described here for direct protein-protein interaction inhibition may be effective for rapid development of inhibitors against relatively weak protein-protein interactions for de novo drug development. © 2014 Wiley Periodicals, Inc.

Development of a gradient elution high-performance liquid chromatography assay with ultraviolet detection for the determination in plasma of the anticancer peptide [Arg6, D-Trp7,9, mePhe8]-substance P (6-11) (antagonist G), its major metabolites and a C-terminal pyrene-labelled conjugate.

PubMed

Cummings, J; MacLellan, A J; Mark, M; Jodrell, D I

1999-09-24

[Arg6, D-Trp7,9 mePhe8]-substance P (6-11), code-named antagonist G, is a novel peptide currently undergoing early clinical trials as an anticancer drug. A sensitive, high efficiency high-performance liquid chromatography (HPLC) method is described for the determination in human plasma of antagonist G and its three major metabolites, deamidated-G (M1), G-minus Met11 (M2) and G[Met11(O)] (M3). Gradient elution was employed using 40 mM ammonium acetate in 0.15% trifluoroacetic acid as buffer A and acetonitrile as solvent B, with a linear gradient increasing from 30 to 100% B over 15 min, together with a microbore analytical column (microBondapak C18, 30 cm X 2 mm I.D.). Detection was by UV at 280 nm and the column was maintained at 40 degrees C. Retention times varied by <1% throughout the day and were as follows: G, 13.0 min; M1, 12.2 min; M2, 11.2 min; M3, 10.8 min, and 18.1 min for a pyrene conjugate of G (G-P). The limit of detection on column (LOD) was 2.5 ng for antagonist G, M1-3 and G-P and the limit of quantitation (LOQ) was 20 ng/ml for G and 100 ng/ml for M1-3. Sample clean-up by solid-phase extraction using C2-bonded 40 microm silica particles (Bond Elut, 1 ml reservoirs) resulted in elimination of interference from plasma constituents. Within-day and between-day precision and accuracy over a broad range of concentrations (100 ng/ml-100 microg/ml) normally varied by < 10%, although at the highest concentrations of M1 and M2 studied (50 microg/ml), increased variability and reduced recovery were observed. The new assay will aid in the clinical development of antagonist G.

Effectiveness of tobramycin conjugated to iron oxide nanoparticles in treating infection in cystic fibrosis

NASA Astrophysics Data System (ADS)

Brandt, Yekaterina I.; Armijo, Leisha M.; Rivera, Antonio C.; Plumley, John B.; Cook, Nathaniel C.; Smolyakov, Gennady A.; Smyth, Hugh D. C.; Osiński, Marek

2013-02-01

Cystic fibrosis (CF) is an inherited childhood-onset life-shortening disease. It is characterized by increased respiratory production, leading to airway obstruction, chronic lung infection and inflammatory reactions. The most common bacteria causing persisting infections in people with CF is Pseudomonas aeruginosa. Superparamagnetic Fe3O4 iron oxide nanoparticles (NPs) conjugated to the antibiotic (tobramycin), guided by a gradient of the magnetic field or subjected to an oscillating magnetic field, show promise in improving the drug delivery across the mucus and P. aeruginosa biofilm to the bacteria. The question remains whether tobramycin needs to be released from the NPs after the penetration of the mucus barrier in order to act upon the pathogenic bacteria. We used a zero-length 1-ethyl-3-[3-dimethylaminopropyl] carbodiimide hydrochloride (EDC) crosslinking agent to couple tobramycin, via its amine groups, to the carboxyl groups on Fe3O4 NPs capped with citric acid. The therapeutic efficiency of Fe3O4 NPs attached to the drug versus that of the free drug was investigated in P. aeruginosa culture.

Third Law of Thermodynamics and The Shape of the Phase Diagram for Systems With a First-Order Quantum Phase Transition.

PubMed

Kirkpatrick, T R; Belitz, D

2015-07-10

The third law of thermodynamics constrains the phase diagram of systems with a first-order quantum phase transition. For a zero conjugate field, the coexistence curve has an infinite slope at T=0. If a tricritical point exists at T>0, then the associated tricritical wings are perpendicular to the T=0 plane, but not to the zero-field plane. These results are based on the third law and basic thermodynamics only, and are completely general. As an explicit example we consider the ferromagnetic quantum phase transition in clean metals, where a first-order quantum phase transition is commonly observed.

Demonstration of nuclear compartmentalization of glutathione in hepatocytes.

PubMed Central

Bellomo, G; Vairetti, M; Stivala, L; Mirabelli, F; Richelmi, P; Orrenius, S

1992-01-01

The intracellular distribution of glutathione (GSH) in cultured hepatocytes has been investigated by using the compound monochlorobimane (BmCl), which interacts specifically with GSH to form a highly fluorescent adduct. Image analysis of BmCl-labeled hepatocytes predominantly localized the fluorescence in the nucleus; the nuclear/cytoplasmic concentration gradient was approximately three. This concentration gradient was collapsed by treatment of the cells with ATP-depleting agents. The uneven distribution of BmCl fluorescence was not attributable to (i) nonspecific interaction of BmCl with protein sulfhydryl groups, (ii) any selective nuclear localization of the GSH transferase(s) catalyzing formation of the GSH-BmCl conjugate, or (iii) any apparent alterations in cell morphology from culture conditions, suggesting that this distribution did, indeed, reflect a nuclear compartmentalization of GSH. That the nuclear pool of GSH was found more resistant to depletion by several agents than the cytoplasmic pool supports the assumption that GSH is essential in protecting DNA and other nuclear structures from chemical injury. Images PMID:1584774

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.

The unidirectional motion of two heat-conducting liquids in a flat channel

NASA Astrophysics Data System (ADS)

Andreev, V. K.; Cheremnykh, E. N.

2017-10-01

The unidirectional motion of two viscous incompressible liquids in a flat channel is studied. Liquids contact on a flat interface. External boundaries are fixed solid walls, on which the non-stationary temperature gradients are given. The motion is induced by a joint action of thermogravitational and thermocapillary forces and given total non - stationary fluid flow rate in layers. The corresponding initial boundary value problem is conjugate and inverse because the pressure gradients along axes channel have to be determined together with the velocity and temperature field. For this problem the exact stationary solution is found and a priori estimates of non - stationary solutions are obtained. In Laplace images the solution of the non - stationary problem is found in quadratures. It is proved, that the solution converges to a steady regime with time, if the temperature on the walls and the fluid flow rate are stabilized. The numerical calculations for specific liquid media good agree with the theoretical results.

Ion-exchange chromatography for the characterization of biopharmaceuticals.

PubMed

Fekete, Szabolcs; Beck, Alain; Veuthey, Jean-Luc; Guillarme, Davy

2015-09-10

Ion-exchange chromatography (IEX) is a historical technique widely used for the detailed characterization of therapeutic proteins and can be considered as a reference and powerful technique for the qualitative and quantitative evaluation of charge heterogeneity. The goal of this review is to provide an overview of theoretical and practical aspects of modern IEX applied for the characterization of therapeutic proteins including monoclonal antibodies (Mabs) and antibody drug conjugates (ADCs). The section on method development describes how to select a suitable stationary phase chemistry and dimensions, the mobile phase conditions (pH, nature and concentration of salt), as well as the temperature and flow rate, considering proteins isoelectric point (pI). In addition, both salt-gradient and pH-gradient approaches were critically reviewed and benefits as well as limitations of these two strategies were provided. Finally, several applications, mostly from pharmaceutical industries, illustrate the potential of IEX for the characterization of charge variants of various types of biopharmaceutical products. Copyright © 2015 Elsevier B.V. All rights reserved.

Structure of neutron star crusts from new Skyrme effective interactions constrained by chiral effective field theory

NASA Astrophysics Data System (ADS)

Lim, Yeunhwan; Holt, Jeremy W.

2017-06-01

We investigate the structure of neutron star crusts, including the crust-core boundary, based on new Skyrme mean field models constrained by the bulk-matter equation of state from chiral effective field theory and the ground-state energies of doubly-magic nuclei. Nuclear pasta phases are studied using both the liquid drop model as well as the Thomas-Fermi approximation. We compare the energy per nucleon for each geometry (spherical nuclei, cylindrical nuclei, nuclear slabs, cylindrical holes, and spherical holes) to obtain the ground state phase as a function of density. We find that the size of the Wigner-Seitz cell depends strongly on the model parameters, especially the coefficients of the density gradient interaction terms. We employ also the thermodynamic instability method to check the validity of the numerical solutions based on energy comparisons.

Preconditioned conjugate gradient wave-front reconstructors for multiconjugate adaptive optics.

PubMed

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

2003-09-10

Multiconjugate adaptive optics (MCAO) systems with 10(4)-10(5) 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 adaptive optics degrees of freedom. We develop scalable open-loop iterative sparse matrix implementations of minimum variance wave-front reconstruction for telescope diameters up to 32 m with more than 10(4) actuators. The basic approach is the preconditioned conjugate gradient method with an efficient preconditioner, whose block structure is defined by the atmospheric turbulent layers very much like the layer-oriented MCAO algorithms of current interest. Two cost-effective preconditioners are investigated: a multigrid solver and a simpler block symmetric Gauss-Seidel (BSGS) sweep. Both options require off-line sparse Cholesky factorizations of the diagonal blocks of the matrix system. The cost to precompute these factors scales approximately as the three-halves power of the number of estimated phase grid points per atmospheric layer, and their average update rate is typically of the order of 10(-2) Hz, i.e., 4-5 orders of magnitude lower than the typical 10(3) Hz temporal sampling rate. All other computations scale almost linearly with the total number of estimated phase grid points. We present numerical simulation results to illustrate algorithm convergence. Convergence rates of both preconditioners are similar, regardless of measurement noise level, indicating that the layer-oriented BSGS sweep is as effective as the more elaborated multiresolution preconditioner.

Direct reconstruction of cardiac PET kinetic parametric images using a preconditioned conjugate gradient approach

PubMed Central

Rakvongthai, Yothin; Ouyang, Jinsong; Guerin, Bastien; Li, Quanzheng; Alpert, Nathaniel M.; El Fakhri, Georges

2013-01-01

Purpose: Our research goal is to develop an algorithm to reconstruct cardiac positron emission tomography (PET) kinetic parametric images directly from sinograms and compare its performance with the conventional indirect approach. Methods: Time activity curves of a NCAT phantom were computed according to a one-tissue compartmental kinetic model with realistic kinetic parameters. The sinograms at each time frame were simulated using the activity distribution for the time frame. The authors reconstructed the parametric images directly from the sinograms by optimizing a cost function, which included the Poisson log-likelihood and a spatial regularization terms, using the preconditioned conjugate gradient (PCG) algorithm with the proposed preconditioner. The proposed preconditioner is a diagonal matrix whose diagonal entries are the ratio of the parameter and the sensitivity of the radioactivity associated with parameter. The authors compared the reconstructed parametric images using the direct approach with those reconstructed using the conventional indirect approach. Results: At the same bias, the direct approach yielded significant relative reduction in standard deviation by 12%–29% and 32%–70% for 50 × 106 and 10 × 106 detected coincidences counts, respectively. Also, the PCG method effectively reached a constant value after only 10 iterations (with numerical convergence achieved after 40–50 iterations), while more than 500 iterations were needed for CG. Conclusions: The authors have developed a novel approach based on the PCG algorithm to directly reconstruct cardiac PET parametric images from sinograms, and yield better estimation of kinetic parameters than the conventional indirect approach, i.e., curve fitting of reconstructed images. The PCG method increases the convergence rate of reconstruction significantly as compared to the conventional CG method. PMID:24089922

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.

First Applications of the New Parallel Krylov Solver for MODFLOW on a National and Global Scale

NASA Astrophysics Data System (ADS)

Verkaik, J.; Hughes, J. D.; Sutanudjaja, E.; van Walsum, P.

2016-12-01

Integrated high-resolution hydrologic models are increasingly being used for evaluating water management measures at field scale. Their drawbacks are large memory requirements and long run times. Examples of such models are The Netherlands Hydrological Instrument (NHI) model and the PCRaster Global Water Balance (PCR-GLOBWB) model. Typical simulation periods are 30-100 years with daily timesteps. The NHI model predicts water demands in periods of drought, supporting operational and long-term water-supply decisions. The NHI is a state-of-the-art coupling of several models: a 7-layer MODFLOW groundwater model ( 6.5M 250m cells), a MetaSWAP model for the unsaturated zone (Richards emulator of 0.5M cells), and a surface water model (MOZART-DM). The PCR-GLOBWB model provides a grid-based representation of global terrestrial hydrology and this work uses the version that includes a 2-layer MODFLOW groundwater model ( 4.5M 10km cells). The Parallel Krylov Solver (PKS) speeds up computation by both distributed memory parallelization (Message Passing Interface) and shared memory parallelization (Open Multi-Processing). PKS includes conjugate gradient, bi-conjugate gradient stabilized, and generalized minimal residual linear accelerators that use an overlapping additive Schwarz domain decomposition preconditioner. PKS can be used for both structured and unstructured grids and has been fully integrated in MODFLOW-USG using METIS partitioning and in iMODFLOW using RCB partitioning. iMODFLOW is an accelerated version of MODFLOW-2005 that is implicitly and online coupled to MetaSWAP. Results for benchmarks carried out on the Cartesius Dutch supercomputer (https://userinfo.surfsara.nl/systems/cartesius) for the PCRGLOB-WB model and on a 2x16 core Windows machine for the NHI model show speedups up to 10-20 and 5-10, respectively.

A nonrecursive order N preconditioned conjugate gradient: Range space formulation of MDOF dynamics

NASA Technical Reports Server (NTRS)

Kurdila, Andrew J.

1990-01-01

While excellent progress has been made in deriving algorithms that are efficient for certain combinations of system topologies and concurrent multiprocessing hardware, several issues must be resolved to incorporate transient simulation in the control design process for large space structures. Specifically, strategies must be developed that are applicable to systems with numerous degrees of freedom. In addition, the algorithms must have a growth potential in that they must also be amenable to implementation on forthcoming parallel system architectures. For mechanical system simulation, this fact implies that algorithms are required that induce parallelism on a fine scale, suitable for the emerging class of highly parallel processors; and transient simulation methods must be automatically load balancing for a wider collection of system topologies and hardware configurations. These problems are addressed by employing a combination range space/preconditioned conjugate gradient formulation of multi-degree-of-freedom dynamics. The method described has several advantages. In a sequential computing environment, the method has the features that: by employing regular ordering of the system connectivity graph, an extremely efficient preconditioner can be derived from the 'range space metric', as opposed to the system coefficient matrix; because of the effectiveness of the preconditioner, preliminary studies indicate that the method can achieve performance rates that depend linearly upon the number of substructures, hence the title 'Order N'; and the method is non-assembling. Furthermore, the approach is promising as a potential parallel processing algorithm in that the method exhibits a fine parallel granularity suitable for a wide collection of combinations of physical system topologies/computer architectures; and the method is easily load balanced among processors, and does not rely upon system topology to induce parallelism.

Direct reconstruction of cardiac PET kinetic parametric images using a preconditioned conjugate gradient approach.

PubMed

Rakvongthai, Yothin; Ouyang, Jinsong; Guerin, Bastien; Li, Quanzheng; Alpert, Nathaniel M; El Fakhri, Georges

2013-10-01

Our research goal is to develop an algorithm to reconstruct cardiac positron emission tomography (PET) kinetic parametric images directly from sinograms and compare its performance with the conventional indirect approach. Time activity curves of a NCAT phantom were computed according to a one-tissue compartmental kinetic model with realistic kinetic parameters. The sinograms at each time frame were simulated using the activity distribution for the time frame. The authors reconstructed the parametric images directly from the sinograms by optimizing a cost function, which included the Poisson log-likelihood and a spatial regularization terms, using the preconditioned conjugate gradient (PCG) algorithm with the proposed preconditioner. The proposed preconditioner is a diagonal matrix whose diagonal entries are the ratio of the parameter and the sensitivity of the radioactivity associated with parameter. The authors compared the reconstructed parametric images using the direct approach with those reconstructed using the conventional indirect approach. At the same bias, the direct approach yielded significant relative reduction in standard deviation by 12%-29% and 32%-70% for 50 × 10(6) and 10 × 10(6) detected coincidences counts, respectively. Also, the PCG method effectively reached a constant value after only 10 iterations (with numerical convergence achieved after 40-50 iterations), while more than 500 iterations were needed for CG. The authors have developed a novel approach based on the PCG algorithm to directly reconstruct cardiac PET parametric images from sinograms, and yield better estimation of kinetic parameters than the conventional indirect approach, i.e., curve fitting of reconstructed images. The PCG method increases the convergence rate of reconstruction significantly as compared to the conventional CG method.

Multigrid Methods for the Computation of Propagators in Gauge Fields

NASA Astrophysics Data System (ADS)

Kalkreuter, Thomas

Multigrid methods were invented for the solution of discretized partial differential equations in order to overcome the slowness of traditional algorithms by updates on various length scales. In the present work generalizations of multigrid methods for propagators in gauge fields are investigated. Gauge fields are incorporated in algorithms in a covariant way. The kernel C of the restriction operator which averages from one grid to the next coarser grid is defined by projection on the ground-state of a local Hamiltonian. The idea behind this definition is that the appropriate notion of smoothness depends on the dynamics. The ground-state projection choice of C can be used in arbitrary dimension and for arbitrary gauge group. We discuss proper averaging operations for bosons and for staggered fermions. The kernels C can also be used in multigrid Monte Carlo simulations, and for the definition of block spins and blocked gauge fields in Monte Carlo renormalization group studies. Actual numerical computations are performed in four-dimensional SU(2) gauge fields. We prove that our proposals for block spins are “good”, using renormalization group arguments. A central result is that the multigrid method works in arbitrarily disordered gauge fields, in principle. It is proved that computations of propagators in gauge fields without critical slowing down are possible when one uses an ideal interpolation kernel. Unfortunately, the idealized algorithm is not practical, but it was important to answer questions of principle. Practical methods are able to outperform the conjugate gradient algorithm in case of bosons. The case of staggered fermions is harder. Multigrid methods give considerable speed-ups compared to conventional relaxation algorithms, but on lattices up to 184 conjugate gradient is superior.

The two-phase method for finding a great number of eigenpairs of the symmetric or weakly non-symmetric large eigenvalue problems

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

Dul, F.A.; Arczewski, K.

1994-03-01

Although it has been stated that [open quotes]an attempt to solve (very large problems) by subspace iterations seems futile[close quotes], we will show that the statement is not true, especially for extremely large eigenproblems. In this paper a new two-phase subspace iteration/Rayleigh quotient/conjugate gradient method for generalized, large, symmetric eigenproblems Ax = [lambda]Bx is presented. It has the ability of solving extremely large eigenproblems, N = 216,000, for example, and finding a large number of leftmost or rightmost eigenpairs, up to 1000 or more. Multiple eigenpairs, even those with multiplicity 100, can be easily found. The use of the proposedmore » method for solving the big full eigenproblems (N [approximately] 10[sup 3]), as well as for large weakly non-symmetric eigenproblems, have been considered also. The proposed method is fully iterative; thus the factorization of matrices ins avoided. The key idea consists in joining two methods: subspace and Rayleigh quotient iterations. The systems of indefinite and almost singular linear equations (a - [sigma]B)x = By are solved by various iterative conjugate gradient method can be used without danger of breaking down due to its property that may be called [open quotes]self-correction towards the eigenvector,[close quotes] discovered recently by us. The use of various preconditioners (SSOR and IC) has also been considered. The main features of the proposed method have been analyzed in detail. Comparisons with other methods, such as, accelerated subspace iteration, Lanczos, Davidson, TLIME, TRACMN, and SRQMCG, are presented. The results of numerical tests for various physical problems (acoustic, vibrations of structures, quantum chemistry) are presented as well. 40 refs., 12 figs., 2 tabs.« less

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

Technical note: Avoiding the direct inversion of the numerator relationship matrix for genotyped animals in single-step genomic best linear unbiased prediction solved with the preconditioned conjugate gradient.

PubMed

Masuda, Y; Misztal, I; Legarra, A; Tsuruta, S; Lourenco, D A L; Fragomeni, B O; Aguilar, I

2017-01-01

This paper evaluates an efficient implementation to multiply the inverse of a numerator relationship matrix for genotyped animals () by a vector (). The computation is required for solving mixed model equations in single-step genomic BLUP (ssGBLUP) with the preconditioned conjugate gradient (PCG). The inverse can be decomposed into sparse matrices that are blocks of the sparse inverse of a numerator relationship matrix () including genotyped animals and their ancestors. The elements of were rapidly calculated with the Henderson's rule and stored as sparse matrices in memory. Implementation of was by a series of sparse matrix-vector multiplications. Diagonal elements of , which were required as preconditioners in PCG, were approximated with a Monte Carlo method using 1,000 samples. The efficient implementation of was compared with explicit inversion of with 3 data sets including about 15,000, 81,000, and 570,000 genotyped animals selected from populations with 213,000, 8.2 million, and 10.7 million pedigree animals, respectively. The explicit inversion required 1.8 GB, 49 GB, and 2,415 GB (estimated) of memory, respectively, and 42 s, 56 min, and 13.5 d (estimated), respectively, for the computations. The efficient implementation required <1 MB, 2.9 GB, and 2.3 GB of memory, respectively, and <1 sec, 3 min, and 5 min, respectively, for setting up. Only <1 sec was required for the multiplication in each PCG iteration for any data sets. When the equations in ssGBLUP are solved with the PCG algorithm, is no longer a limiting factor in the computations.

A Pn Spreading Model Constrained with Observed Amplitudes in Asia

DTIC Science & Technology

2011-09-01

and stations, from which we collected my data. According to Patton (1980), the “ tectonic ” province was defined as an area with its crustal thickness...and the definition of the “ tectonic ” province as a tectonically active region with similar crustal and upper-mantle structure in most parts of the...North Australian Craton: Influence of crustal velocity gradients, Bull. Seismol. Soc. Am. 81: 592–610. Brune, J. N. (1970). Tectonic stress and the

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

Ma, Xiangfeng; Tanihata, Kimiaki; Miyamoto, Yoshinari

A TiC/Ni functionally gradient material (FGM) fabricated via gas-pressure combustion sintering is presently investigated to establish its mechanical and thermal properties. Attention is given to the FGM's specific thermal conductivities with different thermal cycling conditions; these are found to decrease with thermal cycling in all samples tested, implying that the lateral cracks are generated in the FGM and then propagated by the thermal cycle. High compressive stresses are induced at the TiC surface when this is constrained by a Cu block. 6 refs.

Interactive effects of genotype and food quality on consumer growth rate and elemental content.

PubMed

Prater, Clay; Wagner, Nicole D; Frost, Paul C

2017-05-01

Consumer body stoichiometry is a key trait that links organismal physiology to population and ecosystem-level dynamics. However, as elemental composition has traditionally been considered to be constrained within a species, the ecological and evolutionary factors shaping consumer elemental composition have not been clearly resolved. To this end, we examined the causes and extent of variation in the body phosphorus (P) content and the expression of P-linked traits, mass specific growth rate (MSGR), and P use efficiency (PUE) of the keystone aquatic consumer Daphnia using lake surveys and common garden experiments. While daphnid body %P was relatively constrained in field assemblages sampled across an environmental P gradient, unique genotypes isolated from these lakes showed highly variable phenotypic responses when raised across dietary P gradients in the laboratory. Specifically, we observed substantial inter- and intra-specific variation and differences in daphnid responses within and among our study lakes. While variation in Daphnia body %P was mostly due to plastic phenotypic changes, we documented considerable genetic differences in daphnid MSGR and PUE, and relationships between MSGR and body P content were highly variable among genotypes. Overall, our study found that consumer responses to food quality may differ considerably among genotypes and that relationships between organismal life-history traits and body stoichiometry may be strongly influenced by genetic and environmental variation in natural assemblages. © 2017 by the Ecological Society of America.

Estimating the composition of hydrates from a 3D seismic dataset near Penghu Canyon on Chinese passive margin offshore Taiwan

NASA Astrophysics Data System (ADS)

Chi, Wu-Cheng

2016-04-01

A bottom-simulating reflector (BSR), representing the base of the gas hydrate stability zone, can be used to estimate geothermal gradients under seafloor. However, to derive temperature estimates at the BSR, the correct hydrate composition is needed to calculate the phase boundary. Here we applied the method by Minshull and Keddie to constrain the hydrate composition and the pore fluid salinity. We used a 3D seismic dataset offshore SW Taiwan to test the method. Different from previous studies, we have considered the effects of 3D topographic effects using finite element modelling and also depth-dependent thermal conductivity. Using a pore water salinity of 2% at the BSR depth as found from the nearby core samples, we successfully used 99% methane and 1% ethane gas hydrate phase boundary to derive a sub-bottom depth vs. temperature plot which is consistent with the seafloor temperature from in-situ measurements. The results are also consistent with geochemical analyses of the pore fluids. The derived regional geothermal gradient is 40.1oC/km, which is similar to 40oC/km used in the 3D finite element modelling used in this study. This study is among the first documented successful use of Minshull and Keddie's method to constrain seafloor gas hydrate composition.

Performance of the strongly constrained and appropriately normed density functional for solid-state materials

DOE PAGES

Isaacs, Eric B.; Wolverton, Chris

2018-06-22

Constructed to satisfy 17 known exact constraints for a semilocal density functional, the strongly constrained and appropriately normed (SCAN) meta-generalized-gradient-approximation functional has shown early promise for accurately describing the electronic structure of molecules and solids. One open question is how well SCAN predicts the formation energy, a key quantity for describing the thermodynamic stability of solid-state compounds. To answer this question, we perform an extensive benchmark of SCAN by computing the formation energies for a diverse group of nearly 1000 crystalline compounds for which experimental values are known. Due to an enhanced exchange interaction in the covalent bonding regime, SCANmore » substantially decreases the formation energy errors for strongly bound compounds, by approximately 50% to 110 meV/atom, as compared to the generalized gradient approximation of Perdew, Burke, and Ernzerhof (PBE). However, for intermetallic compounds, SCAN performs moderately worse than PBE with an increase in formation energy error of approximately 20%, stemming from SCAN's distinct behavior in the weak bonding regime. The formation energy errors can be further reduced via elemental chemical potential fitting. We find that SCAN leads to significantly more accurate predicted crystal volumes, moderately enhanced magnetism, and mildly improved band gaps as compared to PBE. Altogether, SCAN represents a significant improvement in accurately describing the thermodynamics of strongly bound compounds.« less

Performance of the strongly constrained and appropriately normed density functional for solid-state materials

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

Isaacs, Eric B.; Wolverton, Chris

Constructed to satisfy 17 known exact constraints for a semilocal density functional, the strongly constrained and appropriately normed (SCAN) meta-generalized-gradient-approximation functional has shown early promise for accurately describing the electronic structure of molecules and solids. One open question is how well SCAN predicts the formation energy, a key quantity for describing the thermodynamic stability of solid-state compounds. To answer this question, we perform an extensive benchmark of SCAN by computing the formation energies for a diverse group of nearly 1000 crystalline compounds for which experimental values are known. Due to an enhanced exchange interaction in the covalent bonding regime, SCANmore » substantially decreases the formation energy errors for strongly bound compounds, by approximately 50% to 110 meV/atom, as compared to the generalized gradient approximation of Perdew, Burke, and Ernzerhof (PBE). However, for intermetallic compounds, SCAN performs moderately worse than PBE with an increase in formation energy error of approximately 20%, stemming from SCAN's distinct behavior in the weak bonding regime. The formation energy errors can be further reduced via elemental chemical potential fitting. We find that SCAN leads to significantly more accurate predicted crystal volumes, moderately enhanced magnetism, and mildly improved band gaps as compared to PBE. Altogether, SCAN represents a significant improvement in accurately describing the thermodynamics of strongly bound compounds.« less

Mechanical properties of conjugate faults in the Makran accretionary prism estimated from InSAR observations of coseismic deformation due to the 2013 Baluchistan (Mw 7.7) earthquake

NASA Astrophysics Data System (ADS)

Dutta, R.; Harrington, J.; Wang, T.; Feng, G.; Vasyura-Bathke, H.; Jonsson, S.

2017-12-01

Interferometric Synthetic Aperture Radar (InSAR) measurements allow us to study various mechanical and rheological properties around faults. For example, strain localizations along faults induced by nearby earthquakes observed by InSAR have been explained by the elastic response of compliant fault zones (CFZ) where the elastic moduli is reduced with respect to that of the surrounding rock. We observed similar strain localizations (up to 1-3 cm displacements in the line-of-sight direction of InSAR) along several conjugate faults near the rupture of the 2013 Mw7.7 Baluchistan (Pakistan) earthquake in the accretionary prism of the Makran subduction zone. These conjugate compliant faults, which have strikes of N30°E and N45°W, are located 15-30 km from the mainshock fault rupture in a N-S compressional stress regime. The long-term geologic slip direction of these faults is left-lateral for the N30°E striking faults and right-lateral for the N45°W striking faults. The 2013 Baluchistan earthquake caused WSW-ENE extensional coseismic stress changes across the conjugate fault system and the observed strain localizations shows opposite sense of motion to that of the geologic long-term slip. We use 3D Finite Element modeling (FEM) to study the effects extensional coseismic stresses have on the conjugate CFZs that is otherwise loaded in a compressional regional stress. We use coseismic static displacements due to the earthquake along the FEM domain boundaries to simulate the extensional coseismic stress change acting across the fault system. Around 0.5-2 km wide CFZs with reduction in shear modulus by a factor of 3 to 4 can explain the observed InSAR strain localizations and the opposite sense of motion. The InSAR measurements were also used to constrain the ranges of the length, width and rigidity variations of the CFZs. The FEM solution shows that the N45°W striking faults localize mostly extensional strain and a small amount of left-lateral shear (opposite sense to the geologic motion), whereas the N30°E striking faults localize mostly right-lateral shear (opposite sense) and a small amount of extensional strain. Similar results were found for CFZs near the 1992 Landers and the 1999 Hector Mine earthquakes in California, although here the strain localizations occur on a more complex conjugate sets of faults.

Counter-extrapolation method for conjugate interfaces in computational heat and mass transfer.

PubMed

Le, Guigao; Oulaid, Othmane; Zhang, Junfeng

2015-03-01

In this paper a conjugate interface method is developed by performing extrapolations along the normal direction. Compared to other existing conjugate models, our method has several technical advantages, including the simple and straightforward algorithm, accurate representation of the interface geometry, applicability to any interface-lattice relative orientation, and availability of the normal gradient. The model is validated by simulating the steady and unsteady convection-diffusion system with a flat interface and the steady diffusion system with a circular interface, and good agreement is observed when comparing the lattice Boltzmann results with respective analytical solutions. A more general system with unsteady convection-diffusion process and a curved interface, i.e., the cooling process of a hot cylinder in a cold flow, is also simulated as an example to illustrate the practical usefulness of our model, and the effects of the cylinder heat capacity and thermal diffusivity on the cooling process are examined. Results show that the cylinder with a larger heat capacity can release more heat energy into the fluid and the cylinder temperature cools down slower, while the enhanced heat conduction inside the cylinder can facilitate the cooling process of the system. Although these findings appear obvious from physical principles, the confirming results demonstrates the application potential of our method in more complex systems. In addition, the basic idea and algorithm of the counter-extrapolation procedure presented here can be readily extended to other lattice Boltzmann models and even other computational technologies for heat and mass transfer systems.

Investigation on Single-walled Carbon Nanotubes-Liposomes Conjugate to Treatment Tumor with Dual-mechanism.

PubMed

Zhu, Xiali; Huang, Heqing; Zhang, Yingjie; Xie, Yingxia; Hou, Lin; Zhang, Huijuan; Zhang, Zhenzhong

2015-01-01

Single-walled carbon nanotubes (SWNT) have been widely explored as carriers for drug delivery because of their large surface area, high near-infrared absorption coefficient and facile transport through cellular membranes. In this study, Lysine (Lys) modified SWNT-liposomes conjugate loaded with doxorubicin (DOX) was designed to enhance the targeted drug delivery and antitumor effect. The conjugate (DOX-Lys/SWNT-Lip) was prepared with pH gradient methods, and the mean particle size and drug entrapment efficiency were 223±5.9 nm and 85.9 %, respectively. In vitro drug release study showed that DOX released much slowly from DOX-Lys/SWNT-Lip than from DOX solution, but faster than that of DOX-Lys/SWNT. DOX-Lys/SWNT-Lip could efficiently cross the cell membrane and afford higher anti-tumor efficacy on MCF-7 cells in vitro. For in vivo experiment, normal saline (N.S.), and DOX or DOX-Lys/SWNTLip were given to the S180 tumor bearing mice by i.v. administration, and followed by exposing the tumor site to nearinfrared laser (NIR) irradiation at 808 nm for 2 min. The relative tumor volumes in DOX-Lys/SWNT-Lip group and DOX group were obviously smaller than those of N.S. group. When combined with NIR laser irradiation, the suppression on tumor growth was much stronger. In conclusion, this study may provide potentially viable clinical strategies for tumor treatment with chemotherapy and photothermal therapy dual-mechanism.

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

Potential mechanism of corpus-predominant gastritis after PPI therapy in Helicobacter pylori-positive patients with GERD.

PubMed

Mukaisho, Ken-ichi; Hagiwara, Tadashi; Nakayama, Takahisa; Hattori, Takanori; Sugihara, Hiroyuki

2014-09-14

The long-term use of proton pump inhibitors (PPIs) exacerbates corpus atrophic gastritis in patients with Helicobacter pylori (H. pylori) infection. To identify a potential mechanism for this change, we discuss interactions between pH, bile acids, and H. pylori. Duodenogastric reflux, which includes bile, occurs in healthy individuals, and bile reflux is increased in patients with gastroesophageal reflux disease (GERD). Diluted human plasma and bile acids have been found to be significant chemoattractants and chemorepellents, respectively, for the bacillus H. pylori. Although only taurine conjugates, with a pKa of 1.8-1.9, are soluble in an acidic environment, glycine conjugates, with a pKa of 4.3-5.2, as well as taurine-conjugated bile acids are soluble in the presence of PPI therapy. Thus, the soluble bile acid concentrations in the gastric contents of patients with GERD after continuous PPI therapy are considerably higher than that in those with intact acid production. In the distal stomach, the high concentration of soluble bile acids is likely to act as a bactericide or chemorepellent for H. pylori. In contrast, the mucous layer in the proximal stomach has an optimal bile concentration that forms chemotactic gradients with plasma components required to direct H. pylori to the epithelial surface. H. pylori may then colonize in the stomach body rather than in the pyloric antrum, which may explain the occurrence of corpus-predominant gastritis after PPI therapy in H. pylori-positive patients with GERD.

Stereo transparency and the disparity gradient limit

NASA Technical Reports Server (NTRS)

McKee, Suzanne P.; Verghese, Preeti

2002-01-01

Several studies (Vision Research 15 (1975) 583; Perception 9 (1980) 671) have shown that binocular fusion is limited by the disparity gradient (disparity/distance) separating image points, rather than by their absolute disparity values. Points separated by a gradient >1 appear diplopic. These results are sometimes interpreted as a constraint on human stereo matching, rather than a constraint on fusion. Here we have used psychophysical measurements on stereo transparency to show that human stereo matching is not constrained by a gradient of 1. We created transparent surfaces composed of many pairs of dots, in which each member of a pair was assigned a disparity equal and opposite to the disparity of the other member. For example, each pair could be composed of one dot with a crossed disparity of 6' and the other with uncrossed disparity of 6', vertically separated by a parametrically varied distance. When the vertical separation between the paired dots was small, the disparity gradient for each pair was very steep. Nevertheless, these opponent-disparity dot pairs produced a striking appearance of two transparent surfaces for disparity gradients ranging between 0.5 and 3. The apparent depth separating the two transparent planes was correctly matched to an equivalent disparity defined by two opaque surfaces. A test target presented between the two transparent planes was easily detected, indicating robust segregation of the disparities associated with the paired dots into two transparent surfaces with few mismatches in the target plane. Our simulations using the Tsai-Victor model show that the response profiles produced by scaled disparity-energy mechanisms can account for many of our results on the transparency generated by steep gradients.

Forest gradient response in Sierran landscapes: the physical template

USGS Publications Warehouse

Urban, Dean L.; Miller, Carol; Halpin, Patrick N.; Stephenson, Nathan L.

2000-01-01

Vegetation pattern on landscapes is the manifestation of physical gradients, biotic response to these gradients, and disturbances. Here we focus on the physical template as it governs the distribution of mixed-conifer forests in California's Sierra Nevada. We extended a forest simulation model to examine montane environmental gradients, emphasizing factors affecting the water balance in these summer-dry landscapes. The model simulates the soil moisture regime in terms of the interaction of water supply and demand: supply depends on precipitation and water storage, while evapotranspirational demand varies with solar radiation and temperature. The forest cover itself can affect the water balance via canopy interception and evapotranspiration. We simulated Sierran forests as slope facets, defined as gridded stands of homogeneous topographic exposure, and verified simulated gradient response against sample quadrats distributed across Sequoia National Park. We then performed a modified sensitivity analysis of abiotic factors governing the physical gradient. Importantly, the model's sensitivity to temperature, precipitation, and soil depth varies considerably over the physical template, particularly relative to elevation. The physical drivers of the water balance have characteristic spatial scales that differ by orders of magnitude. Across large spatial extents, temperature and precipitation as defined by elevation primarily govern the location of the mixed conifer zone. If the analysis is constrained to elevations within the mixed-conifer zone, local topography comes into play as it influences drainage. Soil depth varies considerably at all measured scales, and is especially dominant at fine (within-stand) scales. Physical site variables can influence soil moisture deficit either by affecting water supply or water demand; these effects have qualitatively different implications for forest response. These results have clear implications about purely inferential approaches to gradient analysis, and bear strongly on our ability to use correlative approaches in assessing the potential responses of montane forests to anthropogenic climatic change.

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.