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

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.

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

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.

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.

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

PubMed

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

2007-01-01

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

Parallel and fault-tolerant algorithms for hypercube multiprocessors

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

Aykanat, C.

1988-01-01

Several techniques for increasing the performance of parallel algorithms on distributed-memory message-passing multi-processor systems are investigated. These techniques are effectively implemented for the parallelization of the Scaled Conjugate Gradient (SCG) algorithm on a hypercube connected message-passing multi-processor. Significant performance improvement is achieved by using these techniques. The SCG algorithm is used for the solution phase of an FE modeling system. Almost linear speed-up is achieved, and it is shown that hypercube topology is scalable for an FE class of problem. The SCG algorithm is also shown to be suitable for vectorization, and near supercomputer performance is achieved on a vectormore » hypercube multiprocessor by exploiting both parallelization and vectorization. Fault-tolerance issues for the parallel SCG algorithm and for the hypercube topology are also addressed.« less

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.

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.

Efficient ICCG on a shared memory multiprocessor

NASA Technical Reports Server (NTRS)

Hammond, Steven W.; Schreiber, Robert

1989-01-01

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

An efficient parallel algorithm for matrix-vector multiplication

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

Hendrickson, B.; Leland, R.; Plimpton, S.

The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/[radical]p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in themore » well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.« less

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

PubMed

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

2001-05-01

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

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

PubMed

Huang, Yuanyuan; Liu, Changhe

2017-01-01

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

Approximate error conjugation gradient minimization methods

DOEpatents

Kallman, Jeffrey S

2013-05-21

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

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.

Efficient conjugate gradient algorithms for computation of the manipulator forward dynamics

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheid, Robert E.

1989-01-01

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

User's Guide for ENSAERO_FE Parallel Finite Element Solver

NASA Technical Reports Server (NTRS)

Eldred, Lloyd B.; Guruswamy, Guru P.

1999-01-01

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

Application of the conjugate-gradient method to ground-water models

USGS Publications Warehouse

Manteuffel, T.A.; Grove, D.B.; Konikow, Leonard F.

1984-01-01

The conjugate-gradient method can solve efficiently and accurately finite-difference approximations to the ground-water flow equation. An aquifer-simulation model using the conjugate-gradient method was applied to a problem of ground-water flow in an alluvial aquifer at the Rocky Mountain Arsenal, Denver, Colorado. For this application, the accuracy and efficiency of the conjugate-gradient method compared favorably with other available methods for steady-state flow. However, its efficiency relative to other available methods depends on the nature of the specific problem. The main advantage of the conjugate-gradient method is that it does not require the use of iteration parameters, thereby eliminating this partly subjective procedure. (USGS)

Minimizing inner product data dependencies in conjugate gradient iteration

NASA Technical Reports Server (NTRS)

Vanrosendale, J.

1983-01-01

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

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.

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.

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

PubMed

Du, Shouqiang; Chen, Miao

2018-01-01

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

Domain decomposition methods in aerodynamics

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.; Saltz, Joel

1990-01-01

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

Non-Cartesian Parallel Imaging Reconstruction

PubMed Central

Wright, Katherine L.; Hamilton, Jesse I.; Griswold, Mark A.; Gulani, Vikas; Seiberlich, Nicole

2014-01-01

Non-Cartesian parallel imaging has played an important role in reducing data acquisition time in MRI. The use of non-Cartesian trajectories can enable more efficient coverage of k-space, which can be leveraged to reduce scan times. These trajectories can be undersampled to achieve even faster scan times, but the resulting images may contain aliasing artifacts. Just as Cartesian parallel imaging can be employed to reconstruct images from undersampled Cartesian data, non-Cartesian parallel imaging methods can mitigate aliasing artifacts by using additional spatial encoding information in the form of the non-homogeneous sensitivities of multi-coil phased arrays. This review will begin with an overview of non-Cartesian k-space trajectories and their sampling properties, followed by an in-depth discussion of several selected non-Cartesian parallel imaging algorithms. Three representative non-Cartesian parallel imaging methods will be described, including Conjugate Gradient SENSE (CG SENSE), non-Cartesian GRAPPA, and Iterative Self-Consistent Parallel Imaging Reconstruction (SPIRiT). After a discussion of these three techniques, several potential promising clinical applications of non-Cartesian parallel imaging will be covered. PMID:24408499

MILC Code Performance on High End CPU and GPU Supercomputer Clusters

NASA Astrophysics Data System (ADS)

DeTar, Carleton; Gottlieb, Steven; Li, Ruizi; Toussaint, Doug

2018-03-01

With recent developments in parallel supercomputing architecture, many core, multi-core, and GPU processors are now commonplace, resulting in more levels of parallelism, memory hierarchy, and programming complexity. It has been necessary to adapt the MILC code to these new processors starting with NVIDIA GPUs, and more recently, the Intel Xeon Phi processors. We report on our efforts to port and optimize our code for the Intel Knights Landing architecture. We consider performance of the MILC code with MPI and OpenMP, and optimizations with QOPQDP and QPhiX. For the latter approach, we concentrate on the staggered conjugate gradient and gauge force. We also consider performance on recent NVIDIA GPUs using the QUDA library.

A Parallel Nonrigid Registration Algorithm Based on B-Spline for Medical Images.

PubMed

Du, Xiaogang; Dang, Jianwu; Wang, Yangping; Wang, Song; Lei, Tao

2016-01-01

The nonrigid registration algorithm based on B-spline Free-Form Deformation (FFD) plays a key role and is widely applied in medical image processing due to the good flexibility and robustness. However, it requires a tremendous amount of computing time to obtain more accurate registration results especially for a large amount of medical image data. To address the issue, a parallel nonrigid registration algorithm based on B-spline is proposed in this paper. First, the Logarithm Squared Difference (LSD) is considered as the similarity metric in the B-spline registration algorithm to improve registration precision. After that, we create a parallel computing strategy and lookup tables (LUTs) to reduce the complexity of the B-spline registration algorithm. As a result, the computing time of three time-consuming steps including B-splines interpolation, LSD computation, and the analytic gradient computation of LSD, is efficiently reduced, for the B-spline registration algorithm employs the Nonlinear Conjugate Gradient (NCG) optimization method. Experimental results of registration quality and execution efficiency on the large amount of medical images show that our algorithm achieves a better registration accuracy in terms of the differences between the best deformation fields and ground truth and a speedup of 17 times over the single-threaded CPU implementation due to the powerful parallel computing ability of Graphics Processing Unit (GPU).

Aztec user`s guide. Version 1

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

Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S.

1995-10-01

Aztec is an iterative library that greatly simplifies the parallelization process when solving the linear systems of equations Ax = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. Aztec is intended as a software tool for users who want to avoid cumbersome parallel programming details but who have large sparse linear systems which require an efficiently utilized parallel processing system. A collection of data transformation tools are provided that allow for easy creation of distributed sparsemore » unstructured matrices for parallel solution. Once the distributed matrix is created, computation can be performed on any of the parallel machines running Aztec: nCUBE 2, IBM SP2 and Intel Paragon, MPI platforms as well as standard serial and vector platforms. Aztec includes a number of Krylov iterative methods such as conjugate gradient (CG), generalized minimum residual (GMRES) and stabilized biconjugate gradient (BICGSTAB) to solve systems of equations. These Krylov methods are used in conjunction with various preconditioners such as polynomial or domain decomposition methods using LU or incomplete LU factorizations within subdomains. Although the matrix A can be general, the package has been designed for matrices arising from the approximation of partial differential equations (PDEs). In particular, the Aztec package is oriented toward systems arising from PDE applications.« less

Parallel Reconstruction Using Null Operations (PRUNO)

PubMed Central

Zhang, Jian; Liu, Chunlei; Moseley, Michael E.

2011-01-01

A novel iterative k-space data-driven technique, namely Parallel Reconstruction Using Null Operations (PRUNO), is presented for parallel imaging reconstruction. In PRUNO, both data calibration and image reconstruction are formulated into linear algebra problems based on a generalized system model. An optimal data calibration strategy is demonstrated by using Singular Value Decomposition (SVD). And an iterative conjugate- gradient approach is proposed to efficiently solve missing k-space samples during reconstruction. With its generalized formulation and precise mathematical model, PRUNO reconstruction yields good accuracy, flexibility, stability. Both computer simulation and in vivo studies have shown that PRUNO produces much better reconstruction quality than autocalibrating partially parallel acquisition (GRAPPA), especially under high accelerating rates. With the aid of PRUO reconstruction, ultra high accelerating parallel imaging can be performed with decent image quality. For example, we have done successful PRUNO reconstruction at a reduction factor of 6 (effective factor of 4.44) with 8 coils and only a few autocalibration signal (ACS) lines. PMID:21604290

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.

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

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

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

1997-06-01

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

Krylov subspace methods on supercomputers

NASA Technical Reports Server (NTRS)

Saad, Youcef

1988-01-01

A short survey of recent research on Krylov subspace methods with emphasis on implementation on vector and parallel computers is presented. Conjugate gradient methods have proven very useful on traditional scalar computers, and their popularity is likely to increase as three-dimensional models gain importance. A conservative approach to derive effective iterative techniques for supercomputers has been to find efficient parallel/vector implementations of the standard algorithms. The main source of difficulty in the incomplete factorization preconditionings is in the solution of the triangular systems at each step. A few approaches consisting of implementing efficient forward and backward triangular solutions are described in detail. Polynomial preconditioning as an alternative to standard incomplete factorization techniques is also discussed. Another efficient approach is to reorder the equations so as to improve the structure of the matrix to achieve better parallelism or vectorization. An overview of these and other ideas and their effectiveness or potential for different types of architectures is given.

Quantifying the Energy Efficiency of Object Recognition and Optical Flow

DTIC Science & Technology

2014-03-28

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

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.

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.

Modified conjugate gradient method for diagonalizing large matrices.

PubMed

Jie, Quanlin; Liu, Dunhuan

2003-11-01

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

A Parallel Nonrigid Registration Algorithm Based on B-Spline for Medical Images

PubMed Central

Wang, Yangping; Wang, Song

2016-01-01

The nonrigid registration algorithm based on B-spline Free-Form Deformation (FFD) plays a key role and is widely applied in medical image processing due to the good flexibility and robustness. However, it requires a tremendous amount of computing time to obtain more accurate registration results especially for a large amount of medical image data. To address the issue, a parallel nonrigid registration algorithm based on B-spline is proposed in this paper. First, the Logarithm Squared Difference (LSD) is considered as the similarity metric in the B-spline registration algorithm to improve registration precision. After that, we create a parallel computing strategy and lookup tables (LUTs) to reduce the complexity of the B-spline registration algorithm. As a result, the computing time of three time-consuming steps including B-splines interpolation, LSD computation, and the analytic gradient computation of LSD, is efficiently reduced, for the B-spline registration algorithm employs the Nonlinear Conjugate Gradient (NCG) optimization method. Experimental results of registration quality and execution efficiency on the large amount of medical images show that our algorithm achieves a better registration accuracy in terms of the differences between the best deformation fields and ground truth and a speedup of 17 times over the single-threaded CPU implementation due to the powerful parallel computing ability of Graphics Processing Unit (GPU). PMID:28053653

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.

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

PubMed

Yang, Xiaoli; Hofmann, Ralf; Dapp, Robin; van de Kamp, Thomas; dos Santos Rolo, Tomy; Xiao, Xianghui; Moosmann, Julian; Kashef, Jubin; Stotzka, Rainer

2015-03-09

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

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

DOE PAGES

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 o f 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 themore » number 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.« less

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.

Efficient operator splitting algorithm for joint sparsity-regularized SPIRiT-based parallel MR imaging reconstruction.

PubMed

Duan, Jizhong; Liu, Yu; Jing, Peiguang

2018-02-01

Self-consistent parallel imaging (SPIRiT) is an auto-calibrating model for the reconstruction of parallel magnetic resonance imaging, which can be formulated as a regularized SPIRiT problem. The Projection Over Convex Sets (POCS) method was used to solve the formulated regularized SPIRiT problem. However, the quality of the reconstructed image still needs to be improved. Though methods such as NonLinear Conjugate Gradients (NLCG) can achieve higher spatial resolution, these methods always demand very complex computation and converge slowly. In this paper, we propose a new algorithm to solve the formulated Cartesian SPIRiT problem with the JTV and JL1 regularization terms. The proposed algorithm uses the operator splitting (OS) technique to decompose the problem into a gradient problem and a denoising problem with two regularization terms, which is solved by our proposed split Bregman based denoising algorithm, and adopts the Barzilai and Borwein method to update step size. Simulation experiments on two in vivo data sets demonstrate that the proposed algorithm is 1.3 times faster than ADMM for datasets with 8 channels. Especially, our proposal is 2 times faster than ADMM for the dataset with 32 channels. Copyright © 2017 Elsevier Inc. All rights reserved.

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.

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.

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

NASA Technical Reports Server (NTRS)

Navon, I. M.

1984-01-01

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

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.

Domain decomposition methods for the parallel computation of reacting flows

NASA Technical Reports Server (NTRS)

Keyes, David E.

1988-01-01

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

Final Report, DE-FG01-06ER25718 Domain Decomposition and Parallel Computing

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

Widlund, Olof B.

2015-06-09

The goal of this project is to develop and improve domain decomposition algorithms for a variety of partial differential equations such as those of linear elasticity and electro-magnetics.These iterative methods are designed for massively parallel computing systems and allow the fast solution of the very large systems of algebraic equations that arise in large scale and complicated simulations. A special emphasis is placed on problems arising from Maxwell's equation. The approximate solvers, the preconditioners, are combined with the conjugate gradient method and must always include a solver of a coarse model in order to have a performance which is independentmore » of the number of processors used in the computer simulation. A recent development allows for an adaptive construction of this coarse component of the preconditioner.« less

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

A feasible DY conjugate gradient method for linear equality constraints

NASA Astrophysics Data System (ADS)

LI, Can

2017-09-01

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

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

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

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

2009-01-01

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

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

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

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

2009-03-10

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

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

NASA Technical Reports Server (NTRS)

Poole, E. L.

1991-01-01

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

A modified form of conjugate gradient method for unconstrained optimization problems

NASA Astrophysics Data System (ADS)

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

2016-06-01

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

Gradient optimization and nonlinear control

NASA Technical Reports Server (NTRS)

Hasdorff, L.

1976-01-01

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

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

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.

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.

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

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.

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.

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.

2D Seismic Imaging of Elastic Parameters by Frequency Domain Full Waveform Inversion

NASA Astrophysics Data System (ADS)

Brossier, R.; Virieux, J.; Operto, S.

2008-12-01

Thanks to recent advances in parallel computing, full waveform inversion is today a tractable seismic imaging method to reconstruct physical parameters of the earth interior at different scales ranging from the near- surface to the deep crust. We present a massively parallel 2D frequency-domain full-waveform algorithm for imaging visco-elastic media from multi-component seismic data. The forward problem (i.e. the resolution of the frequency-domain 2D PSV elastodynamics equations) is based on low-order Discontinuous Galerkin (DG) method (P0 and/or P1 interpolations). Thanks to triangular unstructured meshes, the DG method allows accurate modeling of both body waves and surface waves in case of complex topography for a discretization of 10 to 15 cells per shear wavelength. The frequency-domain DG system is solved efficiently for multiple sources with the parallel direct solver MUMPS. The local inversion procedure (i.e. minimization of residuals between observed and computed data) is based on the adjoint-state method which allows to efficiently compute the gradient of the objective function. Applying the inversion hierarchically from the low frequencies to the higher ones defines a multiresolution imaging strategy which helps convergence towards the global minimum. In place of expensive Newton algorithm, the combined use of the diagonal terms of the approximate Hessian matrix and optimization algorithms based on quasi-Newton methods (Conjugate Gradient, LBFGS, ...) allows to improve the convergence of the iterative inversion. The distribution of forward problem solutions over processors driven by a mesh partitioning performed by METIS allows to apply most of the inversion in parallel. We shall present the main features of the parallel modeling/inversion algorithm, assess its scalability and illustrate its performances with realistic synthetic case studies.

Enhancement of the beam quality of non-uniform output slab laser amplifier with a 39-actuator rectangular piezoelectric deformable mirror.

PubMed

Yang, Ping; Ning, Yu; Lei, Xiang; Xu, Bing; Li, Xinyang; Dong, Lizhi; Yan, Hu; Liu, Wenjing; Jiang, Wenhan; Liu, Lei; Wang, Chao; Liang, Xingbo; Tang, Xiaojun

2010-03-29

We present a slab laser amplifier beam cleanup experimental system based on a 39-actuator rectangular piezoelectric deformable mirror. Rather than use a wave-front sensor to measure distortions in the wave-front and then apply a conjugation wave-front for compensating them, the system uses a Stochastic Parallel Gradient Descent algorithm to maximize the power contained within a far-field designated bucket. Experimental results demonstrate that at the output power of 335W, more than 30% energy concentrates in the 1x diffraction-limited area while the beam quality is enhanced greatly.

Charge order-superfluidity transition in a two-dimensional system of hard-core bosons and emerging domain structures

NASA Astrophysics Data System (ADS)

Moskvin, A. S.; Panov, Yu. D.; Rybakov, F. N.; Borisov, A. B.

2017-11-01

We have used high-performance parallel computations by NVIDIA graphics cards applying the method of nonlinear conjugate gradients and Monte Carlo method to observe directly the developing ground state configuration of a two-dimensional hard-core boson system with decrease in temperature, and its evolution with deviation from a half-filling. This has allowed us to explore unconventional features of a charge order—superfluidity phase transition, specifically, formation of an irregular domain structure, emergence of a filamentary superfluid structure that condenses within of the charge-ordered phase domain antiphase boundaries, and formation and evolution of various topological structures.

SPIRiT: Iterative Self-consistent Parallel Imaging Reconstruction from Arbitrary k-Space

PubMed Central

Lustig, Michael; Pauly, John M.

2010-01-01

A new approach to autocalibrating, coil-by-coil parallel imaging reconstruction is presented. It is a generalized reconstruction framework based on self consistency. The reconstruction problem is formulated as an optimization that yields the most consistent solution with the calibration and acquisition data. The approach is general and can accurately reconstruct images from arbitrary k-space sampling patterns. The formulation can flexibly incorporate additional image priors such as off-resonance correction and regularization terms that appear in compressed sensing. Several iterative strategies to solve the posed reconstruction problem in both image and k-space domain are presented. These are based on a projection over convex sets (POCS) and a conjugate gradient (CG) algorithms. Phantom and in-vivo studies demonstrate efficient reconstructions from undersampled Cartesian and spiral trajectories. Reconstructions that include off-resonance correction and nonlinear ℓ1-wavelet regularization are also demonstrated. PMID:20665790

Sub-domain decomposition methods and computational controls for multibody dynamical systems. [of spacecraft structures

NASA Technical Reports Server (NTRS)

Menon, R. G.; Kurdila, A. J.

1992-01-01

This paper presents a concurrent methodology to simulate the dynamics of flexible multibody systems with a large number of degrees of freedom. A general class of open-loop structures is treated and a redundant coordinate formulation is adopted. A range space method is used in which the constraint forces are calculated using a preconditioned conjugate gradient method. By using a preconditioner motivated by the regular ordering of the directed graph of the structures, it is shown that the method is order N in the total number of coordinates of the system. The overall formulation has the advantage that it permits fine parallelization and does not rely on system topology to induce concurrency. It can be efficiently implemented on the present generation of parallel computers with a large number of processors. Validation of the method is presented via numerical simulations of space structures incorporating large number of flexible degrees of freedom.

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.

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

PubMed

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

2004-01-01

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

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.

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

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.

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.

A new deadlock resolution protocol and message matching algorithm for the extreme-scale simulator

DOE PAGES

Engelmann, Christian; Naughton, III, Thomas J.

2016-03-22

Investigating the performance of parallel applications at scale on future high-performance computing (HPC) architectures and the performance impact of different HPC architecture choices is an important component of HPC hardware/software co-design. The Extreme-scale Simulator (xSim) is a simulation toolkit for investigating the performance of parallel applications at scale. xSim scales to millions of simulated Message Passing Interface (MPI) processes. The overhead introduced by a simulation tool is an important performance and productivity aspect. This paper documents two improvements to xSim: (1)~a new deadlock resolution protocol to reduce the parallel discrete event simulation overhead and (2)~a new simulated MPI message matchingmore » algorithm to reduce the oversubscription management overhead. The results clearly show a significant performance improvement. The simulation overhead for running the NAS Parallel Benchmark suite was reduced from 102% to 0% for the embarrassingly parallel (EP) benchmark and from 1,020% to 238% for the conjugate gradient (CG) benchmark. xSim offers a highly accurate simulation mode for better tracking of injected MPI process failures. Furthermore, with highly accurate simulation, the overhead was reduced from 3,332% to 204% for EP and from 37,511% to 13,808% for CG.« less

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

NASA Astrophysics Data System (ADS)

Liu, Y.; Li, Y.

2016-12-01

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

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

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

PubMed

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

2014-09-01

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

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.

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

Parallel consensual neural networks.

PubMed

Benediktsson, J A; Sveinsson, J R; Ersoy, O K; Swain, P H

1997-01-01

A new type of a neural-network architecture, the parallel consensual neural network (PCNN), is introduced and applied in classification/data fusion of multisource remote sensing and geographic data. The PCNN architecture is based on statistical consensus theory and involves using stage neural networks with transformed input data. The input data are transformed several times and the different transformed data are used as if they were independent inputs. The independent inputs are first classified using the stage neural networks. The output responses from the stage networks are then weighted and combined to make a consensual decision. In this paper, optimization methods are used in order to weight the outputs from the stage networks. Two approaches are proposed to compute the data transforms for the PCNN, one for binary data and another for analog data. The analog approach uses wavelet packets. The experimental results obtained with the proposed approach show that the PCNN outperforms both a conjugate-gradient backpropagation neural network and conventional statistical methods in terms of overall classification accuracy of test data.

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.

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

NASA Astrophysics Data System (ADS)

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

2000-11-01

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

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.

Climate Data Assimilation on a Massively Parallel Supercomputer

NASA Technical Reports Server (NTRS)

Ding, Hong Q.; Ferraro, Robert D.

1996-01-01

We have designed and implemented a set of highly efficient and highly scalable algorithms for an unstructured computational package, the PSAS data assimilation package, as demonstrated by detailed performance analysis of systematic runs on up to 512-nodes of an Intel Paragon. The preconditioned Conjugate Gradient solver achieves a sustained 18 Gflops performance. Consequently, we achieve an unprecedented 100-fold reduction in time to solution on the Intel Paragon over a single head of a Cray C90. This not only exceeds the daily performance requirement of the Data Assimilation Office at NASA's Goddard Space Flight Center, but also makes it possible to explore much larger and challenging data assimilation problems which are unthinkable on a traditional computer platform such as the Cray C90.

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

NASA Technical Reports Server (NTRS)

Farhat, Charbel; Crivelli, Luis; Roux, Francois-Xavier

1992-01-01

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

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

PubMed

Mafi, Ramin; Sirouspour, Shahin

2014-03-01

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

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.

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.

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

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

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.

SIERRA - A 3-D device simulator for reliability modeling

NASA Astrophysics Data System (ADS)

Chern, Jue-Hsien; Arledge, Lawrence A., Jr.; Yang, Ping; Maeda, John T.

1989-05-01

SIERRA is a three-dimensional general-purpose semiconductor-device simulation program which serves as a foundation for investigating integrated-circuit (IC) device and reliability issues. This program solves the Poisson and continuity equations in silicon under dc, transient, and small-signal conditions. Executing on a vector/parallel minisupercomputer, SIERRA utilizes a matrix solver which uses an incomplete LU (ILU) preconditioned conjugate gradient square (CGS, BCG) method. The ILU-CGS method provides a good compromise between memory size and convergence rate. The authors have observed a 5x to 7x speedup over standard direct methods in simulations of transient problems containing highly coupled Poisson and continuity equations such as those found in reliability-oriented simulations. The application of SIERRA to parasitic CMOS latchup and dynamic random-access memory single-event-upset studies is described.

Computer Science Techniques Applied to Parallel Atomistic Simulation

NASA Astrophysics Data System (ADS)

Nakano, Aiichiro

1998-03-01

Recent developments in parallel processing technology and multiresolution numerical algorithms have established large-scale molecular dynamics (MD) simulations as a new research mode for studying materials phenomena such as fracture. However, this requires large system sizes and long simulated times. We have developed: i) Space-time multiresolution schemes; ii) fuzzy-clustering approach to hierarchical dynamics; iii) wavelet-based adaptive curvilinear-coordinate load balancing; iv) multilevel preconditioned conjugate gradient method; and v) spacefilling-curve-based data compression for parallel I/O. Using these techniques, million-atom parallel MD simulations are performed for the oxidation dynamics of nanocrystalline Al. The simulations take into account the effect of dynamic charge transfer between Al and O using the electronegativity equalization scheme. The resulting long-range Coulomb interaction is calculated efficiently with the fast multipole method. Results for temperature and charge distributions, residual stresses, bond lengths and bond angles, and diffusivities of Al and O will be presented. The oxidation of nanocrystalline Al is elucidated through immersive visualization in virtual environments. A unique dual-degree education program at Louisiana State University will also be discussed in which students can obtain a Ph.D. in Physics & Astronomy and a M.S. from the Department of Computer Science in five years. This program fosters interdisciplinary research activities for interfacing High Performance Computing and Communications with large-scale atomistic simulations of advanced materials. This work was supported by NSF (CAREER Program), ARO, PRF, and Louisiana LEQSF.

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.

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.

Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

NASA Technical Reports Server (NTRS)

Oliker, Leonid; Li, Xiaoye; Husbands, Parry; Biswas, Rupak; Biegel, Bryan (Technical Monitor)

2002-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. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(O) preconditioned CG (PCG) using different programming paradigms and architectures. Results show that for this class of applications: ordering significantly improves overall performance on both distributed and distributed shared-memory systems, that cache reuse may be more important than reducing communication, that it is possible to achieve message-passing performance using shared-memory constructs through careful data ordering and distribution, and that a hybrid MPI+OpenMP paradigm increases programming complexity with little performance gains. A implementation of CG on the Cray MTA does not require special ordering or partitioning to obtain high efficiency and scalability, giving it a distinct advantage for adaptive applications; however, it shows limited scalability for PCG due to a lack of thread level parallelism.

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.

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.

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.

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

Subpicosecond Optical Digital Computation Using Conjugate Parametric Generators

DTIC Science & Technology

1989-03-31

Using Phase Conjugate Farametric Generators ..... 12. PERSONAL AUTHOR(S) Alfano, Robert- Eichmann . George; Dorsinville. Roger! Li. Yao 13a. TYPE OF...conjugation-based optical residue arithmetic processor," Y. Li, G. Eichmann , R. Dorsinville, and R. R. Alfano, Opt. Lett. 13, (1988). [2] "Parallel ultrafast...optical digital and symbolic computation via optical phase conjugation," Y. Li, G. Eichmann , R. Dorsinville, Appl. Opt. 27, 2025 (1988). [3

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

Method and apparatus for fabrication of high gradient insulators with parallel surface conductors spaced less than one millimeter apart

DOEpatents

Sanders, David M.; Decker, Derek E.

1999-01-01

Optical patterns and lithographic techniques are used as part of a process to embed parallel and evenly spaced conductors in the non-planar surfaces of an insulator to produce high gradient insulators. The approach extends the size that high gradient insulating structures can be fabricated as well as improves the performance of those insulators by reducing the scale of the alternating parallel lines of insulator and conductor along the surface. This fabrication approach also substantially decreases the cost required to produce high gradient insulators.

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

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

NASA Technical Reports Server (NTRS)

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

1995-01-01

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

Scalable Evaluation of Polarization Energy and Associated Forces in Polarizable Molecular Dynamics: II.Towards Massively Parallel Computations using Smooth Particle Mesh Ewald.

PubMed

Lagardère, Louis; Lipparini, Filippo; Polack, Étienne; Stamm, Benjamin; Cancès, Éric; Schnieders, Michael; Ren, Pengyu; Maday, Yvon; Piquemal, Jean-Philip

2014-02-28

In this paper, we present a scalable and efficient implementation of point dipole-based polarizable force fields for molecular dynamics (MD) simulations with periodic boundary conditions (PBC). The Smooth Particle-Mesh Ewald technique is combined with two optimal iterative strategies, namely, a preconditioned conjugate gradient solver and a Jacobi solver in conjunction with the Direct Inversion in the Iterative Subspace for convergence acceleration, to solve the polarization equations. We show that both solvers exhibit very good parallel performances and overall very competitive timings in an energy-force computation needed to perform a MD step. Various tests on large systems are provided in the context of the polarizable AMOEBA force field as implemented in the newly developed Tinker-HP package which is the first implementation for a polarizable model making large scale experiments for massively parallel PBC point dipole models possible. We show that using a large number of cores offers a significant acceleration of the overall process involving the iterative methods within the context of spme and a noticeable improvement of the memory management giving access to very large systems (hundreds of thousands of atoms) as the algorithm naturally distributes the data on different cores. Coupled with advanced MD techniques, gains ranging from 2 to 3 orders of magnitude in time are now possible compared to non-optimized, sequential implementations giving new directions for polarizable molecular dynamics in periodic boundary conditions using massively parallel implementations.

Scalable Evaluation of Polarization Energy and Associated Forces in Polarizable Molecular Dynamics: II.Towards Massively Parallel Computations using Smooth Particle Mesh Ewald

PubMed Central

Lagardère, Louis; Lipparini, Filippo; Polack, Étienne; Stamm, Benjamin; Cancès, Éric; Schnieders, Michael; Ren, Pengyu; Maday, Yvon; Piquemal, Jean-Philip

2015-01-01

In this paper, we present a scalable and efficient implementation of point dipole-based polarizable force fields for molecular dynamics (MD) simulations with periodic boundary conditions (PBC). The Smooth Particle-Mesh Ewald technique is combined with two optimal iterative strategies, namely, a preconditioned conjugate gradient solver and a Jacobi solver in conjunction with the Direct Inversion in the Iterative Subspace for convergence acceleration, to solve the polarization equations. We show that both solvers exhibit very good parallel performances and overall very competitive timings in an energy-force computation needed to perform a MD step. Various tests on large systems are provided in the context of the polarizable AMOEBA force field as implemented in the newly developed Tinker-HP package which is the first implementation for a polarizable model making large scale experiments for massively parallel PBC point dipole models possible. We show that using a large number of cores offers a significant acceleration of the overall process involving the iterative methods within the context of spme and a noticeable improvement of the memory management giving access to very large systems (hundreds of thousands of atoms) as the algorithm naturally distributes the data on different cores. Coupled with advanced MD techniques, gains ranging from 2 to 3 orders of magnitude in time are now possible compared to non-optimized, sequential implementations giving new directions for polarizable molecular dynamics in periodic boundary conditions using massively parallel implementations. PMID:26512230

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

Efficient Iterative Methods Applied to the Solution of Transonic Flows

NASA Astrophysics Data System (ADS)

Wissink, Andrew M.; Lyrintzis, Anastasios S.; Chronopoulos, Anthony T.

1996-02-01

We investigate the use of an inexact Newton's method to solve the potential equations in the transonic regime. As a test case, we solve the two-dimensional steady transonic small disturbance equation. Approximate factorization/ADI techniques have traditionally been employed for implicit solutions of this nonlinear equation. Instead, we apply Newton's method using an exact analytical determination of the Jacobian with preconditioned conjugate gradient-like iterative solvers for solution of the linear systems in each Newton iteration. Two iterative solvers are tested; a block s-step version of the classical Orthomin(k) algorithm called orthogonal s-step Orthomin (OSOmin) and the well-known GMRES method. The preconditioner is a vectorizable and parallelizable version of incomplete LU (ILU) factorization. Efficiency of the Newton-Iterative method on vector and parallel computer architectures is the main issue addressed. In vectorized tests on a single processor of the Cray C-90, the performance of Newton-OSOmin is superior to Newton-GMRES and a more traditional monotone AF/ADI method (MAF) for a variety of transonic Mach numbers and mesh sizes. Newton-GMRES is superior to MAF for some cases. The parallel performance of the Newton method is also found to be very good on multiple processors of the Cray C-90 and on the massively parallel thinking machine CM-5, where very fast execution rates (up to 9 Gflops) are found for large problems.

Parallel closure theory for toroidally confined plasmas

NASA Astrophysics Data System (ADS)

Ji, Jeong-Young; Held, Eric D.

2017-10-01

We solve a system of general moment equations to obtain parallel closures for electrons and ions in an axisymmetric toroidal magnetic field. Magnetic field gradient terms are kept and treated using the Fourier series method. Assuming lowest order density (pressure) and temperature to be flux labels, the parallel heat flow, friction, and viscosity are expressed in terms of radial gradients of the lowest-order temperature and pressure, parallel gradients of temperature and parallel flow, and the relative electron-ion parallel flow velocity. Convergence of closure quantities is demonstrated as the number of moments and Fourier modes are increased. Properties of the moment equations in the collisionless limit are also discussed. Combining closures with fluid equations parallel mass flow and electric current are also obtained. Work in collaboration with the PSI Center and supported by the U.S. DOE under Grant Nos. DE-SC0014033, DE-SC0016256, and DE-FG02-04ER54746.

Optimizing Irregular Applications for Energy and Performance on the Tilera Many-core Architecture

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

Chavarría-Miranda, Daniel; Panyala, Ajay R.; Halappanavar, Mahantesh

Optimizing applications simultaneously for energy and performance is a complex problem. High performance, parallel, irregular applications are notoriously hard to optimize due to their data-dependent memory accesses, lack of structured locality and complex data structures and code patterns. Irregular kernels are growing in importance in applications such as machine learning, graph analytics and combinatorial scientific computing. Performance- and energy-efficient implementation of these kernels on modern, energy efficient, multicore and many-core platforms is therefore an important and challenging problem. We present results from optimizing two irregular applications { the Louvain method for community detection (Grappolo), and high-performance conjugate gradient (HPCCG) {more » on the Tilera many-core system. We have significantly extended MIT's OpenTuner auto-tuning framework to conduct a detailed study of platform-independent and platform-specific optimizations to improve performance as well as reduce total energy consumption. We explore the optimization design space along three dimensions: memory layout schemes, compiler-based code transformations, and optimization of parallel loop schedules. Using auto-tuning, we demonstrate whole node energy savings of up to 41% relative to a baseline instantiation, and up to 31% relative to manually optimized variants.« less

Layout optimization with algebraic multigrid methods

NASA Technical Reports Server (NTRS)

Regler, Hans; Ruede, Ulrich

1993-01-01

Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.

Final report for “Extreme-scale Algorithms and Solver Resilience”

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

Gropp, William Douglas

2017-06-30

This is a joint project with principal investigators at Oak Ridge National Laboratory, Sandia National Laboratories, the University of California at Berkeley, and the University of Tennessee. Our part of the project involves developing performance models for highly scalable algorithms and the development of latency tolerant iterative methods. During this project, we extended our performance models for the Multigrid method for solving large systems of linear equations and conducted experiments with highly scalable variants of conjugate gradient methods that avoid blocking synchronization. In addition, we worked with the other members of the project on alternative techniques for resilience and reproducibility.more » We also presented an alternative approach for reproducible dot-products in parallel computations that performs almost as well as the conventional approach by separating the order of computation from the details of the decomposition of vectors across the processes.« less

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

PubMed

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

2014-01-01

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

Impact of a variational objective analysis scheme on a regional area numerical model: The Italian Air Force Weather Service experience

NASA Astrophysics Data System (ADS)

Bonavita, M.; Torrisi, L.

2005-03-01

A new data assimilation system has been designed and implemented at the National Center for Aeronautic Meteorology and Climatology of the Italian Air Force (CNMCA) in order to improve its operational numerical weather prediction capabilities and provide more accurate guidance to operational forecasters. The system, which is undergoing testing before operational use, is based on an “observation space” version of the 3D-VAR method for the objective analysis component, and on the High Resolution Regional Model (HRM) of the Deutscher Wetterdienst (DWD) for the prognostic component. Notable features of the system include a completely parallel (MPI+OMP) implementation of the solution of analysis equations by a preconditioned conjugate gradient descent method; correlation functions in spherical geometry with thermal wind constraint between mass and wind field; derivation of the objective analysis parameters from a statistical analysis of the innovation increments.

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.

Growth of large aluminum nitride single crystals with thermal-gradient control

DOEpatents

Bondokov, Robert T; Rao, Shailaja P; Gibb, Shawn Robert; Schowalter, Leo J

2015-05-12

In various embodiments, non-zero thermal gradients are formed within a growth chamber both substantially parallel and substantially perpendicular to the growth direction during formation of semiconductor crystals, where the ratio of the two thermal gradients (parallel to perpendicular) is less than 10, by, e.g., arrangement of thermal shields outside of the growth chamber.

Growth of large aluminum nitride single crystals with thermal-gradient control

DOEpatents

Bondokov, Robert T.; Rao, Shailaja P.; Schowalter, Leo J.

2017-02-28

In various embodiments, non-zero thermal gradients are formed within a growth chamber both substantially parallel and substantially perpendicular to the growth direction during formation of semiconductor crystals, where the ratio of the two thermal gradients (parallel to perpendicular) is less than 10, by, e.g., arrangement of thermal shields outside of the growth chamber.

A Hybrid MPI/OpenMP Approach for Parallel Groundwater Model Calibration on Multicore Computers

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

Tang, Guoping; D'Azevedo, Ed F; Zhang, Fan

2010-01-01

Groundwater model calibration is becoming increasingly computationally time intensive. We describe a hybrid MPI/OpenMP approach to exploit two levels of parallelism in software and hardware to reduce calibration time on multicore computers with minimal parallelization effort. At first, HydroGeoChem 5.0 (HGC5) is parallelized using OpenMP for a uranium transport model with over a hundred species involving nearly a hundred reactions, and a field scale coupled flow and transport model. In the first application, a single parallelizable loop is identified to consume over 97% of the total computational time. With a few lines of OpenMP compiler directives inserted into the code,more » the computational time reduces about ten times on a compute node with 16 cores. The performance is further improved by selectively parallelizing a few more loops. For the field scale application, parallelizable loops in 15 of the 174 subroutines in HGC5 are identified to take more than 99% of the execution time. By adding the preconditioned conjugate gradient solver and BICGSTAB, and using a coloring scheme to separate the elements, nodes, and boundary sides, the subroutines for finite element assembly, soil property update, and boundary condition application are parallelized, resulting in a speedup of about 10 on a 16-core compute node. The Levenberg-Marquardt (LM) algorithm is added into HGC5 with the Jacobian calculation and lambda search parallelized using MPI. With this hybrid approach, compute nodes at the number of adjustable parameters (when the forward difference is used for Jacobian approximation), or twice that number (if the center difference is used), are used to reduce the calibration time from days and weeks to a few hours for the two applications. This approach can be extended to global optimization scheme and Monte Carol analysis where thousands of compute nodes can be efficiently utilized.« less

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

Percolation and permeability of heterogeneous fracture networks

NASA Astrophysics Data System (ADS)

Adler, Pierre; Mourzenko, Valeri; Thovert, Jean-François

2013-04-01

Natural fracture fields are almost necessarily heterogeneous with a fracture density varying with space. Two classes of variations are quite frequent. In the first one, the fracture density is decreasing from a given surface; the fracture density is usually (but not always see [1]) an exponential function of depth as it has been shown by many measurements. Another important example of such an exponential decrease consists of the Excavated Damaged Zone (EDZ) which is created by the excavation process of a gallery [2,3]. In the second one, the fracture density undergoes some local random variations around an average value. This presentation is mostly focused on the first class and numerical samples are generated with an exponentially decreasing density from a given plane surface. Their percolation status and hydraulic transmissivity can be calculated by the numerical codes which are detailed in [4]. Percolation is determined by a pseudo diffusion algorithm. Flow determination necessitates the meshing of the fracture networks and the discretisation of the Darcy equation by a finite volume technique; the resulting linear system is solved by a conjugate gradient algorithm. Only the flow properties of the EDZ along the directions which are parallel to the wall are of interest when a pressure gradient parallel to the wall is applied. The transmissivity T which relates the total flow rate per unit width Q along the wall through the whole fractured medium to the pressure gradient grad p, is defined by Q = - T grad p/mu where mu is the fluid viscosity. The percolation status and hydraulic transmissivity are systematically determined for a wide range of decay lengths and anisotropy parameters. They can be modeled by comparison with anisotropic fracture networks with a constant density. A heuristic power-law model is proposed which accurately describes the results for the percolation threshold over the whole investigated range of heterogeneity and anisotropy. Then, the data for transmissivity are presented. A simple parallel flow model is introduced. The flow properties of the medium vary with the distance z from the wall. However, the macroscopic pressure gradient does not depend on z, and the flow lines are in average parallel to the wall. Hence, the overall transmissivity is tentatively estimated by a parallel flow model, where a layer at depth z behaves as a fractured medium with uniform properties corresponding to the state at this position in the medium. It yields an explicit analytical expression for the transmissivity as a function of the heterogeneity and anisotropy parameters, and it successfully accounts for all the numerical data. Graphical tools are provided from which first estimates can be quickly and easily obtained. A short overview of the second class of heterogeneous media will be given. [1] Barton C.A., Zoback M.D., J. Geophys. Res., 97B, 5181-5200 (1992). [2] Bossart P. et al, Eng. Geol., vol. 66, 19-38 (2002). [3] Thovert J.-F. et al, Eng. Geol., 117, 39-51 (2011). [4] Adler P.M. et al, Fractured porous media, Oxford U. Press, 2012.

Ion-temperature-gradient sensitivity of the hydrodynamic instability caused by shear in the magnetic-field-aligned plasma flow

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

Mikhailenko, V. V., E-mail: vladimir@pusan.ac.kr; Mikhailenko, V. S.; Faculty of Transportation Systems, Kharkiv National Automobile and Highway University, 61002 Kharkiv

2014-07-15

The cross-magnetic-field (i.e., perpendicular) profile of ion temperature and the perpendicular profile of the magnetic-field-aligned (parallel) plasma flow are sometimes inhomogeneous for space and laboratory plasma. Instability caused either by a gradient in the ion-temperature profile or by shear in the parallel flow has been discussed extensively in the literature. In this paper, (1) hydrodynamic plasma stability is investigated, (2) real and imaginary frequency are quantified over a range of the shear parameter, the normalized wavenumber, and the ratio of density-gradient and ion-temperature-gradient scale lengths, and (3) the role of inverse Landau damping is illustrated for the case of combinedmore » ion-temperature gradient and parallel-flow shear. We find that increasing the ion-temperature gradient reduces the instability threshold for the hydrodynamic parallel-flow shear instability, also known as the parallel Kelvin-Helmholtz instability or the D'Angelo instability. We also find that a kinetic instability arises from the coupled, reinforcing action of both free-energy sources. For the case of comparable electron and ion temperature, we illustrate analytically the transition of the D'Angelo instability to the kinetic instability as (a) the shear parameter, (b) the normalized wavenumber, and (c) the ratio of density-gradient and ion-temperature-gradient scale lengths are varied and we attribute the changes in stability to changes in the amount of inverse ion Landau damping. We show that near a normalized wavenumber k{sub ⊥}ρ{sub i} of order unity (i) the real and imaginary values of frequency become comparable and (ii) the imaginary frequency, i.e., the growth rate, peaks.« less

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

PubMed

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

2013-09-15

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

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

PubMed

Xu, Xiao; Kong, Fan-Yu

2016-01-01

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

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

PubMed

Wei, Yongjie; Ge, Baozhen; Wei, Yaolin

2009-03-20

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

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

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

NASA Technical Reports Server (NTRS)

Burrows, R. R.

1972-01-01

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

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

Amélioration des performances d'une implantation parallélovectorielle du gradient conjugué par extension du schéma de stockage matriciel

NASA Astrophysics Data System (ADS)

Magnin, H.; Coulomb, J. L.

1993-03-01

Electromagnetic field computation with the Finite Element (FE) method implies solving of large linear systems of equations. Performances and memory capacities of today computers allow to achieve three-dimensional FE discretizations of electromagnetic problems, but the number of unknowns grows high. So, to improve time to the numerical solution of the linear system(s) thus arising, the use of parallel and/or vector computers has to be envisaged. In this paper, the main constitutive steps of the Pre-conditioned Conjugate Gradient algorithm (PCG) are analysed. After a short recall of our previous work concerning their improvement by use of vector and parallel computations, we show some speedup limitations due to the sparse row-wise matrix storage scheme employed. Then, an extension of this matrix representation is proposed, leading to introduce redundant storage of non-zero coefficients. In spite of the “memory waste” thus implied, it is shown how this extension can be successfully employed to increase the speedup due to parallelism and vectorization on the whole algorithm, and in particular to derive a parallel preconditioner. La résolution par la méthode des éléments finis des équations de l'électromagnétisme conduit à résoudre de grands systèmes d'équations linéaires. Les capacités mémoire et les performances actuelles des systèmes informatiques permettent de traiter les problèmes électromagnétiques par discrétisation tridimensionnelle, mais alors le nombre d'inconnues devient très élevé. Ainsi, la résolution en un temps raisonnable des équations linéaires associées à de telles discrétisations conduit à envisager l'emploi d'ordinateurs à architecture parallèle. Dans cet article, les différentes étapes constitutives de l'algorithme du gradient conjugué préconditionné (GCP) sont analysées. Après un court rappel de nos travaux antérieurs concemant leur amélioration par utilisation de traitements parallèles et vectoriels, nous montrons les limitations du gain de temps dues au mode de stockage matriciel utilisé : la représentation creuse dite “Morse”. Nous proposons alors une extension de ce mode de stockage, conduisant à l'introduction de redondance au niveau du rangement des termes matriciels en mémoire. Malgré le “gaspillage” mémoire ainsi occasionné, il apparait que cette extension peut être mise à profit pour augmenter sensiblement les gains par parallélisation et vectorisation de l'ensemble de l'algorithme du gradient conjugué, et notamment pour la réalisation d'un pré-conditionnement parallèle.

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.

Relationships between serum bilirubins and production and conjugation of bilirubin. Studies in Gilbert's syndrome, Crigler-Najjar disease, hemolytic disorders, and rat models.

PubMed

Muraca, M; Fevery, J; Blanckaert, N

1987-02-01

The pattern of serum bilirubins was determined in serum of humans and rats with unconjugated hyperbilirubinemia due to increased pigment load or defective hepatic conjugation. Bilirubin ester conjugates were present in all serum samples tested and were identified as bilirubin 1-O-acyl glucuronides. In Gilbert's syndrome, the concentration of total conjugates was comparable to the values in healthy control subjects. Because the concentration of unconjugated pigment was increased, the fraction of conjugated relative to total bilirubins was markedly decreased. Sera from patients with Crigler-Najjar disease differed from those with Gilbert's syndrome by the higher unconjugated bilirubin levels and the undetectability of diconjugated bilirubins. A striking finding was that in hemolytic disease, the concentration of both monoconjugates and diconjugates was enhanced in parallel with the increase of unconjugated pigment. Therefore, the fraction of conjugated relative to total bilirubins remained within the normal range. As in Gilbert's syndrome, heterozygote R/APfd-j/+ rats with impaired hepatic bilirubin conjugation exhibit an increased unconjugated bilirubin level in serum, whereas the concentration of total conjugates was comparable to the values in normal rats. In serum of normal rats loaded intraperitoneally with unconjugated bilirubin, both unconjugated and mono- and diconjugated bilirubins were increased in parallel so that the ratio of unconjugated to esterified pigment remained unaffected. Decreased hepatic conjugation or increased bilirubin load was associated with a lower percentage of diconjugates relative to total conjugates both in human and rat serum. The present results are consistent with a compartmental model in which there is bidirectional transfer across the sinusoidal membrane for unconjugated bilirubin as well as for the bilirubin glucuronides. Because typical patterns of serum bilirubins are found in Gilbert's syndrome and patients with hemolytic hyperbilirubinemia, determination of esterified bilirubins in serum is of value to study the pathophysiology and the differential diagnosis of unconjugated hyperbilirubinemia.

A hierarchical wavefront reconstruction algorithm for gradient sensors

NASA Astrophysics Data System (ADS)

Bharmal, Nazim; Bitenc, Urban; Basden, Alastair; Myers, Richard

2013-12-01

ELT-scale extreme adaptive optics systems will require new approaches tocompute the wavefront suitably quickly, when the computational burden ofapplying a MVM is no longer practical. An approach is demonstrated here whichis hierarchical in transforming wavefront slopes from a WFS into a wavefront,and then to actuator values. First, simple integration in 1D is used to create1D-wavefront estimates with unknown starting points at the edges of independentspatial domains. Second, these starting points are estimated globally. By thesestarting points are a sub-set of the overall grid where wavefront values are tobe estimated, sparse representations are produced and numerical complexity canbe chosen by the spacing of the starting point grid relative to the overallgrid. Using a combination of algebraic expressions, sparse representation, anda conjugate gradient solver, the number of non-parallelized operations forreconstruction on a 100x100 sub-aperture sized problem is ~600,000 or O(N^3/2),which is approximately the same as for each thread of a MVM solutionparallelized over 100 threads. To reduce the effects of noise propagationwithin each domain, a noise reduction algorithm can be applied which ensuresthe continuity of the wavefront. To apply this additional step has a cost of~1,200,000 operations. We conclude by briefly discussing how the final step ofconverting from wavefront to actuator values can be achieved.

Parallelisation study of a three-dimensional environmental flow model

NASA Astrophysics Data System (ADS)

O'Donncha, Fearghal; Ragnoli, Emanuele; Suits, Frank

2014-03-01

There are many simulation codes in the geosciences that are serial and cannot take advantage of the parallel computational resources commonly available today. One model important for our work in coastal ocean current modelling is EFDC, a Fortran 77 code configured for optimal deployment on vector computers. In order to take advantage of our cache-based, blade computing system we restructured EFDC from serial to parallel, thereby allowing us to run existing models more quickly, and to simulate larger and more detailed models that were previously impractical. Since the source code for EFDC is extensive and involves detailed computation, it is important to do such a port in a manner that limits changes to the files, while achieving the desired speedup. We describe a parallelisation strategy involving surgical changes to the source files to minimise error-prone alteration of the underlying computations, while allowing load-balanced domain decomposition for efficient execution on a commodity cluster. The use of conjugate gradient posed particular challenges due to implicit non-local communication posing a hindrance to standard domain partitioning schemes; a number of techniques are discussed to address this in a feasible, computationally efficient manner. The parallel implementation demonstrates good scalability in combination with a novel domain partitioning scheme that specifically handles mixed water/land regions commonly found in coastal simulations. The approach presented here represents a practical methodology to rejuvenate legacy code on a commodity blade cluster with reasonable effort; our solution has direct application to other similar codes in the geosciences.

Efficient iterative methods applied to the solution of transonic flows

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

Wissink, A.M.; Lyrintzis, A.S.; Chronopoulos, A.T.

1996-02-01

We investigate the use of an inexact Newton`s method to solve the potential equations in the transonic regime. As a test case, we solve the two-dimensional steady transonic small disturbance equation. Approximate factorization/ADI techniques have traditionally been employed for implicit solutions of this nonlinear equation. Instead, we apply Newton`s method using an exact analytical determination of the Jacobian with preconditioned conjugate gradient-like iterative solvers for solution of the linear systems in each Newton iteration. Two iterative solvers are tested; a block s-step version of the classical Orthomin(k) algorithm called orthogonal s-step Orthomin (OSOmin) and the well-known GIVIRES method. The preconditionermore » is a vectorizable and parallelizable version of incomplete LU (ILU) factorization. Efficiency of the Newton-Iterative method on vector and parallel computer architectures is the main issue addressed. In vectorized tests on a single processor of the Cray C-90, the performance of Newton-OSOmin is superior to Newton-GMRES and a more traditional monotone AF/ADI method (MAF) for a variety of transonic Mach numbers and mesh sizes. Newton- GIVIRES is superior to MAF for some cases. The parallel performance of the Newton method is also found to be very good on multiple processors of the Cray C-90 and on the massively parallel thinking machine CM-5, where very fast execution rates (up to 9 Gflops) are found for large problems. 38 refs., 14 figs., 7 tabs.« less

Reducing computational costs in large scale 3D EIT by using a sparse Jacobian matrix with block-wise CGLS reconstruction.

PubMed

Yang, C L; Wei, H Y; Adler, A; Soleimani, M

2013-06-01

Electrical impedance tomography (EIT) is a fast and cost-effective technique to provide a tomographic conductivity image of a subject from boundary current-voltage data. This paper proposes a time and memory efficient method for solving a large scale 3D EIT inverse problem using a parallel conjugate gradient (CG) algorithm. The 3D EIT system with a large number of measurement data can produce a large size of Jacobian matrix; this could cause difficulties in computer storage and the inversion process. One of challenges in 3D EIT is to decrease the reconstruction time and memory usage, at the same time retaining the image quality. Firstly, a sparse matrix reduction technique is proposed using thresholding to set very small values of the Jacobian matrix to zero. By adjusting the Jacobian matrix into a sparse format, the element with zeros would be eliminated, which results in a saving of memory requirement. Secondly, a block-wise CG method for parallel reconstruction has been developed. The proposed method has been tested using simulated data as well as experimental test samples. Sparse Jacobian with a block-wise CG enables the large scale EIT problem to be solved efficiently. Image quality measures are presented to quantify the effect of sparse matrix reduction in reconstruction results.

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.

On a model of three-dimensional bursting and its parallel implementation

NASA Astrophysics Data System (ADS)

Tabik, S.; Romero, L. F.; Garzón, E. M.; Ramos, J. I.

2008-04-01

A mathematical model for the simulation of three-dimensional bursting phenomena and its parallel implementation are presented. The model consists of four nonlinearly coupled partial differential equations that include fast and slow variables, and exhibits bursting in the absence of diffusion. The differential equations have been discretized by means of a second-order accurate in both space and time, linearly-implicit finite difference method in equally-spaced grids. The resulting system of linear algebraic equations at each time level has been solved by means of the Preconditioned Conjugate Gradient (PCG) method. Three different parallel implementations of the proposed mathematical model have been developed; two of these implementations, i.e., the MPI and the PETSc codes, are based on a message passing paradigm, while the third one, i.e., the OpenMP code, is based on a shared space address paradigm. These three implementations are evaluated on two current high performance parallel architectures, i.e., a dual-processor cluster and a Shared Distributed Memory (SDM) system. A novel representation of the results that emphasizes the most relevant factors that affect the performance of the paralled implementations, is proposed. The comparative analysis of the computational results shows that the MPI and the OpenMP implementations are about twice more efficient than the PETSc code on the SDM system. It is also shown that, for the conditions reported here, the nonlinear dynamics of the three-dimensional bursting phenomena exhibits three stages characterized by asynchronous, synchronous and then asynchronous oscillations, before a quiescent state is reached. It is also shown that the fast system reaches steady state in much less time than the slow variables.

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

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.

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

NASA Technical Reports Server (NTRS)

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

1998-01-01

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

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.

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.

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

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

Percolation and permeability of fracture networks in Excavated Damaged Zones

NASA Astrophysics Data System (ADS)

Mourzenko, V.; Thovert, J.; Adler, P. M.

2012-12-01

Generally, the excavation process of a gallery generates fractures in its immediate vicinity. The corresponding zone which is called the Excavated Damaged Zone (EDZ), has a larger permeability than the intact surrounding medium. The properties of the EDZ are attracting more and more attention because of their potential importance in repositories of nuclear wastes. The EDZ which is induced by the excavation process may create along the galleries of the repositories a high permeability zone which could directly connect the storage area with the ground surface. Therefore, the studies of its properties are of crucial importance for applications such as the storage of nuclear wastes. Field observations (such as the ones which have been systematically performed at Mont Terri by [1, 2]) suggest that the fracture density is an exponentially decreasing function of the distance to the wall with a characteristic length of about 0.5 m and that the fracture orientation is anisotropic (most fractures are subparallel to the tunnel walls) and well approximated by a Fisher law whose pole is orthogonal to the wall. Numerical samples are generated according to these prescriptions. Their percolation status and hydraulic transmissivity can be calculated by the numerical codes which are detailed in [3]. Percolation is determined by a pseudo diffusion algorithm. Flow determination necessitates the meshing of the fracture networks and the discretisation of the Darcy equation by a finite volume technique; the resulting linear system is solved by a conjugate gradient algorithm. Only the flow properties of the EDZ along the directions which are parallel to the wall are of interest when a pressure gradient parallel to the wall is applied. The transmissivity T which relates the total flow rate per unit width Q along the wall through the whole EDZ to the pressure gradient grad p, is defined by Q = - T grad p/mu where mu is the fluid viscosity. The percolation status and hydraulic transmissivity are systematically determined for a wide range of decay lengths and anisotropy parameters. They can be modeled by comparison with anisotropic fracture networks with a constant density. A heuristic power-law model is proposed which accurately describes the results for the percolation threshold over the whole investigated range of heterogeneity and anisotropy. Then, the data for the EDZ transmissivity are presented. A simple parallel flow model is introduced. The flow properties of the EDZ vary with the distance z from the wall. However, the macroscopic pressure gradient does not depend on z, and the flow lines are in average parallel to the wall. Hence, the overall transmissivity is tentatively estimated by a parallel flow model, where a layer at depth z behaves as a fractured medium with uniform properties corresponding to the state at this position in the EDZ. It yields an explicit analytical expression for the transmissivity as a function of the heterogeneity and anisotropy parameters, and it successfully accounts for all the numerical data. Graphical tools are provided from which first estimates can be quickly and easily obtained. [1] Bossart P. et al, Eng. Geol., vol. 66, 19-38 (2002). [2] Thovert J.-F. et al, Eng. Geol., 117, 39-51 (2011). [3] Adler P.M. et al, Fractured porous media, Oxford U. Press, in press.

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.

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

Design Method of Digital Optimal Control Scheme and Multiple Paralleled Bridge Type Current Amplifier for Generating Gradient Magnetic Fields in MRI Systems

NASA Astrophysics Data System (ADS)

Watanabe, Shuji; Takano, Hiroshi; Fukuda, Hiroya; Hiraki, Eiji; Nakaoka, Mutsuo

This paper deals with a digital control scheme of multiple paralleled high frequency switching current amplifier with four-quadrant chopper for generating gradient magnetic fields in MRI (Magnetic Resonance Imaging) systems. In order to track high precise current pattern in Gradient Coils (GC), the proposal current amplifier cancels the switching current ripples in GC with each other and designed optimum switching gate pulse patterns without influences of the large filter current ripple amplitude. The optimal control implementation and the linear control theory in GC current amplifiers have affinity to each other with excellent characteristics. The digital control system can be realized easily through the digital control implementation, DSPs or microprocessors. Multiple-parallel operational microprocessors realize two or higher paralleled GC current pattern tracking amplifier with optimal control design and excellent results are given for improving the image quality of MRI systems.

Parallelization of Program to Optimize Simulated Trajectories (POST3D)

NASA Technical Reports Server (NTRS)

Hammond, Dana P.; Korte, John J. (Technical Monitor)

2001-01-01

This paper describes the parallelization of the Program to Optimize Simulated Trajectories (POST3D). POST3D uses a gradient-based optimization algorithm that reaches an optimum design point by moving from one design point to the next. The gradient calculations required to complete the optimization process, dominate the computational time and have been parallelized using a Single Program Multiple Data (SPMD) on a distributed memory NUMA (non-uniform memory access) architecture. The Origin2000 was used for the tests presented.

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.

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.

Linearly exact parallel closures for slab geometry

NASA Astrophysics Data System (ADS)

Ji, Jeong-Young; Held, Eric D.; Jhang, Hogun

2013-08-01

Parallel closures are obtained by solving a linearized kinetic equation with a model collision operator using the Fourier transform method. The closures expressed in wave number space are exact for time-dependent linear problems to within the limits of the model collision operator. In the adiabatic, collisionless limit, an inverse Fourier transform is performed to obtain integral (nonlocal) parallel closures in real space; parallel heat flow and viscosity closures for density, temperature, and flow velocity equations replace Braginskii's parallel closure relations, and parallel flow velocity and heat flow closures for density and temperature equations replace Spitzer's parallel transport relations. It is verified that the closures reproduce the exact linear response function of Hammett and Perkins [Phys. Rev. Lett. 64, 3019 (1990)] for Landau damping given a temperature gradient. In contrast to their approximate closures where the vanishing viscosity coefficient numerically gives an exact response, our closures relate the heat flow and nonvanishing viscosity to temperature and flow velocity (gradients).

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.

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.

A parallel algorithm for 2D visco-acoustic frequency-domain full-waveform inversion: application to a dense OBS data set

NASA Astrophysics Data System (ADS)

Sourbier, F.; Operto, S.; Virieux, J.

2006-12-01

We present a distributed-memory parallel algorithm for 2D visco-acoustic full-waveform inversion of wide-angle seismic data. Our code is written in fortran90 and use MPI for parallelism. The algorithm was applied to real wide-angle data set recorded by 100 OBSs with a 1-km spacing in the eastern-Nankai trough (Japan) to image the deep structure of the subduction zone. Full-waveform inversion is applied sequentially to discrete frequencies by proceeding from the low to the high frequencies. The inverse problem is solved with a classic gradient method. Full-waveform modeling is performed with a frequency-domain finite-difference method. In the frequency-domain, solving the wave equation requires resolution of a large unsymmetric system of linear equations. We use the massively parallel direct solver MUMPS (http://www.enseeiht.fr/irit/apo/MUMPS) for distributed-memory computer to solve this system. The MUMPS solver is based on a multifrontal method for the parallel factorization. The MUMPS algorithm is subdivided in 3 main steps: a symbolic analysis step that performs re-ordering of the matrix coefficients to minimize the fill-in of the matrix during the subsequent factorization and an estimation of the assembly tree of the matrix. Second, the factorization is performed with dynamic scheduling to accomodate numerical pivoting and provides the LU factors distributed over all the processors. Third, the resolution is performed for multiple sources. To compute the gradient of the cost function, 2 simulations per shot are required (one to compute the forward wavefield and one to back-propagate residuals). The multi-source resolutions can be performed in parallel with MUMPS. In the end, each processor stores in core a sub-domain of all the solutions. These distributed solutions can be exploited to compute in parallel the gradient of the cost function. Since the gradient of the cost function is a weighted stack of the shot and residual solutions of MUMPS, each processor computes the corresponding sub-domain of the gradient. In the end, the gradient is centralized on the master processor using a collective communation. The gradient is scaled by the diagonal elements of the Hessian matrix. This scaling is computed only once per frequency before the first iteration of the inversion. Estimation of the diagonal terms of the Hessian requires performing one simulation per non redondant shot and receiver position. The same strategy that the one used for the gradient is used to compute the diagonal Hessian in parallel. This algorithm was applied to a dense wide-angle data set recorded by 100 OBSs in the eastern Nankai trough, offshore Japan. Thirteen frequencies ranging from 3 and 15 Hz were inverted. Tweny iterations per frequency were computed leading to 260 tomographic velocity models of increasing resolution. The velocity model dimensions are 105 km x 25 km corresponding to a finite-difference grid of 4201 x 1001 grid with a 25-m grid interval. The number of shot was 1005 and the number of inverted OBS gathers was 93. The inversion requires 20 days on 6 32-bits bi-processor nodes with 4 Gbytes of RAM memory per node when only the LU factorization is performed in parallel. Preliminary estimations of the time required to perform the inversion with the fully-parallelized code is 6 and 4 days using 20 and 50 processors respectively.

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.

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.

The Role of Nonlinear Gradients in Parallel Imaging: A k-Space Based Analysis.

PubMed

Galiana, Gigi; Stockmann, Jason P; Tam, Leo; Peters, Dana; Tagare, Hemant; Constable, R Todd

2012-09-01

Sequences that encode the spatial information of an object using nonlinear gradient fields are a new frontier in MRI, with potential to provide lower peripheral nerve stimulation, windowed fields of view, tailored spatially-varying resolution, curved slices that mirror physiological geometry, and, most importantly, very fast parallel imaging with multichannel coils. The acceleration for multichannel images is generally explained by the fact that curvilinear gradient isocontours better complement the azimuthal spatial encoding provided by typical receiver arrays. However, the details of this complementarity have been more difficult to specify. We present a simple and intuitive framework for describing the mechanics of image formation with nonlinear gradients, and we use this framework to review some the main classes of nonlinear encoding schemes.

LASER APPLICATIONS AND OTHER TOPICS IN QUANTUM ELECTRONICS: Application of the stochastic parallel gradient descent algorithm for numerical simulation and analysis of the coherent summation of radiation from fibre amplifiers

NASA Astrophysics Data System (ADS)

Zhou, Pu; Wang, Xiaolin; Li, Xiao; Chen, Zilum; Xu, Xiaojun; Liu, Zejin

2009-10-01

Coherent summation of fibre laser beams, which can be scaled to a relatively large number of elements, is simulated by using the stochastic parallel gradient descent (SPGD) algorithm. The applicability of this algorithm for coherent summation is analysed and its optimisaton parameters and bandwidth limitations are studied.

Using the GeoFEST Faulted Region Simulation System

NASA Technical Reports Server (NTRS)

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

2004-01-01

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

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures

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

Druinsky, Alex; Ghysels, Pieter; Li, Xiaoye S.

In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism andmore » made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.« less

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.

Fast Whole-Engine Stirling Analysis

NASA Technical Reports Server (NTRS)

Dyson, Rodger W.; Wilson, Scott D.; Tew, Roy C.; Demko, Rikako

2006-01-01

This presentation discusses the simulation approach to whole-engine for physical consistency, REV regenerator modeling, grid layering for smoothness, and quality, conjugate heat transfer method adjustment, high-speed low cost parallel cluster, and debugging.

Image reconstruction from cone-beam projections with attenuation correction

NASA Astrophysics Data System (ADS)

Weng, Yi

1997-07-01

In single photon emission computered tomography (SPECT) imaging, photon attenuation within the body is a major factor contributing to the quantitative inaccuracy in measuring the distribution of radioactivity. Cone-beam SPECT provides improved sensitivity for imaging small organs. This thesis extends the results for 2D parallel- beam and fan-beam geometry to 3D parallel-beam and cone- beam geometries in order to derive filtered backprojection reconstruction algorithms for the 3D exponential parallel-beam transform and for the exponential cone-beam transform with sampling on a sphere. An exact inversion formula for the 3D exponential parallel-beam transform is obtained and is extended to the 3D exponential cone-beam transform. Sampling on a sphere is not useful clinically and current cone-beam tomography, with the focal point traversing a planar orbit, does not acquire sufficient data to give an accurate reconstruction. Thus a data acquisition method that obtains complete data for cone-beam SPECT by simultaneously rotating the gamma camera and translating the patient bed, so that cone-beam projections can be obtained with the focal point traversing a helix that surrounds the patient was developed. First, an implementation of Grangeat's algorithm for helical cone- beam projections was developed without attenuation correction. A fast new rebinning scheme was developed that uses all of the detected data to reconstruct the image and properly normalizes any multiply scanned data. In the case of attenuation no theorem analogous to Tuy's has been proven. We hypothesized that an artifact-free reconstruction could be obtained even if the cone-beam data are attenuated, provided the imaging orbit satisfies Tuy's condition and the exact attenuation map is known. Cone-beam emission data were acquired by using a circle- and-line and a helix orbit on a clinical SPECT system. An iterative conjugate gradient reconstruction algorithm was used to reconstruct projection data with a known attenuation map. The quantitative accuracy of the attenuation-corrected emission reconstruction was significantly improved.

Extending substructure based iterative solvers to multiple load and repeated analyses

NASA Technical Reports Server (NTRS)

Farhat, Charbel

1993-01-01

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

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.

Transect studies on pine forests along parallel 52° north, 12-32° east and along a pollution gradient in Poland: general assumptions

Treesearch

Alicja Breymeyer

1998-01-01

The responses of pine forest to changing climate and environmental chemistry were studied along two transects following the pollution and continentality gradients in Poland. One axis begins on the western border of Poland, crosses the country along the 52nd parallel, and ends on the eastern border of Poland in the area of Bialowieza National Park, Biosphere Reserve....

Parallel electric fields detected via conjugate electron echoes during the Echo 7 sounding rocket flight

NASA Technical Reports Server (NTRS)

Nemzek, R. J.; Winckler, J. R.

1991-01-01

Electron detectors on the Echo 7 active sounding rocket experiment measured 'conjugate echoes' resulting from artificial electron beam injections. Analysis of the drift motion of the electrons after a complete bounce leads to measurements of the magnetospheric convection electric field mapped to ionospheric altitudes. The magnetospheric field was highly variable, changing by tens of mV/m on time scales of as little as hundreds of millisec. While the smallest-scale magnetospheric field irregularities were mapped out by ionospheric conductivity, larger-scale features were enhanced by up to 50 mV/m in the ionosphere. The mismatch between magnetospheric and ionspheric convection fields indicates a violation of the equipotential field line condition. The parallel fields occurred in regions roughly 10 km across and probably supported a total potential drop of 10-100 V.

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.

Parallel dynamics between non-Hermitian and Hermitian systems

NASA Astrophysics Data System (ADS)

Wang, P.; Lin, S.; Jin, L.; Song, Z.

2018-06-01

We reveals a connection between non-Hermitian and Hermitian systems by studying the connection between a family of non-Hermitian and Hermitian Hamiltonians based on exact solutions. In general, for a dynamic process in a non-Hermitian system H , there always exists a parallel dynamic process governed by the corresponding Hermitian conjugate system H†. We show that a linear superposition of the two parallel dynamics is exactly equivalent to the time evolution of a state under a Hermitian Hamiltonian H , and we present the relations between {H ,H ,H†} .

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.

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.

Fast implementation for compressive recovery of highly accelerated cardiac cine MRI using the balanced sparse model.

PubMed

Ting, Samuel T; Ahmad, Rizwan; Jin, Ning; Craft, Jason; Serafim da Silveira, Juliana; Xue, Hui; Simonetti, Orlando P

2017-04-01

Sparsity-promoting regularizers can enable stable recovery of highly undersampled magnetic resonance imaging (MRI), promising to improve the clinical utility of challenging applications. However, lengthy computation time limits the clinical use of these methods, especially for dynamic MRI with its large corpus of spatiotemporal data. Here, we present a holistic framework that utilizes the balanced sparse model for compressive sensing and parallel computing to reduce the computation time of cardiac MRI recovery methods. We propose a fast, iterative soft-thresholding method to solve the resulting ℓ1-regularized least squares problem. In addition, our approach utilizes a parallel computing environment that is fully integrated with the MRI acquisition software. The methodology is applied to two formulations of the multichannel MRI problem: image-based recovery and k-space-based recovery. Using measured MRI data, we show that, for a 224 × 144 image series with 48 frames, the proposed k-space-based approach achieves a mean reconstruction time of 2.35 min, a 24-fold improvement compared a reconstruction time of 55.5 min for the nonlinear conjugate gradient method, and the proposed image-based approach achieves a mean reconstruction time of 13.8 s. Our approach can be utilized to achieve fast reconstruction of large MRI datasets, thereby increasing the clinical utility of reconstruction techniques based on compressed sensing. Magn Reson Med 77:1505-1515, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.

Multi-step high-throughput conjugation platform for the development of antibody-drug conjugates.

PubMed

Andris, Sebastian; Wendeler, Michaela; Wang, Xiangyang; Hubbuch, Jürgen

2018-07-20

Antibody-drug conjugates (ADCs) form a rapidly growing class of biopharmaceuticals which attracts a lot of attention throughout the industry due to its high potential for cancer therapy. They combine the specificity of a monoclonal antibody (mAb) and the cell-killing capacity of highly cytotoxic small molecule drugs. Site-specific conjugation approaches involve a multi-step process for covalent linkage of antibody and drug via a linker. Despite the range of parameters that have to be investigated, high-throughput methods are scarcely used so far in ADC development. In this work an automated high-throughput platform for a site-specific multi-step conjugation process on a liquid-handling station is presented by use of a model conjugation system. A high-throughput solid-phase buffer exchange was successfully incorporated for reagent removal by utilization of a batch cation exchange step. To ensure accurate screening of conjugation parameters, an intermediate UV/Vis-based concentration determination was established including feedback to the process. For conjugate characterization, a high-throughput compatible reversed-phase chromatography method with a runtime of 7 min and no sample preparation was developed. Two case studies illustrate the efficient use for mapping the operating space of a conjugation process. Due to the degree of automation and parallelization, the platform is capable of significantly reducing process development efforts and material demands and shorten development timelines for antibody-drug conjugates. Copyright © 2018 Elsevier B.V. All rights reserved.

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.

In vitro antibody-enzyme conjugates with specific bactericidal activity.

PubMed

Knowles, D M; Sulivan, T J; Parker, C W; Williams, R C

1973-06-01

IgG with antibacterial antibody opsonic activity was isolated from rabbit antisera produced by intravenous hyperimmunization with several test strains of pneumococci, Group A beta-hemolytic streptococci, Staphylococcus aureus, Proteus mirabilis, Pseudomonas aeruginosa, and Escherichia coli. Antibody-enzyme conjugates were prepared, using diethylmalonimidate to couple glucose oxidase to IgG antibacterial antibody preparations. Opsonic human IgG obtained from serum of patients with subacute bacterial endocarditis was also conjugated to glucose oxidase. Antibody-enzyme conjugates retained combining specificity for test bacteria as demonstrated by indirect immunofluorescence. In vitro test for bactericidal activity of antibody-enzyme conjugates utilized potassium iodide, lactoperoxidase, and glucose as cofactors. Under these conditions glucose oxidase conjugated to antibody generates hydrogen peroxide, and lactoperoxidase enzyme catalyzes the reduction of hydrogen peroxide with simultaneous oxidation of I(-) and halogenation and killing of test bacteria. Potent in vitro bactericidal activity of this system was repeatedly demonstrated for antibody-enzyme conjugates against pneumococci, streptococci, S. aureus, P. mirabilis, and E. coli. However, no bactericidal effect was demonstrable with antibody-enzyme conjugates and two test strains of P. aeruginosa. Bactericidal activity of antibody-enzyme conjugates appeared to parallel original opsonic potency of unconjugated IgG preparations. Antibody-enzyme conjugates at concentrations as low as 0.01 mg/ml were capable of intense bactericidal activity producing substantial drops in surviving bacterial counts within 30-60 min after initiation of assay. These in vitro bactericidal systems indicate that the concept of antibacterial antibody-enzyme conjugates may possibly be adaptable as a mechanism for treatment of patients with leukocyte dysfunction or fulminant bacteremia.

High-Beta Electromagnetic Turbulence in LAPD Plasmas

NASA Astrophysics Data System (ADS)

Rossi, G.; Carter, T. A.; Pueschel, M. J.; Jenko, F.; Told, D.; Terry, P. W.

2015-11-01

The introduction of a new LaB6 cathode plasma source in the Large Plasma Device has enabled the study of pressure-gradient-driven turbulence and transport variations at significantly higher plasma β. Density fluctuations are observed to decrease with increasing β while magnetic fluctuations increase. Furthermore, the perpendicular magnetic fluctuations are seen to saturate while parallel (compressional) magnetic fluctuations increase continuously with β. These observations are compared to linear and nonlinear simulations with the GENE code. The results are consistent with the linear excitation of a Gradient-driven Drift Coupling mode (GDC) which relies on grad-B drift due to parallel magnetic fluctuations and can be driven by density or temperature gradients.

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.

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

NASA Technical Reports Server (NTRS)

Larson, J. W.; Guo, J.; Lyster, P. M.

1999-01-01

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

3-D modeling of ductile tearing using finite elements: Computational aspects and techniques

NASA Astrophysics Data System (ADS)

Gullerud, Arne Stewart

This research focuses on the development and application of computational tools to perform large-scale, 3-D modeling of ductile tearing in engineering components under quasi-static to mild loading rates. Two standard models for ductile tearing---the computational cell methodology and crack growth controlled by the crack tip opening angle (CTOA)---are described and their 3-D implementations are explored. For the computational cell methodology, quantification of the effects of several numerical issues---computational load step size, procedures for force release after cell deletion, and the porosity for cell deletion---enables construction of computational algorithms to remove the dependence of predicted crack growth on these issues. This work also describes two extensions of the CTOA approach into 3-D: a general 3-D method and a constant front technique. Analyses compare the characteristics of the extensions, and a validation study explores the ability of the constant front extension to predict crack growth in thin aluminum test specimens over a range of specimen geometries, absolutes sizes, and levels of out-of-plane constraint. To provide a computational framework suitable for the solution of these problems, this work also describes the parallel implementation of a nonlinear, implicit finite element code. The implementation employs an explicit message-passing approach using the MPI standard to maintain portability, a domain decomposition of element data to provide parallel execution, and a master-worker organization of the computational processes to enhance future extensibility. A linear preconditioned conjugate gradient (LPCG) solver serves as the core of the solution process. The parallel LPCG solver utilizes an element-by-element (EBE) structure of the computations to permit a dual-level decomposition of the element data: domain decomposition of the mesh provides efficient coarse-grain parallel execution, while decomposition of the domains into blocks of similar elements (same type, constitutive model, etc.) provides fine-grain parallel computation on each processor. A major focus of the LPCG solver is a new implementation of the Hughes-Winget element-by-element (HW) preconditioner. The implementation employs a weighted dependency graph combined with a new coloring algorithm to provide load-balanced scheduling for the preconditioner and overlapped communication/computation. This approach enables efficient parallel application of the HW preconditioner for arbitrary unstructured meshes.

Hybrid optoelectronic neural networks using a mutually pumped phase-conjugate mirror

NASA Astrophysics Data System (ADS)

Dunning, G. J.; Owechko, Y.; Soffer, B. H.

1991-06-01

A method is described for interconnecting hybrid optoelectronic neural networks by using a mutually pumped phase conjugate mirror (MP-PCM). In this method, cross talk due to Bragg degeneracies is greatly reduced by storing each weight among many spatially and angularly multiplexed gratings. The effective weight throughput is increased by the parallel updating of weights using outer-product learning. Experiments demonstrated a high degree of interconnectivity between adjacent pixels. A diagram is presented showing the architecture for the optoelectronic neural network using an MP-PCM.

Evaluation of the accuracy of the Rotating Parallel Ray Omnidirectional Integration for instantaneous pressure reconstruction from the measured pressure gradient

NASA Astrophysics Data System (ADS)

Moreto, Jose; Liu, Xiaofeng

2017-11-01

The accuracy of the Rotating Parallel Ray omnidirectional integration for pressure reconstruction from the measured pressure gradient (Liu et al., AIAA paper 2016-1049) is evaluated against both the Circular Virtual Boundary omnidirectional integration (Liu and Katz, 2006 and 2013) and the conventional Poisson equation approach. Dirichlet condition at one boundary point and Neumann condition at all other boundary points are applied to the Poisson solver. A direct numerical simulation database of isotropic turbulence flow (JHTDB), with a homogeneously distributed random noise added to the entire field of DNS pressure gradient, is used to assess the performance of the methods. The random noise, generated by the Matlab function Rand, has a magnitude varying randomly within the range of +/-40% of the maximum DNS pressure gradient. To account for the effect of the noise distribution pattern on the reconstructed pressure accuracy, a total of 1000 different noise distributions achieved by using different random number seeds are involved in the evaluation. Final results after averaging the 1000 realizations show that the error of the reconstructed pressure normalized by the DNS pressure variation range is 0.15 +/-0.07 for the Poisson equation approach, 0.028 +/-0.003 for the Circular Virtual Boundary method and 0.027 +/-0.003 for the Rotating Parallel Ray method, indicating the robustness of the Rotating Parallel Ray method in pressure reconstruction. Sponsor: The San Diego State University UGP program.

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.

Development of a Stereo Vision Measurement System for a 3D Three-Axial Pneumatic Parallel Mechanism Robot Arm

PubMed Central

Chiang, Mao-Hsiung; Lin, Hao-Ting; Hou, Chien-Lun

2011-01-01

In this paper, a stereo vision 3D position measurement system for a three-axial pneumatic parallel mechanism robot arm is presented. The stereo vision 3D position measurement system aims to measure the 3D trajectories of the end-effector of the robot arm. To track the end-effector of the robot arm, the circle detection algorithm is used to detect the desired target and the SAD algorithm is used to track the moving target and to search the corresponding target location along the conjugate epipolar line in the stereo pair. After camera calibration, both intrinsic and extrinsic parameters of the stereo rig can be obtained, so images can be rectified according to the camera parameters. Thus, through the epipolar rectification, the stereo matching process is reduced to a horizontal search along the conjugate epipolar line. Finally, 3D trajectories of the end-effector are computed by stereo triangulation. The experimental results show that the stereo vision 3D position measurement system proposed in this paper can successfully track and measure the fifth-order polynomial trajectory and sinusoidal trajectory of the end-effector of the three- axial pneumatic parallel mechanism robot arm. PMID:22319408

Effect of parallel refraction on magnetospheric upper hybrid waves

NASA Technical Reports Server (NTRS)

Engel, J.; Kennel, C. F.

1984-01-01

Large amplitude (not less than 10 mV/m) electrostatic plasma waves near the upper hybrid (UH) frequency have been observed from 0 to 50 deg magnetic latitude (MLAT) during satellite plasma-pause crossings. A three-dimensional numerical ray-tracing calculation, based on an electron distribution measured during a GEOS 1 dayside intense upper-hybrid wave event, suggests how UH waves might achieve such large amplitudes away from the geomagnetic equator. Refractive effects largely control the wave amplification and, in particular, the unavoidable refraction due to parallel geomagnetic field gradients restricts growth to levels below those observed. However, a cold electron density gradient parallel to the field can lead to upper hybrid wave growth that can account for the observed emission levels.

Dip and anisotropy effects on flow using a vertically skewed model grid.

PubMed

Hoaglund, John R; Pollard, David

2003-01-01

Darcy flow equations relating vertical and bedding-parallel flow to vertical and bedding-parallel gradient components are derived for a skewed Cartesian grid in a vertical plane, correcting for structural dip given the principal hydraulic conductivities in bedding-parallel and bedding-orthogonal directions. Incorrect-minus-correct flow error results are presented for ranges of structural dip (0 < or = theta < or = 90) and gradient directions (0 < or = phi < or = 360). The equations can be coded into ground water models (e.g., MODFLOW) that can use a skewed Cartesian coordinate system to simulate flow in structural terrain with deformed bedding planes. Models modified with these equations will require input arrays of strike and dip, and a solver that can handle off-diagonal hydraulic conductivity terms.

Experimental verification of the role of electron pressure in fast magnetic reconnection with a guide field

DOE PAGES

Fox, W.; Sciortino, F.; v. Stechow, A.; ...

2017-03-21

We report detailed laboratory observations of the structure of a reconnection current sheet in a two-fluid plasma regime with a guide magnetic field. We observe and quantitatively analyze the quadrupolar electron pressure variation in the ion-diffusion region, as originally predicted by extended magnetohydrodynamics simulations. The projection of the electron pressure gradient parallel to the magnetic field contributes significantly to balancing the parallel electric field, and the resulting cross-field electron jets in the reconnection layer are diamagnetic in origin. Furthermore, these results demonstrate how parallel and perpendicular force balance are coupled in guide field reconnection and confirm basic theoretical models ofmore » the importance of electron pressure gradients for obtaining fast magnetic reconnection.« less

Phase locking of a seven-channel continuous wave fibre laser system by a stochastic parallel gradient algorithm

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

Volkov, M V; Garanin, S G; Dolgopolov, Yu V

2014-11-30

A seven-channel fibre laser system operated by the master oscillator – multichannel power amplifier scheme is the phase locked using a stochastic parallel gradient algorithm. The phase modulators on lithium niobate crystals are controlled by a multichannel electronic unit with the microcontroller processing signals in real time. The dynamic phase locking of the laser system with the bandwidth of 14 kHz is demonstrated, the time of phasing is 3 – 4 ms. (fibre and integrated-optical structures)

Parallel Douglas-Kroll Energy and Gradients in NWChem. Estimating Scalar Relativistic Effects Using Douglas-Kroll Contracted Basis Sets.

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

De Jong, Wibe A.; Harrison, Robert J.; Dixon, David A.

A parallel implementation of the spin-free one-electron Douglas-Kroll(-Hess) Hamiltonian (DKH) in NWChem is discussed. An efficient and accurate method to calculate DKH gradients is introduced. It is shown that the use of standard (non-relativistic) contracted basis set can produce erroneous results for elements beyond the first row elements. The generation of DKH contracted cc-pVXZ (X = D, T, Q, 5) basis sets for H, He, B - Ne, Al - Ar, and Ga - Br will be discussed.

FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data—Part 1: Algorithm

NASA Astrophysics Data System (ADS)

Sourbier, Florent; Operto, Stéphane; Virieux, Jean; Amestoy, Patrick; L'Excellent, Jean-Yves

2009-03-01

This is the first paper in a two-part series that describes a massively parallel code that performs 2D frequency-domain full-waveform inversion of wide-aperture seismic data for imaging complex structures. Full-waveform inversion methods, namely quantitative seismic imaging methods based on the resolution of the full wave equation, are computationally expensive. Therefore, designing efficient algorithms which take advantage of parallel computing facilities is critical for the appraisal of these approaches when applied to representative case studies and for further improvements. Full-waveform modelling requires the resolution of a large sparse system of linear equations which is performed with the massively parallel direct solver MUMPS for efficient multiple-shot simulations. Efficiency of the multiple-shot solution phase (forward/backward substitutions) is improved by using the BLAS3 library. The inverse problem relies on a classic local optimization approach implemented with a gradient method. The direct solver returns the multiple-shot wavefield solutions distributed over the processors according to a domain decomposition driven by the distribution of the LU factors. The domain decomposition of the wavefield solutions is used to compute in parallel the gradient of the objective function and the diagonal Hessian, this latter providing a suitable scaling of the gradient. The algorithm allows one to test different strategies for multiscale frequency inversion ranging from successive mono-frequency inversion to simultaneous multifrequency inversion. These different inversion strategies will be illustrated in the following companion paper. The parallel efficiency and the scalability of the code will also be quantified.

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.

Towards the minimization of thermodynamic irreversibility in an electrically actuated microflow of a viscoelastic fluid under electrical double layer phenomenon

NASA Astrophysics Data System (ADS)

Sarma, Rajkumar; Jain, Manish; Mondal, Pranab Kumar

2017-10-01

We discuss the entropy generation minimization for electro-osmotic flow of a viscoelastic fluid through a parallel plate microchannel under the combined influences of interfacial slip and conjugate transport of heat. We use in this study the simplified Phan-Thien-Tanner model to describe the rheological behavior of the viscoelastic fluid. Using Navier's slip law and thermal boundary conditions of the third kind, we solve the transport equations analytically and evaluate the global entropy generation rate of the system. We examine the influential role of the following parameters on the entropy generation rate of the system, viz., the viscoelastic parameter (ɛDe2), Debye-Hückel parameter ( κ ¯ ) , channel wall thickness (δ), thermal conductivity of the wall (γ), Biot number (Bi), Peclet number (Pe), and axial temperature gradient (B). This investigation finally establishes the optimum values of the abovementioned parameters, leading to the minimum entropy generation of the system. We believe that results of this analysis could be helpful in optimizing the second-law performance of microscale thermal management devices, including the micro-heat exchangers, micro-reactors, and micro-heat pipes.

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

USGS Publications Warehouse

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

2007-01-01

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

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

NASA Technical Reports Server (NTRS)

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

2001-01-01

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

Advancing parabolic operators in thermodynamic MHD models: Explicit super time-stepping versus implicit schemes with Krylov solvers

NASA Astrophysics Data System (ADS)

Caplan, R. M.; Mikić, Z.; Linker, J. A.; Lionello, R.

2017-05-01

We explore the performance and advantages/disadvantages of using unconditionally stable explicit super time-stepping (STS) algorithms versus implicit schemes with Krylov solvers for integrating parabolic operators in thermodynamic MHD models of the solar corona. Specifically, we compare the second-order Runge-Kutta Legendre (RKL2) STS method with the implicit backward Euler scheme computed using the preconditioned conjugate gradient (PCG) solver with both a point-Jacobi and a non-overlapping domain decomposition ILU0 preconditioner. The algorithms are used to integrate anisotropic Spitzer thermal conduction and artificial kinematic viscosity at time-steps much larger than classic explicit stability criteria allow. A key component of the comparison is the use of an established MHD model (MAS) to compute a real-world simulation on a large HPC cluster. Special attention is placed on the parallel scaling of the algorithms. It is shown that, for a specific problem and model, the RKL2 method is comparable or surpasses the implicit method with PCG solvers in performance and scaling, but suffers from some accuracy limitations. These limitations, and the applicability of RKL methods are briefly discussed.

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments.

PubMed

Fisicaro, G; Genovese, L; Andreussi, O; Marzari, N; Goedecker, S

2016-01-07

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments

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

Fisicaro, G., E-mail: giuseppe.fisicaro@unibas.ch; Goedecker, S.; Genovese, L.

2016-01-07

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and themore » linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.« less

Optimization and quantization in gradient symbol systems: a framework for integrating the continuous and the discrete in cognition.

PubMed

Smolensky, Paul; Goldrick, Matthew; Mathis, Donald

2014-08-01

Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The framework we introduce here, Gradient Symbol Processing, characterizes the emergence of grammatical macrostructure from the Parallel Distributed Processing microstructure (McClelland, Rumelhart, & The PDP Research Group, 1986) of language processing. The mental representations that emerge, Distributed Symbol Systems, have both combinatorial and gradient structure. They are processed through Subsymbolic Optimization-Quantization, in which an optimization process favoring representations that satisfy well-formedness constraints operates in parallel with a distributed quantization process favoring discrete symbolic structures. We apply a particular instantiation of this framework, λ-Diffusion Theory, to phonological production. Simulations of the resulting model suggest that Gradient Symbol Processing offers a way to unify accounts of grammatical competence with both discrete and continuous patterns in language performance. Copyright © 2013 Cognitive Science Society, Inc.

On-bead antibody-small molecule conjugation using high-capacity magnetic beads.

PubMed

Nath, Nidhi; Godat, Becky; Benink, Hélène; Urh, Marjeta

2015-11-01

Antibodies labeled with small molecules such as fluorophore, biotin or drugs play an important role in various areas of biological research, drug discovery and diagnostics. However, the majority of current methods for labeling antibodies is solution-based and has several limitations including the need for purified antibodies at high concentrations and multiple buffer exchange steps. In this study, a method (on-bead conjugation) is described that addresses these limitations by combining antibody purification and conjugation in a single workflow. This method uses high capacity-magnetic Protein A or Protein G beads to capture antibodies directly from cell media followed by conjugation with small molecules and elution of conjugated antibodies from the beads. High-capacity magnetic antibody capture beads are key to this method and were developed by combining porous and hydrophilic cellulose beads with oriented immobilization of Protein A and Protein G using HaloTag technology. With a variety of fluorophores it is shown that the on-bead conjugation method is compatible with both thiol- and amine-based chemistry. This method enables simple and rapid processing of multiple samples in parallel with high-efficiency antibody recovery. It is further shown that recovered antibodies are functional and compatible with downstream applications. Copyright © 2015. Published by Elsevier B.V.

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.

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

NASA Astrophysics Data System (ADS)

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

1989-08-01

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

Parallelism between gradient temperature raman spectroscopy and differential scanning calorimetry results

USDA-ARS?s Scientific Manuscript database

Temperature dependent Raman spectroscopy (TDR) applies the temperature gradients utilized in differential scanning calorimetry (DSC) to Raman spectroscopy, providing a straightforward technique to identify molecular rearrangements that occur just prior to phase transitions. Herein we apply TDR and D...

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.

Predator-induced phenotypic plasticity of shape and behavior: parallel and unique patterns across sexes and species

PubMed Central

Kinnison, Michael T.

2017-01-01

Abstract Phenotypic plasticity is often an adaptation of organisms to cope with temporally or spatially heterogenous landscapes. Like other adaptations, one would predict that different species, populations, or sexes might thus show some degree of parallel evolution of plasticity, in the form of parallel reaction norms, when exposed to analogous environmental gradients. Indeed, one might even expect parallelism of plasticity to repeatedly evolve in multiple traits responding to the same gradient, resulting in integrated parallelism of plasticity. In this study, we experimentally tested for parallel patterns of predator-mediated plasticity of size, shape, and behavior of 2 species and sexes of mosquitofish. Examination of behavioral trials indicated that the 2 species showed unique patterns of behavioral plasticity, whereas the 2 sexes in each species showed parallel responses. Fish shape showed parallel patterns of plasticity for both sexes and species, albeit males showed evidence of unique plasticity related to reproductive anatomy. Moreover, patterns of shape plasticity due to predator exposure were broadly parallel to what has been depicted for predator-mediated population divergence in other studies (slender bodies, expanded caudal regions, ventrally located eyes, and reduced male gonopodia). We did not find evidence of phenotypic plasticity in fish size for either species or sex. Hence, our findings support broadly integrated parallelism of plasticity for sexes within species and less integrated parallelism for species. We interpret these findings with respect to their potential broader implications for the interacting roles of adaptation and constraint in the evolutionary origins of parallelism of plasticity in general. PMID:29491997

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.

Generation of spiral bevel gears with conjugate tooth surfaces and tooth contact analysis

NASA Technical Reports Server (NTRS)

Litvin, Faydor L.; Tsung, Wei-Jiung; Lee, Hong-Tao

1987-01-01

A new method for generation of spiral bevel gears is proposed. The main features of this method are as follows: (1) the gear tooth surfaces are conjugated and can transform rotation with zero transmission errors; (2) the tooth bearing contact is localized; (3) the center of the instantaneous contact ellipse moves in a plane that has a fixed orientation; (4) the contact normal performs in the process of meshing a parallel motion; (5) the motion of the contact ellipse provides improved conditions of lubrication; and (6) the gears can be manufactured by use of Gleason's equipment.

Evidence of a New Instability in Gyrokinetic Simulations of LAPD Plasmas

NASA Astrophysics Data System (ADS)

Terry, P. W.; Pueschel, M. J.; Rossi, G.; Jenko, F.; Told, D.; Carter, T. A.

2015-11-01

Recent experiments at the LArge Plasma Device (LAPD) have focused on structure formation driven by density and temperature gradients. A central difference relative to typical, tokamak-like plasmas stems from the linear geometry and absence of background magnetic shear. At sufficiently high β, strong excitation of parallel (compressional) magnetic fluctuations was observed. Here, linear and nonlinear simulations with the Gene code are used to demonstrate that these findings can be explained through the linear excitation of a Gradient-driven Drift Coupling mode (GDC). This recently-discovered instability, unlike other drift waves, relies on the grad-B drift due to parallel magnetic fluctuations in lieu of a parallel electron response, and can be driven by density or temperature gradients. The linear properties of the GDC for LAPD parameters are studied in detail, and the corresponding turbulence is investigated. It is found that, despite the very large collisionality in the experiment, many properties are recovered fairly well in the simulations. In addition to confirming the existence of the GDC, this opens up interesting questions regarding GDC activity in astrophysical and space plasmas. Supported by USDOE.

Ubiquitin-protein ligases in muscle wasting: multiple parallel pathways?

NASA Technical Reports Server (NTRS)

Lecker, Stewart H.; Goldberg, A. L. (Principal Investigator)

2003-01-01

PURPOSE OF REVIEW: Studies in a wide variety of animal models of muscle wasting have led to the concept that increased protein breakdown via the ubiquitin-proteasome pathway is responsible for the loss of muscle mass seen as muscle atrophy. The complexity of the ubiquitination apparatus has hampered our understanding of how this pathway is activated in atrophying muscles and which ubiquitin-conjugating enzymes in muscle are responsible. RECENT FINDINGS: Recent experiments have shown that two newly identified ubiquitin-protein ligases (E3s), atrogin-1/MAFbx and MURF-1, are critical in the development of muscle atrophy. Other in-vitro studies also implicated E2(14k) and E3alpha, of the N-end rule pathway, as playing an important role in the process. SUMMARY: It seems likely that multiple pathways of ubiquitin conjugation are activated in parallel in atrophying muscle, perhaps to target for degradation specific classes of muscle proteins. The emerging challenge will be to define the protein targets for, as well as inhibitors of, these E3s.

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.

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.

Hypothesis on the origin of lineaments in the LANDSAT and SLAR images of precambrian soil in the low Contas River Valley (southern Bahia)

NASA Technical Reports Server (NTRS)

Liu, C. C. (Principal Investigator); Rodrigues, J. E.

1984-01-01

Examination of LANDSAT and SLAR images in southern Bahia reveals numerous linear features, which are grouped in five sets, based on their trends: N65 degrees E, N70 degrees W, N45 degrees E and NS/N15 degrees E. Owing to their topographic expressions, distributive patterns, spacing between individual lineaments and their mutual relationships, the lineament sets of N65 degrees E and N70 degrees W, as well as the sets of N40 degrees E and N45 degrees W, are considered as two groups of conjugate shear fractures and the former is older and is always cut by the latter. Their conjugate shear angles are 45 degrees and 85 degrees and their bisector lines are approximately in east-west and north-south directions, respectively. According to Badgeley's argumentation on the conjugate shear angles, the former conjugate shear fractures would be caused by: (1) vertical movements, and the bisector of their conjugate angle would be parallel to the long axis of horsting or folding, or (2) by a compressive force in the east-west direction and under a condition of low confining pressure and temperature.

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.

Conjugates of ubiquitin cross-reactive protein distribute in a cytoskeletal pattern.

PubMed Central

Loeb, K R; Haas, A L

1994-01-01

Ubiquitin cross-reactive protein (UCRP), a 15-kDa interferon-induced protein, is a sequence homolog of ubiquitin that is covalently ligated to intracellular proteins in a parallel enzymatic reaction and is found at low levels within cultured cell lines and human tissues not exposed to interferon. Ubiquitin and UCRP ligation reactions apparently target distinct subsets of intracellular proteins, as judged from differences in the distributions of the respective adducts revealed on immunoblots. In this study, successive passages of the human lung carcinoma line A549 in the presence of neutralizing antibodies against alpha and beta interferons had no effect on the levels of either free or conjugated UCRP, indicating that these UCRP pools are constitutively present within uninduced cells and are thus not a consequence of autoinduction by low levels of secreted alpha/beta interferon. In an effort to identify potential targets for UCRP conjugation, the immunocytochemical distribution of UCRP was examined by using affinity-purified polyclonal antibodies against recombinant polypeptide. UCRP distributes in a punctate cytoskeletal pattern that is resistant to extraction by nonionic detergents (e.g., Triton X-100) in both uninduced and interferon-treated A549 cells. The cytoskeletal pattern colocalizes with the intermediate filament network of epithelial and mesothelial cell lines. Immunoblots of parallel Triton X-100-insoluble cell extracts suggest that the cytoskeletal association largely results from the noncovalent association of UCRP conjugates with the intermediate filaments rather than direct ligation of the polypeptide to structural components of the filaments. A significant increase in the sequestration of UCRP adducts on intermediate filaments accompanies interferon induction. These results suggest that UCRP may serve as a trans-acting binding factor directing the association of ligated target proteins to intermediate filaments. Images PMID:7526157

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

Parallel bulk heterojunction photovoltaics based on all-conjugated block copolymer additives

DOE PAGES

Mok, Jorge W.; Kipp, Dylan; Hasbun, Luis R.; ...

2016-08-23

We demonstrated that the addition of block copolymers to binary donor–acceptor blends represents an effective approach to target equilibrium, co-continuous morphologies of interpenetrating donors and acceptors in our recent study. We report a study of the impact of all-conjugated poly(thieno[3,4-b]-thiophene-co-benzodithiophene)-b-polynaphthalene diimide (PTB7-b-PNDI) block copolymer additives on the electronic properties and photovoltaic performance of bulk heterojunction organic photovoltaic active layers comprised of a PTB7 donor and a phenyl-C61-butyric acid methyl ester (PCBM61) acceptor. We find that small amounts of BCP additives lead to improved performance due to a large increase in the device open-circuit voltage (VOC), and the VOC is pinnedmore » to this higher value for higher BCP additive loadings. Such results contrast prior studies of ternary blend OPVs where either a continuous change in VOC or a value of VOC pinned to the lowest value is observed. We hypothesize and provide evidence in the form of device and morphology analyses that the impact of VOC is likely due to the formation of a parallel bulk heterojunction made up of isolated PCBM and PNDI acceptor domains separated by intermediate PTB7 donor domains. Our work demonstrates that all-conjugated block copolymers can be utilized as additives to both dictate morphology and modulate the electronic properties of the active layer.« less

Parallel bulk heterojunction photovoltaics based on all-conjugated block copolymer additives

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

Mok, Jorge W.; Kipp, Dylan; Hasbun, Luis R.

We demonstrated that the addition of block copolymers to binary donor–acceptor blends represents an effective approach to target equilibrium, co-continuous morphologies of interpenetrating donors and acceptors in our recent study. We report a study of the impact of all-conjugated poly(thieno[3,4-b]-thiophene-co-benzodithiophene)-b-polynaphthalene diimide (PTB7-b-PNDI) block copolymer additives on the electronic properties and photovoltaic performance of bulk heterojunction organic photovoltaic active layers comprised of a PTB7 donor and a phenyl-C61-butyric acid methyl ester (PCBM61) acceptor. We find that small amounts of BCP additives lead to improved performance due to a large increase in the device open-circuit voltage (VOC), and the VOC is pinnedmore » to this higher value for higher BCP additive loadings. Such results contrast prior studies of ternary blend OPVs where either a continuous change in VOC or a value of VOC pinned to the lowest value is observed. We hypothesize and provide evidence in the form of device and morphology analyses that the impact of VOC is likely due to the formation of a parallel bulk heterojunction made up of isolated PCBM and PNDI acceptor domains separated by intermediate PTB7 donor domains. Our work demonstrates that all-conjugated block copolymers can be utilized as additives to both dictate morphology and modulate the electronic properties of the active layer.« less

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.

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

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.

Quantitative Analysis of Cancer Cell Migration in Gradients Of EGF, HGF, and SDF-alpha Using a Microfluidic Chemotaxis Device

DTIC Science & Technology

2005-01-01

Quantitative Analysis of Cancer Cell Migration in Gradients of EGF, HGF, and SDF-alpha Using a Microfluidic Chemotaxis Device The University of California...allowing for parallel analysis . Additionally, simple methods of localizing gels into microdevices are demonstrated. The device was characterized by...To overcome some of these drawbacks, several approaches have utilized free diffusion to produce gradients in static environ - ments.5-9 However

Analytical Devices Based on Direct Synthesis of DNA on Paper.

PubMed

Glavan, Ana C; Niu, Jia; Chen, Zhen; Güder, Firat; Cheng, Chao-Min; Liu, David; Whitesides, George M

2016-01-05

This paper addresses a growing need in clinical diagnostics for parallel, multiplex analysis of biomarkers from small biological samples. It describes a new procedure for assembling arrays of ssDNA and proteins on paper. This method starts with the synthesis of DNA oligonucleotides covalently linked to paper and proceeds to assemble microzones of DNA-conjugated paper into arrays capable of simultaneously capturing DNA, DNA-conjugated protein antigens, and DNA-conjugated antibodies. The synthesis of ssDNA oligonucleotides on paper is convenient and effective with 32% of the oligonucleotides cleaved and eluted from the paper substrate being full-length by HPLC for a 32-mer. These ssDNA arrays can be used to detect fluorophore-linked DNA oligonucleotides in solution, and as the basis for DNA-directed assembly of arrays of DNA-conjugated capture antibodies on paper, detect protein antigens by sandwich ELISAs. Paper-anchored ssDNA arrays with different sequences can be used to assemble paper-based devices capable of detecting DNA and antibodies in the same device and enable simple microfluidic paper-based devices.

Neuronal Tracing with Magnetic Labels: NMR Imaging Methods, Preliminary Results, and New Optimized Coils.

NASA Astrophysics Data System (ADS)

Ghosh, Pratik

1992-01-01

The investigations focussed on in vivo NMR imaging studies of magnetic particles with and within neural cells. NMR imaging methods, both Fourier transform and projection reconstruction, were implemented and new protocols were developed to perform "Neuronal Tracing with Magnetic Labels" on small animal brains. Having performed the preliminary experiments with neuronal tracing, new optimized coils and experimental set-up were devised. A novel gradient coil technology along with new rf-coils were implemented, and optimized for future use with small animals in them. A new magnetic labelling procedure was developed that allowed labelling of billions of cells with ultra -small magnetite particles in a short time. The relationships among the viability of such cells, the amount of label and the contrast in the images were studied as quantitatively as possible. Intracerebral grafting of magnetite labelled fetal rat brain cells made it possible for the first time to attempt monitoring in vivo the survival, differentiation, and possible migration of both host and grafted cells in the host rat brain. This constituted the early steps toward future experiments that may lead to the monitoring of human brain grafts of fetal brain cells. Preliminary experiments with direct injection of horse radish peroxidase-conjugated magnetite particles into neurons, followed by NMR imaging, revealed a possible non-invasive alternative, allowing serial study of the dynamic transport pattern of tracers in single living animals. New gradient coils were built by using parallel solid-conductor ribbon cables that could be wrapped easily and quickly. Rapid rise times provided by these coils allowed implementation of fast imaging methods. Optimized rf-coil circuit development made it possible to understand better the sample-coil properties and the associated trade -offs in cases of small but conducting samples.

Bessel smoothing filter for spectral-element mesh

NASA Astrophysics Data System (ADS)

Trinh, P. T.; Brossier, R.; Métivier, L.; Virieux, J.; Wellington, P.

2017-06-01

Smoothing filters are extremely important tools in seismic imaging and inversion, such as for traveltime tomography, migration and waveform inversion. For efficiency, and as they can be used a number of times during inversion, it is important that these filters can easily incorporate prior information on the geological structure of the investigated medium, through variable coherent lengths and orientation. In this study, we promote the use of the Bessel filter to achieve these purposes. Instead of considering the direct application of the filter, we demonstrate that we can rely on the equation associated with its inverse filter, which amounts to the solution of an elliptic partial differential equation. This enhances the efficiency of the filter application, and also its flexibility. We apply this strategy within a spectral-element-based elastic full waveform inversion framework. Taking advantage of this formulation, we apply the Bessel filter by solving the associated partial differential equation directly on the spectral-element mesh through the standard weak formulation. This avoids cumbersome projection operators between the spectral-element mesh and a regular Cartesian grid, or expensive explicit windowed convolution on the finite-element mesh, which is often used for applying smoothing operators. The associated linear system is solved efficiently through a parallel conjugate gradient algorithm, in which the matrix vector product is factorized and highly optimized with vectorized computation. Significant scaling behaviour is obtained when comparing this strategy with the explicit convolution method. The theoretical numerical complexity of this approach increases linearly with the coherent length, whereas a sublinear relationship is observed practically. Numerical illustrations are provided here for schematic examples, and for a more realistic elastic full waveform inversion gradient smoothing on the SEAM II benchmark model. These examples illustrate well the efficiency and flexibility of the approach proposed.

Electromagnetic turbulence and transport in increased β LAPD Plasmas

NASA Astrophysics Data System (ADS)

Rossi, Giovanni; Carter, Troy; Pueschel, Mj; Jenko, Frank; Terry, Paul; Told, Daniel

2016-10-01

The new LaB6 plasma source in LAPD has enabled the production of magnetized, increased β plasmas (up to 15%). We report on the modifications of pressure-gradient-driven turbulence and transport with increased plasma β. Density fluctuations decrease with increasing β while magnetic fluctuations increase. B ⊥ fluctuations saturate while parallel (compressional) magnetic fluctuations increase continuously with β. At the highest β values Î δ ||/ δ B ⊥ 2 and δ B/B 1%. The measurements are consistent with the excitation of the Gradient-driven Drift Coupling (GDC). This instability prefers k|| = 0 and grows in finite β plasmas due to density and temperature gradients through the production of parallel magnetic field fluctuations and resulting ⊥ B|| drifts. Comparisons between experimental measurements and theoretical predictions for the GDC will be shown. Direct measurements of electrostatic particle flux have been performed and show a strong reduction with increasing β. No evidence is found (e.g. density profile shape) of enhanced confinement, suggesting that other transport mechanisms are active. Preliminary measurements indicate that electromagnetic transport due to parallel magnetic field fluctuations at first increases with β but is subsequently suppressed at higher β values.

Use of shift gradient in the second dimension to improve the separation space in comprehensive two-dimensional liquid chromatography.

PubMed

Li, Duxin; Schmitz, Oliver J

2013-08-01

Comprehensive two-dimensional liquid chromatography (LC × LC) has received much attention because it offers much higher peak capacities than separation in a single dimension. The advantageous peak capacity makes it attractive for the separation of complex samples. Various gradient methods have been used in LC × LC systems. The use of continuous shift gradient is advantageous because it combines the peak compression effect of full gradient mode and the tailed gradient program in parallel gradient mode. Here, a comparison of LC × LC analysis of Chinese herbal medicine with full gradient mode and shift gradient mode in the second dimension was performed. A correlation between the first and second dimensions was found in full gradient mode, and this was significantly reduced with shift gradient mode. The orthogonality increased by 43.7%. The effective peak distribution area increased significantly, which produced better separation.

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.

Pockels-effect cell for gas-flow simulation

NASA Astrophysics Data System (ADS)

Weimer, D.

1982-05-01

A Pockels effect cell using a 75 cu cm DK*P crystal was developed and used as a gas flow simulator. Index of refraction gradients were produced in the cell by the fringing fields of parallel plate electrodes. Calibration curves for the device were obtained for index of refraction gradients in excess of .00025 m.

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.

A method for real-time implementation of HOG feature extraction

NASA Astrophysics Data System (ADS)

Luo, Hai-bo; Yu, Xin-rong; Liu, Hong-mei; Ding, Qing-hai

2011-08-01

Histogram of oriented gradient (HOG) is an efficient feature extraction scheme, and HOG descriptors are feature descriptors which is widely used in computer vision and image processing for the purpose of biometrics, target tracking, automatic target detection(ATD) and automatic target recognition(ATR) etc. However, computation of HOG feature extraction is unsuitable for hardware implementation since it includes complicated operations. In this paper, the optimal design method and theory frame for real-time HOG feature extraction based on FPGA were proposed. The main principle is as follows: firstly, the parallel gradient computing unit circuit based on parallel pipeline structure was designed. Secondly, the calculation of arctangent and square root operation was simplified. Finally, a histogram generator based on parallel pipeline structure was designed to calculate the histogram of each sub-region. Experimental results showed that the HOG extraction can be implemented in a pixel period by these computing units.

Inertial Currents in Isotropic Plasma

NASA Technical Reports Server (NTRS)

Heinemann, M.; Erickson, G. M.; Pontius, D. H., Jr.

1993-01-01

The magnetospheric convection electric field contributes to Birkeland currents. The effects of the field are to polarize the plasma by displacing the bounce paths of the ions from those of electrons, to redistribute the pressure so that it is not constant along magnetic field lines, and to enhance the pressure gradient by the gradient of the bulk speed. Changes in the polarization charge during the convection of the plasma are neutralized by electrons in the form of field-aligned currents that close through the ionosphere. The pressure drives field-aligned currents through its gradient in the same manner as in quasi-static plasma, but with modifications that are important if the bulk speed is of the order of the ion thermal speed; the variations in the pressure along field lines are maintained by a weak parallel potential drop. These effects are described in terms of the field-aligned currents in steady state, isotropic, MED plasma. Solutions are developed by taking the MHD limit of two-fluid solutions and illustrated in the special case of Maxwellian plasma for which the temperature is constant along magnetic field lines. The expression for the Birkeland current density is a generalization of Vasyliunas' expression for the field-aligned current density in quasi-static plasma and provides a unifying expression when both pressure gradients and ion inertia operate simultaneously as sources of field-aligned currents. It contains a full account of different aspects of the ion flow (parallel and perpendicular velocity and vorticity) that contribute to the currents. Contributions of ion inertia to field-aligned currents will occur in regions of strong velocity shear, electric field reversal, or large gradients in the parallel velocity or number density, and may be important in the low-latitude boundary layer, plasma sheet boundary layer, and the inner edge region of the plasma sheet.

Inertial currents in isotropic plasma

NASA Technical Reports Server (NTRS)

Heinemann, M.; Erickson, G. M.; Pontius, D. H. JR.

1994-01-01

The magnetospheric convection electric field contributes to Birkeland currents. The effects of the field are to polarize the plasma by displacing the bounce paths of the ions from those of electrons, to redistribute the pressure so that it is not constant along magnetic field lines, and to enhance the pressure gradient by the gradient of the bulk speed. Changes in the polarization charge during the convection of the plasma are neutralized by electrons in the form of field-aligned currents that close through the ionosphere. The pressure drives field-aligned currents through its gradient in the same manner as in quasi-static plasma, but with modifications that are important if the bulk speed is of the order of the ion thermal speed; the variations in the pressure along field lines are maintained by a weak parallel potential drop. These effects are described in terms of the field-aligned currents in steady state, isotropic, magnetohyrodynamic (MHD) plasma. Solutions are developed by taking the MHD limit of two-fluid solutions and illustrated in the special case of Maxwellian plasma for which the temperature is constant along magnetic field lines. The expression for the Birkeland current density is a generalization of Vasyliunas' expression for the field-aligned current density in quasi-static plasma and provides a unifying expression when both pressure gradients and ion inertia operate simultaneously as sources of field-aligned currents. It contains a full account of different aspects of the ion flow (parallel and perpendicular velocity and vorticity) that contribute to the currents. Contributions of ion inertia to field-aligned currents will occur in regions of strong velocity shear, electric field reversal, or large gradients in the parallel velocity or number density, and may be important in the low-latitude boundary layer, plasma sheet boundary layer, and the inner edge region of the plasma sheet.

Inertial currents in isotropic plasma

NASA Technical Reports Server (NTRS)

Heinemann, M.; Erickson, G. M.; Pontius, D. H., Jr.

1994-01-01

The magnetospheric convection electric field contributes to Birkeland currents. The effects of the field are to polarize the plasma by displacing the bounce paths of the ions from those of electrons, to redistribute the pressure so that it is not constant along magnetic field lines, and to enhance the pressure gradient by the gradient of the bulk speed. Changes in the polarization charge during the convection of the plasma are neutralized by electrons in the form of field-aligned currents that close through the ionosphere. The pressure drives field-aligned currents through its gradient in the same manner as in quasi-static plasmas, but with modifications that are important if the bulk speed is of the order of the ion thermal speed; the variations in the pressure along field lines are maintained by a weak parallel potential drop. These effects are described in terms of the field-aligned currents in steady state, isotropic, MHD plasma. Solutions are developed by taking the MHD limit ot two-fluid solutions and illustrated in the special case of Maxwellian plasma for which the temperature is constant along magnetic field lines. The expression for the Birkeland current density is a generalization of Vasyliunas' expression for the field-aligned current density in quasi-static plasma and provides a unifying expression when both pressure gradients and ion inertia operate simultaneously as sources of field-aligned currents. It contains a full account of different aspects of the ion flow (parallel and perpendicular velocity and vorticity) that contribute to the currents. Contributions of ion inertia to field-aligned currents will occur in regions of strong velocity shear, electric field reversal, or large gradients in the parallel velocity or number density, and may be important in the low-latitude boundary layer, plasma sheet boundary layer, and the inner edge region of the plasma sheet.

Global gyrokinetic simulations of intrinsic rotation in ASDEX Upgrade Ohmic L-mode plasmas

NASA Astrophysics Data System (ADS)

Hornsby, W. A.; Angioni, C.; Lu, Z. X.; Fable, E.; Erofeev, I.; McDermott, R.; Medvedeva, A.; Lebschy, A.; Peeters, A. G.; The ASDEX Upgrade Team

2018-05-01

Non-linear, radially global, turbulence simulations of ASDEX Upgrade (AUG) plasmas are performed and the nonlinear generated intrinsic flow shows agreement with the intrinsic flow gradients measured in the core of Ohmic L-mode plasmas at nominal parameters. Simulations utilising the kinetic electron model show hollow intrinsic flow profiles as seen in a predominant number of experiments performed at similar plasma parameters. In addition, significantly larger flow gradients are seen than in a previous flux-tube analysis (Hornsby et al 2017 Nucl. Fusion 57 046008). Adiabatic electron model simulations can show a flow profile with opposing sign in the gradient with respect to a kinetic electron simulation, implying a reversal in the sign of the residual stress due to kinetic electrons. The shaping of the intrinsic flow is strongly determined by the density gradient profile. The sensitivity of the residual stress to variations in density profile curvature is calculated and seen to be significantly stronger than to neoclassical flows (Hornsby et al 2017 Nucl. Fusion 57 046008). This variation is strong enough on its own to explain the large variations in the intrinsic flow gradients seen in some AUG experiments. Analysis of the symmetry breaking properties of the turbulence shows that profile shearing is the dominant mechanism in producing a finite parallel wave-number, with turbulence gradient effects contributing a smaller portion of the parallel wave-vector.

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.

Complex wet-environments in electronic-structure calculations

NASA Astrophysics Data System (ADS)

Fisicaro, Giuseppe; Genovese, Luigi; Andreussi, Oliviero; Marzari, Nicola; Goedecker, Stefan

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of an applied electrochemical potentials, including complex electrostatic screening coming from the solvent. In the present work we present a solver to handle both the Generalized Poisson and the Poisson-Boltzmann equation. A preconditioned conjugate gradient (PCG) method has been implemented for the Generalized Poisson and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations. On the other hand, a self-consistent procedure enables us to solve the Poisson-Boltzmann problem. The algorithms take advantage of a preconditioning procedure based on the BigDFT Poisson solver for the standard Poisson equation. They exhibit very high accuracy and parallel efficiency, and allow different boundary conditions, including surfaces. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and it will be released as a independent program, suitable for integration in other codes. We present test calculations for large proteins to demonstrate efficiency and performances. This work was done within the PASC and NCCR MARVEL projects. Computer resources were provided by the Swiss National Supercomputing Centre (CSCS) under Project ID s499. LG acknowledges also support from the EXTMOS EU project.

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

USGS Publications Warehouse

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

2008-01-01

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

Hybrid simulations of radial transport driven by the Rayleigh-Taylor instability

NASA Astrophysics Data System (ADS)

Delamere, P. A.; Stauffer, B. H.; Ma, X.

2017-12-01

Plasma transport in the rapidly rotating giant magnetospheres is thought to involve a centrifugally-driven flux tube interchange instability, similar to the Rayleigh-Taylor (RT) instability. In three dimensions, the convective flow patterns associated with the RT instability can produce strong guide field reconnection, allowing plasma mass to move radially outward while conserving magnetic flux (Ma et al., 2016). We present a set of hybrid (kinetic ion / fluid electron) plasma simulations of the RT instability using high plasma beta conditions appropriate for Jupiter's inner and middle magnetosphere. A density gradient, combined with a centrifugal force, provide appropriate RT onset conditions. Pressure balance is achieved by initializing two ion populations: one with fixed temperature, but varying density, and the other with fixed density, but a temperature gradient that offsets the density gradient from the first population and the centrifugal force (effective gravity). We first analyze two-dimensional results for the plane perpendicular to the magnetic field by comparing growth rates as a function of wave vector following Huba et al. (1998). Prescribed perpendicular wave modes are seeded with an initial velocity perturbation. We then extend the model to three dimensions, introducing a stabilizing parallel wave vector. Boundary conditions in the parallel direction prohibit motion of the magnetic field line footprints to model the eigenmodes of the magnetodisc's resonant cavity. We again compare growth rates based on perpendicular wave number, but also on the parallel extent of the resonant cavity, which fixes the size of the largest parallel wavelength. Finally, we search for evidence of strong guide field magnetic reconnection within the domain by identifying areas with large parallel electric fields or changes in magnetic field topology.

Containment of groundwater contamination plumes: minimizing drawdown by aligning capture wells parallel to regional flow

NASA Astrophysics Data System (ADS)

Christ, John A.; Goltz, Mark N.

2004-01-01

Pump-and-treat systems that are installed to contain contaminated groundwater migration typically involve placement of extraction wells perpendicular to the regional groundwater flow direction at the down gradient edge of a contaminant plume. These wells capture contaminated water for above ground treatment and disposal, thereby preventing further migration of contaminated water down gradient. In this work, examining two-, three-, and four-well systems, we compare well configurations that are parallel and perpendicular to the regional groundwater flow direction. We show that orienting extraction wells co-linearly, parallel to regional flow, results in (1) a larger area of aquifer influenced by the wells at a given total well flow rate, (2) a center and ultimate capture zone width equal to the perpendicular configuration, and (3) more flexibility with regard to minimizing drawdown. Although not suited for some scenarios, we found orienting extraction wells parallel to regional flow along a plume centerline, when compared to a perpendicular configuration, reduces drawdown by up to 7% and minimizes the fraction of uncontaminated water captured.

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.

Malachite green-conjugated microtubules as mobile bioprobes selective for malachite green aptamers with capturing/releasing ability.

PubMed

Hirabayashi, Miki; Taira, Shu; Kobayashi, Suzuko; Konishi, Kaoru; Katoh, Kaoru; Hiratsuka, Yuichi; Kodaka, Masato; Uyeda, Taro Q P; Yumoto, Noboru; Kubo, Tai

2006-06-20

We have developed a novel mobile bioprobe using a conjugate of a kinesin-driven microtubule (MT) and malachite green (MG) as a platform for capturing MG RNA aptamers. The fluorescence of MG increases when it is bound to an MG aptamer, allowing MT-MG conjugates to work as sensors of RNA transcripts containing the MG aptamer sequence. Kinesin motor proteins provide an effective driving force to create mobile bioprobes without any manipulation. Although the fluorescence of a small number of MG-binding aptamers is low, the self-organization of tubulins into MTs enables the microscopic observation of the bound aptamers by collecting them on MTs. We demonstrate that MT-MG conjugates can select target aptamers from a transcription mixture and transport them without losing their inherent motility. Because the MG aptamer binds MG in a reversible manner, MT-MG conjugates can conditionally load and unload the target aptamers. This is one advantage of this system over the molecular probes developed previously in which reversible unloading is impossible due to high-affinity binding, such as between avidin and biotin. Furthermore, an MT-MG conjugate can be used as a platform for other MG aptameric sensors with recognition regions for various target analytes optimized by further selection procedures. This is the first step to applying living systems to in vitro devices. This technique could provide a new paradigm of mobile bioprobes establishing high-throughput in vitro selection systems using microfluidic devices operating in parallel. 2006 Wiley Periodicals, Inc.

Design and analysis of all-dielectric broadband nonpolarizing parallel-plate beam splitters.

PubMed

Wang, Wenliang; Xiong, Shengming; Zhang, Yundong

2007-06-01

Past research on the all-dielectric nonpolarizing beam splitter is reviewed. With the aid of the needle thin-film synthesis method and the conjugate graduate refine method, three different split ratio nonpolarizing parallel-plate beam splitters over a 200 nm spectral range centered at 550 nm with incidence angles of 45 degrees are designed. The chosen materials component and the initial stack are based on the Costich and Thelen theories. The results of design and analysis show that the designs maintain a very low polarization ratio in the working range of the spectrum and has a reasonable angular field.

All-dielectric broadband non-polarizing parallel plate beam splitter operating between 450-650nm

NASA Astrophysics Data System (ADS)

Wang, Wenliang; Xiong, Shenming; Zhang, Yundong

2007-12-01

Past research on all-dielectric non-polarizing beam splitter is reviewed. With the aid of needle thin film synthesis method and conjugate graduate refining method, three non-polarizing parallel plate beam splitters with different split ratios over a 200nm spectral range centered at 550nm with incidence angle 45° are designed. Selection of material components and initial stack are based on Costich and Thelen's theory. The results of design and analysis show that it maintains a very low polarization ratio in the working range of spectrum and has a reasonable angular field.

The Importance of Three-Body Interactions in Molecular Dynamics Simulations of Water with the Fragment Molecular Orbital Method

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

Pruitt, Spencer R.; Nakata, Hiroya; Nagata, Takeshi

2016-04-12

The analytic first derivative with respect to nuclear coordinates is formulated and implemented in the framework of the three-body fragment molecular orbital (FMO) method. The gradient has been derived and implemented for restricted Hartree-Fock, second-order Møller-Plesset perturbation, and density functional theories. The importance of the three-body fully analytic gradient is illustrated through the failure of the two-body FMO method during molecular dynamics simulations of a small water cluster. The parallel implementation of the fragment molecular orbital method, its parallel efficiency, and its scalability on the Blue Gene/Q architecture up to 262,144 CPU cores, are also discussed.

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.

Simultaneous auto-calibration and gradient delays estimation (SAGE) in non-Cartesian parallel MRI using low-rank constraints.

PubMed

Jiang, Wenwen; Larson, Peder E Z; Lustig, Michael

2018-03-09

To correct gradient timing delays in non-Cartesian MRI while simultaneously recovering corruption-free auto-calibration data for parallel imaging, without additional calibration scans. The calibration matrix constructed from multi-channel k-space data should be inherently low-rank. This property is used to construct reconstruction kernels or sensitivity maps. Delays between the gradient hardware across different axes and RF receive chain, which are relatively benign in Cartesian MRI (excluding EPI), lead to trajectory deviations and hence data inconsistencies for non-Cartesian trajectories. These in turn lead to higher rank and corrupted calibration information which hampers the reconstruction. Here, a method named Simultaneous Auto-calibration and Gradient delays Estimation (SAGE) is proposed that estimates the actual k-space trajectory while simultaneously recovering the uncorrupted auto-calibration data. This is done by estimating the gradient delays that result in the lowest rank of the calibration matrix. The Gauss-Newton method is used to solve the non-linear problem. The method is validated in simulations using center-out radial, projection reconstruction and spiral trajectories. Feasibility is demonstrated on phantom and in vivo scans with center-out radial and projection reconstruction trajectories. SAGE is able to estimate gradient timing delays with high accuracy at a signal to noise ratio level as low as 5. The method is able to effectively remove artifacts resulting from gradient timing delays and restore image quality in center-out radial, projection reconstruction, and spiral trajectories. The low-rank based method introduced simultaneously estimates gradient timing delays and provides accurate auto-calibration data for improved image quality, without any additional calibration scans. © 2018 International Society for Magnetic Resonance in Medicine.

Questa Baseline and Premining Ground-Water Quality Investigation 18. Characterization of Brittle Structures in the Questa Caldera and Their Potential Influence on Bedrock Ground-Water Flow, Red River Valley, New Mexico

USGS Publications Warehouse

Caine, Jonathan S.

2006-01-01

This report presents a field-based characterization of fractured and faulted crystalline bedrock in the southern portion of the Questa caldera and its margin. The focus is (1) the identification and description of brittle geological structures and (2) speculation on the potential effects and controls that these structures might have on the potential fluxes of paleo to present-day ground water in relation to natural or mining-related metal and acid loads to surface and ground water. The entire study area is pervasively jointed with a few distinctive patterns such as orthogonal, oblique orthogonal, and conjugate joint sets. Joint intensity, the number of joints measured per unit line length, is high to extreme. Three types of fault zones are present that include partially silicified, low- and high-angle faults with well-developed damage zones and clay-rich cores and high-angle, unsilicified open faults. Conceptually, the joint networks can be thought of as providing the background porosity and permeability structure of the bedrock aquifer system. This background is cut by discrete entities such as the faults with clay-rich cores and open faults that may act as important hydrologic heterogeneities. The southern caldera margin runs parallel to the course of the Red River Valley, whose incision has left an extreme topographic gradient at high angles to the river. Many of the faults and fault intersections run parallel to this assumed hydraulic gradient; thus, these structures have great potential to provide paleo and present-day, discrete and anisotropic pathways for solute transport within the otherwise relatively low porosity and permeability bedrock background aquifer system. Although brittle fracture networks and faults are pervasive and complex, simple Darcy calculations are used to estimate the hydraulic conductivity and potential ground-water discharges of the bedrock aquifer, caldera margin, and other faults in order to gain insight into the potential contributions of these features to the ground-water and surface-water flow systems. These calculations show that, because all of these features are found along the Red River in the Cabin Springs-Columbine Park-Goat Hill fan area, their combined effect increases the probability that the bedrock aquifer ground-water flow system provides discharge to the Red River along this reach.

Wavelet Transforms in Parallel Image Processing

DTIC Science & Technology

1994-01-27

NUMBER OF PAGES Object Segmentation, Texture Segmentation, Image Compression, Image 137 Halftoning , Neural Network, Parallel Algorithms, 2D and 3D...Vector Quantization of Wavelet Transform Coefficients ........ ............................. 57 B.1.f Adaptive Image Halftoning based on Wavelet...application has been directed to the adaptive image halftoning . The gray information at a pixel, including its gray value and gradient, is represented by

5-s-Cysteinyl-conjugates of catecholamines induce cell damage, extensive DNA base modification and increases in caspase-3 activity in neurons.

PubMed

Spencer, Jeremy P E; Whiteman, Matthew; Jenner, Peter; Halliwell, Barry

2002-04-01

A decrease in reduced glutathione levels in dopamine containing nigral cells in Parkinson's disease may result from the formation of cysteinyl-adducts of catecholamines, which in turn exert toxicity on nigral cells. We show that exposure of neurons (CSM 14.1) to 5-S-cysteinyl conjugates of dopamine, L-DOPA, DOPAC or DHMA causes neuronal damage, increases in oxidative DNA base modification and an elevation of caspase-3 activity in cells. Damage to neurons was apparent 12-48 h of post-exposure and there were increases in caspase-3 activity in neurons after 6 h. These changes were paralleled by large increases in pyrimidine and purine base oxidation products, such as 8-OH-guanine suggesting that 5-S-cysteinyl conjugates of catecholamines are capable of diffusing into cells and stimulating the formation of reactive oxygen species (ROS), which may then lead to a mechanism of cell damage involving caspase-3. Indeed, intracellular ROS were observed to rise sharply on exposure to the conjugates. These results suggest one mechanism by which oxidative stress may occur in the substantia nigra in Parkinson's disease.

Molecular evolution of tetracycline-resistance plasmids carrying TetM found in Neisseria gonorrhoeae from different countries.

PubMed

Gascoyne, D M; Heritage, J; Hawkey, P M; Turner, A; van Klingeren, B

1991-08-01

High level tetracycline resistant strains of Neisseria gonorrhoeae (TRNG) have been shown to carry a 40.6 kb (25.2 MDa) conjugative plasmid with a Class M tetracycline resistance determinant. Restriction endonuclease analysis mapping showed that there were at least two different TRNG plasmid types which were found in geographically distinct locations. The physical maps of these two plasmids were compared to a gonococcal conjugative plasmid which did not encode tetracycline resistance. The plasmid type which is endemic in the Netherlands was found to be closely related to the gonococcal conjugative plasmid, which supports the established hypothesis that the 40.6 kb plasmid has evolved by transposition of the TetM determinant into the conjugative plasmid. The plasmid found in the United States has either evolved by substantial divergent evolution or it results from a different transposition event. In the UK there have been isolations of TRNGs carrying either of the two plasmid types reflecting a flow of people both across the Atlantic and in Europe. It is possible that further TetM-containing plasmids will be found in N. gonorrhoeae paralleling the family of TEM beta-lactamase encoding plasmids already described.

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.

Liver, pancreas and biliary tract enhanced lipoperoxidation products in pure pancreatic juice: evidence for organ-specific oxidative stress in chronic pancreatitis.

PubMed

Santini, S A; Spada, C; Bononi, F; Foschia, F; Mutignani, M; Perri, V; Giardina, B; Silveri, N Gentiloni; Costamagna, G

2003-12-01

Oxygen-free radicalscan play a role in the development of chronic pancreatitis, altering the redox state with damage of cell constituents and decrease in antioxidant defences. To measure levels of lipoperoxidation products, conjugated dienes and lipid hydroperoxides, in pure pancreatic juice and serum of chronic pancreatitis patients and compare them to that in controls. To investigate a possible correlation with serum indexes of pancreatic inflammation (amylase and lipase). Pancreatic juice was collected during ERCP, after secretin stimulation, in 20 patients with chronic pancreatitis and 11 controls with biliary diseases. Lipid hydroperoxide levels were determined with FOX2 method and measured as absorbance at 560 nm. Conjugated diene levels were measured using second-derivative spectroscopy. No substantial difference was present in serum levels of lipid hydroperoxides, conjugated dienes (in both isomeric forms) and isomer-ratio values between those of patients with chronic pancreatitis and controls. In pancreatic juice, there was a significant increase in lipid hydroperoxides and conjugated dienes levels (especially trans-trans isomers) in chronic pancreatitis patients compared with controls, with a decrease in cis-trans isomers and a significant difference in isomer-ratio values. Increased levels of lipid hydroperoxides and conjugated dienes in the pancreatic juice of chronic pancreatitis patients is indicative of an enhanced lipoperoxidation and antioxidants consumption in pancreatic tissue, confirmed by the decreased isomer-ratio values as an indirect index of decreased antioxidant capacity. The lack of significant difference in conjugated diene and lipid hydroperoxide levels in the serum of chronic pancreatitis patients versus that of controls suggests an oxidative stress limited to pancreatic tissue and indicative of an organ-specific pathology, confirmed by the parallel behaviour of oxidative parameters (lipid hydroperoxides and conjugated dienes) and indexes of pancreatic inflammation (amylase and lipase).

Local deformation gradients in epitaxial Pb(Zr0.2Ti0.8)O3 layers investigated by transmission electron microscopy

NASA Astrophysics Data System (ADS)

Denneulin, T.; Wollschläger, N.; Everhardt, A. S.; Farokhipoor, S.; Noheda, B.; Snoeck, E.; Hÿtch, M.

2018-05-01

Lead zirconate titanate samples are used for their piezoelectric and ferroelectric properties in various types of micro-devices. Epitaxial layers of tetragonal perovskites have a tendency to relax by forming ferroelastic domains. The accommodation of the a/c/a/c polydomain structure on a flat substrate leads to nanoscale deformation gradients which locally influence the polarization by flexoelectric effect. Here, we investigated the deformation fields in epitaxial layers of Pb(Zr0.2Ti0.8)O3 grown on SrTiO3 substrates using transmission electron microscopy (TEM). We found that the deformation gradients depend on the domain walls inclination ( or to the substrate interface) of the successive domains and we describe three different a/c/a domain configurations: one configuration with parallel a-domains and two configurations with perpendicular a-domains (V-shaped and hat--shaped). In the parallel configuration, the c-domains contain horizontal and vertical gradients of out-of-plane deformation. In the V-shaped and hat--shaped configurations, the c-domains exhibit a bending deformation field with vertical gradients of in-plane deformation. Each of these configurations is expected to have a different influence on the polarization and so the local properties of the film. The deformation gradients were measured using dark-field electron holography, a TEM technique, which offers a good sensitivity (0.1%) and a large field-of-view (hundreds of nanometers). The measurements are compared with finite element simulations.

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.

Gyrokinetic GDC turbulence simulations: confirming a new instability regime in LAPD plasmas

NASA Astrophysics Data System (ADS)

Pueschel, M. J.; Rossi, G.; Told, D.; Terry, P. W.; Jenko, F.; Carter, T. A.

2016-10-01

Recent high-beta experiments at the LArge Plasma Device have found significant parallel magnetic fluctuations in the region of large pressure gradients. Linear gyrokinetic simulations show the dominant instability at these radii to be the gradient-driven drift coupling (GDC) mode, a non-textbook mode driven by pressure gradients and destabilized by the coupling of ExB and grad-B∥ drifts. Unlike in previous studies, the large parallel extent of the device allows for finite-kz versions of this instability in addition to kz = 0 . The locations of maximum linear growth match very well with experimentally observed peaks of B∥ fluctuations. Local nonlinear simulations reproduce many features of the observations fairly well, with the exception of Bperp fluctuations, for which experimental profiles suggest a source unrelated to pressure gradients. In toto, the results presented here show that turbulence and transport in these experiments are driven by the GDC instability, that important characteristics of the linear instability carry over to nonlinear simulations, and - in the context of validation - that the gyrokinetic framework performs surprisingly well far outside its typical area of application, increasing confidence in its predictive abilities. Supported by U.S. DOE.

Competing pathways in drug metabolism. I. Effect of input concentration on the conjugation of gentisamide in the once-through in situ perfused rat liver preparation

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

Morris, M.E.; Yuen, V.; Tang, B.K.

1988-05-01

Sulfation and glucuronidation are two parallel pathways for the metabolism of phenolic substrates. Gentisamide (GAM) was used as a model compound to examine the effects of parallel competing pathways on drug disappearance and metabolite formation in the once-through perfused rat liver preparation. GAM was found to form one glucuronide (GAM-5G) and two sulfate (GAM-2S and GAM-5S) conjugates. These GAM conjugates were biosynthesized in recirculating rat liver preparations, and were isolated by preparative high-performance liquid chromatography. Specific incorporation of 35S-sodium sulfate and (14C)glucose into GAM sulfate and glucuronide conjugates revealed corresponding elution patterns as labeled GAM metabolites. Their identities were characterizedmore » by enzymatic and acid hydrolyses and by NMR spectroscopy. Gentisamide-5-sulfate (GAM-5S) and gentisamide-5-glucuronide (GAM-5G) are major metabolites, and gentisamide-2-sulfate (GAM-2S) is a minor metabolite. Single-pass rat liver perfusions were used to examine the effect of stepwise increases/decreases of input GAM concentration (CIn) on the extraction ratio (E) of GAM and formation of metabolites. The E of GAM remained constant (about 0.89) at input concentrations from 0.9 to 120 microM and decreased at CIn greater than 120 microM. Metabolite patterns, however, changed with GAM CIn, even when E was constant at CIn up to 120 microM. GAM-5S was present as the major metabolite of GAM at all GAM CInS in most liver preparations but the proportions of GAM-5S and GAM-2S decreased at increasing CIn; the proportion of GAM-5G, a minor metabolite at low CIn, increased with increasing CIn. Biliary excretion rates at steady state accounted for 5.3 +/- 2.7% (mean +/- S.D.) of the input rate: GAM-5G was the predominant metabolite found.« less

Method and system for optical figuring by imagewise heating of a solvent

DOEpatents

Rushford, Michael C.

2005-08-30

A method and system of imagewise etching the surface of a substrate, such as thin glass, in a parallel process. The substrate surface is placed in contact with an etchant solution which increases in etch rate with temperature. A local thermal gradient is then generated in each of a plurality of selected local regions of a boundary layer of the etchant solution to imagewise etch the substrate surface in a parallel process. In one embodiment, the local thermal gradient is a local heating gradient produced at selected addresses chosen from an indexed array of addresses. The activation of each of the selected addresses is independently controlled by a computer processor so as to imagewise etch the substrate surface at region-specific etch rates. Moreover, etching progress is preferably concurrently monitored in real time over the entire surface area by an interferometer so as to deterministically control the computer processor to image-wise figure the substrate surface where needed.

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.

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

Onsager's symmetry relation and the residual parallel Reynolds stress in a magnetized plasma with electrostatic turbulence

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

Zuo, Yang, E-mail: yangzustc@gmail.com; Wang, Shaojie

2014-09-15

The physics of the residual parallel Reynolds stress in a rotating plasma with electrostatic turbulence is explicitly identified by using the transport formulation of the gyrokinetic turbulence. It is clarified that the residual stress consists of four terms, among which are the cross terms due to the pressure gradient and the temperature gradient and the terms related to the turbulent acceleration impulse and the turbulent heating rate. The last two terms are identified for the first time, and are shown to cause analogous residual term in the heat flux. Meanwhile, the transport matrix reveals diffusion in the phase space. Themore » transport matrix is demonstrated to satisfy the Onsager's symmetry relation.« less

Sinusoidal echo-planar imaging with parallel acquisition technique for reduced acoustic noise in auditory fMRI.

PubMed

Zapp, Jascha; Schmitter, Sebastian; Schad, Lothar R

2012-09-01

To extend the parameter restrictions of a silent echo-planar imaging (sEPI) sequence using sinusoidal readout (RO) gradients, in particular with increased spatial resolution. The sound pressure level (SPL) of the most feasible configurations is compared to conventional EPI having trapezoidal RO gradients. We enhanced the sEPI sequence by integrating a parallel acquisition technique (PAT) on a 3 T magnetic resonance imaging (MRI) system. The SPL was measured for matrix sizes of 64 × 64 and 128 × 128 pixels, without and with PAT (R = 2). The signal-to-noise ratio (SNR) was examined for both sinusoidal and trapezoidal RO gradients. Compared to EPI PAT, the SPL could be reduced by up to 11.1 dB and 5.1 dB for matrix sizes of 64 × 64 and 128 × 128 pixels, respectively. The SNR of sinusoidal RO gradients is lower by a factor of 0.96 on average compared to trapezoidal RO gradients. The sEPI PAT sequence allows for 1) increased resolution, 2) expanded RO frequency range toward lower frequencies, which is in general beneficial for SPL, or 3) shortened TE, TR, and RO train length. At the same time, it generates lower SPL compared to conventional EPI for a wide range of RO frequencies while having the same imaging parameters. Copyright © 2012 Wiley Periodicals, Inc.

Gravitational spreading, bookshelf faulting, and tectonic evolution of the South Polar Terrain of Saturn's moon Enceladus

NASA Astrophysics Data System (ADS)

Yin, An; Pappalardo, Robert T.

2015-11-01

Despite a decade of intense research the mechanical origin of the tiger-stripe fractures (TSF) and their geologic relationship to the hosting South Polar Terrain (SPT) of Enceladus remain poorly understood. Here we show via systematic photo-geological mapping that the semi-squared SPT is bounded by right-slip, left-slip, extensional, and contractional zones on its four edges. Discrete deformation along the edges in turn accommodates translation of the SPT as a single sheet with its transport direction parallel to the regional topographic gradient. This parallel relationship implies that the gradient of gravitational potential energy drove the SPT motion. In map view, internal deformation of the SPT is expressed by distributed right-slip shear parallel to the SPT transport direction. The broad right-slip shear across the whole SPT was facilitated by left-slip bookshelf faulting along the parallel TSF. We suggest that the flow-like tectonics, to the first approximation across the SPT on Enceladus, is best explained by the occurrence of a transient thermal event, which allowed the release of gravitational potential energy via lateral viscous flow within the thermally weakened ice shell.

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.

Parallel Semi-Implicit Spectral Element Atmospheric Model

NASA Astrophysics Data System (ADS)

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

2001-05-01

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

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.

Minimum envelope roughness pulse design for reduced amplifier distortion in parallel excitation.

PubMed

Grissom, William A; Kerr, Adam B; Stang, Pascal; Scott, Greig C; Pauly, John M

2010-11-01

Parallel excitation uses multiple transmit channels and coils, each driven by independent waveforms, to afford the pulse designer an additional spatial encoding mechanism that complements gradient encoding. In contrast to parallel reception, parallel excitation requires individual power amplifiers for each transmit channel, which can be cost prohibitive. Several groups have explored the use of low-cost power amplifiers for parallel excitation; however, such amplifiers commonly exhibit nonlinear memory effects that distort radio frequency pulses. This is especially true for pulses with rapidly varying envelopes, which are common in parallel excitation. To overcome this problem, we introduce a technique for parallel excitation pulse design that yields pulses with smoother envelopes. We demonstrate experimentally that pulses designed with the new technique suffer less amplifier distortion than unregularized pulses and pulses designed with conventional regularization.

Multi-dressing suppression and enhancement and all-optical switching in parametrically amplified four-wave mixing

NASA Astrophysics Data System (ADS)

Li, Xinghua; Zhang, Dan; Sun, Ming; Li, Kangkang; Wang, Zhiguo; Zhang, Yanpeng

2018-04-01

We study different dressing effects in parametrically amplified four-wave mixing (PA-FWM) processes. By seeding a weak probe laser into the Stokes or anti-Stokes channel of the FWM, the gain process is generated in the so-called bright twin beams which are the probe and conjugate beams. The dressing types dramatically affect the gain factors in both the probe and conjugate channels. The gain factor of the FWM signal decreases under the cascade-type dressing and the signal's shape splits into two dips under this dressing type. However, the intensity of the FWM signal changes from suppression to enhancement under the parallel-type dressing. We will apply this switching process to all-optical switching.

Method and apparatus for second-rank tensor generation

NASA Technical Reports Server (NTRS)

Liu, Hua-Kuang (Inventor)

1991-01-01

A method and apparatus are disclosed for generation of second-rank tensors using a photorefractive crystal to perform the outer-product between two vectors via four-wave mixing, thereby taking 2n input data to a control n squared output data points. Two orthogonal amplitude modulated coherent vector beams x and y are expanded and then parallel sides of the photorefractive crystal in exact opposition. A beamsplitter is used to direct a coherent pumping beam onto the crystal at an appropriate angle so as to produce a conjugate beam that is the matrix product of the vector beam that propagates in the exact opposite direction from the pumping beam. The conjugate beam thus separated is the tensor output xy (sup T).

Atmospheric tomography using a fringe pattern in the sodium layer.

PubMed

Baharav, Y; Ribak, E N; Shamir, J

1994-02-15

We wish to measure and separate the contribution of atmospheric turbulent layers for multiconjugate adaptive optics. To this end, we propose to create a periodic fringe pattern in the sodium layer and image it with a modified Hartmann sensor. Overlapping sections of the fringes are imaged by a lenslet array onto contiguous areas in a large-format camera. Low-layer turbulence causes an overall shift of the fringe pattern in each lenslet, and high-attitude turbulence results in internal deformations in the pattern. Parallel Fourier analysis permits separation of the atmospheric layers. Two mirrors, one conjugate to a ground layer and the other conjugate to a single high-altitude layer, are shown to widen the field of view significantly compared with existing methods.

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.

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.

Assessment of Linear Finite-Difference Poisson-Boltzmann Solvers

PubMed Central

Wang, Jun; Luo, Ray

2009-01-01

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

An historical survey of computational methods in optimal control.

NASA Technical Reports Server (NTRS)

Polak, E.

1973-01-01

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

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.

A parallel Jacobson-Oksman optimization algorithm. [parallel processing (computers)

NASA Technical Reports Server (NTRS)

Straeter, T. A.; Markos, A. T.

1975-01-01

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

A Generalized Electron Heat Flow Relation and its Connection to the Thermal Force and the Solar Wind Parallel Electric Field

NASA Astrophysics Data System (ADS)

Scudder, J. D.

2017-12-01

Enroute to a new formulation of the heat law for the solar wind plasma the role of the invariably neglected, but omnipresent, thermal force for the multi-fluid physics of the corona and solar wind expansion will be discussed. This force (a) controls the size of the collisional ion electron energy exchange, favoring the thermal vs supra thermal electrons; (b) occurs whenever heat flux occurs; (c) remains after the electron and ion fluids come to a no slip, zero parallel current, equilibrium; (d) enhances the equilibrium parallel electric field; but (e) has a size that is theoretically independent of the electron collision frequency - allowing its importance to persist far up into the corona where collisions are invariably ignored in first approximation. The constituent parts of the thermal force allow the derivation of a new generalized electron heat flow relation that will be presented. It depends on the separate field aligned divergences of electron and ion pressures and the gradients of the ion gravitational potential and parallel flow energies and is based upon a multi-component electron distribution function. The new terms in this heat law explicitly incorporate the astrophysical context of gradients, acceleration and external forces that make demands on the parallel electric field and quasi-neutrality; essentially all of these effects are missing in traditional formulations.

Nonequilibrium thermodynamics and the transport phenomena in magnetically confined plasmas

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

Balescu, R.

1987-09-01

The neoclassical theory of transport in magnetically confined plasmas is reviewed. The emphasis is laid on a set of relationships existing among the banana transport coefficients. The surface-averaged entropy production in such plasmas is evaluated. It is shown that neoclassical effects emerge from the entropy production due to parallel transport processes. The Pfirsch-Schlueter effect can be clearly interpreted as due to spatial fluctuations of parallel fluxes on a magnetic surface: the corresponding entropy production is the measure of these fluctuations. The banana fluxes can be formulated in a quasithermodynamic form in which the average entropy production is a bilinear formmore » in the parallel fluxes and the conjugate generalized stresses. A formulation as a quadratic form in the thermodynamic forces is also possible, but leads to anomalies, which are discussed in some detail.« less

Local deformation gradients in epitaxial Pb(Zr0.2Ti0.8)O3 layers investigated by transmission electron microscopy.

PubMed

Denneulin, T; Wollschläger, N; Everhardt, A S; Farokhipoor, S; Noheda, B; Snoeck, E; Hÿtch, M

2018-05-31

Lead zirconate titanate samples are used for their piezoelectric and ferroelectric properties in various types of micro-devices. Epitaxial layers of tetragonal perovskites have a tendency to relax by forming [Formula: see text] ferroelastic domains. The accommodation of the a/c/a/c polydomain structure on a flat substrate leads to nanoscale deformation gradients which locally influence the polarization by flexoelectric effect. Here, we investigated the deformation fields in epitaxial layers of Pb(Zr 0.2 Ti 0.8 )O 3 grown on SrTiO 3 substrates using transmission electron microscopy (TEM). We found that the deformation gradients depend on the domain walls inclination ([Formula: see text] or [Formula: see text] to the substrate interface) of the successive [Formula: see text] domains and we describe three different a/c/a domain configurations: one configuration with parallel a-domains and two configurations with perpendicular a-domains (V-shaped and hat-[Formula: see text]-shaped). In the parallel configuration, the c-domains contain horizontal and vertical gradients of out-of-plane deformation. In the V-shaped and hat-[Formula: see text]-shaped configurations, the c-domains exhibit a bending deformation field with vertical gradients of in-plane deformation. Each of these configurations is expected to have a different influence on the polarization and so the local properties of the film. The deformation gradients were measured using dark-field electron holography, a TEM technique, which offers a good sensitivity (0.1%) and a large field-of-view (hundreds of nanometers). The measurements are compared with finite element simulations.

Flow distribution in parallel microfluidic networks and its effect on concentration gradient

PubMed Central

Guermonprez, Cyprien; Michelin, Sébastien; Baroud, Charles N.

2015-01-01

The architecture of microfluidic networks can significantly impact the flow distribution within its different branches and thereby influence tracer transport within the network. In this paper, we study the flow rate distribution within a network of parallel microfluidic channels with a single input and single output, using a combination of theoretical modeling and microfluidic experiments. Within the ladder network, the flow rate distribution follows a U-shaped profile, with the highest flow rate occurring in the initial and final branches. The contrast with the central branches is controlled by a single dimensionless parameter, namely, the ratio of hydrodynamic resistance between the distribution channel and the side branches. This contrast in flow rates decreases when the resistance of the side branches increases relative to the resistance of the distribution channel. When the inlet flow is composed of two parallel streams, one of which transporting a diffusing species, a concentration variation is produced within the side branches of the network. The shape of this concentration gradient is fully determined by two dimensionless parameters: the ratio of resistances, which determines the flow rate distribution, and the Péclet number, which characterizes the relative speed of diffusion and advection. Depending on the values of these two control parameters, different distribution profiles can be obtained ranging from a flat profile to a step distribution of solute, with well-distributed gradients between these two limits. Our experimental results are in agreement with our numerical model predictions, based on a simplified 2D advection-diffusion problem. Finally, two possible applications of this work are presented: the first one combines the present design with self-digitization principle to encapsulate the controlled concentration in nanoliter chambers, while the second one extends the present design to create a continuous concentration gradient within an open flow chamber. PMID:26487905

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.

Monitoring of the spatio-temporal change in the interplate coupling at northeastern Japan subduction zone based on the spatial gradients of surface velocity field

NASA Astrophysics Data System (ADS)

Iinuma, Takeshi

2018-04-01

A monitoring method to grasp the spatio-temporal change in the interplate coupling in a subduction zone based on the spatial gradients of surface displacement rate fields is proposed. I estimated the spatio-temporal change in the interplate coupling along the plate boundary in northeastern (NE) Japan by applying the proposed method to the surface displacement rates based on global positioning system observations. The gradient of the surface velocities is calculated in each swath configured along the direction normal to the Japan Trench for time windows such as 0.5, 1, 2, 3 and 5 yr being shifted by one week during the period of 1997-2016. The gradient of the horizontal velocities is negative and has a large magnitude when the interplate coupling at the shallow part (less than approximately 50 km in depth) beneath the profile is strong, and the sign of the gradient of the vertical velocity is sensitive to the existence of the coupling at the deep part (greater than approximately 50 km in depth). The trench-parallel variation of the spatial gradients of a displacement rate field clearly corresponds to the trench-parallel variation of the amplitude of the interplate coupling on the plate interface, as well as the rupture areas of previous interplate earthquakes. Temporal changes in the trench-parallel variation of the spatial gradient of the displacement rate correspond to the strengthening or weakening of the interplate coupling. We can monitor the temporal change in the interplate coupling state by calculating the spatial gradients of the surface displacement rate field to some extent without performing inversion analyses with applying certain constraint conditions that sometimes cause over- and/or underestimation at areas of limited spatial resolution far from the observation network. The results of the calculation confirm known interplate events in the NE Japan subduction zone, such as the post-seismic slip of the 2003 M8.0 Tokachi-oki and 2005 M7.2 Miyagi-oki earthquakes and the recovery of the interplate coupling around the rupture area of the 1994 M7.6 Sanriku-Haruka-oki earthquake. The results also indicate the semi-periodic occurrence of slow slip events and the expansion of the area of slow slip events before the 2011 Tohoku-oki earthquake (M9.0) approaching the hypocentre of the Tohoku-oki earthquake.

A Review of Therapeutic Aptamer Conjugates with Emphasis on New Approaches

PubMed Central

Bruno, John G.

2013-01-01

The potential to emulate or enhance antibodies with nucleic acid aptamers while lowering costs has prompted development of new aptamer-protein, siRNA, drug, and nanoparticle conjugates. Specific focal points of this review discuss DNA aptamers covalently bound at their 3' ends to various proteins for enhanced stability and greater pharmacokinetic lifetimes in vivo. The proteins can include Fc tails of IgG for opsonization, and the first component of complement (C1q) to trigger complement-mediated lysis of antibiotic-resistant Gram negative bacteria, cancer cells and possibly some parasites during vulnerable stages. In addition, the 3' protein adduct may be a biotoxin, enzyme, or may simply be human serum albumin (HSA) or a drug known to bind HSA, thereby retarding kidney and other organ clearance and inhibiting serum exonucleases. In this review, the author summarizes existing therapeutic aptamer conjugate categories and describes his patented concept for PCR-based amplification of double-stranded aptamers followed by covalent attachment of proteins or other agents to the chemically vulnerable overhanging 3' adenine added by Taq polymerase. PCR amplification of aptamers could dramatically lower the current $2,000/gram cost of parallel chemical oligonucleotide synthesis, thereby enabling mass production of aptamer-3'-protein or drug conjugates to better compete against expensive humanized monoclonal antibodies. PMID:24276022

Constructing a mixed π-conjugated bridge to effectively enhance the nonlinear optical response in the Möbius cyclacene-based systems.

PubMed

Chen, Liwei; Yu, Guangtao; Chen, Wei; Tu, Chunyun; Zhao, Xingang; Huang, Xuri

2014-06-14

Using density functional theory computations, employing the concept of a mixed π-conjugated bridge can effectively improve the first hyperpolarizability (β0) of Möbius cyclacene (MC)-based systems with a D-π-A framework. This mixed π-conjugated bridge is constructed by applying a -(CH=CH)x-NH2 or -(CH=CH)x-NO2 chain to modify [8]MC, which can lead to a considerable β0 value (e.g. [8]MC-(CH=CH)12-NO2 (9.87 × 10(5) au) with only a certain chain length), much larger than the sole [8]MC (261 au) and the corresponding NH2/NO2-modified polyethylene chain with the same π-conjugated length. It is revealed that the substituent sites and the chain length can play a crucial role in improving β0 values of these MC-chain systems, where the β0 value can monotonically increase with increasing -(CH=CH)x- length, and the substituent electron-withdrawing -(CH=CH)x-NO2 chain is superior to the parallel electron-donating -(CH=CH)x-NH2. These appealing findings can provide valuable insights into the design of novel NLO materials based on MC.

The accuracy of the compressible Reynolds equation for predicting the local pressure in gas-lubricated textured parallel slider bearings

PubMed Central

Qiu, Mingfeng; Bailey, Brian N.; Stoll, Rob

2014-01-01

The validity of the compressible Reynolds equation to predict the local pressure in a gas-lubricated, textured parallel slider bearing is investigated. The local bearing pressure is numerically simulated using the Reynolds equation and the Navier-Stokes equations for different texture geometries and operating conditions. The respective results are compared and the simplifying assumptions inherent in the application of the Reynolds equation are quantitatively evaluated. The deviation between the local bearing pressure obtained with the Reynolds equation and the Navier-Stokes equations increases with increasing texture aspect ratio, because a significant cross-film pressure gradient and a large velocity gradient in the sliding direction develop in the lubricant film. Inertia is found to be negligible throughout this study. PMID:25049440

Pressure gradients fail to predict diffusio-osmosis

NASA Astrophysics Data System (ADS)

Liu, Yawei; Ganti, Raman; Frenkel, Daan

2018-05-01

We present numerical simulations of diffusio-osmotic flow, i.e. the fluid flow generated by a concentration gradient along a solid-fluid interface. In our study, we compare a number of distinct approaches that have been proposed for computing such flows and compare them with a reference calculation based on direct, non-equilibrium molecular dynamics simulations. As alternatives, we consider schemes that compute diffusio-osmotic flow from the gradient of the chemical potentials of the constituent species and from the gradient of the component of the pressure tensor parallel to the interface. We find that the approach based on treating chemical potential gradients as external forces acting on various species agrees with the direct simulations, thereby supporting the approach of Marbach et al (2017 J. Chem. Phys. 146 194701). In contrast, an approach based on computing the gradients of the microscopic pressure tensor does not reproduce the direct non-equilibrium results.

Architecting the Finite Element Method Pipeline for the GPU.

PubMed

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

2014-02-01

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

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.

Accurate pressure gradient calculations in hydrostatic atmospheric models

NASA Technical Reports Server (NTRS)

Carroll, John J.; Mendez-Nunez, Luis R.; Tanrikulu, Saffet

1987-01-01

A method for the accurate calculation of the horizontal pressure gradient acceleration in hydrostatic atmospheric models is presented which is especially useful in situations where the isothermal surfaces are not parallel to the vertical coordinate surfaces. The present method is shown to be exact if the potential temperature lapse rate is constant between the vertical pressure integration limits. The technique is applied to both the integration of the hydrostatic equation and the computation of the slope correction term in the horizontal pressure gradient. A fixed vertical grid and a dynamic grid defined by the significant levels in the vertical temperature distribution are employed.

New theoretical results for the Lehmann effect in cholesteric liquid crystals

NASA Technical Reports Server (NTRS)

Brand, Helmut R.; Pleiner, Harald

1988-01-01

The Lehmann effect arising in a cholesteric liquid crystal drop when a temperature gradient is applied parallel to its helical axis is investigated theoretically using a local approach. A pseudoscalar quantity is introduced to allow for cross couplings which are absent in nematic liquid crystals, and the statics and dissipative dynamics are analyzed in detail. It is shown that the Lehmann effect is purely dynamic for the case of an external electric field and purely static for an external density gradient, but includes both dynamic and static coupling contributions for the cases of external temperature or concentration gradients.

A time-parallel approach to strong-constraint four-dimensional variational data assimilation

NASA Astrophysics Data System (ADS)

Rao, Vishwas; Sandu, Adrian

2016-05-01

A parallel-in-time algorithm based on an augmented Lagrangian approach is proposed to solve four-dimensional variational (4D-Var) data assimilation problems. The assimilation window is divided into multiple sub-intervals that allows parallelization of cost function and gradient computations. The solutions to the continuity equations across interval boundaries are added as constraints. The augmented Lagrangian approach leads to a different formulation of the variational data assimilation problem than the weakly constrained 4D-Var. A combination of serial and parallel 4D-Vars to increase performance is also explored. The methodology is illustrated on data assimilation problems involving the Lorenz-96 and the shallow water models.

A computationally efficient method for full-core conjugate heat transfer modeling of sodium fast reactors

DOE PAGES

Hu, Rui; Yu, Yiqi

2016-09-08

For efficient and accurate temperature predictions of sodium fast reactor structures, a 3-D full-core conjugate heat transfer modeling capability is developed for an advanced system analysis tool, SAM. The hexagon lattice core is modeled with 1-D parallel channels representing the subassembly flow, and 2-D duct walls and inter-assembly gaps. The six sides of the hexagon duct wall and near-wall coolant region are modeled separately to account for different temperatures and heat transfer between coolant flow and each side of the duct wall. The Jacobian Free Newton Krylov (JFNK) solution method is applied to solve the fluid and solid field simultaneouslymore » in a fully coupled fashion. The 3-D full-core conjugate heat transfer modeling capability in SAM has been demonstrated by a verification test problem with 7 fuel assemblies in a hexagon lattice layout. In addition, the SAM simulation results are compared with RANS-based CFD simulations. Very good agreements have been achieved between the results of the two approaches.« less

Temporal switching of homo-FRET pathways in single-chromophore dimer models of π-conjugated polymers.

PubMed

Stangl, Thomas; Bange, Sebastian; Schmitz, Daniela; Würsch, Dominik; Höger, Sigurd; Vogelsang, Jan; Lupton, John M

2013-01-09

A set of π-conjugated oligomer dimers templated in molecular scaffolds is presented as a model system for studying the interactions between chromophores in conjugated polymers (CPs). Single-molecule spectroscopy was used to reveal energy transfer dynamics between two oligomers in either a parallel or oblique-angle geometry. In particular, the conformation of single molecules embedded in a host matrix was investigated via polarized excitation and emission fluorescence microscopy in combination with fluorescence correlation spectroscopy. While the intramolecular interchromophore conformation was found to have no impact on the fluorescence quantum yield, lifetime, or photon statistics (antibunching), the long-term nonequilibrium dynamics of energy transfer within these bichromophoric systems was accessible by studying the linear dichroism in emission at the single-molecule level, which revealed reversible switching of the emission between the two oligomers. In bulk polymer films, interchromophore coupling promotes the migration of excitation energy to quenching sites. Realizing the presence and dynamics of such interactions is crucial for understanding limitations on the quantum efficiency of larger CP materials.

Interaction of Vaccination and Reduction of Antibiotic Use Drives Unexpected Increase of Pneumococcal Meningitis

PubMed Central

de Cellès, Matthieu Domenech; Pons-Salort, Margarita; Varon, Emmanuelle; Vibet, Marie-Anne; Ligier, Caroline; Letort, Véronique; Opatowski, Lulla; Guillemot, Didier

2015-01-01

Antibiotic-use policies may affect pneumococcal conjugate-vaccine effectiveness. The reported increase of pneumococcal meningitis from 2001 to 2009 in France, where a national campaign to reduce antibiotic use was implemented in parallel to the introduction of the 7-valent conjugate vaccine, provides unique data to assess these effects. We constructed a mechanistic pneumococcal transmission model and used likelihood to assess the ability of competing hypotheses to explain that increase. We find that a model integrating a fitness cost of penicillin resistance successfully explains the overall and age-stratified pattern of serotype replacement. By simulating counterfactual scenarios of public health interventions in France, we propose that this fitness cost caused a gradual and pernicious interaction between the two interventions by increasing the spread of nonvaccine, penicillin-susceptible strains. More generally, our results indicate that reductions of antibiotic use may counteract the benefits of conjugate vaccines introduced into countries with low vaccine-serotype coverages and high-resistance frequencies. Our findings highlight the key role of antibiotic use in vaccine-induced serotype replacement and suggest the need for more integrated approaches to control pneumococcal infections. PMID:26063589

Interaction of Vaccination and Reduction of Antibiotic Use Drives Unexpected Increase of Pneumococcal Meningitis.

PubMed

de Cellès, Matthieu Domenech; Pons-Salort, Margarita; Varon, Emmanuelle; Vibet, Marie-Anne; Ligier, Caroline; Letort, Véronique; Opatowski, Lulla; Guillemot, Didier

2015-06-11

Antibiotic-use policies may affect pneumococcal conjugate-vaccine effectiveness. The reported increase of pneumococcal meningitis from 2001 to 2009 in France, where a national campaign to reduce antibiotic use was implemented in parallel to the introduction of the 7-valent conjugate vaccine, provides unique data to assess these effects. We constructed a mechanistic pneumococcal transmission model and used likelihood to assess the ability of competing hypotheses to explain that increase. We find that a model integrating a fitness cost of penicillin resistance successfully explains the overall and age-stratified pattern of serotype replacement. By simulating counterfactual scenarios of public health interventions in France, we propose that this fitness cost caused a gradual and pernicious interaction between the two interventions by increasing the spread of nonvaccine, penicillin-susceptible strains. More generally, our results indicate that reductions of antibiotic use may counteract the benefits of conjugate vaccines introduced into countries with low vaccine-serotype coverages and high-resistance frequencies. Our findings highlight the key role of antibiotic use in vaccine-induced serotype replacement and suggest the need for more integrated approaches to control pneumococcal infections.

Strike-parallel and strike-normal coordinate system around geometrically complicated rupture traces: use by NGA-West2 and further improvements

USGS Publications Warehouse

Spudich, Paul A.; Chiou, Brian

2015-01-01

We present a two-dimensional system of generalized coordinates for use with geometrically complex fault ruptures that are neither straight nor continuous. The coordinates are a generalization of the conventional strike-normal and strike-parallel coordinates of a single straight fault. The presented conventions and formulations are applicable to a single curved trace, as well as multiple traces representing the rupture of branching faults or noncontiguous faults. An early application of our generalized system is in the second round of the Next Generation of Ground-Motion Attenuation Model project for the Western United States (NGA-West2), where they were used in the characterization of the hanging-wall effects. We further improve the NGA-West2 strike-parallel formulation for multiple rupture traces with a more intuitive definition of the nominal strike direction. We also derive an analytical expression for the gradient of the generalized strike-normal coordinate. The direction of this gradient may be used as the strike-normal direction in the study of polarization effects on ground motions.

Effects of Polymer Conjugation on Hybridization Thermodynamics of Oligonucleic Acids.

PubMed

Ghobadi, Ahmadreza F; Jayaraman, Arthi

2016-09-15

In this work, we perform coarse-grained (CG) and atomistic simulations to study the effects of polymer conjugation on hybridization/melting thermodynamics of oligonucleic acids (ONAs). We present coarse-grained Langevin molecular dynamics simulations (CG-NVT) to assess the effects of the polymer flexibility, length, and architecture on hybridization/melting of ONAs with different ONA duplex sequences, backbone chemistry, and duplex concentration. In these CG-NVT simulations, we use our recently developed CG model of ONAs in implicit solvent, and treat the conjugated polymer as a CG chain with purely repulsive Weeks-Chandler-Andersen interactions with all other species in the system. We find that 8-100-mer linear polymer conjugation destabilizes 8-mer ONA duplexes with weaker Watson-Crick hydrogen bonding (WC H-bonding) interactions at low duplex concentrations, while the same polymer conjugation has an insignificant impact on 8-mer ONA duplexes with stronger WC H-bonding. To ensure the configurational space is sampled properly in the CG-NVT simulations, we also perform CG well-tempered metadynamics simulations (CG-NVT-MetaD) and analyze the free energy landscape of ONA hybridization for a select few systems. We demonstrate that CG-NVT-MetaD simulation results are consistent with the CG-NVT simulations for the studied systems. To examine the limitations of coarse-graining in capturing ONA-polymer interactions, we perform atomistic parallel tempering metadynamics simulations at well-tempered ensemble (AA-MetaD) for a 4-mer DNA in explicit water with and without conjugation to 8-mer poly(ethylene glycol) (PEG). AA-MetaD simulations also show that, for a short DNA duplex at T = 300 K, a condition where the DNA duplex is unstable, conjugation with PEG further destabilizes DNA duplex. We conclude with a comparison of results from these three different types of simulations and discuss their limitations and strengths.

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.

Nongyrotropic Electrons in Guide Field Reconnection

NASA Technical Reports Server (NTRS)

Wendel, D. E.; Hesse, M.; Bessho, N.; Adrian, M. L.; Kuznetsova, M.

2016-01-01

We apply a scalar measure of nongyrotropy to the electron pressure tensor in a 2D particle-in-cell simulation of guide field reconnection and assess the corresponding electron distributions and the forces that account for the nongyrotropy. The scalar measure reveals that the nongyrotropy lies in bands that straddle the electron diffusion region and the separatrices, in the same regions where there are parallel electric fields. Analysis of electron distributions and fields shows that the nongyrotropy along the inflow and outflow separatrices emerges as a result of multiple populations of electrons influenced differently by large and small-scale parallel electric fields and by gradients in the electric field. The relevant parallel electric fields include large-scale potential ramps emanating from the x-line and sub-ion inertial scale bipolar electron holes. Gradients in the perpendicular electric field modify electrons differently depending on their phase, thus producing nongyrotropy. Magnetic flux violation occurs along portions of the separatrices that coincide with the parallel electric fields. An inductive electric field in the electron EB drift frame thus develops, which has the effect of enhancing nongyrotropies already produced by other mechanisms and under certain conditions producing their own nongyrotropy. Particle tracing of electrons from nongyrotropic populations along the inflows and outflows shows that the striated structure of nongyrotropy corresponds to electrons arriving from different source regions. We also show that the relevant parallel electric fields receive important contributions not only from the nongyrotropic portion of the electron pressure tensor but from electron spatial and temporal inertial terms as well.

Wavelength-selective ultraviolet (Mg,Zn)O photodiodes: Tuning of parallel composition gradients with oxygen pressure

NASA Astrophysics Data System (ADS)

Zhang, Zhipeng; von Wenckstern, Holger; Lenzner, Jörg; Grundmann, Marius

2016-06-01

We report on ultraviolet photodiodes with integrated optical filter based on the wurtzite (Mg,Zn)O thin films. Tuning of the bandgap of filter and active layers was realized by employing a continuous composition spread approach relying on the ablation of a single segmented target in pulsed-laser deposition. Filter and active layers of the device were deposited on opposite sides of a sapphire substrate with nearly parallel compositional gradients. Ensure that for each sample position the bandgap of the filter layer blocking the high energy radiation is higher than that of the active layer. Different oxygen pressures during the two depositions runs. The absorption edge is tuned over 360 meV and the spectral bandwidth of photodiodes is typically 100 meV and as low as 50 meV.

A parallel variable metric optimization algorithm

NASA Technical Reports Server (NTRS)

Straeter, T. A.

1973-01-01

An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities of computers is presented. When p is the degree of parallelism, then one cycle of the parallel variable metric algorithm is defined as follows: first, the function and its gradient are computed in parallel at p different values of the independent variable; then the metric is modified by p rank-one corrections; and finally, a single univariant minimization is carried out in the Newton-like direction. Several properties of this algorithm are established. The convergence of the iterates to the solution is proved for a quadratic functional on a real separable Hilbert space. For a finite-dimensional space the convergence is in one cycle when p equals the dimension of the space. Results of numerical experiments indicate that the new algorithm will exploit parallel or pipeline computing capabilities to effect faster convergence than serial techniques.

Toward Computational Design of High-Efficiency Photovoltaics from First-Principles

DTIC Science & Technology

2016-08-15

dependence of exciton diffusion in conjugated small molecules, Applied Physics Letters, (04 2014): 0. doi: 10.1063/1.4871303 Guangfen Wu, Zi Li, Xu...principle approach based on the time- dependent density functional theory (TDDFT) to describe exciton states, including energy levels and many-body wave... depends more sensitively on the dimension and crystallinity of the acceptor parallel to the interface than normal to the interface. Reorganization

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.

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.

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

NASA Technical Reports Server (NTRS)

Pandya, Mohagna J.; Baysal, Oktay

1997-01-01

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

A New Kinematic Model for Polymodal Faulting: Implications for Fault Connectivity

NASA Astrophysics Data System (ADS)

Healy, D.; Rizzo, R. E.

2015-12-01

Conjugate, or bimodal, fault patterns dominate the geological literature on shear failure. Based on Anderson's (1905) application of the Mohr-Coulomb failure criterion, these patterns have been interpreted from all tectonic regimes, including normal, strike-slip and thrust (reverse) faulting. However, a fundamental limitation of the Mohr-Coulomb failure criterion - and others that assume faults form parallel to the intermediate principal stress - is that only plane strain can result from slip on the conjugate faults. However, deformation in the Earth is widely accepted as being three-dimensional, with truly triaxial stresses and strains. Polymodal faulting, with three or more sets of faults forming and slipping simultaneously, can generate three-dimensional strains from truly triaxial stresses. Laboratory experiments and outcrop studies have verified the occurrence of the polymodal fault patterns in nature. The connectivity of polymodal fault networks differs significantly from conjugate fault networks, and this presents challenges to our understanding of faulting and an opportunity to improve our understanding of seismic hazards and fluid flow. Polymodal fault patterns will, in general, have more connected nodes in 2D (and more branch lines in 3D) than comparable conjugate (bimodal) patterns. The anisotropy of permeability is therefore expected to be very different in rocks with polymodal fault patterns in comparison to conjugate fault patterns, and this has implications for the development of hydrocarbon reservoirs, the genesis of ore deposits and the management of aquifers. In this contribution, I assess the published evidence and models for polymodal faulting before presenting a novel kinematic model for general triaxial strain in the brittle field.

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.

MUTILS - a set of efficient modeling tools for multi-core CPUs implemented in MEX

NASA Astrophysics Data System (ADS)

Krotkiewski, Marcin; Dabrowski, Marcin

2013-04-01

The need for computational performance is common in scientific applications, and in particular in numerical simulations, where high resolution models require efficient processing of large amounts of data. Especially in the context of geological problems the need to increase the model resolution to resolve physical and geometrical complexities seems to have no limits. Alas, the performance of new generations of CPUs does not improve any longer by simply increasing clock speeds. Current industrial trends are to increase the number of computational cores. As a result, parallel implementations are required in order to fully utilize the potential of new processors, and to study more complex models. We target simulations on small to medium scale shared memory computers: laptops and desktop PCs with ~8 CPU cores and up to tens of GB of memory to high-end servers with ~50 CPU cores and hundereds of GB of memory. In this setting MATLAB is often the environment of choice for scientists that want to implement their own models with little effort. It is a useful general purpose mathematical software package, but due to its versatility some of its functionality is not as efficient as it could be. In particular, the challanges of modern multi-core architectures are not fully addressed. We have developed MILAMIN 2 - an efficient FEM modeling environment written in native MATLAB. Amongst others, MILAMIN provides functions to define model geometry, generate and convert structured and unstructured meshes (also through interfaces to external mesh generators), compute element and system matrices, apply boundary conditions, solve the system of linear equations, address non-linear and transient problems, and perform post-processing. MILAMIN strives to combine the ease of code development and the computational efficiency. Where possible, the code is optimized and/or parallelized within the MATLAB framework. Native MATLAB is augmented with the MUTILS library - a set of MEX functions that implement the computationally intensive, performance critical parts of the code, which we have identified to be bottlenecks. Here, we discuss the functionality and performance of the MUTILS library. Currently, it includes: 1. time and memory efficient assembly of sparse matrices for FEM simulations 2. parallel sparse matrix - vector product with optimizations speficic to symmetric matrices and multiple degrees of freedom per node 3. parallel point in triangle location and point in tetrahedron location for unstructured, adaptive 2D and 3D meshes (useful for 'marker in cell' type of methods) 4. parallel FEM interpolation for 2D and 3D meshes of elements of different types and orders, and for different number of degrees of freedom per node 5. a stand-alone, MEX implementation of the Conjugate Gradients iterative solver 6. interface to METIS graph partitioning and a fast implementation of RCM reordering

The molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory: The DEC-RI-MP2 gradient

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

Bykov, Dmytro; Kristensen, Kasper; Kjærgaard, Thomas

We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 methodmore » and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.« less

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.

Analytical and numerical study of the transverse Kelvin-Helmholtz instability in tokamak edge plasmas

DOE PAGES

Myra, James R.; D'Ippolito, Daniel A.; Russell, David A.; ...

2016-04-11

Sheared flows perpendicular to the magnetic field can be driven by the Reynolds stress or ion pressure gradient effects and can potentially influence the stability and turbulent saturation level of edge plasma modes. On the other hand, such flows are subject to the transverse Kelvin- Helmholtz (KH) instability. Here, the linear theory of KH instabilities is first addressed with an analytic model in the asymptotic limit of long wavelengths compared with the flow scale length. The analytic model treats sheared ExB flows, ion diamagnetism (including gyro-viscous terms), density gradients and parallel currents in a slab geometry, enabling a unified summarymore » that encompasses and extends previous results. In particular, while ion diamagnetism, density gradients and parallel currents each individually reduce KH growth rates, the combined effect of density and ion pressure gradients is more complicated and partially counteracting. Secondly, the important role of realistic toroidal geometry is explored numerically using an invariant scaling analysis together with the 2DX eigenvalue code to examine KH modes in both closed and open field line regions. For a typical spherical torus magnetic geometry, it is found that KH modes are more unstable at and just outside the separatrix as a result of the distribution of magnetic shear. Lastly implications for reduced edge turbulence modeling codes are discussed.« less

Efficient time-dependent density functional theory approximations for hybrid density functionals: analytical gradients and parallelization.

PubMed

Petrenko, Taras; Kossmann, Simone; Neese, Frank

2011-02-07

In this paper, we present the implementation of efficient approximations to time-dependent density functional theory (TDDFT) within the Tamm-Dancoff approximation (TDA) for hybrid density functionals. For the calculation of the TDDFT/TDA excitation energies and analytical gradients, we combine the resolution of identity (RI-J) algorithm for the computation of the Coulomb terms and the recently introduced "chain of spheres exchange" (COSX) algorithm for the calculation of the exchange terms. It is shown that for extended basis sets, the RIJCOSX approximation leads to speedups of up to 2 orders of magnitude compared to traditional methods, as demonstrated for hydrocarbon chains. The accuracy of the adiabatic transition energies, excited state structures, and vibrational frequencies is assessed on a set of 27 excited states for 25 molecules with the configuration interaction singles and hybrid TDDFT/TDA methods using various basis sets. Compared to the canonical values, the typical error in transition energies is of the order of 0.01 eV. Similar to the ground-state results, excited state equilibrium geometries differ by less than 0.3 pm in the bond distances and 0.5° in the bond angles from the canonical values. The typical error in the calculated excited state normal coordinate displacements is of the order of 0.01, and relative error in the calculated excited state vibrational frequencies is less than 1%. The errors introduced by the RIJCOSX approximation are, thus, insignificant compared to the errors related to the approximate nature of the TDDFT methods and basis set truncation. For TDDFT/TDA energy and gradient calculations on Ag-TB2-helicate (156 atoms, 2732 basis functions), it is demonstrated that the COSX algorithm parallelizes almost perfectly (speedup ~26-29 for 30 processors). The exchange-correlation terms also parallelize well (speedup ~27-29 for 30 processors). The solution of the Z-vector equations shows a speedup of ~24 on 30 processors. The parallelization efficiency for the Coulomb terms can be somewhat smaller (speedup ~15-25 for 30 processors), but their contribution to the total calculation time is small. Thus, the parallel program completes a Becke3-Lee-Yang-Parr energy and gradient calculation on the Ag-TB2-helicate in less than 4 h on 30 processors. We also present the necessary extension of the Lagrangian formalism, which enables the calculation of the TDDFT excited state properties in the frozen-core approximation. The algorithms described in this work are implemented into the ORCA electronic structure system.

Highly active anticancer curcumin analogues.

PubMed

Mosley, Cara A; Liotta, Dennis C; Snyder, James P

2007-01-01

Curcumin, a compound in the human food supply, represents a near-perfect starting point for drug discovery. Consequently, a number of research groups have taken the natural product as a starting point to prepare and biologically evaluate a wide variety of curcumin analogues. One widely used structural modification truncates the central conjugated beta-diketone in curcumin to the monocarbonyl dienone. A diverse array of the latter compounds exhibit cytotoxicities against an equally diverse set of cancer-related cell lines. Importantly, these compounds still retain toxicity profiles in rodents comparable to the parent natural product, whereas some analogues (e.g., EF-24, 41) exhibit good oral bioavailability and good pharmacokinetics in mice. Thiol conjugates of EF-24 analogues have been prepared that address stability and solubility issues while demonstrating cellular activities similar to the unmodified dienones. In parallel experiments, the factor VIIa-tissue factor complex (fVIIa-TF) has been exploited to develop a targeting strategy for the analogues. In particular, the EF24-FFRck-fVIIa protein conjugate is not only somewhat more effective relative to the drug alone against breast cancer and melanocyte cells. Both simple curcumin analogues and the protein conjugate evidence antiangiogenic activity in cell culture. The implication is that the fVIIa-TF targeting process, like the dienone drugs, permits a double-pronged attack with the potential to destroy a tumor directly by apoptosis.

Predictors of elevational biodiversity gradients change from single taxa to the multi-taxa community level

PubMed Central

Peters, Marcell K.; Hemp, Andreas; Appelhans, Tim; Behler, Christina; Classen, Alice; Detsch, Florian; Ensslin, Andreas; Ferger, Stefan W.; Frederiksen, Sara B.; Gebert, Friederike; Haas, Michael; Helbig-Bonitz, Maria; Hemp, Claudia; Kindeketa, William J.; Mwangomo, Ephraim; Ngereza, Christine; Otte, Insa; Röder, Juliane; Rutten, Gemma; Schellenberger Costa, David; Tardanico, Joseph; Zancolli, Giulia; Deckert, Jürgen; Eardley, Connal D.; Peters, Ralph S.; Rödel, Mark-Oliver; Schleuning, Matthias; Ssymank, Axel; Kakengi, Victor; Zhang, Jie; Böhning-Gaese, Katrin; Brandl, Roland; Kalko, Elisabeth K.V.; Kleyer, Michael; Nauss, Thomas; Tschapka, Marco; Fischer, Markus; Steffan-Dewenter, Ingolf

2016-01-01

The factors determining gradients of biodiversity are a fundamental yet unresolved topic in ecology. While diversity gradients have been analysed for numerous single taxa, progress towards general explanatory models has been hampered by limitations in the phylogenetic coverage of past studies. By parallel sampling of 25 major plant and animal taxa along a 3.7 km elevational gradient on Mt. Kilimanjaro, we quantify cross-taxon consensus in diversity gradients and evaluate predictors of diversity from single taxa to a multi-taxa community level. While single taxa show complex distribution patterns and respond to different environmental factors, scaling up diversity to the community level leads to an unambiguous support for temperature as the main predictor of species richness in both plants and animals. Our findings illuminate the influence of taxonomic coverage for models of diversity gradients and point to the importance of temperature for diversification and species coexistence in plant and animal communities. PMID:28004657

Magnetospheric Multiscale Observations of the Electron Diffusion Region of Large Guide Field Magnetic Reconnection

NASA Technical Reports Server (NTRS)

Eriksson, S.; Wilder, F. D.; Ergun, R. E.; Schwartz, S. J.; Cassak, P. A.; Burch, J. L.; Chen, Li-Jen; Torbert, R. B.; Phan, T. D.; Lavraud, B.;

Point interactions, metamaterials, and PT-symmetry

NASA Astrophysics Data System (ADS)

Mostafazadeh, Ali

2016-05-01

We express the boundary conditions for TE and TM waves at the interfaces of an infinite planar slab of homogeneous metamaterial as certain point interactions and use them to compute the transfer matrix of the system. This allows us to demonstrate the omnidirectional reflectionlessness of Veselago's slab for waves of arbitrary wavelength, reveal the translational and reflection symmetry of this slab, explore the laser threshold condition and coherent perfect absorption for active negative-index metamaterials, introduce a point interaction modeling phase-conjugation, determine the corresponding antilinear transfer matrix, and offer a simple proof of the equivalence of Veselago's slab with a pair of parallel phase-conjugating plates. We also study the connection between certain optical setups involving metamaterials and a class of PT-symmetric quantum systems defined on wedge-shape contours in the complex plane. This provides a physical interpretation for the latter.

Association between mitogenicity and immunogenicity of 4-hydroxy-3,5- dinitrophenacetyl-lipopolysaccharide, a T-independent antigen

PubMed Central

1976-01-01

Polymyxin B, which is a basic polypeptide produced by various strains of Bacillus Polymyxa, has previously been shown to prevent the lethal effect of LPS and to neutralize the Schwartzmann reaction. In this study we have investigated the interactions between polymyxin B and lipopolysaccharide (LPS) and hapten LPS conjugates. Polymyxin B was found to suppress mitogenicity of LPS and also to inhibit immunogenicity of the hapten conjugate 4-hydroxy-3,5-dinitrophenacetyl (NNP)-LPS. Inhibition was not due to interference with the expression of NNP determinants nor to cross-reactivity between PB and the hapten. Since mitogenicity and immunogenicity decreased in parallel, we conclude that B-cell activation in specific thymus independent responses does not take place in the absence of a nonspecific (non-Ig- mediated) signal. PMID:178823

A Theoretical Study of Cold Air Damming.

NASA Astrophysics Data System (ADS)

Xu, Qin

1990-12-01

The dynamics of cold air damming are examined analytically with a two-layer steady state model. The upper layer is a warm and saturated cross-mountain (easterly or southeasterly onshore) flow. The lower layer is a cold mountain-parallel (northerly) jet trapped on the windward (eastern) side of the mountain. The interface between the two layers represents a coastal front-a sloping inversion layer coupling the trapped cold dome with the warm onshore flow above through pressure continuity.An analytical expression is obtained for the inviscid upper-layer flow with hydrostatic and moist adiabatic approximations. Blackadar's PBL parameterization of eddy viscosity is used in the lower-layer equations. Solutions for the mountain-parallel jet and its associated secondary transverse circulation are obtained by expanding asymptotically upon a small parameter proportional to the square root of the inertial aspect ratio-the ratio between the mountain height and the radius of inertial oscillation. The geometric shape of the sloping interface is solved numerically from a differential-integral equation derived from the pressure continuity condition imposed at the interface.The observed flow structures and force balances of cold air damming events are produced qualitatively by the model. In the cold dome the mountain-parallel jet is controlled by the competition between the mountain-parallel pressure gradient and friction: the jet is stronger with smoother surfaces, higher mountains, and faster mountain-normal geostrophic winds. In the mountain-normal direction the vertically averaged force balance in the cold dome is nearly geostrophic and controls the geometric shape of the cold dome. The basic mountain-normal pressure gradient generated in the cold dome by the negative buoyancy distribution tends to flatten the sloping interface and expand the cold dome upstream against the mountain-normal pressure gradient (produced by the upper-layer onshore wind) and Coriolis force (induced by the lower-layer mountain-parallel jet). It is found that the interface slope increases and the cold dome shrinks as the Froude number and/or upstream mountain-parallel geostrophic wind increase, or as the Rossby number, upper-layer depth, and/or surface roughness length decrease, and vice versa. The cold dome will either vanish or not be in a steady state if the Froude number is large enough or the roughness length gets too small. The theoretical findings are explained physically based on detailed analyses of the force balance along the inversion interface.

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.

Holographic Associative Memory Employing Phase Conjugation

NASA Astrophysics Data System (ADS)

Soffer, B. H.; Marom, E.; Owechko, Y.; Dunning, G.

1986-12-01

The principle of information retrieval by association has been suggested as a basis for parallel computing and as the process by which human memory functions.1 Various associative processors have been proposed that use electronic or optical means. Optical schemes,2-7 in particular, those based on holographic principles,8'8' are well suited to associative processing because of their high parallelism and information throughput. Previous workers8 demonstrated that holographically stored images can be recalled by using relatively complicated reference images but did not utilize nonlinear feedback to reduce the large cross talk that results when multiple objects are stored and a partial or distorted input is used for retrieval. These earlier approaches were limited in their ability to reconstruct the output object faithfully from a partial input.

Partial fourier and parallel MR image reconstruction with integrated gradient nonlinearity correction.

PubMed

Tao, Shengzhen; Trzasko, Joshua D; Shu, Yunhong; Weavers, Paul T; Huston, John; Gray, Erin M; Bernstein, Matt A

2016-06-01

To describe how integrated gradient nonlinearity (GNL) correction can be used within noniterative partial Fourier (homodyne) and parallel (SENSE and GRAPPA) MR image reconstruction strategies, and demonstrate that performing GNL correction during, rather than after, these routines mitigates the image blurring and resolution loss caused by postreconstruction image domain based GNL correction. Starting from partial Fourier and parallel magnetic resonance imaging signal models that explicitly account for GNL, noniterative image reconstruction strategies for each accelerated acquisition technique are derived under the same core mathematical assumptions as their standard counterparts. A series of phantom and in vivo experiments on retrospectively undersampled data were performed to investigate the spatial resolution benefit of integrated GNL correction over conventional postreconstruction correction. Phantom and in vivo results demonstrate that the integrated GNL correction reduces the image blurring introduced by the conventional GNL correction, while still correcting GNL-induced coarse-scale geometrical distortion. Images generated from undersampled data using the proposed integrated GNL strategies offer superior depiction of fine image detail, for example, phantom resolution inserts and anatomical tissue boundaries. Noniterative partial Fourier and parallel imaging reconstruction methods with integrated GNL correction reduce the resolution loss that occurs during conventional postreconstruction GNL correction while preserving the computational efficiency of standard reconstruction techniques. Magn Reson Med 75:2534-2544, 2016. © 2015 Wiley Periodicals, Inc. © 2015 Wiley Periodicals, Inc.

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

Field gradients can control the alignment of nanorods.

PubMed

Ooi, Chinchun; Yellen, Benjamin B

2008-08-19

This work is motivated by the unexpected experimental observation that field gradients can control the alignment of nonmagnetic nanorods immersed inside magnetic fluids. In the presence of local field gradients, nanorods were observed to align perpendicular to the external field at low field strengths, but parallel to the external field at high field strengths. The switching behavior results from the competition between a preference to align with the external field (orientational potential energy) and preference to move into regions of minimum magnetic field (positional potential energy). A theoretical model is developed to explain this experimental behavior by investigating the statistics of nanorod alignment as a function of both the external uniform magnetic field strength and the local magnetic field variation above a periodic array of micromagnets. Computational phase diagrams are developed which indicate that the relative population of nanorods in parallel and perpendicular states can be adjusted through several control parameters. However, an energy barrier to rotation was discovered to influence the rate kinetics and restrict the utility of this assembly technique to nanorods which are slightly shorter than the micromagnet length. Experimental results concerning the orientation of nanorods inside magnetic fluid are also presented and shown to be in strong agreement with the theoretical work.

Gradients of microhabitat and crappie (Pomoxis spp.) distributions in reservoir coves

USGS Publications Warehouse

Kaczka, Levi J.; Miranda, Leandro E.

2013-01-01

Embayments are among the most widespread littoral habitats found in Mississippi flood-control reservoirs. These macrohabitats represent commonly used nursery zones for age-0 crappies, Pomoxis spp., despite barren and eroded shorelines formed over 60–70 years of annual water level fluctuations. We tested if embayments displayed microhabitat gradients linked to the effect of water level fluctuations on riparian vegetation and if these gradients were paralleled by gradients in age-0 crappie distribution. Habitat composition changed longitudinally along the embayments with the most pronounced gradient representing a shift from nonvegetated mudflats near the mouth of embayments to herbaceous material upstream. The degree of habitat change depended on the water level. Similarly, catch rates of crappies increased upstream toward the rear of embayments, differing among water levels and reservoirs, but the longitudinal pattern persisted. Our results indicate that habitat composition gradients occur in embayments of northwest Mississippi flood-control reservoirs and that these gradients may influence a similar gradient in age-0 crappie distribution. While the biotic interactions behind the gradients may be less clear, we speculate that water level is the main factor influencing the observed gradients in habitat composition and fish. Management to benefit age-0 crappies may involve habitat improvement along embayment shorelines and water level regimes that foster growth of herbaceous plants.

Focused terahertz waves generated by a phase velocity gradient in a parallel-plate waveguide.

PubMed

McKinney, Robert W; Monnai, Yasuaki; Mendis, Rajind; Mittleman, Daniel

2015-10-19

We demonstrate the focusing of a free-space THz beam emerging from a leaky parallel-plate waveguide (PPWG). Focusing is accomplished by grading the launch angle of the leaky wave using a PPWG with gradient plate separation. Inside the PPWG, the phase velocity of the guided TE1 mode exceeds the vacuum light speed, allowing the wave to leak into free space from a slit cut along the top plate. Since the leaky wave angle changes as the plate separation decreases, the beam divergence can be controlled by grading the plate separation along the propagation axis. We experimentally demonstrate focusing of the leaky wave at a selected location at frequencies of 100 GHz and 170 GHz, and compare our measurements with numerical simulations. The proposed concept can be valuable for implementing a flat and wide-aperture beam-former for THz communications systems.

Multi-water-bag models of ion temperature gradient instability in cylindrical geometry

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

Coulette, David; Besse, Nicolas

2013-05-15

Ion temperature gradient instabilities play a major role in the understanding of anomalous transport in core fusion plasmas. In the considered cylindrical geometry, ion dynamics is described using a drift-kinetic multi-water-bag model for the parallel velocity dependency of the ion distribution function. In a first stage, global linear stability analysis is performed. From the obtained normal modes, parametric dependencies of the main spectral characteristics of the instability are then examined. Comparison of the multi-water-bag results with a reference continuous Maxwellian case allows us to evaluate the effects of discrete parallel velocity sampling induced by the Multi-Water-Bag model. Differences between themore » global model and local models considered in previous works are discussed. Using results from linear, quasilinear, and nonlinear numerical simulations, an analysis of the first stage saturation dynamics of the instability is proposed, where the divergence between the three models is examined.« less

Turbopump Performance Improved by Evolutionary Algorithms

NASA Technical Reports Server (NTRS)

Oyama, Akira; Liou, Meng-Sing

2002-01-01

The development of design optimization technology for turbomachinery has been initiated using the multiobjective evolutionary algorithm under NASA's Intelligent Synthesis Environment and Revolutionary Aeropropulsion Concepts programs. As an alternative to the traditional gradient-based methods, evolutionary algorithms (EA's) are emergent design-optimization algorithms modeled after the mechanisms found in natural evolution. EA's search from multiple points, instead of moving from a single point. In addition, they require no derivatives or gradients of the objective function, leading to robustness and simplicity in coupling any evaluation codes. Parallel efficiency also becomes very high by using a simple master-slave concept for function evaluations, since such evaluations often consume the most CPU time, such as computational fluid dynamics. Application of EA's to multiobjective design problems is also straightforward because EA's maintain a population of design candidates in parallel. Because of these advantages, EA's are a unique and attractive approach to real-world design optimization problems.

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

NASA Technical Reports Server (NTRS)

Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

2005-01-01

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Evaluating the Gradient of the Thin Wire Kernel

NASA Technical Reports Server (NTRS)

Wilton, Donald R.; Champagne, Nathan J.

2008-01-01

Recently, a formulation for evaluating the thin wire kernel was developed that employed a change of variable to smooth the kernel integrand, canceling the singularity in the integrand. Hence, the typical expansion of the wire kernel in a series for use in the potential integrals is avoided. The new expression for the kernel is exact and may be used directly to determine the gradient of the wire kernel, which consists of components that are parallel and radial to the wire axis.

Management of Transjugular Intrahepatic Portosystemic Shunt (TIPS)-associated Refractory Hepatic Encephalopathy by Shunt Reduction Using the Parallel Technique: Outcomes of a Retrospective Case Series

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

Cookson, Daniel T., E-mail: danielthomascookson@yahoo.co.uk; Zaman, Zubayr; Gordon-Smith, James

2011-02-15

Purpose: To investigate the reproducibility and technical and clinical success of the parallel technique of transjugular intrahepatic portosystemic shunt (TIPS) reduction in the management of refractory hepatic encephalopathy (HE). Materials and Methods: A 10-mm-diameter self-expanding stent graft and a 5-6-mm-diameter balloon-expandable stent were placed in parallel inside the existing TIPS in 8 patients via a dual unilateral transjugular approach. Changes in portosystemic pressure gradient and HE grade were used as primary end points. Results: TIPS reduction was technically successful in all patients. Mean {+-} standard deviation portosystemic pressure gradient before and after shunt reduction was 4.9 {+-} 3.6 mmHg (range,more » 0-12 mmHg) and 10.5 {+-} 3.9 mmHg (range, 6-18 mmHg). Duration of follow-up was 137 {+-} 117.8 days (range, 18-326 days). Clinical improvement of HE occurred in 5 patients (62.5%) with resolution of HE in 4 patients (50%). Single episodes of recurrent gastrointestinal hemorrhage occurred in 3 patients (37.5%). These were self-limiting in 2 cases and successfully managed in 1 case by correction of coagulopathy and blood transfusion. Two of these patients (25%) died, one each of renal failure and hepatorenal failure. Conclusion: The parallel technique of TIPS reduction is reproducible and has a high technical success rate. A dual unilateral transjugular approach is advantageous when performing this procedure. The parallel technique allows repeat bidirectional TIPS adjustment and may be of significant clinical benefit in the management of refractory HE.« less

Edge gyrokinetic theory and continuum simulations

NASA Astrophysics Data System (ADS)

Xu, X. Q.; Xiong, Z.; Dorr, M. R.; Hittinger, J. A.; Bodi, K.; Candy, J.; Cohen, B. I.; Cohen, R. H.; Colella, P.; Kerbel, G. D.; Krasheninnikov, S.; Nevins, W. M.; Qin, H.; Rognlien, T. D.; Snyder, P. B.; Umansky, M. V.

2007-08-01

The following results are presented from the development and application of TEMPEST, a fully nonlinear (full-f) five-dimensional (3d2v) gyrokinetic continuum edge-plasma code. (1) As a test of the interaction of collisions and parallel streaming, TEMPEST is compared with published analytic and numerical results for endloss of particles confined by combined electrostatic and magnetic wells. Good agreement is found over a wide range of collisionality, confining potential and mirror ratio, and the required velocity space resolution is modest. (2) In a large-aspect-ratio circular geometry, excellent agreement is found for a neoclassical equilibrium with parallel ion flow in the banana regime with zero temperature gradient and radial electric field. (3) The four-dimensional (2d2v) version of the code produces the first self-consistent simulation results of collisionless damping of geodesic acoustic modes and zonal flow (Rosenbluth-Hinton residual) with Boltzmann electrons using a full-f code. The electric field is also found to agree with the standard neoclassical expression for steep density and ion temperature gradients in the plateau regime. In divertor geometry, it is found that the endloss of particles and energy induces parallel flow stronger than the core neoclassical predictions in the SOL.

Evidence for a Functional Hierarchy of Association Networks.

PubMed

Choi, Eun Young; Drayna, Garrett K; Badre, David

2018-05-01

Patient lesion and neuroimaging studies have identified a rostral-to-caudal functional gradient in the lateral frontal cortex (LFC) corresponding to higher-order (complex or abstract) to lower-order (simple or concrete) cognitive control. At the same time, monkey anatomical and human functional connectivity studies show that frontal regions are reciprocally connected with parietal and temporal regions, forming parallel and distributed association networks. Here, we investigated the link between the functional gradient of LFC regions observed during control tasks and the parallel, distributed organization of association networks. Whole-brain fMRI task activity corresponding to four orders of hierarchical control [Badre, D., & D'Esposito, M. Functional magnetic resonance imaging evidence for a hierarchical organization of the prefrontal cortex. Journal of Cognitive Neuroscience, 19, 2082-2099, 2007] was compared with a resting-state functional connectivity MRI estimate of cortical networks [Yeo, B. T., Krienen, F. M., Sepulcre, J., Sabuncu, M. R., Lashkari, D., Hollinshead, M., et al. The organization of the human cerebral cortex estimated by intrinsic functional connectivity. Journal of Neurophysiology, 106, 1125-1165, 2011]. Critically, at each order of control, activity in the LFC and parietal cortex overlapped onto a common association network that differed between orders. These results are consistent with a functional organization based on separable association networks that are recruited during hierarchical control. Furthermore, corticostriatal functional connectivity MRI showed that, consistent with their participation in functional networks, rostral-to-caudal LFC and caudal-to-rostral parietal regions had similar, order-specific corticostriatal connectivity that agreed with a striatal gating model of hierarchical rule use. Our results indicate that hierarchical cognitive control is subserved by parallel and distributed association networks, together forming multiple localized functional gradients in different parts of association cortex. As such, association networks, while connectionally organized in parallel, may be functionally organized in a hierarchy via dynamic interaction with the striatum.

SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

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

Yang, R; Fallone, B; Cross Cancer Institute, Edmonton, AB

Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. Themore » LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been formulated on GPU, resulting in two orders of magnitude speedup. Funding support from Natural Sciences and Engineering Research Council and Alberta Innovates Health Solutions. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).« less

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

PARAVT: Parallel Voronoi tessellation code

NASA Astrophysics Data System (ADS)

González, R. E.

2016-10-01

In this study, we present a new open source code for massive parallel computation of Voronoi tessellations (VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several serial Voronoi tessellation codes, however no open source and parallel implementations are available to handle the large number of particles/galaxies in current N-body simulations and sky surveys. Parallelization is implemented under MPI and VT using Qhull library. Domain decomposition takes into account consistent boundary computation between tasks, and includes periodic conditions. In addition, the code computes neighbors list, Voronoi density, Voronoi cell volume, density gradient for each particle, and densities on a regular grid. Code implementation and user guide are publicly available at https://github.com/regonzar/paravt.

The Spectral Web of stationary plasma equilibria. I. General theory

NASA Astrophysics Data System (ADS)

Goedbloed, J. P.

2018-03-01

A new approach to computing the complex spectrum of magnetohydrodynamic waves and instabilities of moving plasmas is presented. It is based on the concept of the Spectral Web, exploiting the self-adjointness of the generalized Frieman-Rotenberg force operator, G, and the Doppler-Coriolis gradient operator parallel to the velocity, U. The problem is solved with an open boundary, where the complementary energy Wcom represents the amount of energy to be delivered to or extracted from the system to maintain a harmonic time-dependence. The eigenvalues are connected by a system of curves in the complex ω-plane, the solution path and the conjugate path (where Wcom is real or imaginary) which together constitute the Spectral Web, having a characteristic geometry that has to be clarified yet, but that has a deep physical significance. It is obtained by straightforward contour plotting of the two paths. The complex eigenvalues, within a specified rectangle of the complex ω-plane, are found by fast, reliable, and accurate iterations. Real and complex oscillation theorems, replacing the familiar tool of counting nodes of eigenfunctions, provide an associated mechanism of mode tracking along the two paths. The Spectral Web method is generalized to toroidal systems and extended to include a resistive wall by accounting for the dissipation in such a wall. It is applied in an accompanying Paper II [J. P. Goedbloed, Phys. Plasmas 25, 032110 (2018).] to a multitude of the basic fundamental instabilities operating in cylindrical plasmas.

Decomposed direct matrix inversion for fast non-cartesian SENSE reconstructions.

PubMed

Qian, Yongxian; Zhang, Zhenghui; Wang, Yi; Boada, Fernando E

2006-08-01

A new k-space direct matrix inversion (DMI) method is proposed here to accelerate non-Cartesian SENSE reconstructions. In this method a global k-space matrix equation is established on basic MRI principles, and the inverse of the global encoding matrix is found from a set of local matrix equations by taking advantage of the small extension of k-space coil maps. The DMI algorithm's efficiency is achieved by reloading the precalculated global inverse when the coil maps and trajectories remain unchanged, such as in dynamic studies. Phantom and human subject experiments were performed on a 1.5T scanner with a standard four-channel phased-array cardiac coil. Interleaved spiral trajectories were used to collect fully sampled and undersampled 3D raw data. The equivalence of the global k-space matrix equation to its image-space version, was verified via conjugate gradient (CG) iterative algorithms on a 2x undersampled phantom and numerical-model data sets. When applied to the 2x undersampled phantom and human-subject raw data, the decomposed DMI method produced images with small errors (< or = 3.9%) relative to the reference images obtained from the fully-sampled data, at a rate of 2 s per slice (excluding 4 min for precalculating the global inverse at an image size of 256 x 256). The DMI method may be useful for noise evaluations in parallel coil designs, dynamic MRI, and 3D sodium MRI with fixed coils and trajectories. Copyright 2006 Wiley-Liss, Inc.

Condition number estimation of preconditioned matrices.

PubMed

Kushida, Noriyuki

2015-01-01

The present paper introduces a condition number estimation method for preconditioned matrices. The newly developed method provides reasonable results, while the conventional method which is based on the Lanczos connection gives meaningless results. The Lanczos connection based method provides the condition numbers of coefficient matrices of systems of linear equations with information obtained through the preconditioned conjugate gradient method. Estimating the condition number of preconditioned matrices is sometimes important when describing the effectiveness of new preconditionerers or selecting adequate preconditioners. Operating a preconditioner on a coefficient matrix is the simplest method of estimation. However, this is not possible for large-scale computing, especially if computation is performed on distributed memory parallel computers. This is because, the preconditioned matrices become dense, even if the original matrices are sparse. Although the Lanczos connection method can be used to calculate the condition number of preconditioned matrices, it is not considered to be applicable to large-scale problems because of its weakness with respect to numerical errors. Therefore, we have developed a robust and parallelizable method based on Hager's method. The feasibility studies are curried out for the diagonal scaling preconditioner and the SSOR preconditioner with a diagonal matrix, a tri-daigonal matrix and Pei's matrix. As a result, the Lanczos connection method contains around 10% error in the results even with a simple problem. On the other hand, the new method contains negligible errors. In addition, the newly developed method returns reasonable solutions when the Lanczos connection method fails with Pei's matrix, and matrices generated with the finite element method.

Evaluation of differences between dual salt-pH gradient elution and mono gradient elution using a thermodynamic model: Simultaneous separation of six monoclonal antibody charge and size variants on preparative-scale ion exchange chromatographic resin.

PubMed

Lee, Yi Feng; Jöhnck, Matthias; Frech, Christian

2018-02-21

The efficiencies of mono gradient elution and dual salt-pH gradient elution for separation of six mAb charge and size variants on a preparative-scale ion exchange chromatographic resin are compared in this study. Results showed that opposite dual salt-pH gradient elution with increasing pH gradient and simultaneously decreasing salt gradient is best suited for the separation of these mAb charge and size variants on Eshmuno ® CPX. Besides giving high binding capacity, this type of opposite dual salt-pH gradient also provides better resolved mAb variant peaks and lower conductivity in the elution pools compared to single pH or salt gradients. To have a mechanistic understanding of the differences in mAb variants retention behaviors of mono pH gradient, parallel dual salt-pH gradient, and opposite dual salt-pH gradient, a linear gradient elution model was used. After determining the model parameters using the linear gradient elution model, 2D plots were used to show the pH and salt dependencies of the reciprocals of distribution coefficient, equilibrium constant, and effective ionic capacity of the mAb variants in these gradient elution systems. Comparison of the 2D plots indicated that the advantage of opposite dual salt-pH gradient system with increasing pH gradient and simultaneously decreasing salt gradient is the noncontinuous increased acceleration of protein migration. Furthermore, the fitted model parameters can be used for the prediction and optimization of mAb variants separation in dual salt-pH gradient and step elution. © 2018 American Institute of Chemical Engineers Biotechnol. Prog., 2018. © 2018 American Institute of Chemical Engineers.

Spectral engineering in π-conjugated polymers with intramolecular donor-acceptor interactions.

PubMed

Beaujuge, Pierre M; Amb, Chad M; Reynolds, John R

2010-11-16

With the development of light-harvesting organic materials for solar cell applications and molecular systems with fine-tuned colors for nonemissive electrochromic devices (e.g., smart windows, e-papers), a number of technical challenges remain to be overcome. Over the years, the concept of "spectral engineering" (tailoring the complex interplay between molecular physics and the various optical phenomena occurring across the electromagnetic spectrum) has become increasingly relevant in the field of π-conjugated organic polymers. Within the spectral engineering toolbox, the "donor-acceptor" approach uses alternating electron-rich and electron-deficient moieties along a π-conjugated backbone. This approach has proved especially valuable in the synthesis of dual-band and broadly absorbing chromophores with useful photovoltaic and electrochromic properties. In this Account, we highlight and provide insight into a present controversy surrounding the origin of the dual band of absorption sometimes encountered in semiconducting polymers structured using the "donor-acceptor" approach. Based on empirical evidence, we provide some schematic representations to describe the possible mechanisms governing the evolution of the two-band spectral absorption observed on varying the relative composition of electron-rich and electron-deficient substituents along the π-conjugated backbone. In parallel, we draw attention to the choice of the method employed to estimate and compare the absorption coefficients of polymer chromophores exhibiting distinct repeat unit lengths, and containing various extents of solubilizing side-chains along their backbone. Finally, we discuss the common assumption that "donor-acceptor" systems should have systematically lower absorption coefficients than their "all-donor" counterparts. The proposed models point toward important theoretical parameters which could be further explored at the macromolecular level to help researchers take full advantage of the complex interactions taking place in π-conjugated polymers with intramolecular "donor-acceptor" characteristics.

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.

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

Sarman, Sten, E-mail: sarman@ownit.nu; Wang, Yong-Lei; Laaksonen, Aatto

The self-diffusion coefficients of nematic phases of various model systems consisting of regular convex calamitic and discotic ellipsoids and non-convex bodies such as bent-core molecules and soft ellipsoid strings have been obtained as functions of the shear rate in a shear flow. Then the self-diffusion coefficient is a second rank tensor with three different diagonal components and two off-diagonal components. These coefficients were found to be determined by a combination of two mechanisms, which previously have been found to govern the self-diffusion of shearing isotropic liquids, namely, (i) shear alignment enhancing the diffusion in the direction parallel to the streamlinesmore » and hindering the diffusion in the perpendicular directions and (ii) the distortion of the shell structure in the liquid whereby a molecule more readily can escape from a surrounding shell of nearest neighbors, so that the mobility increases in every direction. Thus, the diffusion parallel to the streamlines always increases with the shear rate since these mechanisms cooperate in this direction. In the perpendicular directions, these mechanisms counteract each other so that the behaviour becomes less regular. In the case of the nematic phases of the calamitic and discotic ellipsoids and of the bent core molecules, mechanism (ii) prevails so that the diffusion coefficients increase. However, the diffusion coefficients of the soft ellipsoid strings decrease in the direction of the velocity gradient because the broadsides of these molecules are oriented perpendicularly to this direction due the shear alignment (i). The cross coupling coefficient relating a gradient of tracer particles in the direction of the velocity gradient and their flow in the direction of the streamlines is negative and rather large, whereas the other coupling coefficient relating a gradient in the direction of the streamlines and a flow in the direction of the velocity gradient is very small.« less

Fast three-dimensional inner volume excitations using parallel transmission and optimized k-space trajectories.

PubMed

Davids, Mathias; Schad, Lothar R; Wald, Lawrence L; Guérin, Bastien

2016-10-01

To design short parallel transmission (pTx) pulses for excitation of arbitrary three-dimensional (3D) magnetization patterns. We propose a joint optimization of the pTx radiofrequency (RF) and gradient waveforms for excitation of arbitrary 3D magnetization patterns. Our optimization of the gradient waveforms is based on the parameterization of k-space trajectories (3D shells, stack-of-spirals, and cross) using a small number of shape parameters that are well-suited for optimization. The resulting trajectories are smooth and sample k-space efficiently with few turns while using the gradient system at maximum performance. Within each iteration of the k-space trajectory optimization, we solve a small tip angle least-squares RF pulse design problem. Our RF pulse optimization framework was evaluated both in Bloch simulations and experiments on a 7T scanner with eight transmit channels. Using an optimized 3D cross (shells) trajectory, we were able to excite a cube shape (brain shape) with 3.4% (6.2%) normalized root-mean-square error in less than 5 ms using eight pTx channels and a clinical gradient system (Gmax  = 40 mT/m, Smax  = 150 T/m/s). This compared with 4.7% (41.2%) error for the unoptimized 3D cross (shells) trajectory. Incorporation of B0 robustness in the pulse design significantly altered the k-space trajectory solutions. Our joint gradient and RF optimization approach yields excellent excitation of 3D cube and brain shapes in less than 5 ms, which can be used for reduced field of view imaging and fat suppression in spectroscopy by excitation of the brain only. Magn Reson Med 76:1170-1182, 2016. © 2015 Wiley Periodicals, Inc. © 2015 Wiley Periodicals, Inc.

Parallel Synthesis of photoluminescent π-conjugated polymers by polymer reactions of an organotitanium polymer with a titanacyclopentadiene unit.

PubMed

Matsumura, Yoshimasa; Fukuda, Katsura; Inagi, Shinsuke; Tomita, Ikuyoshi

2015-04-01

A regioregular organometallic polymer with titanacyclopentadiene unit, obtained by the reaction of a 2,7-diethynylfluorene derivative and a low-valent titanium complex, is subjected to the reaction with three kinds of electrophiles (i.e., sulfur monochloride, hydrochloric acid, and dichlorophenylphosphine) to give π-conjugated polymers possessing both fluorene and building blocks originated from the transformation of the titanacycles in the main chain. For example, a phosphole-containing polymer whose number-average molecular weight is estimated as 5000 is obtained in 50% yield. The obtained thiophene, butadiene, and phosphole-containing polymers exhibit efficient photoluminescence (PL) with emission colors of blue, green, and yellow, respectively. For example, the phosphole-containing polymer exhibits yellow PL with an emission maximum (Emax ) of 533 nm and a quantum yield (Φ) of 0.37. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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.

Deconvolution of astronomical images using SOR with adaptive relaxation.

PubMed

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

2011-07-04

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

Preconditioned conjugate-gradient methods for low-speed flow calculations

NASA Technical Reports Server (NTRS)

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

1993-01-01

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

Preconditioned Conjugate Gradient methods for low speed flow calculations

NASA Technical Reports Server (NTRS)

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

1993-01-01

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

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.

A novel approach for epipolar resampling of cross-track linear pushbroom imagery using orbital parameters model

NASA Astrophysics Data System (ADS)

Jannati, Mojtaba; Valadan Zoej, Mohammad Javad; Mokhtarzade, Mehdi

2018-03-01

This paper presents a novel approach to epipolar resampling of cross-track linear pushbroom imagery using orbital parameters model (OPM). The backbone of the proposed method relies on modification of attitude parameters of linear array stereo imagery in such a way to parallelize the approximate conjugate epipolar lines (ACELs) with the instantaneous base line (IBL) of the conjugate image points (CIPs). Afterward, a complementary rotation is applied in order to parallelize all the ACELs throughout the stereo imagery. The new estimated attitude parameters are evaluated based on the direction of the IBL and the ACELs. Due to the spatial and temporal variability of the IBL (respectively changes in column and row numbers of the CIPs) and nonparallel nature of the epipolar lines in the stereo linear images, some polynomials in the both column and row numbers of the CIPs are used to model new attitude parameters. As the instantaneous position of sensors remains fix, the digital elevation model (DEM) of the area of interest is not required in the resampling process. According to the experimental results obtained from two pairs of SPOT and RapidEye stereo imagery with a high elevation relief, the average absolute values of remained vertical parallaxes of CIPs in the normalized images were obtained 0.19 and 0.28 pixels respectively, which confirm the high accuracy and applicability of the proposed method.

Investigation of obstacle effect to improve conjugate heat transfer in backward facing step channel using fast simulation of incompressible flow

NASA Astrophysics Data System (ADS)

Nouri-Borujerdi, Ali; Moazezi, Arash

2018-01-01

The current study investigates the conjugate heat transfer characteristics for laminar flow in backward facing step channel. All of the channel walls are insulated except the lower thick wall under a constant temperature. The upper wall includes a insulated obstacle perpendicular to flow direction. The effect of obstacle height and location on the fluid flow and heat transfer are numerically explored for the Reynolds number in the range of 10 ≤ Re ≤ 300. Incompressible Navier-Stokes and thermal energy equations are solved simultaneously in fluid region by the upwind compact finite difference scheme based on flux-difference splitting in conjunction with artificial compressibility method. In the thick wall, the energy equation is obtained by Laplace equation. A multi-block approach is used to perform parallel computing to reduce the CPU time. Each block is modeled separately by sharing boundary conditions with neighbors. The developed program for modeling was written in FORTRAN language with OpenMP API. The obtained results showed that using of the multi-block parallel computing method is a simple robust scheme with high performance and high-order accurate. Moreover, the obtained results demonstrated that the increment of Reynolds number and obstacle height as well as decrement of horizontal distance between the obstacle and the step improve the heat transfer.

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.

Quantitative separation of the anisotropic magnetothermopower and planar Nernst effect by the rotation of an in-plane thermal gradient

NASA Astrophysics Data System (ADS)

Reimer, Oliver; Meier, Daniel; Bovender, Michel; Helmich, Lars; Dreessen, Jan-Oliver; Krieft, Jan; Shestakov, Anatoly S.; Back, Christian H.; Schmalhorst, Jan-Michael; Hütten, Andreas; Reiss, Günter; Kuschel, Timo

2017-01-01

A thermal gradient as the driving force for spin currents plays a key role in spin caloritronics. In this field the spin Seebeck effect (SSE) is of major interest and was investigated in terms of in-plane thermal gradients inducing perpendicular spin currents (transverse SSE) and out-of-plane thermal gradients generating parallel spin currents (longitudinal SSE). Up to now all spincaloric experiments employ a spatially fixed thermal gradient. Thus, anisotropic measurements with respect to well defined crystallographic directions were not possible. Here we introduce a new experiment that allows not only the in-plane rotation of the external magnetic field, but also the rotation of an in-plane thermal gradient controlled by optical temperature detection. As a consequence, the anisotropic magnetothermopower and the planar Nernst effect in a permalloy thin film can be measured simultaneously. Thus, the angular dependence of the magnetothermopower with respect to the magnetization direction reveals a phase shift, that allows the quantitative separation of the thermopower, the anisotropic magnetothermopower and the planar Nernst effect.

Confinement effects in premelting dynamics

NASA Astrophysics Data System (ADS)

Pramanik, Satyajit; Wettlaufer, John

2017-11-01

We examine the effects of confinement on the dynamics of premelted films driven by thermomolecular pressure gradients. Our approach is to modify a well-studied setting in which the thermomolecular pressure gradient is driven by a temperature gradient parallel to an interfacially premelted elastic wall. The modification treats the increase in viscosity associated with the thinning of films studied in a wide variety of materials using a power law and we examine the consequent evolution of the elastic wall. We treat (i) a range of interactions that are known to underlie interfacial premelting and (ii) a constant temperature gradient wherein the thermomolecular pressure gradient is a constant. The difference between the cases with and without the proximity effect arises in the volume flux of premelted liquid. The proximity effect increases the viscosity as the film thickness decreases thereby requiring the thermomolecular pressure driven flux to be accommodated at larger temperatures where the premelted film thickness is the largest. Implications for experiment and observations of frost heave are discussed.

Confinement effects in premelting dynamics

NASA Astrophysics Data System (ADS)

Pramanik, Satyajit; Wettlaufer, John S.

2017-11-01

We examine the effects of confinement on the dynamics of premelted films driven by thermomolecular pressure gradients. Our approach is to modify a well-studied setting in which the thermomolecular pressure gradient is driven by a temperature gradient parallel to an interfacially premelted elastic wall. The modification treats the increase in viscosity associated with the thinning of films, studied in a wide variety of materials, using a power law and we examine the consequent evolution of the confining elastic wall. We treat (1) a range of interactions that are known to underlie interfacial premelting and (2) a constant temperature gradient wherein the thermomolecular pressure gradient is a constant. The difference between the cases with and without the proximity effect arises in the volume flux of premelted liquid. The proximity effect increases the viscosity as the film thickness decreases thereby requiring the thermomolecular pressure driven flux to be accommodated at higher temperatures where the premelted film thickness is the largest. Implications for experiment and observations of frost heave are discussed.

Associative Memory In A Phase Conjugate Resonator Cavity Utilizing A Hologram

NASA Astrophysics Data System (ADS)

Owechko, Y.; Marom, E.; Soffer, B. H.; Dunning, G.

1987-01-01

The principle of information retrieval by association has been suggested as a basis for parallel computing and as the process by which human memory functions.1 Various associative processors have been proposed that use electronic or optical means. Optical schemes,2-7 in particular, those based on holographic principles,3,6,7 are well suited to associative processing because of their high parallelism and information throughput. Previous workers8 demonstrated that holographically stored images can be recalled by using relatively complicated reference images but did not utilize nonlinear feedback to reduce the large cross talk that results when multiple objects are stored and a partial or distorted input is used for retrieval. These earlier approaches were limited in their ability to reconstruct the output object faithfully from a partial input.

Unsteady boundary-layer injection

NASA Technical Reports Server (NTRS)

Telionis, D. P.; Jones, G. S.

1981-01-01

The boundary-layer equations for two-dimensional incompressible flow are integrated numerically for the flow over a flat plate and a Howarth body. Injection is introduced either impulsively or periodically along a narrow strip. Results indicate that injection perpendicular to the wall is transmitted instantly across the boundary layer and has little effect on the velocity profile parallel to the wall. The effect is a little more noticeable for flows with adverse pressure gradients. Injection parallel to the wall results in fuller velocity profiles. Parallel and oscillatory injection appears to influence the mean. The amplitude of oscillation decreases with distance from the injection strip but further downstream it increases again in a manner reminiscent of an unstable process.

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.

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.

Continental-scale patterns of canopy tree composition and function across Amazonia.

PubMed

ter Steege, Hans; Pitman, Nigel C A; Phillips, Oliver L; Chave, Jerome; Sabatier, Daniel; Duque, Alvaro; Molino, Jean-François; Prévost, Marie-Françoise; Spichiger, Rodolphe; Castellanos, Hernán; von Hildebrand, Patricio; Vásquez, Rodolfo

2006-09-28

The world's greatest terrestrial stores of biodiversity and carbon are found in the forests of northern South America, where large-scale biogeographic patterns and processes have recently begun to be described. Seven of the nine countries with territory in the Amazon basin and the Guiana shield have carried out large-scale forest inventories, but such massive data sets have been little exploited by tropical plant ecologists. Although forest inventories often lack the species-level identifications favoured by tropical plant ecologists, their consistency of measurement and vast spatial coverage make them ideally suited for numerical analyses at large scales, and a valuable resource to describe the still poorly understood spatial variation of biomass, diversity, community composition and forest functioning across the South American tropics. Here we show, by using the seven forest inventories complemented with trait and inventory data collected elsewhere, two dominant gradients in tree composition and function across the Amazon, one paralleling a major gradient in soil fertility and the other paralleling a gradient in dry season length. The data set also indicates that the dominance of Fabaceae in the Guiana shield is not necessarily the result of root adaptations to poor soils (nodulation or ectomycorrhizal associations) but perhaps also the result of their remarkably high seed mass there as a potential adaptation to low rates of disturbance.

Axisymmetric magnetorotational instability in ideal and viscous laboratory plasmas

NASA Astrophysics Data System (ADS)

Mikhailovskii, A. B.; Lominadze, J. G.; Churikov, A. P.; Erokhin, N. N.; Pustovitov, V. D.; Konovalov, S. V.

2008-10-01

The original analysis of the axisymmetric magnetorotational instability (MRI) by Velikhov (Sov. Phys. JETP 9, 995 (1959)) and Chandrasekhar (Proc. Nat. Acad. Sci. 46, 253 (1960)), applied to the ideally conducting magnetized medium in the laboratory conditions and restricted to the incompressible approximation, is extended by allowing for the compressibility. Thereby, two additional driving mechanisms of MRI are revealed in addition to the standard drive due to the negative medium rotation frequency gradient (the Velikhov effect). One is due to the squared medium pressure gradient and another is a combined effect of the pressure and density gradients. For laboratory applications, the expression for the MRI boundary with all the above driving mechanisms and the stabilizing magnetoacoustic effect is derived. The effects of parallel and perpendicular viscosities on the MRI in the laboratory plasma are investigated. It is shown that, for strong viscosity, there is a family of MRI driven for the same condition as the ideal one. It is also revealed that the presence of strong viscosity leads to additional family of instabilities called the viscosity-driven MRI. Then the parallel-viscositydriven MRI looks as an overstability (oscillatory instability) possessing both the growth rate and the real part of oscillation frequency, while the perpendicular-viscosity MRI is the aperiodical instability.