Experiments with conjugate gradient algorithms for homotopy curve tracking

Science.gov (United States)

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.

Block-conjugate-gradient method

International Nuclear Information System (INIS)

McCarthy, J.F.

1989-01-01

It is shown that by using the block-conjugate-gradient method several, say s, columns of the inverse Kogut-Susskind fermion matrix can be found simultaneously, in less time than it would take to run the standard conjugate-gradient algorithm s times. The method improves in efficiency relative to the standard conjugate-gradient algorithm as the fermion mass is decreased and as the value of the coupling is pushed to its limit before the finite-size effects become important. Thus it is potentially useful for measuring propagators in large lattice-gauge-theory calculations of the particle spectrum

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Science.gov (United States)

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

2015-01-01

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

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Directory of Open Access Journals (Sweden)

Gonglin Yuan

Full Text Available 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.

Approximate error conjugation gradient minimization methods

Science.gov (United States)

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.

Gadolinium burnable absorber optimization by the method of conjugate gradients

International Nuclear Information System (INIS)

Drumm, C.R.; Lee, J.C.

1987-01-01

The optimal axial distribution of gadolinium burnable poison in a pressurized water reactor is determined to yield an improved power distribution. The optimization scheme is based on Pontryagin's maximum principle, with the objective function accounting for a target power distribution. The conjugate gradients optimization method is used to solve the resulting Euler-Lagrange equations iteratively, efficiently handling the high degree of nonlinearity of the problem

Preconditioning the modified conjugate gradient method ...

African Journals Online (AJOL)

In this paper, the convergence analysis of the conventional conjugate Gradient method was reviewed. And the convergence analysis of the modified conjugate Gradient method was analysed with our extension on preconditioning the algorithm. Convergence of the algorithm is a function of the condition number of M-1A.

New generalized conjugate gradient methods for the non-quadratic model in unconstrained optimization

International Nuclear Information System (INIS)

Al-Bayati, A.

2001-01-01

This paper present two new conjugate gradient algorithms which use the non-quadratic model in unconstrained optimization. The first is a new generalized self-scaling variable metric algorithm based on the sloboda generalized conjugate gradient method which is invariant to a nonlinear scaling of a stricity convex quadratic function; the second is an interleaving between the generalized sloboda method and the first algorithm; all these algorithm use exact line searches. Numerical comparisons over twenty test functions show that the interleaving algorithm is best overall and requires only about half the function evaluations of the Sloboda method: interleaving algorithms are likely to be preferred when the dimensionality of the problem is increased. (author). 29 refs., 1 tab

Global Convergence of a Spectral Conjugate Gradient Method for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

Jinkui Liu

2012-01-01

Full Text Available A new nonlinear spectral conjugate descent method for solving unconstrained optimization problems is proposed on the basis of the CD method and the spectral conjugate gradient method. For any line search, the new method satisfies the sufficient descent condition gkTdk<−∥gk∥2. Moreover, we prove that the new method is globally convergent under the strong Wolfe line search. The numerical results show that the new method is more effective for the given test problems from the CUTE test problem library (Bongartz et al., 1995 in contrast to the famous CD method, FR method, and PRP method.

Conjugate gradient algorithms using multiple recursions

Energy Technology Data Exchange (ETDEWEB)

Barth, T.; Manteuffel, T.

1996-12-31

Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

JAC2D: A two-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method

International Nuclear Information System (INIS)

Biffle, J.H.; Blanford, M.L.

1994-05-01

JAC2D is a two-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equations. The method is implemented in a two-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. A four-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic/plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere

JAC3D -- A three-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method

International Nuclear Information System (INIS)

Biffle, J.H.

1993-02-01

JAC3D is a three-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equation. The method is implemented in a three-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. An eight-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic-plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere

Minimizing inner product data dependencies in conjugate gradient iteration

Science.gov (United States)

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

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

Science.gov (United States)

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)

Efficient conjugate gradient algorithms for computation of the manipulator forward dynamics

Science.gov (United States)

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.

Modified conjugate gradient method for diagonalizing large matrices.

Science.gov (United States)

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.

Parallel conjugate gradient algorithms for manipulator dynamic simulation

Science.gov (United States)

Fijany, Amir; Scheld, Robert E.

1989-01-01

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

Orderings for conjugate gradient preconditionings

Science.gov (United States)

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.

A constrained conjugate gradient algorithm for computed tomography

Energy Technology Data Exchange (ETDEWEB)

Azevedo, S.G.; Goodman, D.M. [Lawrence Livermore National Lab., CA (United States)

1994-11-15

Image reconstruction from projections of x-ray, gamma-ray, protons and other penetrating radiation is a well-known problem in a variety of fields, and is commonly referred to as computed tomography (CT). Various analytical and series expansion methods of reconstruction and been used in the past to provide three-dimensional (3D) views of some interior quantity. The difficulties of these approaches lie in the cases where (a) the number of views attainable is limited, (b) the Poisson (or other) uncertainties are significant, (c) quantifiable knowledge of the object is available, but not implementable, or (d) other limitations of the data exist. We have adapted a novel nonlinear optimization procedure developed at LLNL to address limited-data image reconstruction problems. The technique, known as nonlinear least squares with general constraints or constrained conjugate gradients (CCG), has been successfully applied to a number of signal and image processing problems, and is now of great interest to the image reconstruction community. Previous applications of this algorithm to deconvolution problems and x-ray diffraction images for crystallography have shown the great promise.

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

Science.gov (United States)

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.

Several Guaranteed Descent Conjugate Gradient Methods for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

San-Yang Liu

2014-01-01

Full Text Available This paper investigates a general form of guaranteed descent conjugate gradient methods which satisfies the descent condition gkTdk≤-1-1/4θkgk2  θk>1/4 and which is strongly convergent whenever the weak Wolfe line search is fulfilled. Moreover, we present several specific guaranteed descent conjugate gradient methods and give their numerical results for large-scale unconstrained optimization.

JAC3D -- A three-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method; Yucca Mountain Site Characterization Project

Energy Technology Data Exchange (ETDEWEB)

Biffle, J.H.

1993-02-01

JAC3D is a three-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equation. The method is implemented in a three-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. An eight-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic-plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere.

JAC2D: A two-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method; Yucca Mountain Site Characterization Project

Energy Technology Data Exchange (ETDEWEB)

Biffle, J.H.; Blanford, M.L.

1994-05-01

JAC2D is a two-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equations. The method is implemented in a two-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. A four-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic/plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere.

Comparison of preconditioned generalized conjugate gradient methods to two-dimensional neutron and photon transport equation

International Nuclear Information System (INIS)

Chen, G.S.

1997-01-01

We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used. TFQMR (transpose free quasi-minimal residual algorithm), CGS (conjuage gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These sub-routines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. (author)

Non-linear extension of FFT-based methods accelerated by conjugate gradients to evaluate the mechanical behavior of composite materials

International Nuclear Information System (INIS)

Gelebart, Lionel; Mondon-Cancel, Romain

2013-01-01

FFT-based methods are used to solve the problem of a heterogeneous unit-cell submitted to periodic boundary conditions, which is of a great interest in the context of numerical homogenization. Recently (in 2010), Brisard and Zeman proposed simultaneously to use Conjugate Gradient based solvers in order to improve the convergence properties (when compared to the basic scheme, proposed initially in 1994). The purpose of the paper is to extend this idea to the case of non-linear behaviors. The proposed method is based on a Newton-Raphson algorithm and can be applied to various kinds of behaviors (time dependant or independent, with or without internal variables) through a conventional integration procedure as used in finite element codes. It must be pointed out that this approach is fundamentally different from the traditional FFT-based approaches which rely on a fixed-point algorithm (e.g. basic scheme, Eyre and Milton accelerated scheme, Augmented Lagrangian scheme, etc.). The method is compared to the basic scheme on the basis of a simple application (a linear elastic spherical inclusion within a non-linear elastic matrix): a low sensitivity to the reference material and an improved efficiency, for a soft or a stiff inclusion, are observed. At first proposed for a prescribed macroscopic strain, the method is then extended to mixed loadings. (authors)

Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

International Nuclear Information System (INIS)

Bonnet, M.; Meurant, G.

1978-01-01

Different methods of solution of linear and nonlinear algebraic systems are applied to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems, methods in general use of alternating directions type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method on nonlinear conjugate gradient is studied as also Newton's method and some of its variants. It should be noted, however that Newton's method is found to be more efficient when coupled with a good method for solution of the linear system. To conclude, such methods are used to solve a nonlinear diffusion problem and the numerical results obtained are to be compared [fr

Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

International Nuclear Information System (INIS)

Bonnet, M.; Meurant, G.

1978-01-01

The object of this study is to compare different methods of solving linear and nonlinear algebraic systems and to apply them to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems the conventional methods of alternating direction type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method of nonlinear conjugate gradient is studied together with Newton's method and some of its variants. It should be noted, however, that Newton's method is found to be more efficient when coupled with a good method for solving the linear system. As a conclusion, these methods are used to solve a nonlinear diffusion problem and the numerical results obtained are compared [fr

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

Science.gov (United States)

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

MODIFIED ARMIJO RULE ON GRADIENT DESCENT AND CONJUGATE GRADIENT

Directory of Open Access Journals (Sweden)

ZURAIDAH FITRIAH

2017-10-01

Full Text Available Armijo rule is an inexact line search method to determine step size in some descent method to solve unconstrained local optimization. Modified Armijo was introduced to increase the numerical performance of several descent algorithms that applying this method. The basic difference of Armijo and its modified are in existence of a parameter and estimating the parameter that is updated in every iteration. This article is comparing numerical solution and time of computation of gradient descent and conjugate gradient hybrid Gilbert-Nocedal (CGHGN that applying modified Armijo rule. From program implementation in Matlab 6, it's known that gradient descent was applying modified Armijo more effectively than CGHGN from one side: iteration needed to reach some norm of the gradient  (input by the user. The amount of iteration was representing how long the step size of each algorithm in each iteration. In another side, time of computation has the same conclusion.

Nonlinear piezoelectricity in PZT ceramics for generating ultrasonic phase conjugate waves

Science.gov (United States)

Yamamoto; Kokubo; Sakai; Takagi

2000-03-01

We have succeeded in the generation of acoustic phase conjugate waves with nonlinear PZT piezoelectric ceramics and applied them to ultrasonic imaging systems. Our aim is to make a phase conjugator with 100% efficiency. For this purpose, it is important to clarify the mechanism of acoustic phase conjugation through nonlinear piezoelectricity. The process is explained by the parametric interaction via the third-order nonlinear piezoelectricity between the incident acoustic wave at angular frequency omega and the pump electric field at 2 omega. We solved the coupling equations including the third-ordered nonlinear piezoelectricity and theoretically derived the amplitude efficiency of the acoustic phase conjugation. We compared the efficiencies between the theoretical and experimental values for PZT ceramics with eight different compositions. Pb[(Zn1/3Nb2/3)(1 - x)Tix]O3 (X = 0.09, PZNT91/9) piezoelectric single crystals have been investigated for high-performance ultrasonic transducer application, because these have large piezoelectric constants, high electrical-mechanical coupling factors and high dielectric constants. We found that they have third-order nonlinear piezoelectric constants much larger than PZT and are hopeful that the material as a phase conjugator has over 100% efficiency.

Comparison of genetic algorithms with conjugate gradient methods

Science.gov (United States)

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.

Adaptive Regularization of Neural Networks Using Conjugate Gradient

DEFF Research Database (Denmark)

Goutte, Cyril; Larsen, Jan

1998-01-01

Andersen et al. (1997) and Larsen et al. (1996, 1997) suggested a regularization scheme which iteratively adapts regularization parameters by minimizing validation error using simple gradient descent. In this contribution we present an improved algorithm based on the conjugate gradient technique........ Numerical experiments with feedforward neural networks successfully demonstrate improved generalization ability and lower computational cost...

Conjugate Gradient Algorithms For Manipulator Simulation

Science.gov (United States)

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.

The multigrid preconditioned conjugate gradient method

Science.gov (United States)

Tatebe, Osamu

1993-01-01

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

Fourier domain preconditioned conjugate gradient algorithm for atmospheric tomography.

Science.gov (United States)

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.

Application of preconditioned conjugate gradient-like methods to reactor kinetics

International Nuclear Information System (INIS)

Yang, D.Y.; Chen, G.S.; Chou, H.P.

1993-01-01

Several conjugate gradient-like (CG-like) methods are applied to solve the nonsymmetric linear systems of equations derived from the time-dependent two-dimensional two-energy-group neutron diffusion equations by a finite difference approximation. The methods are: the generalized conjugate residual method; the generalized conjugate gradient least-square method; the generalized minimal residual method (GMRES); the conjugate gradient square method; and a variant of bi-conjugate gradient method (Bi-CGSTAB). In order to accelerate these methods, six preconditioning techniques are investigated. Two are based on pointwise incomplete factorization: the incomplete LU (ILU) and the modified incomplete LU (MILU) decompositions; two, based on the block tridiagonal structure of the coefficient matrix, are blockwise and modified blockwise incomplete factorizations, BILU and MBILU; two are the alternating-direction implicit and symmetric successive overrelaxation (SSOR) preconditioners, derived from the basic iterative schemes. Comparisons are made by using CG-like methods combined with different preconditioners to solve a sequence of time-step reactor transient problems. Numerical tests indicate that preconditioned BI-CGSTAB with the preconditioner MBILU requires less CPU time and fewer iterations than other methods. The preconditioned CG-like methods are less sensitive to the time-step size used than the Chebyshev semi-iteration method and line SOR method. The indication is that the CGS, Bi-CGSTAB and GMRES methods are, on average, better than the other methods in reactor kinetics computation and that a good preconditioner is more important than the choice of CG-like methods. The MILU decomposition based on the conventional row-sum criterion has difficulty yielding a convergent solution and an improved version is introduced. (author)

A Scanning Hologram Recorded by Phase Conjugate Property of Nonlinear Crystals

DEFF Research Database (Denmark)

Zi-Liang, Ping; Dalsgaard, Erik

1996-01-01

A methode of recording a scanning hologram with phase conjugate property of nonlinear crystal is provided. The principle of recording, setup and experiments are given.......A methode of recording a scanning hologram with phase conjugate property of nonlinear crystal is provided. The principle of recording, setup and experiments are given....

Conjugate Gradient like methods and their application to fixed source neutron diffusion problems

International Nuclear Information System (INIS)

Suetomi, Eiichi; Sekimoto, Hiroshi

1989-01-01

This paper presents a number of fast iterative methods for solving systems of linear equations appearing in fixed source problems for neutron diffusion. We employed the conjugate gradient and conjugate residual methods. In order to accelerate the conjugate residual method, we proposed the conjugate residual squared method by transforming the residual polynomial of the conjugate residual method. Since the convergence of these methods depends on the spectrum of coefficient matrix, we employed the incomplete Choleski (IC) factorization and the modified IC (MIC) factorization as preconditioners. These methods were applied to some neutron diffusion problems and compared with the successive overrelaxation (SOR) method. The results of these numerical experiments showed superior convergence characteristics of the conjugate gradient like method with MIC factorization to the SOR method, especially for a problem involving void region. The CPU time of the MICCG, MICCR and MICCRS methods showed no great difference. In order to vectorize the conjugate gradient like methods based on (M)IC factorization, the hyperplane method was used and implemented on the vector computers, the HITAC S-820/80 and ETA10-E (one processor mode). Significant decrease of the CPU times was observed on the S-820/80. Since the scaled conjugate gradient (SCG) method can be vectorized with no manipulation, it was also compared with the above methods. It turned out the SCG method was the fastest with respect to the CPU times on the ETA10-E. These results suggest that one should implement suitable algorithm for different vector computers. (author)

Comparison of preconditioned generalized conjugate gradient methods to two-dimensional neutron and photon transport equation

International Nuclear Information System (INIS)

Chen, G.S.; Yang, D.Y.

1998-01-01

We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used: TFQMR (transpose free quasi-minimal residual algorithm) CGS (conjugate gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These subroutines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. The reasons to choose the generalized conjugate gradient methods are that the methods have better residual (equivalent to error) control procedures in the computation and have better convergent rate. The pointwise incomplete LU factorization ILU, modified pointwise incomplete LU factorization MILU, block incomplete factorization BILU and modified blockwise incomplete LU factorization MBILU are the preconditioning techniques used in the several testing problems. In Bi-CGSTAB, CGS, TFQMR and QMRCGSTAB method, we find that either CGS or Bi-CGSTAB method combined with preconditioner MBILU is the most efficient algorithm in these methods in the several testing problems. The numerical solution of flux by preconditioned CGS and Bi-CGSTAB methods has the same result as those from Cray computer, obtained by either the point successive relaxation method or the line successive relaxation method combined with Gaussian elimination

Error Estimation in Preconditioned Conjugate Gradients

Czech Academy of Sciences Publication Activity Database

Strakoš, Zdeněk; Tichý, Petr

2005-01-01

Roč. 45, - (2005), s. 789-817 ISSN 0006-3835 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB1030306 Institutional research plan: CEZ:AV0Z10300504 Keywords : preconditioned conjugate gradient method * error bounds * stopping criteria * evaluation of convergence * numerical stability * finite precision arithmetic * rounding errors Subject RIV: BA - General Mathematics Impact factor: 0.509, year: 2005

M-step preconditioned conjugate gradient methods

Science.gov (United States)

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.

A feasible DY conjugate gradient method for linear equality constraints

Science.gov (United States)

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.

A Spectral Conjugate Gradient Method for Unconstrained Optimization

International Nuclear Information System (INIS)

Birgin, E. G.; Martinez, J. M.

2001-01-01

A family of scaled conjugate gradient algorithms for large-scale unconstrained minimization is defined. The Perry, the Polak-Ribiere and the Fletcher-Reeves formulae are compared using a spectral scaling derived from Raydan's spectral gradient optimization method. The best combination of formula, scaling and initial choice of step-length is compared against well known algorithms using a classical set of problems. An additional comparison involving an ill-conditioned estimation problem in Optics is presented

Problem of unstable pivots in the incomplete LU-conjugate gradient method

International Nuclear Information System (INIS)

Kershaw, D.S.

1978-01-01

Incomplete LU and incomplete-Cholesky conjugate gradient methods are becoming widely used in both laser and magnetic fusion research. In my original presentation of these methods, the problem of what to do if a pivot [L/sub ii/U/sub ii/) becomes very small or zero was raised and only partially answered by the suggestion that it be arbitrarily set to some non-zero value. In what follows it will be shown precisely how small the pivot can become before it must be fixed and precisely what value it should be set to in order to minimize the error in LU. Numerical examples will be given to show that not only does this prescription improve incomplete LU-conjugate gradient methods , but exact LU decomposition carried out with this prescription for handling small pivots and followed by a few linear or conjugate gradient iterations can be much faster than the permutations of rows and columns usually employed to circumvent small pivot problems

Ultrasonic wave propagation through aberrating layers: experimental verification of the conjugate gradient Rayleigh method

NARCIS (Netherlands)

Ledoux, L.A.F.; Berkhoff, Arthur P.; Thijssen, J.M.

The Conjugate Gradient Rayleigh method for the calculation of acoustic reflection and transmission at a rough interface between two media was experimentally verified. The method is based on a continuous version of the conjugate gradient technique and plane-wave expansions. We measured the beam

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

Science.gov (United States)

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.

Conjugate-Gradient Algorithms For Dynamics Of Manipulators

Science.gov (United States)

Fijany, Amir; Scheid, Robert E.

1993-01-01

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

Conjugate gradient heat bath for ill-conditioned actions.

Science.gov (United States)

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.

PRECONDITIONED BI-CONJUGATE GRADIENT METHOD FOR RADIATIVE TRANSFER IN SPHERICAL MEDIA

International Nuclear Information System (INIS)

Anusha, L. S.; Nagendra, K. N.; Paletou, F.; Leger, L.

2009-01-01

A robust numerical method called the Preconditioned Bi-Conjugate Gradient (Pre-BiCG) method is proposed for the solution of the radiative transfer equation in spherical geometry. A variant of this method called Stabilized Preconditioned Bi-Conjugate Gradient (Pre-BiCG-STAB) is also presented. These are iterative methods based on the construction of a set of bi-orthogonal vectors. The application of the Pre-BiCG method in some benchmark tests shows that the method is quite versatile, and can handle difficult problems that may arise in astrophysical radiative transfer theory.

Necessary and sufficient conditions for the existence of a conjugate gradient method

International Nuclear Information System (INIS)

Faber, V.; Manteuffel, T.

1984-01-01

The authors characterize the class CG(s) of matrices A for which the linear system Ax = b can be solved by an s-term conjugate gradient method. The authors show that, except for a few anomalies, the class CG(s) consists of matrices A for which conjugate gradient methods are already known. These matrices are the Hermitian matrices, A* = A, and the matrices of the form A = e/sup i theta/(dI + B), with B* = -B. 7 references

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

Science.gov (United States)

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.

Nonlinear propagation of phase-conjugate focused sound beams in water

Science.gov (United States)

Brysev, A. P.; Krutyansky, L. M.; Preobrazhensky, V. L.; Pyl'nov, Yu. V.; Cunningham, K. B.; Hamilton, M. F.

2000-07-01

Nonlinear propagation of phase-conjugate, focused, ultrasound beams is studied. Measurements are presented of harmonic amplitudes along the axis and in the focal plane of the conjugate beam, and of the waveform and spectrum at the focus. A maximum peak pressure of 3.9 MPa was recorded in the conjugate beam. The measurements are compared with simulations based on the KZK equation, and satisfactory agreement is obtained.

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

Science.gov (United States)

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.

Moving force identification based on modified preconditioned conjugate gradient method

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Total variation superiorized conjugate gradient method for image reconstruction

Science.gov (United States)

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.

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

Science.gov (United States)

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

A complete implementation of the conjugate gradient algorithm on a reconfigurable supercomputer

International Nuclear Information System (INIS)

Dubois, David H.; Dubois, Andrew J.; Connor, Carolyn M.; Boorman, Thomas M.; Poole, Stephen W.

2008-01-01

The conjugate gradient is a prominent iterative method for solving systems of sparse linear equations. Large-scale scientific applications often utilize a conjugate gradient solver at their computational core. In this paper we present a field programmable gate array (FPGA) based implementation of a double precision, non-preconditioned, conjugate gradient solver for fmite-element or finite-difference methods. OUf work utilizes the SRC Computers, Inc. MAPStation hardware platform along with the 'Carte' software programming environment to ease the programming workload when working with the hybrid (CPUIFPGA) environment. The implementation is designed to handle large sparse matrices of up to order N x N where N <= 116,394, with up to 7 non-zero, 64-bit elements per sparse row. This implementation utilizes an optimized sparse matrix-vector multiply operation which is critical for obtaining high performance. Direct parallel implementations of loop unrolling and loop fusion are utilized to extract performance from the various vector/matrix operations. Rather than utilize the FPGA devices as function off-load accelerators, our implementation uses the FPGAs to implement the core conjugate gradient algorithm. Measured run-time performance data is presented comparing the FPGA implementation to a software-only version showing that the FPGA can outperform processors running up to 30x the clock rate. In conclusion we take a look at the new SRC-7 system and estimate the performance of this algorithm on that architecture.

HIRFL-SSC trim coil currents calculation by conjugate gradients method

International Nuclear Information System (INIS)

Liu, W.

2005-01-01

For accelerating different kinds of ions to various energies, the HIRFL-SSC should form the corresponding isochronous magnetic field by its main coil and trim coils. Previously, there were errors in fitting the theoretical isochronous magnetic field in the small radius region, which led to some operation difficulties for ion acceleration in the inject region. After further investigation of the restrictive condition of the maximum current limitation, the trim coil currents for fitting the theoretical isochronous magnetic field were recalculated by the conjugate gradients method. Better results were obtained in the operation of HIRFL-SSC. This article introduces the procedure to calculate the trim coil currents. The calculation method of conjugate gradients is introduced and the fitting error is analysed. (author)

Application of conjugate gradient method to Commix-1B three-dimensional momentum equation

International Nuclear Information System (INIS)

King, J.B.; Domanus, H.

1987-01-01

Conjugate gradient method which is a special case of the variational method was implemented in the momentum section of the COMMIX-1B thermal hydraulics code. The comparisons between this method and the conventional iterative method of Successive Over Relation (S.O.R.) were made. Using COMMIX-1B, three steady state problems were analyzed. These problems were flow distribution in a scaled model of the Clinch River Fast Breeder Reactor outlet plenum, flow of coolant in the cold leg and downcomer of a PWR and isothermal air flow through a partially blocked pipe. It was found that if the conjugate gradient method is used, the execution time required to solve the resulting COMMIX-1B system of equations can be reduced by a factor of about 2 for the first two problems. For the isothermal air flow problem, the conjugate gradient method did not improve the execution time

Accurate conjugate gradient methods for families of shifted systems

NARCIS (Netherlands)

Eshof, J. van den; Sleijpen, G.L.G.

We present an efficient and accurate variant of the conjugate gradient method for solving families of shifted systems. In particular we are interested in shifted systems that occur in Tikhonov regularization for inverse problems since these problems can be sensitive to roundoff errors. The

Implementing the conjugate gradient algorithm on multi-core systems

NARCIS (Netherlands)

Wiggers, W.A.; Bakker, Vincent; Kokkeler, Andre B.J.; Smit, Gerardus Johannes Maria; Nurmi, J.; Takala, J.; Vainio, O.

2007-01-01

In linear solvers, like the conjugate gradient algorithm, sparse-matrix vector multiplication is an important kernel. Due to the sparseness of the matrices, the solver runs relatively slow. For digital optical tomography (DOT), a large set of linear equations have to be solved which currently takes

Use of a preconditioned Bi-conjugate gradient method for hybrid plasma stability analysis

International Nuclear Information System (INIS)

Mikic, Z.; Morse, E.C.

1985-01-01

The numerical stability analysis of compact toroidal plasmas using implicit time differencing requires the solution of a set of coupled, 2-dimensional, elliptic partial differential equations for the field quantities at every timestep. When the equations are spatially finite-differenced and written in matrix form, the resulting matrix is large, sparse, complex, non-Hermitian, and indefinite. The use of the preconditioned bi-conjugate gradient method for solving these equations is discussed. The effect of block-diagonal preconditioning and incomplete block-LU preconditionig on the convergence of the method is investigated. For typical matrices arising in our studies, the eigenvalue spectra of the original and preconditioned matrices are calculated as an illustration of the effectiveness of the preconditioning. We show that the preconditioned bi-conjugate gradient method coverages more rapidly than the conjugate gradient method applied to the normal equations, and that it is an effective iterative method for the class of non-Hermitian, indefinite problems of interest

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

Science.gov (United States)

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.

Conjugate gradient optimization programs for shuttle reentry

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Efficient two-level preconditionined conjugate gradient method on the GPU

NARCIS (Netherlands)

Gupta, R.; Van Gijzen, M.B.; Vuik, K.

2011-01-01

We present an implementation of Two-Level Preconditioned Conjugate Gradient Method for the GPU. We investigate a Truncated Neumann Series based preconditioner in combination with deflation and compare it with Block Incomplete Cholesky schemes. This combination exhibits fine-grain parallelism and

PET regularization by envelope guided conjugate gradients

International Nuclear Information System (INIS)

Kaufman, L.; Neumaier, A.

1996-01-01

The authors propose a new way to iteratively solve large scale ill-posed problems and in particular the image reconstruction problem in positron emission tomography by exploiting the relation between Tikhonov regularization and multiobjective optimization to obtain iteratively approximations to the Tikhonov L-curve and its corner. Monitoring the change of the approximate L-curves allows us to adjust the regularization parameter adaptively during a preconditioned conjugate gradient iteration, so that the desired solution can be reconstructed with a small number of iterations

Solving large mixed linear models using preconditioned conjugate gradient iteration.

Science.gov (United States)

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.

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

Science.gov (United States)

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

1993-01-01

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Deflation in preconditioned conjugate gradient methods for Finite Element Problems

NARCIS (Netherlands)

Vermolen, F.J.; Vuik, C.; Segal, A.

2002-01-01

We investigate the influence of the value of deflation vectors at interfaces on the rate of convergence of preconditioned conjugate gradient methods applied to a Finite Element discretization for an elliptic equation. Our set-up is a Poisson problem in two dimensions with continuous or discontinuous

The Lanczos and Conjugate Gradient Algorithms in Finite Precision Arithmetic

Czech Academy of Sciences Publication Activity Database

Meurant, G.; Strakoš, Zdeněk

2006-01-01

Roč. 15, - (2006), s. 471-542 ISSN 0962-4929 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : Lanczos method * conjugate gradient method * finite precision arithmetic * numerical stability * iterative methods Subject RIV: BA - General Mathematics

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

Science.gov (United States)

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.

Quasistatic nonlinear viscoelasticity and gradient flows

OpenAIRE

Ball, John M.; Şengül, Yasemin

2014-01-01

We consider the equation of motion for one-dimensional nonlinear viscoelasticity of strain-rate type under the assumption that the stored-energy function is λ-convex, which allows for solid phase transformations. We formulate this problem as a gradient flow, leading to existence and uniqueness of solutions. By approximating general initial data by those in which the deformation gradient takes only finitely many values, we show that under suitable hypotheses on the stored-energy function the d...

A partitioned conjugate gradient algorithm for lattice Green functions

International Nuclear Information System (INIS)

Bowler, K.C.; Kenway, R.D.; Pawley, G.S.; Wallace, D.J.

1984-01-01

Partitioning reduces by one the dimensionality of the lattice on which a propagator need be calculated using, for example, the conjugate gradient algorithm. Thus the quark propagator in lattice QCD may be determined by a computation on a single spatial hyperplane. For free fermions on a 16 3 x N lattice 2N-bit accuracy in the propagator is required to avoid rounding errors. (orig.)

Approximate Solution of Nonlinear Klein-Gordon Equation Using Sobolev Gradients

Directory of Open Access Journals (Sweden)

Nauman Raza

2016-01-01

Full Text Available The nonlinear Klein-Gordon equation (KGE models many nonlinear phenomena. In this paper, we propose a scheme for numerical approximation of solutions of the one-dimensional nonlinear KGE. A common approach to find a solution of a nonlinear system is to first linearize the equations by successive substitution or the Newton iteration method and then solve a linear least squares problem. Here, we show that it can be advantageous to form a sum of squared residuals of the nonlinear problem and then find a zero of the gradient. Our scheme is based on the Sobolev gradient method for solving a nonlinear least square problem directly. The numerical results are compared with Lattice Boltzmann Method (LBM. The L2, L∞, and Root-Mean-Square (RMS values indicate better accuracy of the proposed method with less computational effort.

Accurate reanalysis of structures by a preconditioned conjugate gradient method

Czech Academy of Sciences Publication Activity Database

Kirsch, U.; Kočvara, Michal; Zowe, J.

2002-01-01

Roč. 55, č. 2 (2002), s. 233-251 ISSN 0029-5981 R&D Projects: GA AV ČR IAA1075005 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : preconditioned conjugate gradient s * structural reanalysis Subject RIV: BA - General Mathematics Impact factor: 1.468, year: 2002

MILC staggered conjugate gradient performance on Intel KNL

OpenAIRE

DeTar, Carleton; Doerfler, Douglas; Gottlieb, Steven; Jha, Ashish; Kalamkar, Dhiraj; Li, Ruizi; Toussaint, Doug

2016-01-01

We review our work done to optimize the staggered conjugate gradient (CG) algorithm in the MILC code for use with the Intel Knights Landing (KNL) architecture. KNL is the second gener- ation Intel Xeon Phi processor. It is capable of massive thread parallelism, data parallelism, and high on-board memory bandwidth and is being adopted in supercomputing centers for scientific research. The CG solver consumes the majority of time in production running, so we have spent most of our effort on it. ...

Computing several eigenpairs of Hermitian problems by conjugate gradient iterations

International Nuclear Information System (INIS)

Ovtchinnikov, E.E.

2008-01-01

The paper is concerned with algorithms for computing several extreme eigenpairs of Hermitian problems based on the conjugate gradient method. We analyse computational strategies employed by various algorithms of this kind reported in the literature and identify their limitations. Our criticism is illustrated by numerical tests on a set of problems from electronic structure calculations and acoustics

An M-step preconditioned conjugate gradient method for parallel computation

Science.gov (United States)

Adams, L.

1983-01-01

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

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

Science.gov (United States)

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.

Nonlinear System Identification Using Neural Networks Trained with Natural Gradient Descent

Directory of Open Access Journals (Sweden)

Ibnkahla Mohamed

2003-01-01

Full Text Available We use natural gradient (NG learning neural networks (NNs for modeling and identifying nonlinear systems with memory. The nonlinear system is comprised of a discrete-time linear filter followed by a zero-memory nonlinearity . The NN model is composed of a linear adaptive filter followed by a two-layer memoryless nonlinear NN. A Kalman filter-based technique and a search-and-converge method have been employed for the NG algorithm. It is shown that the NG descent learning significantly outperforms the ordinary gradient descent and the Levenberg-Marquardt (LM procedure in terms of convergence speed and mean squared error (MSE performance.

Two-level preconditioned conjugate gradient methods with applications to bubbly flow problems

NARCIS (Netherlands)

Tang, J.M.

2008-01-01

The Preconditioned Conjugate Gradient (PCG) method is one of the most popular iterative methods for solving large linear systems with a symmetric and positive semi-definite coefficient matrix. However, if the preconditioned coefficient matrix is ill-conditioned, the convergence of the PCG method

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

Science.gov (United States)

Ghosh, A

1988-08-01

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

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

Science.gov (United States)

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

Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems

Directory of Open Access Journals (Sweden)

Zhifeng Dai

2014-01-01

Full Text Available Combining the Rosen gradient projection method with the two-term Polak-Ribière-Polyak (PRP conjugate gradient method, we propose a two-term Polak-Ribière-Polyak (PRP conjugate gradient projection method for solving linear equality constraints optimization problems. The proposed method possesses some attractive properties: (1 search direction generated by the proposed method is a feasible descent direction; consequently the generated iterates are feasible points; (2 the sequences of function are decreasing. Under some mild conditions, we show that it is globally convergent with Armijio-type line search. Preliminary numerical results show that the proposed method is promising.

Practical estimate of gradient nonlinearity for implementation of apparent diffusion coefficient bias correction.

Science.gov (United States)

Malkyarenko, Dariya I; Chenevert, Thomas L

2014-12-01

To describe an efficient procedure to empirically characterize gradient nonlinearity and correct for the corresponding apparent diffusion coefficient (ADC) bias on a clinical magnetic resonance imaging (MRI) scanner. Spatial nonlinearity scalars for individual gradient coils along superior and right directions were estimated via diffusion measurements of an isotropicic e-water phantom. Digital nonlinearity model from an independent scanner, described in the literature, was rescaled by system-specific scalars to approximate 3D bias correction maps. Correction efficacy was assessed by comparison to unbiased ADC values measured at isocenter. Empirically estimated nonlinearity scalars were confirmed by geometric distortion measurements of a regular grid phantom. The applied nonlinearity correction for arbitrarily oriented diffusion gradients reduced ADC bias from 20% down to 2% at clinically relevant offsets both for isotropic and anisotropic media. Identical performance was achieved using either corrected diffusion-weighted imaging (DWI) intensities or corrected b-values for each direction in brain and ice-water. Direction-average trace image correction was adequate only for isotropic medium. Empiric scalar adjustment of an independent gradient nonlinearity model adequately described DWI bias for a clinical scanner. Observed efficiency of implemented ADC bias correction quantitatively agreed with previous theoretical predictions and numerical simulations. The described procedure provides an independent benchmark for nonlinearity bias correction of clinical MRI scanners.

Numerical Simulation of Solid Combustion with a Robust Conjugate-Gradient Solution for Pressure

National Research Council Canada - National Science Library

Wang, Yi-Zun

2002-01-01

A Bi-Conjugate Gradient method (Bi-CGSTAB) is studied and tested for solid combustion in which the gas and solid phases are coupled by a set of conditions describing mass, momentum and heat transport across the interface...

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

Science.gov (United States)

Feng, Shuo; Ji, Jim

2014-04-01

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

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

Science.gov (United States)

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.

Analysis and performance estimation of the Conjugate Gradient method on multiple GPUs

NARCIS (Netherlands)

Verschoor, M.; Jalba, A.C.

2012-01-01

The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems described by a (sparse) matrix. The method requires a large amount of Sparse-Matrix Vector (SpMV) multiplications, vector reductions and other vector operations to be performed. We present a number of

Fiber nonlinearity compensation of an 8-channel WDM PDM-QPSK signal using multiple phase conjugations

DEFF Research Database (Denmark)

Hu, Hao; Jopson, R. M.; Dinu, M.

2013-01-01

We demonstrate compensation of fiber nonlinearities using optical phase conjugation of an 8-chamiel WDM 32-Gbaud PDM QPSK signal. Conjugating phase every 600 km in a fiber loop enabled a 6000 km transmission over True Wave fiber. © 2013 Optical Society of America....

Optimization of gadolinium burnable poison loading by the conjugate gradients method

International Nuclear Information System (INIS)

Drumm, C.R.

1984-01-01

Improved use of burnable poison is suggested for pressurized water reactors (PWR's) to insure a sufficiently negative moderator temperature coefficient of reactivity for extended burnup cycles and low leakage refueling patterns. The use of gadolinium as a burnable poison can lead to large axial fluctuations in the power distribution through the cycle. The goal of this work is to determine the optimal axial distribution of gadolinium burnable poison in a PWR to overcome the axial fluctuations, yielding an improved power distribution. The conjugate gradients optimization method is used in this work because of the high degree of nonlinearity of the problem. The neutron diffusion and depletion equations are solved for a one-dimensional one-group core model. The state variables are the flux, the critical soluble boron concentration, and the burnup. The control variables are the number of gadolinium pins per assembly and the beginning-of-cycle gadolinium concentration, which determine the gadolinium cross section. Two separate objectives are considered: 1) to minimize the power peaking factor, which will minimize the capital cost of the plant; and 2) to maximize the cycle length, which will minimize the fuel cost for the plant. It is shown in this work that optimizing the gadolinium distribution can yield an improved power distribution

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

Science.gov (United States)

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.

T2CG1, a package of preconditioned conjugate gradient solvers for TOUGH2

International Nuclear Information System (INIS)

Moridis, G.; Pruess, K.; Antunez, E.

1994-03-01

Most of the computational work in the numerical simulation of fluid and heat flows in permeable media arises in the solution of large systems of linear equations. The simplest technique for solving such equations is by direct methods. However, because of large storage requirements and accumulation of roundoff errors, the application of direct solution techniques is limited, depending on matrix bandwidth, to systems of a few hundred to at most a few thousand simultaneous equations. T2CG1, a package of preconditioned conjugate gradient solvers, has been added to TOUGH2 to complement its direct solver and significantly increase the size of problems tractable on PCs. T2CG1 includes three different solvers: a Bi-Conjugate Gradient (BCG) solver, a Bi-Conjugate Gradient Squared (BCGS) solver, and a Generalized Minimum Residual (GMRES) solver. Results from six test problems with up to 30,000 equations show that T2CG1 (1) is significantly (and invariably) faster and requires far less memory than the MA28 direct solver, (2) it makes possible the solution of very large three-dimensional problems on PCs, and (3) that the BCGS solver is the fastest of the three in the tested problems. Sample problems are presented related to heat and fluid flow at Yucca Mountain and WIPP, environmental remediation by the Thermal Enhanced Vapor Extraction System, and geothermal resources

Conjugate gradient coupled with multigrid for an indefinite problem

Science.gov (United States)

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.

On the solution of the Hartree-Fock-Bogoliubov equations by the conjugate gradient method

International Nuclear Information System (INIS)

Egido, J.L.; Robledo, L.M.

1995-01-01

The conjugate gradient method is formulated in the Hilbert space for density and non-density dependent Hamiltonians. We apply it to the solution of the Hartree-Fock-Bogoliubov equations with constraints. As a numerical application we show calculations with the finite range density dependent Gogny force. The number of iterations required to reach convergence is reduced by a factor of three to four as compared with the standard gradient method. (orig.)

Compensation of spatial system response in SPECT with conjugate gradient reconstruction technique

International Nuclear Information System (INIS)

Formiconi, A.R.; Pupi, A.; Passeri, A.

1989-01-01

A procedure for determination of the system matrix in single photon emission tomography (SPECT) is described which use a conjugate gradient reconstruction technique to take into account the variable system resolution of a camera equipped with parallel-hole collimators. The procedure involves acquisition of system line spread functions (LSF) in the region occupied by the object studied. Those data are used to generate a set of weighting factors based on the assumption that the LSFs of the collimated camera are of Gaussian shape with full width at half maximum (FWHM) linearly dependent on source depth in the span of image space. Factors are stored on a disc file for subsequent use in reconstruction. Afterwards reconstruction is performed using the conjugate gradient method with the system matrix modified by incorporation of these precalculated factors to take into account variable geometrical system response. The set of weighting factors is regenerated whenever acquisition conditions are changed (collimator, radius of rotation) with an ultra high resolution (UHR) collimator 2000 weighting factors need to be calculated. (author)

The influence of deflation vectors at interfaces on the deflated conjugate gradient method

NARCIS (Netherlands)

Vermolen, F.J.; Vuik, C.

2001-01-01

We investigate the influence of the value of deflation vectors at interfaces on the rate of convergence of preconditioned conjugate gradient methods. Our set-up is a Laplace problem in two dimensions with continuous or discontinuous coeffcients that vary in several orders of magnitude. In the

Weighted graph based ordering techniques for preconditioned conjugate gradient methods

Science.gov (United States)

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.

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

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Gonglin Yuan

Full Text Available 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.

MILC staggered conjugate gradient performance on Intel KNL

Energy Technology Data Exchange (ETDEWEB)

Li, Ruiz [Indiana Univ., Bloomington, IN (United States). Dept. of Physics; Detar, Carleton [Univ. of Utah, Salt Lake City, UT (United States). Dept. of Physics and Astronomy; Doerfler, Douglas W. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC); Gottlieb, Steven [Indiana Univ., Bloomington, IN (United States). Dept. of Physics; Jha, Asish [Intel Corp., Hillsboro, OR (United States). Sofware and Services Group; Kalamkar, Dhiraj [Intel Labs., Bangalore (India). Parallel Computing Lab.; Toussaint, Doug [Univ. of Arizona, Tucson, AZ (United States). Physics Dept.

2016-11-03

We review our work done to optimize the staggered conjugate gradient (CG) algorithm in the MILC code for use with the Intel Knights Landing (KNL) architecture. KNL is the second gener- ation Intel Xeon Phi processor. It is capable of massive thread parallelism, data parallelism, and high on-board memory bandwidth and is being adopted in supercomputing centers for scientific research. The CG solver consumes the majority of time in production running, so we have spent most of our effort on it. We compare performance of an MPI+OpenMP baseline version of the MILC code with a version incorporating the QPhiX staggered CG solver, for both one-node and multi-node runs.

Heterocyclic Nonlinear Optical Chromophores Composed of Phenothiazine or Carbazole Donor and 2-Cyanomethylene-3-cyano-4,5,5- trimethyl-2,5-dihydrofuran Acceptor

International Nuclear Information System (INIS)

Cho, Min Ju; Kim, Ja Youn; Kim, Jae Hong; Lee, Seung Hwan; Choi, Dong Hoon; Dalton, Larry R.

2005-01-01

We prepared the new nonlinear optical chromophores that show fairly high microscopic nonlinearity through intramolecular charge transfer. Phenothiazine and carbazole units played an important role to contribute high electron donability and connect the resonance pathway via conjugative effect in the cyclized ring beside the aromatic ring. Theoretical calculation, electrochemical analysis, and absorption spectroscopic study gave us useful information about the energy states and microscopic nonlinearities of two serial chromophores. We compared the microscopic nonlinearities of four chromophores with the conjugation length and electron donability in the push-pull type NLO chromophores. The effect of gradient donability and lengthening the conjugation were investigated on the electronic state and microscopic nonlinearity

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

Science.gov (United States)

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.

Parallel preconditioned conjugate gradient algorithm applied to neutron diffusion problem

International Nuclear Information System (INIS)

Majumdar, A.; Martin, W.R.

1992-01-01

Numerical solution of the neutron diffusion problem requires solving a linear system of equations such as Ax = b, where A is an n x n symmetric positive definite (SPD) matrix; x and b are vectors with n components. The preconditioned conjugate gradient (PCG) algorithm is an efficient iterative method for solving such a linear system of equations. In this paper, the authors describe the implementation of a parallel PCG algorithm on a shared memory machine (BBN TC2000) and on a distributed workstation (IBM RS6000) environment created by the parallel virtual machine parallelization software

Two Modified Three-Term Type Conjugate Gradient Methods and Their Global Convergence for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

Zhongbo Sun

2014-01-01

Full Text Available Two modified three-term type conjugate gradient algorithms which satisfy both the descent condition and the Dai-Liao type conjugacy condition are presented for unconstrained optimization. The first algorithm is a modification of the Hager and Zhang type algorithm in such a way that the search direction is descent and satisfies Dai-Liao’s type conjugacy condition. The second simple three-term type conjugate gradient method can generate sufficient decent directions at every iteration; moreover, this property is independent of the steplength line search. Also, the algorithms could be considered as a modification of the MBFGS method, but with different zk. Under some mild conditions, the given methods are global convergence, which is independent of the Wolfe line search for general functions. The numerical experiments show that the proposed methods are very robust and efficient.

Analysis and correction of gradient nonlinearity bias in apparent diffusion coefficient measurements.

Science.gov (United States)

Malyarenko, Dariya I; Ross, Brian D; Chenevert, Thomas L

2014-03-01

Gradient nonlinearity of MRI systems leads to spatially dependent b-values and consequently high non-uniformity errors (10-20%) in apparent diffusion coefficient (ADC) measurements over clinically relevant field-of-views. This work seeks practical correction procedure that effectively reduces observed ADC bias for media of arbitrary anisotropy in the fewest measurements. All-inclusive bias analysis considers spatial and time-domain cross-terms for diffusion and imaging gradients. The proposed correction is based on rotation of the gradient nonlinearity tensor into the diffusion gradient frame where spatial bias of b-matrix can be approximated by its Euclidean norm. Correction efficiency of the proposed procedure is numerically evaluated for a range of model diffusion tensor anisotropies and orientations. Spatial dependence of nonlinearity correction terms accounts for the bulk (75-95%) of ADC bias for FA = 0.3-0.9. Residual ADC non-uniformity errors are amplified for anisotropic diffusion. This approximation obviates need for full diffusion tensor measurement and diagonalization to derive a corrected ADC. Practical scenarios are outlined for implementation of the correction on clinical MRI systems. The proposed simplified correction algorithm appears sufficient to control ADC non-uniformity errors in clinical studies using three orthogonal diffusion measurements. The most efficient reduction of ADC bias for anisotropic medium is achieved with non-lab-based diffusion gradients. Copyright © 2013 Wiley Periodicals, Inc.

A fast, preconditioned conjugate gradient Toeplitz solver

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Accelerating learning of neural networks with conjugate gradients for nuclear power plant applications

International Nuclear Information System (INIS)

Reifman, J.; Vitela, J.E.

1994-01-01

The method of conjugate gradients is used to expedite the learning process of feedforward multilayer artificial neural networks and to systematically update both the learning parameter and the momentum parameter at each training cycle. The mechanism for the occurrence of premature saturation of the network nodes observed with the back propagation algorithm is described, suggestions are made to eliminate this undesirable phenomenon, and the reason by which this phenomenon is precluded in the method of conjugate gradients is presented. The proposed method is compared with the standard back propagation algorithm in the training of neural networks to classify transient events in neural power plants simulated by the Midland Nuclear Power Plant Unit 2 simulator. The comparison results indicate that the rate of convergence of the proposed method is much greater than the standard back propagation, that it reduces both the number of training cycles and the CPU time, and that it is less sensitive to the choice of initial weights. The advantages of the method are more noticeable and important for problems where the network architecture consists of a large number of nodes, the training database is large, and a tight convergence criterion is desired

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Program generator for the Incomplete Cholesky Conjugate Gradient (ICCG) method

International Nuclear Information System (INIS)

Kuo-Petravic, G.; Petravic, M.

1978-04-01

The Incomplete Cholesky Conjugate Gradient (ICCG) method has been found very effective for the solution of sparse systems of linear equations. Its implementation on a computer, however, requires a considerable amount of careful coding to achieve good machine efficiency. Furthermore, the resulting code is necessarily inflexible and cannot be easily adapted to different problems. We present in this paper a code generator GENIC which, given a small amount of information concerning the sparsity pattern and size of the system of equations, generates a solver package. This package, called SOLIC, is tailor made for a particular problem and can be easily incorporated into any user program

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

Science.gov (United States)

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.

On form factors of the conjugated field in the non-linear Schroedinger model

Energy Technology Data Exchange (ETDEWEB)

Kozlowski, K.K.

2011-05-15

Izergin-Korepin's lattice discretization of the non-linear Schroedinger model along with Oota's inverse problem provides one with determinant representations for the form factors of the lattice discretized conjugated field operator. We prove that these form factors converge, in the zero lattice spacing limit, to those of the conjugated field operator in the continuous model. We also compute the large-volume asymptotic behavior of such form factors in the continuous model. These are in particular characterized by Fredholm determinants of operators acting on closed contours. We provide a way of defining these Fredholm determinants in the case of generic paramaters. (orig.)

On computing quadrature-based bounds for the A-norm of the error in conjugate gradients

Czech Academy of Sciences Publication Activity Database

Meurant, G.; Tichý, Petr

2013-01-01

Roč. 62, č. 2 (2013), s. 163-191 ISSN 1017-1398 R&D Projects: GA AV ČR IAA100300802 Institutional research plan: CEZ:AV0Z10300504 Keywords : conjugate gradients * norm of the error * bounds for the error norm Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013

On computing quadrature-based bounds for the A-norm of the error in conjugate gradients

Czech Academy of Sciences Publication Activity Database

Meurant, G.; Tichý, Petr

2013-01-01

Roč. 62, č. 2 (2013), s. 163-191 ISSN 1017-1398 R&D Projects: GA AV ČR IAA100300802 Institutional research plan: CEZ:AV0Z10300504 Keywords : conjugate gradient s * norm of the error * bounds for the error norm Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013

Redox control of ferrocene-based complexes with systematically extended π-conjugated connectors: switchable and tailorable second order nonlinear optics.

Science.gov (United States)

Wang, Wen-Yong; Ma, Na-Na; Sun, Shi-Ling; Qiu, Yong-Qing

2014-03-14

The studies of geometrical structures, thermal stabilities, redox properties, nonlinear responses and optoelectronic properties have been carried out on a series of novel ferrocenyl (Fc) chromophores with the view of assessing their switchable and tailorable second order nonlinear optics (NLO). The use of a constant Fc donor and a 4,4'-bipyridinium acceptor and varied conjugated bridges makes it possible to systematically determine the contribution of organic connectors to chromophore nonlinear optical activities. The structures reveal that both the reduction reactions and organic connectors have a significant influence on 4,4'-bipyridinium. The potential energy surface maps along with plots of reduced density gradient mirror the thermal stabilities of the Fc-based chromophores. The first and second reductions take place preferentially at the 4,4'-bipyridinium moieties. Significantly, the reduction processes result in the molecular switches with large NLO contrast varying from zero or very small to a large value. Moreover, time-dependent density functional theory results indicate that the absorption peaks are mainly attributed to Fc to 4,4'-bipyridinium charge transfer and the mixture of intramolecular charge transfer within the two respective 4,4'-bipyridinium moieties coupled with interlayer charge transfer between the two 4,4'-bipyridinium moieties. This provides us with comprehensive information on the effect of organic connectors on the NLO properties.

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

Science.gov (United States)

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.

Method of T2 spectrum inversion with conjugate gradient algorithm from NMR data

International Nuclear Information System (INIS)

Li Pengju; Shi Shangming; Song Yanjie

2010-01-01

Based on the optimization techniques, the T 2 spectrum inversion method of conjugate gradient that is easy to realize non-negativity constraint of T2 spectrum is proposed. The method transforms the linear mixed-determined problem of T2 spectrum inversion into the typical optimization problem of searching the minimum of objective function by building up the objective function according to the basic idea of geophysics modeling. The optimization problem above is solved with the conjugate gradient algorithm that has quick convergence rate and quadratic termination. The method has been applied to the inversion of noise free echo train generated from artificial spectrum, artificial echo train with signal-to-noise ratio (SNR)=25 and NMR experimental data of drilling core. The comparison between the inversion results of this paper and artificial spectrum or the result of software imported in NMR laboratory shows that the method can correctly invert T 2 spectrum from artificial NMR relaxation data even though SNR=25 and that inversion T 2 spectrum with good continuity and smoothness from core NMR experimental data accords perfectly with that of laboratory software imported, and moreover,the absolute error between the NMR porosity computed from T 2 spectrum and helium (He) porosity in laboratory is 0.65%. (authors)

Gradient-driven flux-tube simulations of ion temperature gradient turbulence close to the non-linear threshold

Energy Technology Data Exchange (ETDEWEB)

Peeters, A. G.; Rath, F.; Buchholz, R.; Grosshauser, S. R.; Strintzi, D.; Weikl, A. [Physics Department, University of Bayreuth, Universitätsstrasse 30, Bayreuth (Germany); Camenen, Y. [Aix Marseille Univ, CNRS, PIIM, UMR 7345, Marseille (France); Candy, J. [General Atomics, PO Box 85608, San Diego, California 92186-5608 (United States); Casson, F. J. [CCFE, Culham Science Centre, Abingdon OX14 3DB, Oxon (United Kingdom); Hornsby, W. A. [Max Planck Institut für Plasmaphysik, Boltzmannstrasse 2 85748 Garching (Germany)

2016-08-15

It is shown that Ion Temperature Gradient turbulence close to the threshold exhibits a long time behaviour, with smaller heat fluxes at later times. This reduction is connected with the slow growth of long wave length zonal flows, and consequently, the numerical dissipation on these flows must be sufficiently small. Close to the nonlinear threshold for turbulence generation, a relatively small dissipation can maintain a turbulent state with a sizeable heat flux, through the damping of the zonal flow. Lowering the dissipation causes the turbulence, for temperature gradients close to the threshold, to be subdued. The heat flux then does not go smoothly to zero when the threshold is approached from above. Rather, a finite minimum heat flux is obtained below which no fully developed turbulent state exists. The threshold value of the temperature gradient length at which this finite heat flux is obtained is up to 30% larger compared with the threshold value obtained by extrapolating the heat flux to zero, and the cyclone base case is found to be nonlinearly stable. Transport is subdued when a fully developed staircase structure in the E × B shearing rate forms. Just above the threshold, an incomplete staircase develops, and transport is mediated by avalanche structures which propagate through the marginally stable regions.

Aerodynamic shape optimization using preconditioned conjugate gradient methods

Science.gov (United States)

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 pulse design for parallel excitation with gridding conjugate gradient.

Science.gov (United States)

Feng, Shuo; Ji, Jim

2013-01-01

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

A nonlinear model for fluid flow in a multiple-zone composite reservoir including the quadratic gradient term

International Nuclear Information System (INIS)

Wang, Xiao-Lu; Fan, Xiang-Yu; Nie, Ren-Shi; Huang, Quan-Hua; He, Yong-Ming

2013-01-01

Based on material balance and Darcy's law, the governing equation with the quadratic pressure gradient term was deduced. Then the nonlinear model for fluid flow in a multiple-zone composite reservoir including the quadratic gradient term was established and solved using a Laplace transform. A series of standard log–log type curves of 1-zone (homogeneous), 2-zone and 3-zone reservoirs were plotted and nonlinear flow characteristics were analysed. The type curves governed by the coefficient of the quadratic gradient term (β) gradually deviate from those of a linear model with time elapsing. Qualitative and quantitative analyses were implemented to compare the solutions of the linear and nonlinear models. The results showed that differences of pressure transients between the linear and nonlinear models increase with elapsed time and β. At the end, a successful application of the theoretical model data against the field data shows that the nonlinear model will be a good tool to evaluate formation parameters more accurately. (paper)

Penalty Algorithm Based on Conjugate Gradient Method for Solving Portfolio Management Problem

Directory of Open Access Journals (Sweden)

Wang YaLin

2009-01-01

Full Text Available A new approach was proposed to reformulate the biobjectives optimization model of portfolio management into an unconstrained minimization problem, where the objective function is a piecewise quadratic polynomial. We presented some properties of such an objective function. Then, a class of penalty algorithms based on the well-known conjugate gradient methods was developed to find the solution of portfolio management problem. By implementing the proposed algorithm to solve the real problems from the stock market in China, it was shown that this algorithm is promising.

Frequency domain optical tomography using a conjugate gradient method without line search

International Nuclear Information System (INIS)

Kim, Hyun Keol; Charette, Andre

2007-01-01

A conjugate gradient method without line search (CGMWLS) is presented. This method is used to retrieve the local maps of absorption and scattering coefficients inside the tissue-like test medium, with the synthetic data. The forward problem is solved with a discrete-ordinates finite-difference method based on the frequency domain formulation of radiative transfer equation. The inversion results demonstrate that the CGMWLS can retrieve simultaneously the spatial distributions of optical properties inside the medium within a reasonable accuracy, by reducing cross-talk between absorption and scattering coefficients

A different approach to estimate nonlinear regression model using numerical methods

Science.gov (United States)

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

Interior-Point Method for Non-Linear Non-Convex Optimization

Czech Academy of Sciences Publication Activity Database

Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan

2004-01-01

Roč. 11, č. 5-6 (2004), s. 431-453 ISSN 1070-5325 R&D Projects: GA AV ČR IAA1030103 Institutional research plan: CEZ:AV0Z1030915 Keywords : non-linear programming * interior point methods * indefinite systems * indefinite preconditioners * preconditioned conjugate gradient method * merit functions * algorithms * computational experiments Subject RIV: BA - General Mathematics Impact factor: 0.727, year: 2004

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Modifications of Steepest Descent Method and Conjugate Gradient Method Against Noise for Ill-posed Linear Systems

Directory of Open Access Journals (Sweden)

Chein-Shan Liu

2012-04-01

Full Text Available It is well known that the numerical algorithms of the steepest descent method (SDM, and the conjugate gradient method (CGM are effective for solving well-posed linear systems. However, they are vulnerable to noisy disturbance for solving ill-posed linear systems. We propose the modifications of SDM and CGM, namely the modified steepest descent method (MSDM, and the modified conjugate gradient method (MCGM. The starting point is an invariant manifold defined in terms of a minimum functional and a fictitious time-like variable; however, in the final stage we can derive a purely iterative algorithm including an acceleration parameter. Through the Hopf bifurcation, this parameter indeed plays a major role to switch the situation of slow convergence to a new situation that the functional is stepwisely decreased very fast. Several numerical examples are examined and compared with exact solutions, revealing that the new algorithms of MSDM and MCGM have good computational efficiency and accuracy, even for the highly ill-conditioned linear equations system with a large noise being imposed on the given data.

Transient photoconductivity and femtosecond nonlinear optical properties of a conjugated polymer-graphene oxide composite

Energy Technology Data Exchange (ETDEWEB)

Nalla, Venkatram; Ji Wei [Department of Physics, National University of Singapore, Singapore 117542 (Singapore); Polavarapu, Lakshminarayana; Manga, Kiran Kumar; Goh, Bee Min; Loh, Kian Ping; Xu Qinghua, E-mail: chmxqh@nus.edu.sg, E-mail: phyjiwei@nus.edu.sg [Department of Chemistry, National University of Singapore, Singapore 117543 (Singapore)

2010-10-15

A water soluble conjugated thiophene polymer, sodium salt of poly[2-(3-thienyl)ethoxy-4-butylsulfonate] (TPP), and graphene oxide (GO) composite film (GO-TPP) device was prepared. Transient photoconductivity measurements were carried out on the GO-TPP composite film using 150 ns laser pulses of 527 nm wavelength. Highly efficient photocurrent generation was observed from the GO-TPP film. The relationships of the film photoconductivity, photocurrent decay time and electron decay times with the incident light intensity were investigated. The photoconductive gain of the film was determined to be greater than 40% and to be independent of the light intensity. Furthermore, the femtosecond nonlinear optical properties of the GO-TPP film were measured using 800 nm femtosecond laser pulses and the composite film exhibited high nonlinear absorption and nonlinear refraction coefficients.

Transient photoconductivity and femtosecond nonlinear optical properties of a conjugated polymer-graphene oxide composite

International Nuclear Information System (INIS)

Nalla, Venkatram; Ji Wei; Polavarapu, Lakshminarayana; Manga, Kiran Kumar; Goh, Bee Min; Loh, Kian Ping; Xu Qinghua

2010-01-01

A water soluble conjugated thiophene polymer, sodium salt of poly[2-(3-thienyl)ethoxy-4-butylsulfonate] (TPP), and graphene oxide (GO) composite film (GO-TPP) device was prepared. Transient photoconductivity measurements were carried out on the GO-TPP composite film using 150 ns laser pulses of 527 nm wavelength. Highly efficient photocurrent generation was observed from the GO-TPP film. The relationships of the film photoconductivity, photocurrent decay time and electron decay times with the incident light intensity were investigated. The photoconductive gain of the film was determined to be greater than 40% and to be independent of the light intensity. Furthermore, the femtosecond nonlinear optical properties of the GO-TPP film were measured using 800 nm femtosecond laser pulses and the composite film exhibited high nonlinear absorption and nonlinear refraction coefficients.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Characterization of electrosynthesized conjugated polymer-carbon nanotube composite: optical nonlinearity and electrical property.

Science.gov (United States)

Bahrami, Afarin; Talib, Zainal Abidin; Shahriari, Esmaeil; Yunus, Wan Mahmood Mat; Kasim, Anuar; Behzad, Kasra

2012-01-01

The effects of multi-walled carbon nanotube (MWNT) concentration on the structural, optical and electrical properties of conjugated polymer-carbon nanotube composite are discussed. Multi-walled carbon nanotube-polypyrrole nanocomposites were synthesized by electrochemical polymerization of monomers in the presence of different amounts of MWNTs using sodium dodecylbenzensulfonate (SDBS) as surfactant at room temperature and normal pressure. Field emission scanning electron microscopy (FESEM) indicates that the polymer is wrapped around the nanotubes. Measurement of the nonlinear refractive indices (n(2)) and the nonlinear absorption (β) of the samples with different MWNT concentrations measurements were performed by a single Z-scan method using continuous wave (CW) laser beam excitation wavelength of λ = 532 nm. The results show that both nonlinear optical parameters increased with increasing the concentration of MWNTs. The third order nonlinear susceptibilities were also calculated and found to follow the same trend as n(2) and β. In addition, the conductivity of the composite film was found to increase rapidly with the increase in the MWNT concentration.

Microwave imaging of dielectric cylinder using level set method and conjugate gradient algorithm

International Nuclear Information System (INIS)

Grayaa, K.; Bouzidi, A.; Aguili, T.

2011-01-01

In this paper, we propose a computational method for microwave imaging cylinder and dielectric object, based on combining level set technique and the conjugate gradient algorithm. By measuring the scattered field, we tried to retrieve the shape, localisation and the permittivity of the object. The forward problem is solved by the moment method, while the inverse problem is reformulate in an optimization one and is solved by the proposed scheme. It found that the proposed method is able to give good reconstruction quality in terms of the reconstructed shape and permittivity.

Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Algorithm for Large-Scale Box-Constrained Optimization

Directory of Open Access Journals (Sweden)

Qiuyu Wang

2014-01-01

descent method at first finite number of steps and then by conjugate gradient method subsequently. Under some appropriate conditions, we show that the algorithm converges globally. Numerical experiments and comparisons by using some box-constrained problems from CUTEr library are reported. Numerical comparisons illustrate that the proposed method is promising and competitive with the well-known method—L-BFGS-B.

Generalized conjugate-gradient methods for the Navier-Stokes equations

Science.gov (United States)

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 systematic approach to robust preconditioning for gradient-based inverse scattering algorithms

International Nuclear Information System (INIS)

Nordebo, Sven; Fhager, Andreas; Persson, Mikael; Gustafsson, Mats

2008-01-01

This paper presents a systematic approach to robust preconditioning for gradient-based nonlinear inverse scattering algorithms. In particular, one- and two-dimensional inverse problems are considered where the permittivity and conductivity profiles are unknown and the input data consist of the scattered field over a certain bandwidth. A time-domain least-squares formulation is employed and the inversion algorithm is based on a conjugate gradient or quasi-Newton algorithm together with an FDTD-electromagnetic solver. A Fisher information analysis is used to estimate the Hessian of the error functional. A robust preconditioner is then obtained by incorporating a parameter scaling such that the scaled Fisher information has a unit diagonal. By improving the conditioning of the Hessian, the convergence rate of the conjugate gradient or quasi-Newton methods are improved. The preconditioner is robust in the sense that the scaling, i.e. the diagonal Fisher information, is virtually invariant to the numerical resolution and the discretization model that is employed. Numerical examples of image reconstruction are included to illustrate the efficiency of the proposed technique

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Improved Conjugate Gradient Bundle Adjustment of Dunhuang Wall Painting Images

Science.gov (United States)

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.

Fiber Nonlinearity Post-Compensation by Optical Phase Conjugation for 40Gb/s CO-OFDM Systems

International Nuclear Information System (INIS)

Qiao Yao-Jun; Liu Xue-Jun; Ji Yue-Feng

2011-01-01

Fiber nonlinearity impairments in a 40-Gb/s coherent optical orthogonal frequency division multiplexing (COOFDM) system are post-compensated for by a new method of fiber nonlinearity post-compensation (FNPC). The FNPC located before the CO-OFDM receiver includes an optical phase conjugation (OPC) unit and a subsequent 80-km-high nonlinear fiber (HNLF) as a fiber nonlinearity compensator. The OPC unit is based on a four wave mixing effect in a semiconductor optical amplifier. The fiber nonlinearity impairments in the transmission link are post-compensated for after OPC by transmission through the HNLF with a large nonlinearity coefficient. Simulation results show that the nonlinear threshold (NLT) (for Q > 10 dB) can be increased by about 2.5 dB and the maximum Q factor is increased by about 1.2 dB for the single-channel 40-Gb/s CO-OFDM system with periodic dispersion maps. In the 50-GHz channel spacing wavelength-division-multiplexing system, the NLT increases by 1.1 dB, equating to a 0.7 dB improvement for the maximum Q factor. (fundamental areas of phenomenology(including applications))

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

Science.gov (United States)

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.

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

Czech Academy of Sciences Publication Activity Database

Lukšan, Ladislav; Vlček, Jan

1998-01-01

Roč. 5, č. 3 (1998), s. 219-247 ISSN 1070-5325 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear programming * sparse problems * equality constraints * truncated Newton method * augmented Lagrangian function * indefinite systems * indefinite preconditioners * conjugate gradient method * residual smoothing Subject RIV: BA - General Mathematics Impact factor: 0.741, year: 1998

Computational Experience with Globally Convergent Descent Methods for Large Sparse Systems of Nonlinear Equations

Czech Academy of Sciences Publication Activity Database

Lukšan, Ladislav; Vlček, Jan

1998-01-01

Roč. 8, č. 3-4 (1998), s. 201-223 ISSN 1055-6788 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear equations * Armijo-type descent methods * Newton-like methods * truncated methods * global convergence * nonsymmetric linear systems * conjugate gradient -type methods * residual smoothing * computational experiments Subject RIV: BB - Applied Statistics, Operational Research

Identification techniques for phenomenological models of hysteresis based on the conjugate gradient method

International Nuclear Information System (INIS)

Andrei, Petru; Oniciuc, Liviu; Stancu, Alexandru; Stoleriu, Laurentiu

2007-01-01

An identification technique for the parameters of phenomenological models of hysteresis is presented. The basic idea of our technique is to set up a system of equations for the parameters of the model as a function of known quantities on the major or minor hysteresis loops (e.g. coercive force, susceptibilities at various points, remanence), or other magnetization curves. This system of equations can be either over or underspecified and is solved by using the conjugate gradient method. Numerical results related to the identification of parameters in the Energetic, Jiles-Atherton, and Preisach models are presented

Quality of Gaussian basis sets: direct optimization of orbital exponents by the method of conjugate gradients

International Nuclear Information System (INIS)

Kari, R.E.; Mezey, P.G.; Csizmadia, I.G.

1975-01-01

Expressions are given for calculating the energy gradient vector in the exponent space of Gaussian basis sets and a technique to optimize orbital exponents using the method of conjugate gradients is described. The method is tested on the (9/sups/5/supp/) Gaussian basis space and optimum exponents are determined for the carbon atom. The analysis of the results shows that the calculated one-electron properties converge more slowly to their optimum values than the total energy converges to its optimum value. In addition, basis sets approximating the optimum total energy very well can still be markedly improved for the prediction of one-electron properties. For smaller basis sets, this improvement does not warrant the necessary expense

A Framework for Generalized Conjugate Gradient Methods - with Special Emphasis on Contributions by Rüdiger Weiss

Czech Academy of Sciences Publication Activity Database

Gutknecht, M. H.; Rozložník, Miroslav

2002-01-01

Roč. 41, - (2002), s. 7-22 ISSN 0168-9274 R&D Projects: GA AV ČR IAA1030103; GA ČR GA101/00/1035 Institutional research plan: AV0Z1030915 Keywords : sparse linear systems * Krylov space method * orthogonal residual method * minimal residual method * conjugate gradient method * residual smoothing * CG * CGNE * CGNR * CR * FOM * GMRES * PRES Subject RIV: BA - General Mathematics Impact factor: 0.504, year: 2002

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

IMPROVED CONJUGATE GRADIENT BUNDLE ADJUSTMENT OF DUNHUANG WALL PAINTING IMAGES

Directory of Open Access Journals (Sweden)

K. Hu

2017-09-01

Full Text Available 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.

Robust non-gradient C subroutines for non-linear optimization

DEFF Research Database (Denmark)

Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun

2004-01-01

This report presents a package of robust and easy-to-use C subroutines for solving unconstrained and constrained non-linear optimization problems, where gradient information is not required. The intention is that the routines should use the currently best algorithms available. All routines have...... subroutines are obtained by changing 0 to 1. The present report is a new and updated version of a previous report NI-91-04 with the title Non-gradient c Subroutines for Non- Linear Optimization, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated...... from Fortran to C. The reason for writing the present report is that some of the C subroutines have been replaced by more e ective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modified to some extent...

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

Science.gov (United States)

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

On Error Estimation in the Conjugate Gradient Method and why it Works in Finite Precision Computations

Czech Academy of Sciences Publication Activity Database

Strakoš, Zdeněk; Tichý, Petr

2002-01-01

Roč. 13, - (2002), s. 56-80 ISSN 1068-9613 R&D Projects: GA ČR GA201/02/0595 Institutional research plan: AV0Z1030915 Keywords : conjugate gradient method * Gauss kvadrature * evaluation of convergence * error bounds * finite precision arithmetic * rounding errors * loss of orthogonality Subject RIV: BA - General Mathematics Impact factor: 0.565, year: 2002 http://etna.mcs.kent.edu/volumes/2001-2010/vol13/abstract.php?vol=13&pages=56-80

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

Directory of Open Access Journals (Sweden)

Xiangrong Li

Full Text Available 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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

2013-12-01

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

Preconditioned conjugate gradient technique for the analysis of symmetric anisotropic structures

Science.gov (United States)

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.

Four-wave mixing and phase conjugation in plasmas

International Nuclear Information System (INIS)

Federici, J.F.

1989-01-01

Nonlinear optical effects such as Stimulated Brillouin Scattering, Stimulated Raman Scattering, self-focusing, wave-mixing, parametric mixing, etc., have a long history in plasma physics. Recently, four-wave mixing in plasmas and its applications to phase conjugation has been extensively studied. Although four-wave mixing (FWM), using various nonlinear mediums, has many practical applications in the visible regime, no successful attempt has been made to study or demonstrate FWM for wavelengths longer than 10μm. Plasmas as phase conjugate mirrors have received considerable attention since they become more efficient at longer wavelengths (far-infrared to microwave). The purpose of this thesis is to study various fundamental issues which concern the suitability of plasmas for four-wave mixing and phase conjugation. The major contributions of this thesis are the identification and study of thermal and ionization nonlinearities as potential four-wave mixing and phase conjugation mechanisms and the study of the affect of density inhomogeneities on the FWM process. Using a fluid description for the plasma, this thesis demonstrates that collisional heating generates a thermal force which substantially enhances the phase conjugate reflectivity. The prospect of using a novel ionization nonlinearity in weakly ionized plasmas for wave-mixing and phase conjugation is discussed. The ionization nonlinearity arises from localized heating of the plasma by the beat-wave. Wherever, the local temperature is increased, a plasma density grating is produced due to increased electron-impact ionization. Numerical estimates of the phase conjugate reflectivity indicate reflectivities in the range of 10 -4 -10 -3 are possible in a weakly ionized steady-state gas discharge plasma

Optical phase conjugation

CERN Document Server

Fisher, Robert A

1983-01-01

This book appears at a time of intense activity in optical phase conjugation. We chose not to await the maturation of the field, but instead to provide this material in time to be useful in its development. We have tried very hard to elucidate and interrelate the various nonlinear phenomena which can be used for optical phase conjugation.

Identity of the conjugate gradient and Lanczos algorithms for matrix inversion in lattice fermion calculations

International Nuclear Information System (INIS)

Burkitt, A.N.; Irving, A.C.

1988-01-01

Two of the methods that are widely used in lattice gauge theory calculations requiring inversion of the fermion matrix are the Lanczos and the conjugate gradient algorithms. Those algorithms are already known to be closely related. In fact for matrix inversion, in exact arithmetic, they give identical results at each iteration and are just alternative formulations of a single algorithm. This equivalence survives rounding errors. We give the identities between the coefficients of the two formulations, enabling many of the best features of them to be combined. (orig.)

Inversion of the fermion matrix and the equivalence of the conjugate gradient and Lanczos algorithms

International Nuclear Information System (INIS)

Burkitt, A.N.; Irving, A.C.

1990-01-01

The Lanczos and conjugate gradient algorithms are widely used in lattice QCD calculations. The previously known close relationship between the two methods is explored and two commonly used implementations are shown to give identically the same results at each iteration, in exact arithmetic, for matrix inversion. The identities between the coefficients of the two algorithms are given, and many of the features of the two algorithms can now be combined. The effects of finite arithmetic are investigated and the particular Lanczos formulation is found to be most stable with respect to rounding errors. (orig.)

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

Science.gov (United States)

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.

On the Complete Integrability of Nonlinear Dynamical Systems on Discrete Manifolds within the Gradient-Holonomic Approach

International Nuclear Information System (INIS)

Prykarpatsky, Yarema A.; Bogolubov, Nikolai N. Jr.; Prykarpatsky, Anatoliy K.; Samoylenko, Valeriy H.

2010-12-01

A gradient-holonomic approach for the Lax type integrability analysis of differential-discrete dynamical systems is devised. The asymptotical solutions to the related Lax equation are studied and the related gradient identity is stated. The integrability of a discrete nonlinear Schroedinger type dynamical system is treated in detail. The integrability of a generalized Riemann type discrete hydrodynamical system is discussed. (author)

Nonlinear primary resonance of micro/nano-beams made of nanoporous biomaterials incorporating nonlocality and strain gradient size dependency

Science.gov (United States)

Sahmani, S.; Aghdam, M. M.

2018-03-01

A wide range of biological applications such as drug delivery, biosensors and hemodialysis can be provided by nanoporous biomaterials due to their uniform pore size as well as considerable pore density. In the current study, the size dependency in the nonlinear primary resonance of micro/nano-beams made of nanoporous biomaterials is anticipated. To accomplish this end, a refined truncated cube is introduced to model the lattice structure of nanoporous biomaterial. Accordingly, analytical expressions for the mechanical properties of material are derived as functions of pore size. After that, based upon a nonlocal strain gradient beam model, the size-dependent nonlinear Duffing type equation of motion is constructed. The Galerkin technique together with the multiple time-scales method is employed to obtain the nonlocal strain gradient frequency-response and amplitude-response related to the nonlinear primary resonance of a micro/nano-beam made of the nanoporous biomaterial with different pore sizes. It is indicated that the nonlocality causes to decrease the response amplitudes associated with the both bifurcation points of the jump phenomenon, while the strain gradient size dependency causes to increase them. Also, it is found that increasing the pore size leads to enhance the nonlinearity, so the maximum deflection of response occurs at higher excitation frequency.

Pixel-based OPC optimization based on conjugate gradients.

Science.gov (United States)

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.

Global gradient estimates for divergence-type elliptic problems involving general nonlinear operators

Science.gov (United States)

Cho, Yumi

2018-05-01

We study nonlinear elliptic problems with nonstandard growth and ellipticity related to an N-function. We establish global Calderón-Zygmund estimates of the weak solutions in the framework of Orlicz spaces over bounded non-smooth domains. Moreover, we prove a global regularity result for asymptotically regular problems which are getting close to the regular problems considered, when the gradient variable goes to infinity.

Nonlinear theory of trapped electron temperature gradient driven turbulence in flat density H-mode plasmas

International Nuclear Information System (INIS)

Hahm, T.S.

1990-12-01

Ion temperature gradient turbulence based transport models have difficulties reconciling the recent DIII-D H-mode results where the density profile is flat, but χ e > χ i in the core region. In this work, a nonlinear theory is developed for recently discovered ion temperature gradient trapped electron modes propagating in the electron diamagnetic direction. This instability is predicted to be linearly unstable for L Ti /R approx-lt κ θ ρ s approx-lt (L Ti /R) 1/4 . They are also found to be strongly dispersive even at these long wavelengths, thereby suggesting the importance of the wave-particle-wave interactions in the nonlinear saturation phase. The fluctuation spectrum and anomalous fluxes are calculated. In accordance with the trends observed in DIII-D, the predicted electron thermal diffusivity can be larger than the ion thermal diffusivity. 17 refs., 3 figs

The application of projected conjugate gradient solvers on graphical processing units

International Nuclear Information System (INIS)

Lin, Youzuo; Renaut, Rosemary

2011-01-01

Graphical processing units introduce the capability for large scale computation at the desktop. Presented numerical results verify that efficiencies and accuracies of basic linear algebra subroutines of all levels when implemented in CUDA and Jacket are comparable. But experimental results demonstrate that the basic linear algebra subroutines of level three offer the greatest potential for improving efficiency of basic numerical algorithms. We consider the solution of the multiple right hand side set of linear equations using Krylov subspace-based solvers. Thus, for the multiple right hand side case, it is more efficient to make use of a block implementation of the conjugate gradient algorithm, rather than to solve each system independently. Jacket is used for the implementation. Furthermore, including projection from one system to another improves efficiency. A relevant example, for which simulated results are provided, is the reconstruction of a three dimensional medical image volume acquired from a positron emission tomography scanner. Efficiency of the reconstruction is improved by using projection across nearby slices.

The application of projected conjugate gradient solvers on graphical processing units

Energy Technology Data Exchange (ETDEWEB)

Lin, Youzuo [Los Alamos National Laboratory; Renaut, Rosemary [ARIZONA STATE UNIV.

2011-01-26

Graphical processing units introduce the capability for large scale computation at the desktop. Presented numerical results verify that efficiencies and accuracies of basic linear algebra subroutines of all levels when implemented in CUDA and Jacket are comparable. But experimental results demonstrate that the basic linear algebra subroutines of level three offer the greatest potential for improving efficiency of basic numerical algorithms. We consider the solution of the multiple right hand side set of linear equations using Krylov subspace-based solvers. Thus, for the multiple right hand side case, it is more efficient to make use of a block implementation of the conjugate gradient algorithm, rather than to solve each system independently. Jacket is used for the implementation. Furthermore, including projection from one system to another improves efficiency. A relevant example, for which simulated results are provided, is the reconstruction of a three dimensional medical image volume acquired from a positron emission tomography scanner. Efficiency of the reconstruction is improved by using projection across nearby slices.

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

Science.gov (United States)

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

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

Science.gov (United States)

Oliker, Leonid; Heber, Gerd; Biswas, Rupak

2000-01-01

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

Photon attenuation correction technique in SPECT based on nonlinear optimization

International Nuclear Information System (INIS)

Suzuki, Shigehito; Wakabayashi, Misato; Okuyama, Keiichi; Kuwamura, Susumu

1998-01-01

Photon attenuation correction in SPECT was made using a nonlinear optimization theory, in which an optimum image is searched so that the sum of square errors between observed and reprojected projection data is minimized. This correction technique consists of optimization and step-width algorithms, which determine at each iteration a pixel-by-pixel directional value of search and its step-width, respectively. We used the conjugate gradient and quasi-Newton methods as the optimization algorithm, and Curry rule and the quadratic function method as the step-width algorithm. Statistical fluctuations in the corrected image due to statistical noise in the emission projection data grew as the iteration increased, depending on the combination of optimization and step-width algorithms. To suppress them, smoothing for directional values was introduced. Computer experiments and clinical applications showed a pronounced reduction in statistical fluctuations of the corrected image for all combinations. Combinations using the conjugate gradient method were superior in noise characteristic and computation time. The use of that method with the quadratic function method was optimum if noise property was regarded as important. (author)

Acceleration of monte Carlo solution by conjugate gradient method

International Nuclear Information System (INIS)

Toshihisa, Yamamoto

2005-01-01

The conjugate gradient method (CG) was applied to accelerate Monte Carlo solutions in fixed source problems. The equilibrium model based formulation enables to use CG scheme as well as initial guess to maximize computational performance. This method is available to arbitrary geometry provided that the neutron source distribution in each subregion can be regarded as flat. Even if it is not the case, the method can still be used as a powerful tool to provide an initial guess very close to the converged solution. The major difference of Monte Carlo CG to deterministic CG is that residual error is estimated using Monte Carlo sampling, thus statistical error exists in the residual. This leads to a flow diagram specific to Monte Carlo-CG. Three pre-conditioners were proposed for CG scheme and the performance was compared with a simple 1-D slab heterogeneous test problem. One of them, Sparse-M option, showed an excellent performance in convergence. The performance per unit cost was improved by four times in the test problem. Although direct estimation of efficiency of the method is impossible mainly because of the strong problem-dependence of the optimized pre-conditioner in CG, the method seems to have efficient potential as a fast solution algorithm for Monte Carlo calculations. (author)

An Efficient Hybrid Conjugate Gradient Method with the Strong Wolfe-Powell Line Search

Directory of Open Access Journals (Sweden)

Ahmad Alhawarat

2015-01-01

Full Text Available Conjugate gradient (CG method is an interesting tool to solve optimization problems in many fields, such as design, economics, physics, and engineering. In this paper, we depict a new hybrid of CG method which relates to the famous Polak-Ribière-Polyak (PRP formula. It reveals a solution for the PRP case which is not globally convergent with the strong Wolfe-Powell (SWP line search. The new formula possesses the sufficient descent condition and the global convergent properties. In addition, we further explained about the cases where PRP method failed with SWP line search. Furthermore, we provide numerical computations for the new hybrid CG method which is almost better than other related PRP formulas in both the number of iterations and the CPU time under some standard test functions.

Fully 3D PET image reconstruction using a fourier preconditioned conjugate-gradient algorithm

International Nuclear Information System (INIS)

Fessler, J.A.; Ficaro, E.P.

1996-01-01

Since the data sizes in fully 3D PET imaging are very large, iterative image reconstruction algorithms must converge in very few iterations to be useful. One can improve the convergence rate of the conjugate-gradient (CG) algorithm by incorporating preconditioning operators that approximate the inverse of the Hessian of the objective function. If the 3D cylindrical PET geometry were not truncated at the ends, then the Hessian of the penalized least-squares objective function would be approximately shift-invariant, i.e. G'G would be nearly block-circulant, where G is the system matrix. We propose a Fourier preconditioner based on this shift-invariant approximation to the Hessian. Results show that this preconditioner significantly accelerates the convergence of the CG algorithm with only a small increase in computation

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

Science.gov (United States)

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.

Dynamics of a photorefractive response and competition of nonlinear processes in self-pumping double phase-conjugate mirrors

International Nuclear Information System (INIS)

Mogaddam, Mehran Wahdani; Shuvalov, Vladimir V

2005-01-01

The dynamics of formation of a nonlinear response of a double phase-conjugate (PC) BaTiO 3 mirror is calculated. It is shown that because of competition between processes of different types (related to the presence of several PC channels, the local and nonlocal components of the photorefractive nonlinearity), the transient and dynamic lasing regimes for this mirror can be substantially different. It is found that the development of lasing begins with the successive formation and phasing of dynamic holograms of two different types (two PC channels). It is shown that even under optimal conditions, the lasing regime is not stationary due to competition between processes of different types, and the parameters of output fields fluctuate in time in a nontrivial way (due to the presence of the in-phase and out-of-phase components). Several scenarios of transition to the dynamic chaos are described. (nonlinear optical phenomena)

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

Science.gov (United States)

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.

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

Science.gov (United States)

Didar, Tohid Fatanat; Tabrizian, Maryam

2012-11-07

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

A new modified conjugate gradient coefficient for solving system of linear equations

Science.gov (United States)

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

Effect of conjugation length on nonlinear optical parameters of anthraquinone dyes investigated using He-Ne laser operating in CW mode

Science.gov (United States)

Pramodini, S.; Poornesh, P.

2014-10-01

We report the studies on third-order optical nonlinearity and optical limiting of anthraquinone dyes. Z-scan technique was employed to evaluate the nonlinear parameters such as nonlinear absorption coefficient βeff and nonlinear index of refraction n2. Continuous wave He-Ne laser was used as the source of excitation. The estimated values of βeff, n2 and χ(3) are of the order of 10-3 cm/W, 10-5 esu and 10-7 esu respectively. The presence of donor and acceptor groups in the structure results in increase in conjugation length. This resulted in the enhancement of nonlinear optical parameters values of the dye. Multiple diffraction rings were observed when the samples were exposed to laser beam due to thermal lensing. Dyes exhibited good optical limiting behavior under the experimental conditions. The results indicate that the dyes investigated here are materialise as candidates for photonics device applications such as optical power limiters.

Numerical solution to a multi-dimensional linear inverse heat conduction problem by a splitting-based conjugate gradient method

International Nuclear Information System (INIS)

Dinh Nho Hao; Nguyen Trung Thanh; Sahli, Hichem

2008-01-01

In this paper we consider a multi-dimensional inverse heat conduction problem with time-dependent coefficients in a box, which is well-known to be severely ill-posed, by a variational method. The gradient of the functional to be minimized is obtained by aids of an adjoint problem and the conjugate gradient method with a stopping rule is then applied to this ill-posed optimization problem. To enhance the stability and the accuracy of the numerical solution to the problem we apply this scheme to the discretized inverse problem rather than to the continuous one. The difficulties with large dimensions of discretized problems are overcome by a splitting method which only requires the solution of easy-to-solve one-dimensional problems. The numerical results provided by our method are very good and the techniques seem to be very promising.

Perfect lensing with phase-conjugating surfaces: toward practical realization

International Nuclear Information System (INIS)

Maslovski, Stanislav; Tretyakov, Sergei

2012-01-01

It is theoretically known that a pair of phase-conjugating surfaces can function as a perfect lens, focusing propagating waves and enhancing evanescent waves. However, the known experimental approaches based on thin sheets of nonlinear materials cannot fully realize the required phase conjugation boundary condition. In this paper, we show that the ideal phase-conjugating surface is, in principle, physically realizable and investigate the necessary properties of nonlinear and nonreciprocal particles which can be used to build a perfect lens system. The physical principle of the lens operation is discussed in detail and directions of possible experimental realizations are outlined. (paper)

Large-N limit of the gradient flow in the 2D O(N) nonlinear sigma model

International Nuclear Information System (INIS)

Makino, Hiroki; Sugino, Fumihiko; Suzuki, Hiroshi

2015-01-01

The gradient flow equation in the 2D O(N) nonlinear sigma model with lattice regularization is solved in the leading order of the 1/N expansion. By using this solution, we analytically compute the thermal expectation value of a lattice energy–momentum tensor defined through the gradient flow. The expectation value reproduces thermodynamic quantities obtained by the standard large-N method. This analysis confirms that the above lattice energy–momentum tensor restores the correct normalization automatically in the continuum limit, in a system with a non-perturbative mass gap

Gradient-based optimization in nonlinear structural dynamics

DEFF Research Database (Denmark)

Dou, Suguang

The intrinsic nonlinearity of mechanical structures can give rise to rich nonlinear dynamics. Recently, nonlinear dynamics of micro-mechanical structures have contributed to developing new Micro-Electro-Mechanical Systems (MEMS), for example, atomic force microscope, passive frequency divider......, frequency stabilization, and disk resonator gyroscope. For advanced design of these structures, it is of considerable value to extend current optimization in linear structural dynamics into nonlinear structural dynamics. In this thesis, we present a framework for modelling, analysis, characterization......, and optimization of nonlinear structural dynamics. In the modelling, nonlinear finite elements are used. In the analysis, nonlinear frequency response and nonlinear normal modes are calculated based on a harmonic balance method with higher-order harmonics. In the characterization, nonlinear modal coupling...

Preconditioned conjugate-gradient methods for low-speed flow calculations

Science.gov (United States)

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

A computationally efficient P_1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods

International Nuclear Information System (INIS)

Krishnamoorthy, Gautham

2017-01-01

Highlights: • The P_1 radiation model was interfaced with high performance linear solvers. • Pre-conditioned conjugate gradient (PC CG) method improved convergence by 50% • PC CG was more than 30 times faster than classical iterative methods. • The time to solution scaled linearly with increase in problem size employing PC CG. • Employing WSGGM with P_1 model compared reasonably well against benchmark data. - Abstract: The iterative convergence of the P_1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P_1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P_1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P_1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Further, PC provided 50% computational savings compared to employing CG in a standalone mode. The P_1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P_1 model provided good agreement against benchmark data with L_2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Nonlinear structure formation in ion-temperature-gradient driven drift waves in pair-ion plasma with nonthermal electron distribution

Science.gov (United States)

Razzaq, Javaria; Haque, Q.; Khan, Majid; Bhatti, Adnan Mehmood; Kamran, M.; Mirza, Arshad M.

2018-02-01

Nonlinear structure formation in ion-temperature-gradient (ITG) driven waves is investigated in pair-ion plasma comprising ions and nonthermal electrons (kappa, Cairns). By using the transport equations of the Braginskii model, a new set of nonlinear equations are derived. A linear dispersion relation is obtained and discussed analytically as well as numerically. It is shown that the nonthermal population of electrons affects both the linear and nonlinear characteristics of the ITG mode in pair-ion plasma. This work will be useful in tokamaks and stellarators where non-Maxwellian population of electrons may exist due to resonant frequency heating, electron cyclotron heating, runaway electrons, etc.

Density gradient effects in weakly nonlinear ablative Rayleigh-Taylor instability

International Nuclear Information System (INIS)

Wang, L. F.; Ye, W. H.; He, X. T.

2012-01-01

In this research, density gradient effects (i.e., finite thickness of ablation front effects) in ablative Rayleigh-Taylor instability (ARTI), in the presence of preheating within the weakly nonlinear regime, are investigated numerically. We analyze the weak, medium, and strong ablation surfaces which have different isodensity contours, respectively, to study the influences of finite thickness of ablation front on the weakly nonlinear behaviors of ARTI. Linear growth rates, generation coefficients of the second and the third harmonics, and coefficients of the third-order feedback to the fundamental mode are obtained. It is found that the linear growth rate which has a remarkable maximum, is reduced, especially when the perturbation wavelength λ is short and a cut-off perturbation wavelength λ c appears when the perturbation wavelength λ is sufficiently short, where no higher harmonics exists when λ c . The phenomenon of third-order positive feedback to the fundamental mode near the λ c [J. Sanz et al., Phys. Rev. Lett. 89, 195002 (2002); J. Garnier et al., Phys. Rev. Lett. 90, 185003 (2003); J. Garnier and L. Masse, Phys. Plasmas 12, 062707 (2005)] is confirmed in numerical simulations, and the physical mechanism of the third-order positive feedback is qualitatively discussed. Moreover, it is found that generations and growths of the second and the third harmonics are stabilized (suppressed and reduced) by the ablation effect. Meanwhile, the third-order negative feedback to the fundamental mode is also reduced by the ablation effect, and hence, the linear saturation amplitude (typically ∼0.2λ in our simulations) is increased significantly and therefore exceeds the classical prediction 0.1λ, especially for the strong ablation surface with a small perturbation wavelength. Overall, the ablation effect stabilizes the ARTI in the weakly nonlinear regime. Numerical results obtained are in general agreement with the recent weakly nonlinear theories and simulations

Rationally Engineering Phototherapy Modules of Eosin-Conjugated Responsive Polymeric Nanocarriers via Intracellular Endocytic pH Gradients.

Science.gov (United States)

Liu, Guhuan; Hu, Jinming; Zhang, Guoying; Liu, Shiyong

2015-07-15

Spatiotemporal switching of respective phototherapy modes at the cellular level with minimum side effects and high therapeutic efficacy is a major challenge for cancer phototherapy. Herein we demonstrate how to address this issue by employing photosensitizer-conjugated pH-responsive block copolymers in combination with intracellular endocytic pH gradients. At neutral pH corresponding to extracellular and cytosol milieu, the copolymers self-assemble into micelles with prominently quenched fluorescence emission and low (1)O2 generation capability, favoring a highly efficient photothermal module. Under mildly acidic pH associated with endolysosomes, protonation-triggered micelle-to-unimer transition results in recovered emission and enhanced photodynamic (1)O2 efficiency, which synergistically actuates release of encapsulated drugs, endosomal escape, and photochemical internalization processes.

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

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

2008-01-01

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.

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

Science.gov (United States)

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.

On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Min Sun

2014-01-01

Full Text Available Recently, Zhang et al. proposed a sufficient descent Polak-Ribière-Polyak (SDPRP conjugate gradient method for large-scale unconstrained optimization problems and proved its global convergence in the sense that lim infk→∞∥∇f(xk∥=0 when an Armijo-type line search is used. In this paper, motivated by the line searches proposed by Shi et al. and Zhang et al., we propose two new Armijo-type line searches and show that the SDPRP method has strong convergence in the sense that limk→∞∥∇f(xk∥=0 under the two new line searches. Numerical results are reported to show the efficiency of the SDPRP with the new Armijo-type line searches in practical computation.

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

Science.gov (United States)

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.

Fiber nonlinearity mitigation of WDM-PDM QPSK/16-QAM signals using fiber-optic parametric amplifiers based multiple optical phase conjugations

DEFF Research Database (Denmark)

Hu, Hao; Jopson, Robert M.; Gnauck, Alan H.

2017-01-01

We demonstrate fiber nonlinearity mitigation by using multiple optical phase conjugations (OPCs) in the WDM transmission systems of both 8 x 32-Gbaud PDM QPSK channels and 8 x 32-Gbaud PDM 16-QAM channels, showing improved performance over a single mid-span OPC and no OPC in terms of nonlinear...... threshold and a best achievable Q(2) factor after transmission. In addition, after an even number of OPCs, the signal wavelength can be preserved after transmission. The performance of multiple OPCs for fiber nonlinearity mitigation was evaluated independently for WDM PDM QPSK signals and WDM PDM 16QAM...... to 1 dB compared to the case of mid-span OPC. The improvements in the best achievable Q(2) factors were more modest, ranging from 0.2 dB to 1.1 dB for the results presented. (C) 2017 Optical Society of America...

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

Science.gov (United States)

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.

3D DC Resistivity Inversion with Topography Based on Regularized Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Jian-ke Qiang

2013-01-01

Full Text Available During the past decades, we observed a strong interest in 3D DC resistivity inversion and imaging with complex topography. In this paper, we implemented 3D DC resistivity inversion based on regularized conjugate gradient method with FEM. The Fréchet derivative is assembled with the electric potential in order to speed up the inversion process based on the reciprocity theorem. In this study, we also analyzed the sensitivity of the electric potential on the earth’s surface to the conductivity in each cell underground and introduced an optimized weighting function to produce new sensitivity matrix. The synthetic model study shows that this optimized weighting function is helpful to improve the resolution of deep anomaly. By incorporating topography into inversion, the artificial anomaly which is actually caused by topography can be eliminated. As a result, this algorithm potentially can be applied to process the DC resistivity data collected in mountain area. Our synthetic model study also shows that the convergence and computation speed are very stable and fast.

Solution to Two-Dimensional Steady Inverse Heat Transfer Problems with Interior Heat Source Based on the Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Shoubin Wang

2017-01-01

Full Text Available The compound variable inverse problem which comprises boundary temperature distribution and surface convective heat conduction coefficient of two-dimensional steady heat transfer system with inner heat source is studied in this paper applying the conjugate gradient method. The introduction of complex variable to solve the gradient matrix of the objective function obtains more precise inversion results. This paper applies boundary element method to solve the temperature calculation of discrete points in forward problems. The factors of measuring error and the number of measuring points zero error which impact the measurement result are discussed and compared with L-MM method in inverse problems. Instance calculation and analysis prove that the method applied in this paper still has good effectiveness and accuracy even if measurement error exists and the boundary measurement points’ number is reduced. The comparison indicates that the influence of error on the inversion solution can be minimized effectively using this method.

Regularized variable metric method versus the conjugate gradient method in solution of radiative boundary design problem

International Nuclear Information System (INIS)

Kowsary, F.; Pooladvand, K.; Pourshaghaghy, A.

2007-01-01

In this paper, an appropriate distribution of the heating elements' strengths in a radiation furnace is estimated using inverse methods so that a pre-specified temperature and heat flux distribution is attained on the design surface. Minimization of the sum of the squares of the error function is performed using the variable metric method (VMM), and the results are compared with those obtained by the conjugate gradient method (CGM) established previously in the literature. It is shown via test cases and a well-founded validation procedure that the VMM, when using a 'regularized' estimator, is more accurate and is able to reach at a higher quality final solution as compared to the CGM. The test cases used in this study were two-dimensional furnaces filled with an absorbing, emitting, and scattering gas

An inverse hyperbolic heat conduction problem in estimating surface heat flux by the conjugate gradient method

International Nuclear Information System (INIS)

Huang, C.-H.; Wu, H.-H.

2006-01-01

In the present study an inverse hyperbolic heat conduction problem is solved by the conjugate gradient method (CGM) in estimating the unknown boundary heat flux based on the boundary temperature measurements. Results obtained in this inverse problem will be justified based on the numerical experiments where three different heat flux distributions are to be determined. Results show that the inverse solutions can always be obtained with any arbitrary initial guesses of the boundary heat flux. Moreover, the drawbacks of the previous study for this similar inverse problem, such as (1) the inverse solution has phase error and (2) the inverse solution is sensitive to measurement error, can be avoided in the present algorithm. Finally, it is concluded that accurate boundary heat flux can be estimated in this study

Improved integrability of the gradients of solutions of elliptic equations with variable nonlinearity exponent

International Nuclear Information System (INIS)

Zhikov, Vasilii V; Pastukhova, Svetlana E

2008-01-01

Elliptic equations of p(x)-Laplacian type are investigated. There is a well-known logarithmic condition on the modulus of continuity of the nonlinearity exponent p(x), which ensures that a Laplacian with variable order of nonlinearity inherits many properties of the usual p-Laplacian of constant order. One of these is the so-called improved integrability of the gradient of the solution. It is proved in this paper that this property holds also under a slightly more general condition on the exponent p(x), although then the improvement of integrability is logarithmic rather than power-like. The method put forward is based on a new generalization of Gehring's lemma, which relies upon the reverse Hoelder inequality 'with increased support and exponent on the right-hand side'. A counterexample is constructed that reveals the extent to which the condition on the modulus of continuity obtained is sharp. Bibliography: 28 titles.

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

Science.gov (United States)

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.

50 years of nonlinear optics

International Nuclear Information System (INIS)

Shen Yuanrang

2011-01-01

This article presents a brief introduction to the birth and early investigations of nonlinear optics, such as second harmonic generation,sum and difference frequency generation, stimulated Raman scattering,and self-action of light etc. Several important research achievements and applications of nonlinear optics are presented as well, including nonlinear optical spectroscopy, phase conjugation and adaptive optics, coherent nonlinear optics, and high-order harmonic generation. In the end, current and future research topics in nonlinear optics are summarized. (authors)

Refined isogeometric analysis for a preconditioned conjugate gradient solver

KAUST Repository

Garcia, Daniel

2018-02-12

Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C0 hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55) Garcia et al. (2017). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree p=3, the iterative solver is approximately 2.6 times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers.

Inelastic scattering with Chebyshev polynomials and preconditioned conjugate gradient minimization.

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Non-linear education gradient across the nutrition transition: mothers’ overweight and the population education transition

Science.gov (United States)

Salinas, Daniel; Baker, David P

2015-01-01

Objective Previous studies found that developed and developing countries present opposite education-overweight gradients but have not considered the dynamics at different levels of national development. A U-inverted curve is hypothesized to best describe the education-overweight association. It is also hypothesized that as the nutrition transition unfolds within nations the shape of education-overweight curve change. Design Multi-level logistic regression estimates the moderating effect of the nutrition transition at the population level on education-overweight gradient. At the individual level, a non-linear estimate of the education association assesses the optimal functional form of the association across the nutrition transition. Setting Twenty-two administrations of the Demographic and Health Survey, collected at different time points across the nutrition transition in nine Latin American/Caribbean countries. Subjects Mothers of reproductive age (15–49) in each administration (n 143,258). Results In the pooled sample, a non-linear education gradient on mothers‘ overweight is found; each additional year of schooling increases the probability of being overweight up to the end of primary schooling, after which each additional year of schooling decreases the probability of overweight. Also, as access to diets of high animal fats and sweeteners increases over time, the curve‘s critical point moves to lower education levels, the detrimental positive effect of education diminishes, and both occur as the overall risk of overweight increases with greater access to harmful diets. Conclusions Both hypotheses are supported. As the nutrition transition progresses, the education-overweight curve steadily shifts to a negative linear association with higher average risk of overweight; and education, at increasingly lower levels, acts as a “social vaccine” against increasing risk of overweight. These empirical patterns fit the general “population education

Embedding SAS approach into conjugate gradient algorithms for asymmetric 3D elasticity problems

Energy Technology Data Exchange (ETDEWEB)

Chen, Hsin-Chu; Warsi, N.A. [Clark Atlanta Univ., GA (United States); Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)

1996-12-31

In this paper, we present two strategies to embed the SAS (symmetric-and-antisymmetric) scheme into conjugate gradient (CG) algorithms to make solving 3D elasticity problems, with or without global reflexive symmetry, more efficient. The SAS approach is physically a domain decomposition scheme that takes advantage of reflexive symmetry of discretized physical problems, and algebraically a matrix transformation method that exploits special reflexivity properties of the matrix resulting from discretization. In addition to offering large-grain parallelism, which is valuable in a multiprocessing environment, the SAS scheme also has the potential for reducing arithmetic operations in the numerical solution of a reasonably wide class of scientific and engineering problems. This approach can be applied directly to problems that have global reflexive symmetry, yielding smaller and independent subproblems to solve, or indirectly to problems with partial symmetry, resulting in loosely coupled subproblems. The decomposition is achieved by separating the reflexive subspace from the antireflexive one, possessed by a special class of matrices A, A {element_of} C{sup n x n} that satisfy the relation A = PAP where P is a reflection matrix (symmetric signed permutation matrix).

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

International Nuclear Information System (INIS)

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

2015-01-01

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

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

Science.gov (United States)

Whiteley, J. P.

2017-10-01

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

Picosecond phase conjugation in two-photon absorption in poly-di-acetylenes

International Nuclear Information System (INIS)

Nunzi, Dominique Jean-Michel

1990-01-01

Poly-di-acetylenes exhibit a large two-photon absorption at 1064 nm wavelength. Its different effects on phase-conjugate nonlinearity are described in the framework of picosecond experiments. In solutions, gels, and films (optically thin media), third-order susceptibility appears as an increasing intensity dependent function. Phase measurements by nonlinear interferometry with the substrate or with the solvent are compared with predictions of a resonantly driven three level system. Phase-conjugate response exhibits a multi-exponential decay. Polarization symmetries analysis shows a one-dimensional effect. Study under strong static electric field action reveals that we face charged species bound to photoconductive polymer chains. In PTS single crystals (optically thick media), response saturates and cancels at high light intensity. This is well accounted for by propagation equations solved in large two-photon absorption conditions. The effect is exploited in a phase conjugation experiment under external optical pump excitation. We thus demonstrate that enhanced nonlinearity is a two-photon absorption relayed and amplified by mid-gap absorbing species which have been created by this two-photon absorption. We formally face a four-photon absorption described by a positive imaginary seventh-order non-linearity. (author) [fr

Computation of fields in an arbitrarily shaped heterogeneous dielectric or biological body by an iterative conjugate gradient method

International Nuclear Information System (INIS)

Wang, J.J.H.; Dubberley, J.R.

1989-01-01

Electromagnetic (EM) fields in a three-dimensional, arbitrarily shaped heterogeneous dielectric or biological body illuminated by a plane wave are computed by an iterative conjugate gradient method. The method is a generalized method of moments applied to the volume integral equation. Because no matrix is explicitly involved or stored, the present iterative method is capable of computing EM fields in objects an order of magnitude larger than those that can be handled by the conventional method of moments. Excellent numerical convergence is achieved. Perfect convergence to the result of the conventional moment method using the same basis and weighted with delta functions is consistently achieved in all the cases computed, indicating that these two algorithms (direct and interactive) are equivalent

Effects of Conjugate Gradient Methods and Step-Length Formulas on the Multiscale Full Waveform Inversion in Time Domain: Numerical Experiments

Science.gov (United States)

Liu, Youshan; Teng, Jiwen; Xu, Tao; Badal, José; Liu, Qinya; Zhou, Bing

2017-05-01

We carry out full waveform inversion (FWI) in time domain based on an alternative frequency-band selection strategy that allows us to implement the method with success. This strategy aims at decomposing the seismic data within partially overlapped frequency intervals by carrying out a concatenated treatment of the wavelet to largely avoid redundant frequency information to adapt to wavelength or wavenumber coverage. A pertinent numerical test proves the effectiveness of this strategy. Based on this strategy, we comparatively analyze the effects of update parameters for the nonlinear conjugate gradient (CG) method and step-length formulas on the multiscale FWI through several numerical tests. The investigations of up to eight versions of the nonlinear CG method with and without Gaussian white noise make clear that the HS (Hestenes and Stiefel in J Res Natl Bur Stand Sect 5:409-436, 1952), CD (Fletcher in Practical methods of optimization vol. 1: unconstrained optimization, Wiley, New York, 1987), and PRP (Polak and Ribière in Revue Francaise Informat Recherche Opertionelle, 3e Année 16:35-43, 1969; Polyak in USSR Comput Math Math Phys 9:94-112, 1969) versions are more efficient among the eight versions, while the DY (Dai and Yuan in SIAM J Optim 10:177-182, 1999) version always yields inaccurate result, because it overestimates the deeper parts of the model. The application of FWI algorithms using distinct step-length formulas, such as the direct method ( Direct), the parabolic search method ( Search), and the two-point quadratic interpolation method ( Interp), proves that the Interp is more efficient for noise-free data, while the Direct is more efficient for Gaussian white noise data. In contrast, the Search is less efficient because of its slow convergence. In general, the three step-length formulas are robust or partly insensitive to Gaussian white noise and the complexity of the model. When the initial velocity model deviates far from the real model or the

Single-shot measurement of nonlinear absorption and nonlinear refraction.

Science.gov (United States)

Jayabalan, J; Singh, Asha; Oak, Shrikant M

2006-06-01

A single-shot method for measurement of nonlinear optical absorption and refraction is described and analyzed. A spatial intensity variation of an elliptical Gaussian beam in conjugation with an array detector is the key element of this method. The advantages of this single-shot technique were demonstrated by measuring the two-photon absorption and free-carrier absorption in GaAs as well as the nonlinear refractive index of CS2 using a modified optical Kerr setup.

Preconditioned conjugate gradient wave-front reconstructors for multiconjugate adaptive optics

Science.gov (United States)

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

2003-09-01

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

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

Science.gov (United States)

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

2003-09-10

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

Blockwise conjugate gradient methods for image reconstruction in volumetric CT.

Science.gov (United States)

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

2012-11-01

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

Iterative solution of a nonlinear system arising in phase change problems

International Nuclear Information System (INIS)

Williams, M.A.

1987-01-01

We consider several iterative methods for solving the nonlinear system arising from an enthalpy formulation of a phase change problem. We present the formulation of the problem. Implicit discretization of the governing equations results in a mildly nonlinear system at each time step. We discuss solving this system using Jacobi, Gauss-Seidel, and SOR iterations and a new modified preconditioned conjugate gradient (MPCG) algorithm. The new MPCG algorithm and its properties are discussed in detail. Numerical results are presented comparing the performance of the SOR algorithm and the MPCG algorithm with 1-step SSOR preconditioning. The MPCG algorithm exhibits a superlinear rate of convergence. The SOR algorithm exhibits a linear rate of convergence. Thus, the MPCG algorithm requires fewer iterations to converge than the SOR algorithm. However in most cases, the SOR algorithm requires less total computation time than the MPCG algorithm. Hence, the SOR algorithm appears to be more appropriate for the class of problems considered. 27 refs., 11 figs

Accurate conjugate gradient methods for families of shifted systems

NARCIS (Netherlands)

Eshof, J. van den; Sleijpen, G.L.G.

2003-01-01

We consider the solution of the linear system (ATA + σI)xσ = ATb, for various real values of σ. This family of shifted systems arises, for example, in Tikhonov regularization and computations in lattice quantum chromodynamics. For each single shift σ this system can be solved using the conjugate

Pump induced normal mode splittings in phase conjugation in a Kerr ...

Indian Academy of Sciences (India)

Abstract. Phase conjugation in a Kerr nonlinear waveguide is studied with counter-propagating normally incident pumps and a probe beam at an arbitrary angle of incidence. Detailed numerical results for the specular and phase conjugated reflectivities are obtained with full account of pump depletion. For sufficient ...

Improved Minimum Entropy Filtering for Continuous Nonlinear Non-Gaussian Systems Using a Generalized Density Evolution Equation

Directory of Open Access Journals (Sweden)

Jinliang Xu

2013-06-01

Full Text Available This paper investigates the filtering problem for multivariate continuous nonlinear non-Gaussian systems based on an improved minimum error entropy (MEE criterion. The system is described by a set of nonlinear continuous equations with non-Gaussian system noises and measurement noises. The recently developed generalized density evolution equation is utilized to formulate the joint probability density function (PDF of the estimation errors. Combining the entropy of the estimation error with the mean squared error, a novel performance index is constructed to ensure the estimation error not only has small uncertainty but also approaches to zero. According to the conjugate gradient method, the optimal filter gain matrix is then obtained by minimizing the improved minimum error entropy criterion. In addition, the condition is proposed to guarantee that the estimation error dynamics is exponentially bounded in the mean square sense. Finally, the comparative simulation results are presented to show that the proposed MEE filter is superior to nonlinear unscented Kalman filter (UKF.

An accelerated conjugate gradient algorithm to compute low-lying eigenvalues - a study for the Dirac operator in SU(2) lattice QCD

International Nuclear Information System (INIS)

Kalkreuter, T.; Simma, H.

1995-07-01

The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalizations in the subspace spanned by the numerically computed eigenvectors. We study this combined algorithm in case of the Dirac operator with (dynamical) Wilson fermions in four-dimensional SU(2) gauge fields. The algorithm is numerically very stable and can be parallelized in an efficient way. On lattices of sizes 4 4 - 16 4 an acceleration of the pure CG method by a factor of 4 - 8 is found. (orig.)

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Conjugate descent formulation of backpropagation error in ...

African Journals Online (AJOL)

nique of backpropagation was popularized in a paper by Rumelhart, et al. ... the training of a multilayer neural network using a gradient descent approach applied to a .... superior convergence of the conjugate descent method over a standard ...

Model Hamiltonian Calculations of the Nonlinear Polarizabilities of Conjugated Molecules.

Science.gov (United States)

Risser, Steven Michael

This dissertation advances the theoretical knowledge of the nonlinear polarizabilities of conjugated molecules. The unifying feature of these molecules is an extended delocalized pi electron structure. The pi electrons dominate the electronic properties of the molecules, allowing prediction of molecular properties based on the treatment of just the pi electrons. Two separate pi electron Hamiltonians are used in the research. The principal Hamiltonian used is the non-interacting single-particle Huckel Hamiltonian, which replaces the Coulomb interaction among the pi electrons with a mean field interaction. The simplification allows for exact solution of the Hamiltonian for large molecules. The second Hamiltonian used for this research is the interacting multi-particle Pariser-Parr-Pople (PPP) Hamiltonian, which retains explicit Coulomb interactions. This limits exact solutions to molecules containing at most eight electrons. The molecular properties being investigated are the linear polarizability, and the second and third order hyperpolarizabilities. The hyperpolarizabilities determine the nonlinear optical response of materials. These molecular parameters are determined by two independent approaches. The results from the Huckel Hamiltonian are obtained through first, second and third order perturbation theory. The results from the PPP Hamiltonian are obtained by including the applied field directly in the Hamiltonian and determining the ground state energy at a series of field strengths. By fitting the energy to a polynomial in field strength, the polarizability and hyperpolarizabilities are determined. The Huckel Hamiltonian is used to calculate the third order hyperpolarizability of polyenes. These calculations were the first to show the average hyperpolarizability of the polyenes to be positive, and also to show the saturation of the hyperpolarizability. Comparison of these Huckel results to those from the PPP Hamiltonian shows the lack of explicit Coulomb

Use of the preconditioned conjugate gradient method to accelerate S/sub n/ iterations

International Nuclear Information System (INIS)

Derstine, K.L.; Gelbard, E.M.

1985-01-01

It is well known that specially tailored diffusion difference equations are required in the synthetic method. The tailoring process is not trivial, and for some S/sub n/ schemes (e.g., in hexagonal geometry) tailored diffusion operators are not available. The need for alternative acceleration methods has been noted by Larsen who has, in fact, proposed two alternatives. The proposed methods, however, do not converge to the S/sub n/ solution, and their accuracy is still largely unknown. Los Alamos acceleration methods are required to converge for any mesh, no matter how coarse. Since negative flux-fix ups (normally involved when mesh widths are large) may impede convergence, it is not clear that such a strict condition is really practical. Here a lesser objective is chosen. The authors wish to develop an acceleration method useful for a wide (though finite) range of mesh widths, but to avoid the use of special diffusion difference equations. It is shown that the conjugate gradient (CG) method, with the standard box-centered (BC) diffusion equation as a preconditioner, yields an algorithm that, for fixed-source problems with isotropic scattering, is mechanically very similar to the synthetic method; but, in two-dimensional test problems in various geometries, the CG method is substantially more stable

Tripolar vortex formation in dense quantum plasma with ion-temperature-gradients

Science.gov (United States)

Qamar, Anisa; Ata-ur-Rahman, Mirza, Arshad M.

2012-05-01

We have derived system of nonlinear equations governing the dynamics of low-frequency electrostatic toroidal ion-temperature-gradient mode for dense quantum magnetoplasma. For some specific profiles of the equilibrium density, temperature, and ion velocity gradients, the nonlinear equations admit a stationary solution in the form of a tripolar vortex. These results are relevant to understand nonlinear structure formation in dense quantum plasmas in the presence of equilibrium ion-temperature and density gradients.

Tripolar vortex formation in dense quantum plasma with ion-temperature-gradients

Energy Technology Data Exchange (ETDEWEB)

Qamar, Anisa; Ata-ur-Rahman [Institute of Physics and Electronics, University of Peshawar, Khyber Pakhtoon Khwa 25000 (Pakistan); National Center for Physics Shahdrah Valley Road, Islamabad 44000 (Pakistan); Mirza, Arshad M. [Theoretical Plasma Physics Group, Physics Department, Quaid-i-Azam University, Islamabad 45320 (Pakistan)

2012-05-15

We have derived system of nonlinear equations governing the dynamics of low-frequency electrostatic toroidal ion-temperature-gradient mode for dense quantum magnetoplasma. For some specific profiles of the equilibrium density, temperature, and ion velocity gradients, the nonlinear equations admit a stationary solution in the form of a tripolar vortex. These results are relevant to understand nonlinear structure formation in dense quantum plasmas in the presence of equilibrium ion-temperature and density gradients.

Tripolar vortex formation in dense quantum plasma with ion-temperature-gradients

International Nuclear Information System (INIS)

Qamar, Anisa; Ata-ur-Rahman; Mirza, Arshad M.

2012-01-01

We have derived system of nonlinear equations governing the dynamics of low-frequency electrostatic toroidal ion-temperature-gradient mode for dense quantum magnetoplasma. For some specific profiles of the equilibrium density, temperature, and ion velocity gradients, the nonlinear equations admit a stationary solution in the form of a tripolar vortex. These results are relevant to understand nonlinear structure formation in dense quantum plasmas in the presence of equilibrium ion-temperature and density gradients.

Penyelesaian Persamaan Poisson 2D dengan Menggunakan Metode Gauss-Seidel dan Conjugate Gradien

OpenAIRE

Mahmudah, Dewi Erla; Naf'an, Muhammad Zidny

2017-01-01

In this paper we focus on solution of 2D Poisson equation numerically. 2D Poisson equation is a partial differential equation of second order elliptical type. This equation is a particular form or non-homogeneous form of the Laplace equation. The solution of 2D Poisson equation is performed numerically using Gauss Seidel method and Conjugate Gradient method. The result is the value using Gauss Seidel method and Conjugate Gradient method is same. But, consider the iteration process, the conver...

A New Modified Three-Term Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence

Directory of Open Access Journals (Sweden)

Bakhtawar Baluch

2017-01-01

Full Text Available A new modified three-term conjugate gradient (CG method is shown for solving the large scale optimization problems. The idea relates to the famous Polak-Ribière-Polyak (PRP formula. As the numerator of PRP plays a vital role in numerical result and not having the jamming issue, PRP method is not globally convergent. So, for the new three-term CG method, the idea is to use the PRP numerator and combine it with any good CG formula’s denominator that performs well. The new modification of three-term CG method possesses the sufficient descent condition independent of any line search. The novelty is that by using the Wolfe Powell line search the new modification possesses global convergence properties with convex and nonconvex functions. Numerical computation with the Wolfe Powell line search by using the standard test function of optimization shows the efficiency and robustness of the new modification.

Algorithms for parallel and vector computations

Science.gov (United States)

Ortega, James M.

1995-01-01

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

Efficient CUDA Polynomial Preconditioned Conjugate Gradient Solver for Finite Element Computation of Elasticity Problems

Directory of Open Access Journals (Sweden)

Jianfei Zhang

2013-01-01

Full Text Available Graphics processing unit (GPU has obtained great success in scientific computations for its tremendous computational horsepower and very high memory bandwidth. This paper discusses the efficient way to implement polynomial preconditioned conjugate gradient solver for the finite element computation of elasticity on NVIDIA GPUs using compute unified device architecture (CUDA. Sliced block ELLPACK (SBELL format is introduced to store sparse matrix arising from finite element discretization of elasticity with fewer padding zeros than traditional ELLPACK-based formats. Polynomial preconditioning methods have been investigated both in convergence and running time. From the overall performance, the least-squares (L-S polynomial method is chosen as a preconditioner in PCG solver to finite element equations derived from elasticity for its best results on different example meshes. In the PCG solver, mixed precision algorithm is used not only to reduce the overall computational, storage requirements and bandwidth but to make full use of the capacity of the GPU devices. With SBELL format and mixed precision algorithm, the GPU-based L-S preconditioned CG can get a speedup of about 7–9 to CPU-implementation.

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

Science.gov (United States)

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.

Self-calibrated multiple-echo acquisition with radial trajectories using the conjugate gradient method (SMART-CG).

Science.gov (United States)

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.

Rapid analysis of charge variants of monoclonal antibodies using non-linear salt gradient in cation-exchange high performance liquid chromatography.

Science.gov (United States)

Joshi, Varsha; Kumar, Vijesh; Rathore, Anurag S

2015-08-07

A method is proposed for rapid development of a short, analytical cation exchange high performance liquid chromatography method for analysis of charge heterogeneity in monoclonal antibody products. The parameters investigated and optimized include pH, shape of elution gradient and length of the column. It is found that the most important parameter for development of a shorter method is the choice of the shape of elution gradient. In this paper, we propose a step by step approach to develop a non-linear sigmoidal shape gradient for analysis of charge heterogeneity for two different monoclonal antibody products. The use of this gradient not only decreases the run time of the method to 4min against the conventional method that takes more than 40min but also the resolution is retained. Superiority of the phosphate gradient over sodium chloride gradient for elution of mAbs is also observed. The method has been successfully evaluated for specificity, sensitivity, linearity, limit of detection, and limit of quantification. Application of this method as a potential at-line process analytical technology tool has been suggested. Copyright © 2015 Elsevier B.V. All rights reserved.

Quarter-Sweep Iteration Concept on Conjugate Gradient Normal Residual Method via Second Order Quadrature - Finite Difference Schemes for Solving Fredholm Integro-Differential Equations

International Nuclear Information System (INIS)

Aruchunan, E.

2015-01-01

In this paper, we have examined the effectiveness of the quarter-sweep iteration concept on conjugate gradient normal residual (CGNR) iterative method by using composite Simpson's (CS) and finite difference (FD) discretization schemes in solving Fredholm integro-differential equations. For comparison purposes, Gauss- Seidel (GS) and the standard or full- and half-sweep CGNR methods namely FSCGNR and HSCGNR are also presented. To validate the efficacy of the proposed method, several analyses were carried out such as computational complexity and percentage reduction on the proposed and existing methods. (author)

Linear and nonlinear dynamics of electron temperature gradient mode in non-Maxwellian plasmas

Energy Technology Data Exchange (ETDEWEB)

Zakir, U.; Qamar, A. [Institute of Physics and Electronics, University of Peshawar, Peshawar (Pakistan); Haque, Q. [Theoretical Plasma Physics Division, PINSTECH, Islamabad (Pakistan); National Centre for Physics, Islamabad (Pakistan)

2013-05-15

The effect of non-Maxwellian distributed ions on electron temperature gradient mode is investigated. The linear dispersion relation of η{sub e}−mode is obtained which shows that the behavior of this mode changes in the presence of superthermal ions. The growth rate of η{sub e}−mode driven linear instability is found and is observed to modify due to nonthermal ions. However, it is found that this leaves the electron energy transport coefficient unchanged. In the nonlinear regime, a dipolar vortex solution is derived which indicates that the dynamic behavior of the vortices changes with the inclusion of kappa distributed ions. The importance of present study with respect to space and laboratory plasmas is also pointed out.

Characterization of gradient control systems

NARCIS (Netherlands)

Cortés, Jorge; van der Schaft, Arjan; Crouch, Peter E.

2005-01-01

Given a general nonlinear affine control system with outputs and a torsion-free affine connection defined on its state space, we investigate the gradient realization problem: we give necessary and sufficient conditions under which the control system can be written as a gradient control system

Characterization of Gradient Control Systems

NARCIS (Netherlands)

Cortés, Jorge; Schaft, Arjan van der; Crouch, Peter E.

2005-01-01

Given a general nonlinear affine control system with outputs and a torsion-free affine connection defined on its state space, we investigate the gradient realization problem: we give necessary and sufficient conditions under which the control system can be written as a gradient control system

Stability of Gradient Field Corrections for Quantitative Diffusion MRI

OpenAIRE

Rogers, Baxter P.; Blaber, Justin; Welch, E. Brian; Ding, Zhaohua; Anderson, Adam W.; Landman, Bennett A.

2017-01-01

In magnetic resonance diffusion imaging, gradient nonlinearity causes significant bias in the estimation of quantitative diffusion parameters such as diffusivity, anisotropy, and diffusion direction in areas away from the magnet isocenter. This bias can be substantially reduced if the scanner- and coil-specific gradient field nonlinearities are known. Using a set of field map calibration scans on a large (29 cm diameter) phantom combined with a solid harmonic approximation of the gradient fie...

Acceptable solutions obtained by unfolding noisy data with a conjugate gradient technique

International Nuclear Information System (INIS)

Lang, D.W.

1976-01-01

A linear resolution function in a physical measurement leads to data values and standard deviations at, say, N points. It is noted that the associated resolution functions may require that a number n of particular linear combinations of the data values be each not significantly different from zero. One is left with at most N-n parameters to evaluate. If the resolution functions are reasonably behaved, one can show that one sensible way to describe the underlying spectrum treats it as a linear combination of the given resolution functions and includes all the significant information from the data. An iterative search for the best component available to minimize the chi-square of the next fit to the data leads to a conjugate gradient technique. Programs based on the technique have been successfully used to obtain neutron spectra as a function of energy; in raw data from a pulse height analysis of proton recoils in a proportional counter, and where the raw data are time of flight spectra from a time dependent pulse of known form. It is planned to incorporate these, together with working programs respectively for photonuclear analysis and to explore the impurity concentration profile in a surface, into a single ''work-bench'' type program. A suitably difficult model unfolding problem has been developed and used to show the strengths and weaknesses of a number of other methods that have been used for unfolding

Conditioning the full-waveform inversion gradient to welcome anisotropy

KAUST Repository

Alkhalifah, Tariq Ali

2015-04-23

Multiparameter full-waveform inversion (FWI) suffers from complex nonlinearity in the objective function, compounded by the eventual trade-off between the model parameters. A hierarchical approach based on frequency and arrival time data decimation to maneuver the complex nonlinearity associated with this problem usually falls short in anisotropic media. In place of data decimation, I use a model gradient filter approach to access the parts of the gradient more suitable to combat the potential nonlinearity and parameter trade-off. The filter is based on representing the gradient in the time-lag normalized domain, in which small scattering-angles of the gradient update are initially muted out. The model update hierarchical filtering strategy include applying varying degrees of filtering to the different anisotropic parameter updates, a feature not easily accessible to simple data decimation. Using FWI and reflection-based FWI, when the modeled data are obtained with the single-scattering theory, allows access to additional low model wavenumber components. Combining such access to wavenumbers with scattering-angle filters applied to the individual parameter gradients allows for multiple strategies to avoid complex FWI nonlinearity as well as the parameter trade-off.

All solid-state SBS phase conjugate mirror

Science.gov (United States)

Dane, C.B.; Hackel, L.A.

1999-03-09

A stimulated Brillouin scattering (SBS) phase conjugate laser mirror uses a solid-state nonlinear gain medium instead of the conventional liquid or high pressure gas medium. The concept has been effectively demonstrated using common optical-grade fused silica. An energy threshold of 2.5 mJ and a slope efficiency of over 90% were achieved, resulting in an overall energy reflectivity of >80% for 15 ns, 1 um laser pulses. The use of solid-state materials is enabled by a multi-pass resonant architecture which suppresses transient fluctuations that would otherwise result in damage to the SBS medium. This all solid state phase conjugator is safer, more reliable, and more easily manufactured than prior art designs. It allows nonlinear wavefront correction to be implemented in industrial and defense laser systems whose operating environments would preclude the introduction of potentially hazardous liquids or high pressure gases. 8 figs.

A primal–dual hybrid gradient method for nonlinear operators with applications to MRI

KAUST Repository

Valkonen, Tuomo

2014-05-01

We study the solution of minimax problems min xmax yG(x) + K(x), y - F*(y) in finite-dimensional Hilbert spaces. The functionals G and F* we assume to be convex, but the operator K we allow to be nonlinear. We formulate a natural extension of the modified primal-dual hybrid gradient method, originally for linear K, due to Chambolle and Pock. We prove the local convergence of the method, provided various technical conditions are satisfied. These include in particular the Aubin property of the inverse of a monotone operator at the solution. Of particular interest to us is the case arising from Tikhonov type regularization of inverse problems with nonlinear forward operators. Mainly we are interested in total variation and second-order total generalized variation priors. For such problems, we show that our general local convergence result holds when the noise level of the data f is low, and the regularization parameter α is correspondingly small. We verify the numerical performance of the method by applying it to problems from magnetic resonance imaging (MRI) in chemical engineering and medicine. The specific applications are in diffusion tensor imaging and MR velocity imaging. These numerical studies show very promising performance. © 2014 IOP Publishing Ltd.

Gradient-type methods in inverse parabolic problems

International Nuclear Information System (INIS)

Kabanikhin, Sergey; Penenko, Aleksey

2008-01-01

This article is devoted to gradient-based methods for inverse parabolic problems. In the first part, we present a priori convergence theorems based on the conditional stability estimates for linear inverse problems. These theorems are applied to backwards parabolic problem and sideways parabolic problem. The convergence conditions obtained coincide with sourcewise representability in the self-adjoint backwards parabolic case but they differ in the sideways case. In the second part, a variational approach is formulated for a coefficient identification problem. Using adjoint equations, a formal gradient of an objective functional is constructed. A numerical test illustrates the performance of conjugate gradient algorithm with the formal gradient.

Optical phase conjugation for time-domain undoing of dispersive self-phase-modulation effects

International Nuclear Information System (INIS)

Fisher, R.A.; Suydam, B.R.; Yevick, D.

1983-01-01

We show that the temporal distortion and spectral broadening of a pulse generated by the combined effects of group-velocity dispersion and self-phase modulation is removed by reflection of a cw-pumped, broadband, unity-reflecting Kerr-like optical phase conjugator followed by retraversal of the nonlinear medium. We also examine numerically the effects of finite linear loss in the material, of nonunity conjugate reflectivity, and of finite conjugator thickness

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

Science.gov (United States)

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.

A quasi-Newton algorithm for large-scale nonlinear equations

Directory of Open Access Journals (Sweden)

Linghua Huang

2017-02-01

Full Text Available Abstract In this paper, the algorithm for large-scale nonlinear equations is designed by the following steps: (i a conjugate gradient (CG algorithm is designed as a sub-algorithm to obtain the initial points of the main algorithm, where the sub-algorithm’s initial point does not have any restrictions; (ii a quasi-Newton algorithm with the initial points given by sub-algorithm is defined as main algorithm, where a new nonmonotone line search technique is presented to get the step length α k $\\alpha_{k}$ . The given nonmonotone line search technique can avoid computing the Jacobian matrix. The global convergence and the 1 + q $1+q$ -order convergent rate of the main algorithm are established under suitable conditions. Numerical results show that the proposed method is competitive with a similar method for large-scale problems.

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

Science.gov (United States)

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.

Implementation of a conjugate gradient algorithm for thermal diffusivity identification in a moving boundaries system

International Nuclear Information System (INIS)

Perez, L; Autrique, L; Gillet, M

2008-01-01

The aim of this paper is to investigate the thermal diffusivity identification of a multilayered material dedicated to fire protection. In a military framework, fire protection needs to meet specific requirements, and operational protective systems must be constantly improved in order to keep up with the development of new weapons. In the specific domain of passive fire protections, intumescent coatings can be an effective solution on the battlefield. Intumescent materials have the ability to swell up when they are heated, building a thick multi-layered coating which provides efficient thermal insulation to the underlying material. Due to the heat aggressions (fire or explosion) leading to the intumescent phenomena, high temperatures are considered and prevent from linearization of the mathematical model describing the system state evolution. Previous sensitivity analysis has shown that the thermal diffusivity of the multilayered intumescent coating is a key parameter in order to validate the predictive numerical tool and therefore for thermal protection optimisation. A conjugate gradient method is implemented in order to minimise the quadratic cost function related to the error between predicted temperature and measured temperature. This regularisation algorithm is well adapted for a large number of unknown parameters.

Phase conjugation of gap solitons: A numerical study

Indian Academy of Sciences (India)

We study the effect of a nearby phase-conjugate mirror (PCM) on the gap soliton of a. Kerr non-linear ... They are characterized by a sech field distribution corresponding to the ... It is a generalization of the earlier model proposed by Jose et.

Scattering-angle based filtering of the waveform inversion gradients

KAUST Repository

Alkhalifah, Tariq Ali

2014-01-01

Full waveform inversion (FWI) requires a hierarchical approach to maneuver the complex non-linearity associated with the problem of velocity update. In anisotropic media, the non-linearity becomes far more complex with the potential trade-off between the multiparameter description of the model. A gradient filter helps us in accessing the parts of the gradient that are suitable to combat the potential non-linearity and parameter trade-off. The filter is based on representing the gradient in the time-lag normalized domain, in which the low scattering angle of the gradient update is initially muted out in the FWI implementation, in what we may refer to as a scattering angle continuation process. The result is a low wavelength update dominated by the transmission part of the update gradient. In this case, even 10 Hz data can produce vertically near-zero wavenumber updates suitable for a background correction of the model. Relaxing the filtering at a later stage in the FWI implementation allows for smaller scattering angles to contribute higher-resolution information to the model. The benefits of the extended domain based filtering of the gradient is not only it's ability in providing low wavenumber gradients guided by the scattering angle, but also in its potential to provide gradients free of unphysical energy that may correspond to unrealistic scattering angles.

Scattering-angle based filtering of the waveform inversion gradients

KAUST Repository

Alkhalifah, Tariq Ali

2014-11-22

Full waveform inversion (FWI) requires a hierarchical approach to maneuver the complex non-linearity associated with the problem of velocity update. In anisotropic media, the non-linearity becomes far more complex with the potential trade-off between the multiparameter description of the model. A gradient filter helps us in accessing the parts of the gradient that are suitable to combat the potential non-linearity and parameter trade-off. The filter is based on representing the gradient in the time-lag normalized domain, in which the low scattering angle of the gradient update is initially muted out in the FWI implementation, in what we may refer to as a scattering angle continuation process. The result is a low wavelength update dominated by the transmission part of the update gradient. In this case, even 10 Hz data can produce vertically near-zero wavenumber updates suitable for a background correction of the model. Relaxing the filtering at a later stage in the FWI implementation allows for smaller scattering angles to contribute higher-resolution information to the model. The benefits of the extended domain based filtering of the gradient is not only it\\'s ability in providing low wavenumber gradients guided by the scattering angle, but also in its potential to provide gradients free of unphysical energy that may correspond to unrealistic scattering angles.

Variance gradients and uncertainty budgets for nonlinear measurement functions with independent inputs

International Nuclear Information System (INIS)

Campanelli, Mark; Kacker, Raghu; Kessel, Rüdiger

2013-01-01

A novel variance-based measure for global sensitivity analysis, termed a variance gradient (VG), is presented for constructing uncertainty budgets under the Guide to the Expression of Uncertainty in Measurement (GUM) framework for nonlinear measurement functions with independent inputs. The motivation behind VGs is the desire of metrologists to understand which inputs' variance reductions would most effectively reduce the variance of the measurand. VGs are particularly useful when the application of the first supplement to the GUM is indicated because of the inadequacy of measurement function linearization. However, VGs reduce to a commonly understood variance decomposition in the case of a linear(ized) measurement function with independent inputs for which the original GUM readily applies. The usefulness of VGs is illustrated by application to an example from the first supplement to the GUM, as well as to the benchmark Ishigami function. A comparison of VGs to other available sensitivity measures is made. (paper)

Nonlinear concentration gradients regulated by the width of channels for observation of half maximal inhibitory concentration (IC50) of transporter proteins.

Science.gov (United States)

Abe, Yuta; Kamiya, Koki; Osaki, Toshihisa; Sasaki, Hirotaka; Kawano, Ryuji; Miki, Norihisa; Takeuchi, Shoji

2015-08-21

This paper describes a simple microfluidic device that can generate nonlinear concentration gradients. We changed the "width" of channels that can drastically shorten the total microfluidic channel length and simplify the microfluidic network design rather than the "length" of channels. The logarithmic concentration gradients generated by the device were in good agreement with those obtained by simulation. Using this device, we evaluated a probable IC50 value of the ABC transporter proteins by the competitive transport assays at five different logarithmic concentrations. This probable IC50 value was in good agreement with an IC50 value (0.92 μM) obtained at the diluted concentrations of seven points.

Regularized image denoising based on spectral gradient optimization

International Nuclear Information System (INIS)

Lukić, Tibor; Lindblad, Joakim; Sladoje, Nataša

2011-01-01

Image restoration methods, such as denoising, deblurring, inpainting, etc, are often based on the minimization of an appropriately defined energy function. We consider energy functions for image denoising which combine a quadratic data-fidelity term and a regularization term, where the properties of the latter are determined by a used potential function. Many potential functions are suggested for different purposes in the literature. We compare the denoising performance achieved by ten different potential functions. Several methods for efficient minimization of regularized energy functions exist. Most are only applicable to particular choices of potential functions, however. To enable a comparison of all the observed potential functions, we propose to minimize the objective function using a spectral gradient approach; spectral gradient methods put very weak restrictions on the used potential function. We present and evaluate the performance of one spectral conjugate gradient and one cyclic spectral gradient algorithm, and conclude from experiments that both are well suited for the task. We compare the performance with three total variation-based state-of-the-art methods for image denoising. From the empirical evaluation, we conclude that denoising using the Huber potential (for images degraded by higher levels of noise; signal-to-noise ratio below 10 dB) and the Geman and McClure potential (for less noisy images), in combination with the spectral conjugate gradient minimization algorithm, shows the overall best performance

Scattering angle base filtering of the inversion gradients

KAUST Repository

Alkhalifah, Tariq Ali

2014-01-01

Full waveform inversion (FWI) requires a hierarchical approach based on the availability of low frequencies to maneuver the complex nonlinearity associated with the problem of velocity inversion. I develop a model gradient filter to help us access the parts of the gradient more suitable to combat this potential nonlinearity. The filter is based on representing the gradient in the time-lag normalized domain, in which low scattering angles of the gradient update are initially muted. The result are long-wavelength updates controlled by the ray component of the wavefield. In this case, even 10 Hz data can produce near zero wavelength updates suitable for a background correction of the model. Allowing smaller scattering angle to contribute provides higher resolution information to the model.

One-, two- and three-photon spectroscopy of π-conjugated dendrimers: cooperative enhancement and coherent domains

International Nuclear Information System (INIS)

Drobizhev, M.; Rebane, A.; Suo, Z.; Spangler, C.W.

2005-01-01

We use wavelength tunable femtosecond pulses to measure intrinsic (simultaneous) two-photon absorption (2PA) and three-photon absorption (3PA) molecular cross section in two series of π-conjugated dendrimers built of identical 4,4'-bis(diphenylamino) stilbene (BDPAS) and 4,4'-bis(diphenylamino) distyrylbenzene (BDPADSB) repeat units. Record large 2PA cross sections, σ 2 =10 -46 cm 4 s are obtained for the largest second-generation BDPAS-based dendrimer, as well as zeroth-generation 4-arm BDPADSB-based dendrimer. In both series, maximum 2PA cross section increases nonlinearly with the number of π-electrons, whereas for higher generations this dependence turns to linear one. 3PA cross section also increases nonlinearly with the size of the system in the series of BDPAS-based molecules, amounting a record large value, σ 3 =10 -79 cm 6 s 2 , for the largest, second-generation dendrimer. We interpret these results in terms of direct inter-branch conjugation, which facilitates cooperative enhancement of the nonlinear-optical response. We propose a simple model which allows us to determine the effective size of coherent domains (extent of conjugation), which, in turn, determines the optimum dendrimer size for most efficient nonlinear response

Non-Linear Nitrogen Cycling and Ecosystem Calcium Depletion Along a Temperate Forest Soil Nitrogen Gradient

Science.gov (United States)

Sinkhorn, E. R.; Perakis, S. S.; Compton, J. E.; Cromack, K.; Bullen, T. D.

2007-12-01

Understanding how N availability influences base cation stores is critical for assessing long-term ecosystem sustainability. Indices of nitrogen (N) availability and the distribution of nutrients in plant biomass, soil, and soil water were examined across ten Douglas-fir (Pseudotsuga menziesii) stands spanning a three-fold soil N gradient (0-10 cm: 0.21 - 0.69% N, 0-100 cm: 9.2 - 28.8 Mg N ha-1) in the Oregon Coast Range. This gradient is largely the consequence of historical inputs from N2-fixing red alder stands that can add 100-200 kg N ha-1 yr-1 to the ecosystem for decades. Annual net N mineralization and litterfall N return displayed non-linear relationships with soil N, increasing initially, and then decreasing as N-richness increased. In contrast, nitrate leaching from deep soils increased linearly across the soil N gradient and ranged from 0.074 to 30 kg N ha-1 yr-1. Soil exchangeable Ca, Mg, and K pools to 1 m depth were negatively related to nitrate losses across sites. Ca was the only base cation exhibiting concentration decreases in both plant and soil pools across the soil N gradient, and a greater proportion of total available ecosystem Ca was sequestered in aboveground plant biomass at high N, low Ca sites. Our work supports a hierarchical model of coupled N-Ca cycles across gradients of soil N enrichment, with microbial production of mobile nitrate anions leading to depletion of readily available Ca at the ecosystem scale, and plant sequestration promoting Ca conservation as Ca supply diminishes. The preferential storage of Ca in aboveground biomass at high N and low Ca sites, while critical for sustaining plant productivity, may also predispose forests to Ca depletion in areas managed for intensive biomass removal. Long-term N enrichment of temperate forest soils appears capable of sustaining an open N cycle and key symptoms of N-saturation for multiple decades after the cessation of elevated N inputs.

Conditioning the full waveform inversion gradient to welcome anisotropy

KAUST Repository

Alkhalifah, Tariq Ali

2014-01-01

Multi-parameter full waveform inversion (FWI) suffers from the complex nonlinearity in the objective function, compounded by the eventual tradeoff between the model parameters. A hierarchical approach based on frequency and arrival time data decimation to maneuver the complex nonlinearity associated with this problem usually falls short in anisotropic media. In place of data decimation, I use a model gradient filter approach to access the parts of the gradient more suitable to combat the potential nonlinearity and parameter trade off. The filter is based on representing the gradient in the time-lag normalized domain in which the small scattering angles of the gradient update is initially muted out. A model update hierarchical filtering strategy includes applying varying degree of filtering to the different parameter updates. A feature not easily accessible to simple data decimation. Using both FWI and reection based FWI (RFWI), two strategies to combat the tradeoff between anisotropic parameters are outlined.

Conditioning the full waveform inversion gradient to welcome anisotropy

KAUST Repository

Alkhalifah, Tariq Ali

2014-08-05

Multi-parameter full waveform inversion (FWI) suffers from the complex nonlinearity in the objective function, compounded by the eventual tradeoff between the model parameters. A hierarchical approach based on frequency and arrival time data decimation to maneuver the complex nonlinearity associated with this problem usually falls short in anisotropic media. In place of data decimation, I use a model gradient filter approach to access the parts of the gradient more suitable to combat the potential nonlinearity and parameter trade off. The filter is based on representing the gradient in the time-lag normalized domain in which the small scattering angles of the gradient update is initially muted out. A model update hierarchical filtering strategy includes applying varying degree of filtering to the different parameter updates. A feature not easily accessible to simple data decimation. Using both FWI and reection based FWI (RFWI), two strategies to combat the tradeoff between anisotropic parameters are outlined.

Scintillation Reduction using Conjugate-Plane Imaging (Abstract)

Science.gov (United States)

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.

Experience with the Incomplete Cholesky Conjugate Gradient method in a diffusion code

International Nuclear Information System (INIS)

Hoebel, W.

1985-01-01

For the numerical solution of sparse systems of linear equations arising from finite difference approximation of the multidimensional neutron diffusion equation fast methods are needed. Effective algorithms for scalar computers may not be likewise suitable on vector computers. In the improved version DIXY2 of the Karlsruhe two-dimensional neutron diffusion code for rectangular geometries an Incomplete Cholesky Conjugate Gradient (ICCG) algorithm has been combined with the originally implemented Cyclically Reduced 4-Lines SOR (CR4LSOR) inner iteration method. The combined procedure is automatically activated for slowly converging applications, thus leading to a drastic reduction of iterations as well as CPU-times on a scalar computer. In a follow-up benchmark study necessary modifications to ICCG and CR4LSOR for their use on a vector computer were investigated. It was found that a modified preconditioning for the ICCG algorithm restricted to the block diagonal matrix is an effective method both on scalar and vector computers. With a splitting of the 9-band-matrix in two triangular Cholesky matrices necessary inversions are performed on a scalar machine by recursive forward and backward substitutions. On vector computers an additional factorization of the triangular matrices into four bidiagonal matrices enables Buneman reduction and the recursive inversion is restricted to a small system. A similar strategy can be realized with CR4LSOR if the unvectorizable Gauss-Seidel iteration is replaced by Double Jacobi and Buneman technique for a vector computer. Compared to single line blocking over the original mesh the cyclical 4-lines reduction of the DIXY inner iteration scheme reduces numbers of iterations and CPU-times considerably

Experience with the incomplete Cholesky conjugate gradient method in a diffusion code

International Nuclear Information System (INIS)

Hoebel, W.

1986-01-01

For the numerical solution of sparse systems of linear equations arising from the finite difference approximation of the multidimensional neutron diffusion equation, fast methods are needed. Effective algorithms for scalar computers may not be likewise suitable on vector computers. In the improved version (DIXY2) of the Karlsruhe two-dimensional neutron diffusion code for rectangular geometries, an incomplete Cholesky conjugate gradient (ICCG) algorithm has been combined with the originally implemented cyclically reduced four-line successive overrelaxation (CR4LSOR) inner iteration method. The combined procedure is automatically activated for slowly converging applications, thus leading to a drastic reduction of iterations as well as CPU times on a scalar computer. In a follow-up benchmark study, necessary modifications to ICCG and CR4LSOR for use on a vector computer were investigated. It was found that a modified preconditioning for the ICCG algorithm restricted to the block diagonal matrix is an effective method both on scalar and vector computers. With a splitting of the nine-band matrix in two triangular Cholesky matrices, necessary inversions are performed on a scalar machine by recursive forward and backward substitutions. On vector computers an additional factorization of the triangular matrices into four bidiagonal matrices enables Buneman reduction, and the recursive inversion is restricted to a small system. A similar strategy can be realized with CR4LSOR if the unvectorizable Gauss-eidel iteration is replaced by Double Jacobi and Buneman techniques for a vector computer. Compared to single-line blocking over the original mesh, the cyclical four-line reduction of the DIXY inner iteration scheme reduces numbers of iterations and CPU times considerably

Identification of Random Dynamic Force Using an Improved Maximum Entropy Regularization Combined with a Novel Conjugate Gradient

Directory of Open Access Journals (Sweden)

ChunPing Ren

2017-01-01

Full Text Available We propose a novel mathematical algorithm to offer a solution for the inverse random dynamic force identification in practical engineering. Dealing with the random dynamic force identification problem using the proposed algorithm, an improved maximum entropy (IME regularization technique is transformed into an unconstrained optimization problem, and a novel conjugate gradient (NCG method was applied to solve the objective function, which was abbreviated as IME-NCG algorithm. The result of IME-NCG algorithm is compared with that of ME, ME-CG, ME-NCG, and IME-CG algorithm; it is found that IME-NCG algorithm is available for identifying the random dynamic force due to smaller root mean-square-error (RMSE, lower restoration time, and fewer iterative steps. Example of engineering application shows that L-curve method is introduced which is better than Generalized Cross Validation (GCV method and is applied to select regularization parameter; thus the proposed algorithm can be helpful to alleviate the ill-conditioned problem in identification of dynamic force and to acquire an optimal solution of inverse problem in practical engineering.

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

Science.gov (United States)

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.

Comparative performance of the conjugate gradient and SOR [Successive Over Relaxation] methods for computational thermal hydraulics

International Nuclear Information System (INIS)

King, J.B.; Anghaie, S.; Domanus, H.M.

1987-01-01

Finite difference approximations to the continuity, momentum, and energy equations in thermal hydraulics codes result in a system of N by N equations for a problem having N field points. In a three dimensional problem, N increases as the problem becomes larger or more complex, and more rapidly as the computational mesh size is reduced. As a consequence, the execution time required to solve the problem increases, which may lead to placing limits on the problem resolution or accuracy. A conventinal method of solution of these systems of equations is the Successive Over Relaxation (SOR) technique. However, for a wide range of problems the execution time may be reduced by using a more efficient linear equation solver. One such method is the conjugate gradient method which was implemented in COMMIX-1B thermal hydraulics code. It was found that the execution time required to solve the resulting system of equations was reduced by a factor of about 2 for some problems. This paper summarizes the characteristics of these iterative solution procedures and compares their performance in modeling of a variety of reactor thermal hydraulic problems, using the COMMIX-1B computer code

Compensation of nonlinearity in a fiber-optic transmission system using frequency-degenerate phase conjugation through counter-propagating dual pump FWM in a semiconductor optical amplifier

Science.gov (United States)

Anchal, Abhishek; K, Pradeep Kumar; O'Duill, Sean; Anandarajah, Prince M.; Landais, Pascal

2018-04-01

We present a scheme of frequency-degenerate mid-span spectral inversion (MSSI) for nonlinearity compensation in fiber-optic transmission systems. The spectral inversion is obtained by using counter-propagating dual pump four-wave mixing in a semiconductor optical amplifier (SOA). Frequency-degeneracy between signal and conjugate is achieved by keeping two pump frequencies symmetrical about the signal frequency. We simulate the performance of MSSI for nonlinearity compensation by scrutinizing the improvement of the Q-factor of a 200 Gbps QPSK signal transmitted over a standard single mode fiber, as a function of launch power for different span lengths and number of spans. We demonstrate a 7.5 dB improvement in the input power dynamic range and an almost 83% increase in the transmission length for optimum MSSI parameters of -2 dBm pump power and 400 mA SOA current.

Non-linear osmosis

Science.gov (United States)

Diamond, Jared M.

1966-01-01

1. The relation between osmotic gradient and rate of osmotic water flow has been measured in rabbit gall-bladder by a gravimetric procedure and by a rapid method based on streaming potentials. Streaming potentials were directly proportional to gravimetrically measured water fluxes. 2. As in many other tissues, water flow was found to vary with gradient in a markedly non-linear fashion. There was no consistent relation between the water permeability and either the direction or the rate of water flow. 3. Water flow in response to a given gradient decreased at higher osmolarities. The resistance to water flow increased linearly with osmolarity over the range 186-825 m-osM. 4. The resistance to water flow was the same when the gall-bladder separated any two bathing solutions with the same average osmolarity, regardless of the magnitude of the gradient. In other words, the rate of water flow is given by the expression (Om — Os)/[Ro′ + ½k′ (Om + Os)], where Ro′ and k′ are constants and Om and Os are the bathing solution osmolarities. 5. Of the theories advanced to explain non-linear osmosis in other tissues, flow-induced membrane deformations, unstirred layers, asymmetrical series-membrane effects, and non-osmotic effects of solutes could not explain the results. However, experimental measurements of water permeability as a function of osmolarity permitted quantitative reconstruction of the observed water flow—osmotic gradient curves. Hence non-linear osmosis in rabbit gall-bladder is due to a decrease in water permeability with increasing osmolarity. 6. The results suggest that aqueous channels in the cell membrane behave as osmometers, shrinking in concentrated solutions of impermeant molecules and thereby increasing membrane resistance to water flow. A mathematical formulation of such a membrane structure is offered. PMID:5945254

A finite element conjugate gradient FFT method for scattering

Science.gov (United States)

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.

The disparate impact of the ion temperature gradient and the density gradient on edge transport and the low-high transition in tokamaks

International Nuclear Information System (INIS)

Kleva, Robert G.; Guzdar, Parvez N.

2009-01-01

Steepening of the ion temperature gradient in nonlinear fluid simulations of the edge region of a tokamak plasma causes a rapid degradation in confinement. As the density gradient steepens, there is a continuous improvement in confinement analogous to the low (L) to high (H) transition observed in tokamaks. In contrast, as the ion temperature gradient steepens, there is a rapid increase in the particle and energy fluxes and no L-H transition. For a given pressure gradient, confinement always improves when more of the pressure gradient arises from the density gradient, and less of the pressure gradient arises from the ion temperature gradient.

A sensitivity function-based conjugate gradient method for optical tomography with the frequency-domain equation of radiative transfer

International Nuclear Information System (INIS)

Kim, Hyun Keol; Charette, Andre

2007-01-01

The Sensitivity Function-based Conjugate Gradient Method (SFCGM) is described. This method is used to solve the inverse problems of function estimation, such as the local maps of absorption and scattering coefficients, as applied to optical tomography for biomedical imaging. A highly scattering, absorbing, non-reflecting, non-emitting medium is considered here and simultaneous reconstructions of absorption and scattering coefficients inside the test medium are achieved with the proposed optimization technique, by using the exit intensity measured at boundary surfaces. The forward problem is solved with a discrete-ordinates finite-difference method on the framework of the frequency-domain full equation of radiative transfer. The modulation frequency is set to 600 MHz and the frequency data, obtained with the source modulation, is used as the input data. The inversion results demonstrate that the SFCGM can retrieve simultaneously the spatial distributions of optical properties inside the medium within a reasonable accuracy, by significantly reducing a cross-talk between inter-parameters. It is also observed that the closer-to-detector objects are better retrieved

Conjugated heat transfer in laminar flow between parallel-plates channel

International Nuclear Information System (INIS)

Guedes, R.O.C.; Cotta, R.M.; Brum, N.C.L.

1989-01-01

An analysis is made of conjugated convective-conductive heat transfer in laminar flow of a newtonian fluid between parallel-plates channel, taking into account the longitudinal conduction along the duct walls only, by neglecting the transversal temperature gradients in the solid. This extended Graetz-type problem is then analytically handled through the generalized integral transform technique, providing accurate numerical results for quantities of practical interest sucyh as bulk and wall temperatures, and Nusselt numbers. The effects of a conjugation parameter and Biot number on heat transfer behavior are then investigated. (author)

Application of heat-balance integral method to conjugate thermal explosion

Directory of Open Access Journals (Sweden)

Novozhilov Vasily

2009-01-01

Full Text Available Conjugate thermal explosion is an extension of the classical theory, proposed and studied recently by the author. The paper reports application of heat-balance integral method for developing phase portraits for systems undergoing conjugate thermal explosion. The heat-balance integral method is used as an averaging method reducing partical differential equation problem to the set of first-order ordinary differential equations. The latter reduced problem allows natural interpretation in appropriately chosen phase space. It is shown that, with the help of heat-balance integral technique, conjugate thermal explosion problem can be described with a good accuracy by the set of non-linear first-order differential equations involving complex error function. Phase trajectories are presented for typical regimes emerging in conjugate thermal explosion. Use of heat-balance integral as a spatial averaging method allows efficient description of system evolution to be developed.

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

Science.gov (United States)

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.

Theory of resistivity-gradient-driven turbulence

International Nuclear Information System (INIS)

Garcia, L.; Carreras, B.A.; Diamond, P.H.; Callen, J.D.

1984-10-01

A theory of the nonlinear evolution and saturation of resistivity-driven turbulence, which evolves from linear rippling instabilities, is presented. The nonlinear saturation mechanism is identified both analytically and numerically. Saturation occurs when the turbulent diffusion of the resistivity is large enough so that dissipation due to parallel electron thermal conduction balances the nonlinearly modified resistivity gradient driving term. The levels of potential, resistivity, and density fluctuations at saturation are calculated. A combination of computational modeling and analytic treatment is used in this investigation

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

Science.gov (United States)

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.

Antibody-radioisotope conjugates for tumor localization and treatment

International Nuclear Information System (INIS)

Larson, S.M.; Carrasquillo, J.A.

1985-01-01

In principle, anti-tumor antibodies can be used to carry radioactivity to tumors for in-vivo diagnosis and treatment of cancer. First, for diagnostic purposes, an antibody that targets a specific antigen (for example, the p97 antigen of human melanoma tumor), is labeled with a tracer amount of radioactivity. When this antibody-radioisotope conjugate is injected into the blood stream, the antibody carries the radioactivity throughout the body and in time, percolates through all the tissues of the body. Because the tumor has specific antigens to which the antibody can bind, the antibody conjugate progressively accumulates in the tumor. Using conventional nuclear medicine imaging equipment, the body of the patient is scanned for radioactivity content, and a map of the distribution of the radioactivity is displayed on photographic film. The tumor shows up as a dense area of radio-activity. These same antibody-radioisotope conjugates may be used for therapy of tumors, except that in this case large amounts of radioactivity are loaded on the antibody. After localization of the conjugate there is sufficient radiation deposited in the tumor of radiotherapy. The success of this approach in the clinic is determined in large measure by the concentration gradient that can be achieved between tissue antibody conjugate in tumor versus normal tissue

An adaptive nonlinear solution scheme for reservoir simulation

Energy Technology Data Exchange (ETDEWEB)

Lett, G.S. [Scientific Software - Intercomp, Inc., Denver, CO (United States)

1996-12-31

Numerical reservoir simulation involves solving large, nonlinear systems of PDE with strongly discontinuous coefficients. Because of the large demands on computer memory and CPU, most users must perform simulations on very coarse grids. The average properties of the fluids and rocks must be estimated on these grids. These coarse grid {open_quotes}effective{close_quotes} properties are costly to determine, and risky to use, since their optimal values depend on the fluid flow being simulated. Thus, they must be found by trial-and-error techniques, and the more coarse the grid, the poorer the results. This paper describes a numerical reservoir simulator which accepts fine scale properties and automatically generates multiple levels of coarse grid rock and fluid properties. The fine grid properties and the coarse grid simulation results are used to estimate discretization errors with multilevel error expansions. These expansions are local, and identify areas requiring local grid refinement. These refinements are added adoptively by the simulator, and the resulting composite grid equations are solved by a nonlinear Fast Adaptive Composite (FAC) Grid method, with a damped Newton algorithm being used on each local grid. The nonsymmetric linear system of equations resulting from Newton`s method are in turn solved by a preconditioned Conjugate Gradients-like algorithm. The scheme is demonstrated by performing fine and coarse grid simulations of several multiphase reservoirs from around the world.

Conjugate heat transfer of laminar film condensation along a horizontal plate

Energy Technology Data Exchange (ETDEWEB)

Lee, Euk Soo [Pusan National Univesity, Busan (Korea, Republic of)

2006-03-15

This paper proposes appropriate conjugate parameters and dimensionless temperatures to analysis the conjugate problem of heat conduction in solid wall coupled with laminar film condensation flow adjacent to horizontal flat plate. An efficient methods for some fluids are proposed for its solution. The momentum and energy balance equations are reduced to a nonlinear system of ordinary differential equations with four parameters: the Prandtl number, Pr, Modified Jacob number, Ja{sup *}/Pr, defined by an overall temperature difference, a property ratio {radical}{rho}{sub {iota}}{mu}{sub {iota}} {radical}{rho}{sub {upsilon}}{mu}{sub {upsilon}} and the conjugate parameter {zeta}. The obtained similarity solution reveals the effect of the conjugate parameter, and the results are compared with the simplified solution. The variations of the heat transfer rates as well as the interface temperature and frictions along the plate are shown explicitly.

Considerations of ion temperature gradient driven turbulence

International Nuclear Information System (INIS)

Cowley, S.C.; Kulsrud, R.M.

1991-02-01

The ion temperature gradient driven instability is considered in this paper. Physical pictures are presented to clarify the nature of the instability. The saturation of a single eddy is modeled by a simple nonlinear equation. We show that eddies which are elongated in the direction of the temperature gradient are the most unstable and have the highest saturation amplitudes. In a sheared magnetic field, such elongated eddies twist with the field lines. This structure is shown to be alternative to the usual Fourier mode picture in which the mode is localized around the surface where k parallel = 0. We show how these elongated twisting eddies, which are an integral part of the ''ballooning mode'' structure, could survive in a torus. The elongated eddies are shown to be unstable to secondary instabilities that are driven by the large gradients in the long eddy. We argue that this mechanism isotropizes ion temperature gradient turbulence. We further argue that the ''mixing length'' is set by this nonlinear process, not by a linear eigenmode width. 17 refs., 6 figs

A non-linear optimal control problem in obtaining homogeneous concentration for semiconductor materials

International Nuclear Information System (INIS)

Huang, C.-H.; Li, J.-X.

2006-01-01

A non-linear optimal control algorithm is examined in this study for the diffusion process of semiconductor materials. The purpose of this algorithm is to estimate an optimal control function such that the homogeneity of the concentration can be controlled during the diffusion process and the diffusion-induced stresses for the semiconductor materials can thus be reduced. The validation of this optimal control analysis utilizing the conjugate gradient method of minimization is analysed by using numerical experiments. Three different diffusion processing times are given and the corresponding optimal control functions are to be determined. Results show that the diffusion time can be shortened significantly by applying the optimal control function at the boundary and the homogeneity of the concentration is also guaranteed. This control function can be obtained within a very short CPU time on a Pentium III 600 MHz PC

Purification Efficacy of Synthetic Cannabinoid Conjugates Using High-Pressure Liquid Chromatography

Science.gov (United States)

conducted using high-pressure liquid chromatography and gradient screens to determine the most effective means of purifying the SC:dark quencher conjugates...to obtain the highest yields and purity. The purity was verified using liquid chromatographycoupled mass spectroscopy and nuclear magnetic resonance.

A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations

International Nuclear Information System (INIS)

Yoon, Jong Seon; Choi, Hyoung Gwon; Jeon, Byoung Jin; Jung, Hye Dong

2016-01-01

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations

Energy Technology Data Exchange (ETDEWEB)

Yoon, Jong Seon; Choi, Hyoung Gwon [Seoul Nat’l Univ. of Science and Technology, Seoul (Korea, Republic of); Jeon, Byoung Jin [Yonsei Univ., Seoul (Korea, Republic of); Jung, Hye Dong [Korea Electronics Technology Institute, Seongnam (Korea, Republic of)

2016-09-15

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

Two novel plasma diagnostic tools: fiber sensors and phase conjugation

International Nuclear Information System (INIS)

Jahoda, F.C.

1985-01-01

A rapidly developing technology (single-mode optical fiber sensors) and recent fundamental research in nonlinear optics (phase conjugation) both offer opportunities for novel plasma diagnostics. Single-mode fiber sensors can replace electrical wire probes for current and magnetic field measurements with advantages in voltage insulation requirements, electromagnetic noise immunity, much greater bandwidth, and some configuration flexibility. Faraday rotation measurements through fibers wound on the ZT-40M RFP have demonstrated quantitative results, but competing linear birefringence effects still hinder independent interpretation. Twisted fiber may solve this problem. Optical phase conjugation (in which a phase reversed copy of a laser beam is generated) allows real time distortion corrections in laser diagnostics. Self-pumped phase conjugation in BaTiO 3 improves the quality of phase conjugation imagery and greatly simplifies experimentation directed toward plasma diagnostics. Our initial applications are a) time-differential refractometry with high spatial resolution and b) intracavity absorption Zeeman spectroscopy

Do Quercus ilex woodlands undergo abrupt non-linear functional changes in response to human disturbance along a climatic gradient?

Science.gov (United States)

Bochet, Esther; García-Fayos, Patricio; José Molina, Maria; Moreno de las Heras, Mariano; Espigares, Tíscar; Nicolau, Jose Manuel; Monleon, Vicente

2017-04-01

Theoretical models predict that drylands are particularly prone to suffer critical transitions with abrupt non-linear changes in their structure and functions as a result of the existing complex interactions between climatic fluctuations and human disturbances. However, so far, few studies provide empirical data to validate these models. We aim at determining how holm oak (Quercus ilex) woodlands undergo changes in their functions in response to human disturbance along an aridity gradient (from semi-arid to sub-humid conditions), in eastern Spain. For that purpose, we used (a) remote-sensing estimations of precipitation-use-efficiency (PUE) from enhanced vegetation index (EVI) observations performed in 231x231 m plots of the Moderate Resolution Imaging Spectroradiometer (MODIS); (b) biological and chemical soil parameter determinations (extracellular soil enzyme activity, soil respiration, nutrient cycling processes) from soil sampled in the same plots; (c) vegetation parameter determinations (ratio of functional groups) from vegetation surveys performed in the same plots. We analyzed and compared the shape of the functional change (in terms of PUE and soil and vegetation parameters) in response to human disturbance intensity for our holm oak sites along the aridity gradient. Overall, our results evidenced important differences in the shape of the functional change in response to human disturbance between climatic conditions. Semi-arid areas experienced a more accelerated non-linear decrease with an increasing disturbance intensity than sub-humid ones. The proportion of functional groups (herbaceous vs. woody cover) played a relevant role in the shape of the functional response of the holm oak sites to human disturbance.

Nonlinear Suppression of Range Ambiguity in Pulse Doppler Radar

National Research Council Canada - National Science Library

Anderson, Jon

2001-01-01

... ambiguities in Doppler and range. First introduced by Palermo in 1962 using two conjugate LFM pulses, the primary nonlinear suppression objective involves reducing range ambiguity, given the waveform is nominally unambiguous...

The influence of an interfacial heat release on nonlinear convective regimes under the action of an imposed temperature gradient

Energy Technology Data Exchange (ETDEWEB)

Simanovskii, Ilya B, E-mail: cesima@tx.technion.ac.il [Department of Mathematics, Technion—Israel Institute of Technology, 32000 Haifa (Israel)

2016-12-15

The influence of an interfacial heat release on nonlinear convective regimes, developed under the action of an imposed temperature gradient in the 47v2 silicone oil–water system, has been studied. Two types of boundary conditions—periodic boundary conditions and rigid heat-insulated lateral walls—have been considered. Transitions between the flows with different spatial structures have been investigated. It is shown that the presence of an interfacial heat release can change the sequence of bifurcations and can lead to the appearance of new oscillatory regimes. The period-three phase trajectory has been found. (paper)

Matching bunched beams to alternating gradient focusing systems

International Nuclear Information System (INIS)

Lysenko, W.P.

1980-07-01

A numerical procedure for generating phase-space distributions matched to alternating gradient focusing systems has been tested. For a smooth-focusing system a matched distribution can be calculated. With a particle tracing simulation code such a distribution can be followed while adiabatically deforming the focusing forces until an alternating gradient configuration is reached. The distribution remains matched; that is, the final distribution is periodic with the structure period. This method is useful because it can produce distributions matched to nonlinear forces. This is a feature that elliptical distributions, with ellipse parameters obtained from the Courant-Snyder theory, do not have. External nonlinearities, including nonlinear couplings, were included in our examples but space charge was not. This procedure is expected to work with space charge but will require a three-dimensional space charge calculation in the simulation code

Distinguishing the Effects of Bond-Length Alternation versus Bond-Order Alternation on the Nonlinear Optical Properties of π-Conjugated Chromophores

KAUST Repository

Gieseking, Rebecca L.; Risko, Chad; Bredas, Jean-Luc

2015-01-01

Understanding the relationships between the molecular nonlinear optical (NLO) properties and the bond-length alternation (BLA) or π-bond-order alternation (BOA) along the molecular backbone of linear π-conjugated systems has proven widely useful in the development of NLO organic chromophores and materials. Here, we examine model polymethines to elucidate the reliability of these relationships. While BLA is solely a measure of molecular geometric structure, BOA includes information pertaining to the electronic structure. As a result, BLA is found to be a good predictor of NLO properties only when optimized geometries are considered, whereas BOA is more broadly applicable. Proper understanding of the distinction between BLA and BOA is critical when designing computational studies of NLO properties, especially for molecules in complex environments or in nonequilibrium geometries. © 2015 American Chemical Society.

Distinguishing the Effects of Bond-Length Alternation versus Bond-Order Alternation on the Nonlinear Optical Properties of π-Conjugated Chromophores

KAUST Repository

Gieseking, Rebecca L.

2015-06-18

Understanding the relationships between the molecular nonlinear optical (NLO) properties and the bond-length alternation (BLA) or π-bond-order alternation (BOA) along the molecular backbone of linear π-conjugated systems has proven widely useful in the development of NLO organic chromophores and materials. Here, we examine model polymethines to elucidate the reliability of these relationships. While BLA is solely a measure of molecular geometric structure, BOA includes information pertaining to the electronic structure. As a result, BLA is found to be a good predictor of NLO properties only when optimized geometries are considered, whereas BOA is more broadly applicable. Proper understanding of the distinction between BLA and BOA is critical when designing computational studies of NLO properties, especially for molecules in complex environments or in nonequilibrium geometries. © 2015 American Chemical Society.

Optimal Allocation of Thermal-Electric Decoupling Systems Based on the National Economy by an Improved Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Shuang Rong

2015-12-01

Full Text Available Aiming to relieve the large amount of wind power curtailment during the heating period in the North China region, a thermal-electric decoupling (TED approach is proposed to both bring down the constraint of forced power output of combined heat and power plants and increase the electric load level during valley load times that assist the power grid in consuming more wind power. The operating principles of the thermal-electric decoupling approach is described, the mathematical model of its profits is developed, the constraint conditions of its operation are listed, also, an improved parallel conjugate gradient is utilized to bypass the saddle problem and accelerate the optimal speed. Numerical simulations are implemented and reveal an optimal allocation of TED which with a rated power of 280 MW and 185 MWh heat storage capacity are possible. This allocation of TED could bring approximately 16.9 billion Yuan of economic profit and consume more than 80% of the surplus wind energy which would be curtailed without the participation of TED. The results in this article verify the effectiveness of this method that could provide a referential guidance for thermal-electric decoupling system allocation in practice.

Gradiometer Based on Nonlinear Magneto-Optic Rotation, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — This Phase I SBIR project will demonstrate sensitive measurements of magnetic field gradients by nonlinear atomic spectroscopy. The gradients are determined by...

Nonlinear Optics: Materials, Fundamentals, and Applications. Postdeadline papers

Science.gov (United States)

1992-08-01

The Nonlinear Optics: Materials, Fundamentals, and Applications conference was held on 17-21 Aug. 1992. The following topics were addressed: subpicosecond time resolved four-wave mixing spectroscopy in heteroepitaxial ZnSe thin layers; anisotropic two-photon transition in GaAs/AlGaAs multiple quantum well waveguides; two picosecond, narrow-band, tunable, optical parametric systems using BBO and LBO; second generation in an optically active liquid: experimental observation of a fourth-order optical nonlinearity due to molecular chirality; optical image recognition system implemented with a 3-D memory disk; phase-matched second-harmonic generation in waveguides of polymeric Langmuir-Blodgett films; fluence dependent dynamics observed in the resonant third-order optical response of C60 and C70 films; temporal modulation of spatial optical solitons: a variational approach; measurements of light-scattering noise during two-wave mixing in a Kerr medium; excess noise introduced by beam propagation through an atomic vapor; an approach to all-optical switching based on second-order nonlinearities; multilayer, nonlinear ARROW waveguides for surface emitted sum-frequency mixing; energy scaling of SBS phase conjugate mirrors to 4J; vector versus scalar theory for the double phase conjugate mirror; cross-talk and error probability in counter-beam lambda-multiplexed digital holograms; and modal growth of SHG in doped silica thin film waveguides.

Solar multi-conjugate adaptive optics performance improvement

Science.gov (United States)

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.

Aplicação do pré-condicionador Multigrid Algébrico baseado em Wavelet no cálculo de campos magnéticos não lineares

Directory of Open Access Journals (Sweden)

Fabio Henrique Pereira

2009-01-01

Full Text Available In this work the performance of ¿-cycle wavelet-based algebraic multigrid preconditioner for iterative methods is investigated. The method is applied as a preconditioner for the classical iterative methods Bi-Conjugate Gradient Stabilized (BiCGStab, Generalized Minimum Residual (GMRes and Conjugate Gradient (CG to the solution of non-linear system of algebraic equations from the analysis of a switched reluctance motor with ferromagnetic material the steel S45C and nonlinear magnetization curve, associated with the Newton-Raphson algorithm. Particular attention has been focused in both V- and W-cycle convergence factors, as well as the CPU time. Numerical results show the efficiency of the proposed techniques when compared with classical preconditioner, such as Incomplete Cholesky and Incomplete LU decomposition.

The nonlinear CWFA [Cherenkov Wakefield Accelerator

International Nuclear Information System (INIS)

Schoessow, P.

1989-01-01

The possible use of nonlinear media to enhance the performance of the Cherenkov Wakefield Accelerator (CWFA) is considered. Numerical experiments have been performed using a new wakefield code which demonstrate larger gradients and transformer ratios in the nonlinear CWFA than are obtained in the linear case. 7 refs., 3 figs

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

2013-10-01

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

Is the temperature gradient or the derivative of the density gradient responsible for drift solitons?

International Nuclear Information System (INIS)

Salat, A.

1990-01-01

In conventional drift wave theory the density gradient κ n =d lnn/dχ determines the linear phase velocity, and the (electron) temperature gradient κ T =d lnT/dχ gives rise to a nonlinear term which leads to the existence of soliton-type solutions and solitary waves. LAKHIN, MIKHAILOVSKI and ONISHCHENKO, Phys. Lett. A 119, 348 (1987) and Plasma Phys. and Contr. Fus. 30, 457 (1988), recently claimed that it is not κ T but essentially the derivative of the density gradient, dκ n /dχ, that is relevant. This claim is refuted by means of an expansion scheme in ε=eΦ/T≤1, where Φ is the drift wave potential. (orig.)

NONLINEAR OPTICAL EFFECTS: Four-wave resonant parametric interaction with signal phase conjugation in a wide-band pump field

Science.gov (United States)

Barashkov, M. S.; Iskanderov, N. A.

1987-08-01

An analysis is made of the reduction of the fluctuations introduced in the intensity of the phase conjugate wave and of the reduction in the time for establishment of quasisteady conjugation conditions and in the relaxation time of the intensity of the conjugate wave after switching on of the pump fields in the case of stochastic excitation of a transition. It is shown that, in principle, it is possible to generate a narrow-band pump-induced component of the conjugate wave spectrum.

Effects of high light intensities on the optical Kerr nonlinearity of semiconducting polymers

International Nuclear Information System (INIS)

Charra, Fabrice

1990-01-01

Experimental investigations, in the picosecond time scale, of the Kerr type optical nonlinearity (or pump and probe) are presented. The nonlinear molecules semiconducting polymers of the type poly-diacetylene. The degenerate case (pump and probe at the same frequency) has been studied by four wave mixing at 1064 nm, in the configuration of phase conjugation. It is shown that the response is dominated by high orders of nonlinearity. The results are analysed in terms of two photon resonance. The non-degenerate case is studied by two wave mixing or in the optical Kerr gate experiment. The optical Stark effect and the differential spectra of photoinduced species are analysed. Two photon excitations at 1064 nm and one photon excitations at 532 nm are compared. A consequence of the mechanism of the nonlinearity is the possibility of generating phase conjugate waves at double frequency. The theoretical analysis and the experimental demonstration of this process are presented. The experiment is only sensitive to nonlinearities of the fifth order or more and thus allows to clarify its origins and dynamics. Finally, quantum modelling and calculations of the nonlinear optical responses, developed for the interpretations of the above experiments, are presented. (author) [fr

Correction of Gradient Nonlinearity Bias in Quantitative Diffusion Parameters of Renal Tissue with Intra Voxel Incoherent Motion.

Science.gov (United States)

Malyarenko, Dariya I; Pang, Yuxi; Senegas, Julien; Ivancevic, Marko K; Ross, Brian D; Chenevert, Thomas L

2015-12-01

Spatially non-uniform diffusion weighting bias due to gradient nonlinearity (GNL) causes substantial errors in apparent diffusion coefficient (ADC) maps for anatomical regions imaged distant from magnet isocenter. Our previously-described approach allowed effective removal of spatial ADC bias from three orthogonal DWI measurements for mono-exponential media of arbitrary anisotropy. The present work evaluates correction feasibility and performance for quantitative diffusion parameters of the two-component IVIM model for well-perfused and nearly isotropic renal tissue. Sagittal kidney DWI scans of a volunteer were performed on a clinical 3T MRI scanner near isocenter and offset superiorly. Spatially non-uniform diffusion weighting due to GNL resulted both in shift and broadening of perfusion-suppressed ADC histograms for off-center DWI relative to unbiased measurements close to isocenter. Direction-average DW-bias correctors were computed based on the known gradient design provided by vendor. The computed bias maps were empirically confirmed by coronal DWI measurements for an isotropic gel-flood phantom. Both phantom and renal tissue ADC bias for off-center measurements was effectively removed by applying pre-computed 3D correction maps. Comparable ADC accuracy was achieved for corrections of both b -maps and DWI intensities in presence of IVIM perfusion. No significant bias impact was observed for IVIM perfusion fraction.

Conjugate dynamical systems: classical analogue of the quantum energy translation

International Nuclear Information System (INIS)

Torres-Vega, Gabino

2012-01-01

An aspect of quantum mechanics that has not been fully understood is the energy shift generated by the time operator. In this study, we introduce the use of the eigensurfaces of dynamical variables and commutators in classical mechanics to study the classical analogue of the quantum translation of energy. We determine that there is a conjugate dynamical system that is conjugate to Hamilton's equations of motion, and then we generate the analogue of the time operator and use it in the translation of points along the energy direction, i.e. the classical analogue of the Pauli theorem. The theory is illustrated with a nonlinear oscillator model. (paper)

pH-gradient chromatofocusing of proteins on a chip

NARCIS (Netherlands)

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

2015-01-01

We present a novel microfluidic system for the pH-gradient focusing of proteins with the integration of 16 parallel micro-mixers, a micro-column, and a multiplexer. In this work we successfully achieved the creation of 16 non-linear gradients and the generation of a solid-phase micro-column for the

Truncated Newton-Raphson Methods for Quasicontinuum Simulations

National Research Council Canada - National Science Library

Liang, Yu; Kanapady, Ramdev; Chung, Peter W

2006-01-01

... and preconditioned nonlinear conjugate gradient implementation. Results of illustrative examples mainly focus on the number of minimization iterations to converge and CPU time for the two-dimensional nanoindentation and shearing grain boundary problems.

An approximate block Newton method for coupled iterations of nonlinear solvers: Theory and conjugate heat transfer applications

Science.gov (United States)

Yeckel, Andrew; Lun, Lisa; Derby, Jeffrey J.

2009-12-01

A new, approximate block Newton (ABN) method is derived and tested for the coupled solution of nonlinear models, each of which is treated as a modular, black box. Such an approach is motivated by a desire to maintain software flexibility without sacrificing solution efficiency or robustness. Though block Newton methods of similar type have been proposed and studied, we present a unique derivation and use it to sort out some of the more confusing points in the literature. In particular, we show that our ABN method behaves like a Newton iteration preconditioned by an inexact Newton solver derived from subproblem Jacobians. The method is demonstrated on several conjugate heat transfer problems modeled after melt crystal growth processes. These problems are represented by partitioned spatial regions, each modeled by independent heat transfer codes and linked by temperature and flux matching conditions at the boundaries common to the partitions. Whereas a typical block Gauss-Seidel iteration fails about half the time for the model problem, quadratic convergence is achieved by the ABN method under all conditions studied here. Additional performance advantages over existing methods are demonstrated and discussed.

Large deviations in stochastic heat-conduction processes provide a gradient-flow structure for heat conduction

International Nuclear Information System (INIS)

Peletier, Mark A.; Redig, Frank; Vafayi, Kiamars

2014-01-01

We consider three one-dimensional continuous-time Markov processes on a lattice, each of which models the conduction of heat: the family of Brownian Energy Processes with parameter m (BEP(m)), a Generalized Brownian Energy Process, and the Kipnis-Marchioro-Presutti (KMP) process. The hydrodynamic limit of each of these three processes is a parabolic equation, the linear heat equation in the case of the BEP(m) and the KMP, and a nonlinear heat equation for the Generalized Brownian Energy Process with parameter a (GBEP(a)). We prove the hydrodynamic limit rigorously for the BEP(m), and give a formal derivation for the GBEP(a). We then formally derive the pathwise large-deviation rate functional for the empirical measure of the three processes. These rate functionals imply gradient-flow structures for the limiting linear and nonlinear heat equations. We contrast these gradient-flow structures with those for processes describing the diffusion of mass, most importantly the class of Wasserstein gradient-flow systems. The linear and nonlinear heat-equation gradient-flow structures are each driven by entropy terms of the form −log ρ; they involve dissipation or mobility terms of order ρ 2 for the linear heat equation, and a nonlinear function of ρ for the nonlinear heat equation

Flexoelectricity: strain gradient effects in ferroelectrics

Energy Technology Data Exchange (ETDEWEB)

Ma Wenhui [Department of Physics, Shantou Unversity, Shantou, Guangdong 515063 (China)

2007-12-15

Mechanical strain gradient induced polarization effect or flexoelectricity in perovskite-type ferroelectric and relaxor ferroelectric ceramics was investigated. The flexoelectric coefficients measured at room temperature ranged from about 1 {mu} C m{sup -1} for lead zirconate titanate to 100 {mu} C m{sup -1} for barium strontium titanate. Flexoelectric effects were discovered to be sensitive to chemical makeup, phase symmetry, and domain structures. Based on phenomenological discussion and experimental data on flexoelectricity, the present study proposed that mechanical strain gradient field could influence polarization responses in a way analogous to electric field. Flexoelectric coefficients were found to be nonlinearly enhanced by dielectric permittivity and strain gradient. Interfacial mismatch in epitaxial thin films can give rise to high strain gradients, enabling flexoelectric effects to make a significant impact in properly engineered ferroelectric heterostructure systems.

Conjugate heat transfer effects on wall bubble nucleation in subcooled flashing flows

International Nuclear Information System (INIS)

Peterson, P.F.; Hijikata, K.

1990-01-01

A variety of models have been proposed to explain observations that large liquid superheat is required to initiate nucleation in flashing flows of subcooled liquids in nozzles, cracks and pipes. In such flows an abrupt change in the fluid temperature occurs downstream of the nucleating cavities. This paper examines the subcooling of the nucleating cavities due to conjugate heat transfer to the cold downstream fluid. This examination suggests a mechanism limiting the maximum active cavity size. Simple analysis shows that, of the total superheat required to initiate flashing, a substantial portion results from conjugate wall subcooling, which decreases the cavity vapor pressure. The specific case of flashing critical nozzle flow is examined in detail. Here boundary-layer laminarization due to the strong favorable pressure gradient aids the analysis of conjugate heat transfer

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

Science.gov (United States)

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.

Nonlinearly coupled dynamics of irregularities in the equatorial electrojet

Energy Technology Data Exchange (ETDEWEB)

Atul, J.K., E-mail: jkatulphysics@gmail.com [Department of Physics, College of Commerce under Magadh University, Patna 800020 (India); Sarkar, S. [FCIPT, Institute for Plasma Research, Gandhinagar 382428 (India); Singh, S.K. [Department of Physics, College of Commerce under Magadh University, Patna 800020 (India)

2016-04-01

Kinetic wave description is used to study the nonlinear influence of background Farley Buneman (FB) modes on the Gradient Drift (GD) modes in the equatorial electrojet ionosphere. The dominant nonlinearity is mediated through the electron flux term in the governing fluid equation which further invokes a turbulent current into the system. Electron dynamics reveals the modification in electron collision frequency and inhomogeneity scale length. It is seen that the propagation and growth rate of GD modes get modified by the background FB modes. Also, a new quasimode gets excited through the quadratic dispersion relation. Physical significance of coupled dynamics between the participating modes is also discussed. - Highlights: • Nonlinear influence of Farley Buneman mode on the Gradient drift mode, is investigated. • Electron collision frequency and density gradient scale length get modified. • A new quasimode gets excited due to the competition between these modes. • It seems to be important for modelling of Equatorial Electrojet current system.

Nonlinearly coupled dynamics of irregularities in the equatorial electrojet

International Nuclear Information System (INIS)

Atul, J.K.; Sarkar, S.; Singh, S.K.

2016-01-01

Kinetic wave description is used to study the nonlinear influence of background Farley Buneman (FB) modes on the Gradient Drift (GD) modes in the equatorial electrojet ionosphere. The dominant nonlinearity is mediated through the electron flux term in the governing fluid equation which further invokes a turbulent current into the system. Electron dynamics reveals the modification in electron collision frequency and inhomogeneity scale length. It is seen that the propagation and growth rate of GD modes get modified by the background FB modes. Also, a new quasimode gets excited through the quadratic dispersion relation. Physical significance of coupled dynamics between the participating modes is also discussed. - Highlights: • Nonlinear influence of Farley Buneman mode on the Gradient drift mode, is investigated. • Electron collision frequency and density gradient scale length get modified. • A new quasimode gets excited due to the competition between these modes. • It seems to be important for modelling of Equatorial Electrojet current system.

Prediction of municipal solid waste generation using nonlinear autoregressive network.

Science.gov (United States)

Younes, Mohammad K; Nopiah, Z M; Basri, N E Ahmad; Basri, H; Abushammala, Mohammed F M; Maulud, K N A

2015-12-01

Most of the developing countries have solid waste management problems. Solid waste strategic planning requires accurate prediction of the quality and quantity of the generated waste. In developing countries, such as Malaysia, the solid waste generation rate is increasing rapidly, due to population growth and new consumption trends that characterize society. This paper proposes an artificial neural network (ANN) approach using feedforward nonlinear autoregressive network with exogenous inputs (NARX) to predict annual solid waste generation in relation to demographic and economic variables like population number, gross domestic product, electricity demand per capita and employment and unemployment numbers. In addition, variable selection procedures are also developed to select a significant explanatory variable. The model evaluation was performed using coefficient of determination (R(2)) and mean square error (MSE). The optimum model that produced the lowest testing MSE (2.46) and the highest R(2) (0.97) had three inputs (gross domestic product, population and employment), eight neurons and one lag in the hidden layer, and used Fletcher-Powell's conjugate gradient as the training algorithm.

An extended discrete gradient formula for oscillatory Hamiltonian systems

International Nuclear Information System (INIS)

Liu Kai; Shi Wei; Wu Xinyuan

2013-01-01

In this paper, incorporating the idea of the discrete gradient method into the extended Runge–Kutta–Nyström integrator, we derive and analyze an extended discrete gradient formula for the oscillatory Hamiltonian system with the Hamiltonian H(p,q)= 1/2 p T p+ 1/2 q T Mq+U(q), where q:R→R d represents generalized positions, p:R→R d represents generalized momenta and M is an element of R dxd is a symmetric and positive semi-definite matrix. The solution of this system is a nonlinear oscillator. Basically, many nonlinear oscillatory mechanical systems with a partitioned Hamiltonian function lend themselves to this approach. The extended discrete gradient formula presented in this paper exactly preserves the energy H(p, q). We derive some properties of the new formula. The convergence is analyzed for the implicit schemes based on the discrete gradient formula, and it turns out that the convergence of the implicit schemes based on the extended discrete gradient formula is independent of ‖M‖, which is a significant property for the oscillatory Hamiltonian system. Thus, it transpires that a larger step size can be chosen for the new energy-preserving schemes than that for the traditional discrete gradient methods when applied to the oscillatory Hamiltonian system. Illustrative examples show the competence and efficiency of the new schemes in comparison with the traditional discrete gradient methods in the scientific literature. (paper)

Nonlinear Entanglement and its Application to Generating Cat States

Science.gov (United States)

Shen, Y.; Assad, S. M.; Grosse, N. B.; Li, X. Y.; Reid, M. D.; Lam, P. K.

2015-03-01

The Einstein-Podolsky-Rosen (EPR) paradox, which was formulated to argue for the incompleteness of quantum mechanics, has since metamorphosed into a resource for quantum information. The EPR entanglement describes the strength of linear correlations between two objects in terms of a pair of conjugate observables in relation to the Heisenberg uncertainty limit. We propose that entanglement can be extended to include nonlinear correlations. We examine two driven harmonic oscillators that are coupled via third-order nonlinearity can exhibit quadraticlike nonlinear entanglement which, after a projective measurement on one of the oscillators, collapses the other into a cat state of tunable size.

Stabilization of electron-scale turbulence by electron density gradient in national spherical torus experiment

Energy Technology Data Exchange (ETDEWEB)

Ruiz Ruiz, J.; White, A. E. [MIT-Plasma Science and Fusion Center, Cambridge, Massachusetts 02139 (United States); Ren, Y.; Guttenfelder, W.; Kaye, S. M.; Leblanc, B. P.; Mazzucato, E. [Princeton Plasma Physics Laboratory, Princeton, New Jersey 08543 (United States); Lee, K. C. [National Fusion Research Institute, Daejeon (Korea, Republic of); Domier, C. W. [University of California at Davis, Davis, California 95616 (United States); Smith, D. R. [University of Wisconsin-Madison, Madison, Wisconsin 53706 (United States); Yuh, H. [Nova Photonics, Inc., Princeton, New Jersey 08540 (United States)

2015-12-15

Theory and experiments have shown that electron temperature gradient (ETG) turbulence on the electron gyro-scale, k{sub ⊥}ρ{sub e} ≲ 1, can be responsible for anomalous electron thermal transport in NSTX. Electron scale (high-k) turbulence is diagnosed in NSTX with a high-k microwave scattering system [D. R. Smith et al., Rev. Sci. Instrum. 79, 123501 (2008)]. Here we report on stabilization effects of the electron density gradient on electron-scale density fluctuations in a set of neutral beam injection heated H-mode plasmas. We found that the absence of high-k density fluctuations from measurements is correlated with large equilibrium density gradient, which is shown to be consistent with linear stabilization of ETG modes due to the density gradient using the analytical ETG linear threshold in F. Jenko et al. [Phys. Plasmas 8, 4096 (2001)] and linear gyrokinetic simulations with GS2 [M. Kotschenreuther et al., Comput. Phys. Commun. 88, 128 (1995)]. We also found that the observed power of electron-scale turbulence (when it exists) is anti-correlated with the equilibrium density gradient, suggesting density gradient as a nonlinear stabilizing mechanism. Higher density gradients give rise to lower values of the plasma frame frequency, calculated based on the Doppler shift of the measured density fluctuations. Linear gyrokinetic simulations show that higher values of the electron density gradient reduce the value of the real frequency, in agreement with experimental observation. Nonlinear electron-scale gyrokinetic simulations show that high electron density gradient reduces electron heat flux and stiffness, and increases the ETG nonlinear threshold, consistent with experimental observations.

Self-pumped phase conjugation in InP:Fe using band-edge resonance and temperature stabilization - Theory and experiments

Science.gov (United States)

Millerd, James E.; Garmire, Elsa M.; Klein, Marvin B.

1992-01-01

Data showing nonlinear resonantly enhanced photorefractive response at high modulation depths in InP:Fe are presented. A simple empirical model is used to describe the behavior. Next the impact of these large-signal effects, as well as linear absorption, on the self-pumped phase-conjugate mirror is examined. Predicted performance is compared to actual measurements of a ring self-pumped phase-conjugate mirror using InP. The performance of the double-pumped phase-conjugate mirror is also examined experimentally and compared with the performance of the ring mirror.

Statistical and optimization methods to expedite neural network training for transient identification

International Nuclear Information System (INIS)

Reifman, J.; Vitela, E.J.; Lee, J.C.

1993-01-01

Two complementary methods, statistical feature selection and nonlinear optimization through conjugate gradients, are used to expedite feedforward neural network training. Statistical feature selection techniques in the form of linear correlation coefficients and information-theoretic entropy are used to eliminate redundant and non-informative plant parameters to reduce the size of the network. The method of conjugate gradients is used to accelerate the network training convergence and to systematically calculate the Teaming and momentum constants at each iteration. The proposed techniques are compared with the backpropagation algorithm using the entire set of plant parameters in the training of neural networks to identify transients simulated with the Midland Nuclear Power Plant Unit 2 simulator. By using 25% of the plant parameters and the conjugate gradients, a 30-fold reduction in CPU time was obtained without degrading the diagnostic ability of the network

Nonlinear Electromagnetic Stabilization of Plasma Microturbulence

Science.gov (United States)

Whelan, G. G.; Pueschel, M. J.; Terry, P. W.

2018-04-01

The physical causes for the strong stabilizing effect of finite plasma β on ion-temperature-gradient-driven turbulence, which far exceeds quasilinear estimates, are identified from nonlinear gyrokinetic simulations. The primary contribution stems from a resonance of frequencies in the dominant nonlinear interaction between the unstable mode, the stable mode, and zonal flows, which maximizes the triplet correlation time and therefore the energy transfer efficiency. A modification to mixing-length transport estimates is constructed, which reproduces nonlinear heat fluxes throughout the examined β range.

Thermoelectric properties of high electron concentration materials under large temperature gradients

International Nuclear Information System (INIS)

Bulat, L.P.; Stefansky, V.A.

1994-01-01

Theoretical methods of investigating of transport properties in solids under large temperature gradients are grounded. The nonlinear and non-local expressions for current density and heat flow are obtained with degenerated of current carriers gas. A number of new effects with large temperature gradients have been tested. Use of large temperature gradients leads to the increasing of the thermoelectric figure of merit. copyright 1995 American Institute of Physics

Source Estimation by Full Wave Form Inversion

Energy Technology Data Exchange (ETDEWEB)

Sjögreen, Björn [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing; Petersson, N. Anders [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing

2013-08-07

Given time-dependent ground motion recordings at a number of receiver stations, we solve the inverse problem for estimating the parameters of the seismic source. The source is modeled as a point moment tensor source, characterized by its location, moment tensor components, the start time, and frequency parameter (rise time) of its source time function. In total, there are 11 unknown parameters. We use a non-linear conjugate gradient algorithm to minimize the full waveform misfit between observed and computed ground motions at the receiver stations. An important underlying assumption of the minimization problem is that the wave propagation is accurately described by the elastic wave equation in a heterogeneous isotropic material. We use a fourth order accurate finite difference method, developed in [12], to evolve the waves forwards in time. The adjoint wave equation corresponding to the discretized elastic wave equation is used to compute the gradient of the misfit, which is needed by the non-linear conjugated minimization algorithm. A new source point moment source discretization is derived that guarantees that the Hessian of the misfit is a continuous function of the source location. An efficient approach for calculating the Hessian is also presented. We show how the Hessian can be used to scale the problem to improve the convergence of the non-linear conjugated gradient algorithm. Numerical experiments are presented for estimating the source parameters from synthetic data in a layer over half-space problem (LOH.1), illustrating rapid convergence of the proposed approach.

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

Science.gov (United States)

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.

Mechanism of linear and nonlinear optical properties of bis-thiourea cadmium chloride single crystal

International Nuclear Information System (INIS)

Yang, J.T.; Luo, S.J.; Yi, L.; Laref, A.

2013-01-01

Within the generalized gradient approximation (GGA), a calculation of the electronic structure of a semiorganic crystal named bis-thiourea cadmium chloride (BTCC) was performed, then the linear and nonlinear optical responses were obtained over a wide energy range, using a scissor energy of 1.30 eV, and our results are in good agreement with the experiments. The accurate full-potential projected augmented wave (FP-PAW) method was used. The prominent spectrum of the second harmonic generation (SHG) was successfully correlated with the dielectric function in terms of single- and double-photon resonances. Both the virtual electron (VE) and virtual hole (VH) processes make contributions to the SHG of BTCC crystal, and the VH process is enhanced by the Cd-centered tetrahedron. The SHG effect of the semiorganic material is attributed to the charge transfer (CT). The CT model for the semiorganic crystal is named as “M-Π O ⋯X”. “M” is a metal atom providing electrons, “Π O ” is a π-conjugated covalent of an organic molecule, and “X” is a high electronegativity atom. The CT across the BTCC molecule is along a π-electron conjugation covalence bond, and the delocalized electrons of sulfur provide an excellent bridge. The strong “pull” effect for the CT is due to the intramolecular hydrogen bonds provided by the chlorine with the high electron affinity.

Wavelet methods in multi-conjugate adaptive optics

International Nuclear Information System (INIS)

Helin, T; Yudytskiy, M

2013-01-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. (paper)

An Efficient Approach for Solving Mesh Optimization Problems Using Newton’s Method

Directory of Open Access Journals (Sweden)

Jibum Kim

2014-01-01

Full Text Available We present an efficient approach for solving various mesh optimization problems. Our approach is based on Newton’s method, which uses both first-order (gradient and second-order (Hessian derivatives of the nonlinear objective function. The volume and surface mesh optimization algorithms are developed such that mesh validity and surface constraints are satisfied. We also propose several Hessian modification methods when the Hessian matrix is not positive definite. We demonstrate our approach by comparing our method with nonlinear conjugate gradient and steepest descent methods in terms of both efficiency and mesh quality.

Coherent chirped pulse laser network with Mickelson phase conjugator.

Science.gov (United States)

Okulov, A Yu

2014-04-10

The mechanisms of nonlinear phase-locking of a large fiber amplifier array are analyzed. The preference is given to the most suitable configuration for a coherent coupling of thousands of fundamental spatial mode fiber beams into a single smooth beam ready for chirped pulse compression. It is shown that a Michelson phase-conjugating configuration with double passage through an array of fiber amplifiers has the definite advantage compared to a one-way fiber array coupled in a Mach-Zehnder configuration. Regardless of the amount of synchronized fiber amplifiers, the Michelson phase-conjugating interferometer is expected to do a perfect compensation of the phase-piston errors and collimation of backwardly amplified fiber beams on an entrance/output beam splitter. In both configurations, the nonlinear transformation of the stretched pulse envelope, due to gain saturation, is capable of randomizing the position of chirp inside an envelope; thus it may reduce the visibility of the interference pattern at an output beam splitter. Certain advantages are inherent to the sech-form temporal envelope because of the exponential precursor and self-similar propagation in gain medium. The Gaussian envelope is significantly compressed in a deep gain saturation regime, and the frequency chirp position inside pulse envelope is more deformed.

Development and implementation of an 84-channel matrix gradient coil.

Science.gov (United States)

Littin, Sebastian; Jia, Feng; Layton, Kelvin J; Kroboth, Stefan; Yu, Huijun; Hennig, Jürgen; Zaitsev, Maxim

2018-02-01

Design, implement, integrate, and characterize a customized coil system that allows for generating spatial encoding magnetic fields (SEMs) in a highly-flexible fashion. A gradient coil with a high number of individual elements was designed. Dimensions of the coil were chosen to mimic a whole-body gradient system, scaled down to a head insert. Mechanical shape and wire layout of each element were optimized to increase the local gradient strength while minimizing eddy current effects and simultaneously considering manufacturing constraints. Resulting wire layout and mechanical design is presented. A prototype matrix gradient coil with 12 × 7 = 84 elements consisting of two element types was realized and characterized. Measured eddy currents are gradient strengths between 24 mT∕m and 78 mT∕m could be realized locally with maximum currents of 150 A. Initial proof-of-concept imaging experiments using linear and nonlinear encoding fields are demonstrated. A shielded matrix gradient coil setup capable of generating encoding fields in a highly-flexible manner was designed and implemented. The presented setup is expected to serve as a basis for validating novel imaging techniques that rely on nonlinear spatial encoding fields. Magn Reson Med 79:1181-1191, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Effects of Plasma Shaping on Nonlinear Gyrokinetic Turbulence

Energy Technology Data Exchange (ETDEWEB)

Belli, E. A. [Princeton Plasma Physics Lab. (PPPL), Princeton, NJ (United States); Hammett, G. W. [Princeton Plasma Physics Lab. (PPPL), Princeton, NJ (United States); Dorland, W. [Univ. of Maryland, College Park, MD (United States)

2008-08-01

The effects of flux surface shape on the gyrokinetic stability and transport of tokamak plasmas are studied using the GS2 code [M. Kotschenreuther, G. Rewoldt, and W.M. Tang, Comput. Phys. Commun. 88, 128 (1995); W. Dorland, F. Jenko, M. Kotschenreuther, and B.N. Rogers, Phys. Rev. Lett. 85, 5579 (2000)]. Studies of the scaling of nonlinear turbulence with shaping parameters are performed using analytic equilibria based on interpolations of representative shapes of the Joint European Torus (JET) [P.H. Rebut and B.E. Keen, Fusion Technol. 11, 13 (1987)]. High shaping is found to be a stabilizing influence on both the linear ion-temperature-gradient (ITG) instability and the nonlinear ITG turbulence. For the parameter regime studied here, a scaling of the heat flux with elongation of χ ~ κ^-1.5 or κ^-2.0, depending on the triangularity, is observed at fixed average temperature gradient. While this is not as strong as empirical elongation scalings, it is also found that high shaping results in a larger Dimits upshift of the nonlinear critical temperature gradient due to an enhancement of the Rosenbluth-Hinton residual zonal flows.

Effects of Plasma Shaping on Nonlinear Gyrokinetic Turbulence

International Nuclear Information System (INIS)

E.A. Belli, G.W. Hammett and W. Dorland

2008-01-01

The effects of flux surface shape on the gyrokinetic stability and transport of tokamak plasmas are studied using the GS2 code [M. Kotschenreuther, G. Rewoldt, and W.M. Tang, Comput. Phys. Commun. 88, 128 (1995); W. Dorland, F. Jenko, M. Kotschenreuther, and B.N. Rogers, Phys. Rev. Lett. 85, 5579 (2000)]. Studies of the scaling of nonlinear turbulence with shaping parameters are performed using analytic equilibria based on interpolations of representative shapes of the Joint European Torus (JET) [P.H. Rebut and B.E. Keen, Fusion Technol. 11, 13 (1987)]. High shaping is found to be a stabilizing influence on both the linear ion-temperature-gradient (ITG) instability and the nonlinear ITG turbulence. For the parameter regime studied here, a scaling of the heat flux with elongation of χ ∼ κ -1.5 or κ -2.0 , depending on the triangularity, is observed at fixed average temperature gradient. While this is not as strong as empirical elongation scalings, it is also found that high shaping results in a larger Dimits upshift of the nonlinear critical temperature gradient due to an enhancement of the Rosenbluth-Hinton residual zonal flows

Nonlinear ion-mixing-mode particle transport in the dissipative trapped electron regime

International Nuclear Information System (INIS)

Ware, A.S.; Terry, P.W.

1993-09-01

The nonlinear particle transport arising from the convection of nonadiabatic electron density by ion temperature gradient driven turbulence is examined for trapped electron collisionality regimes. The renormalized dissipative nonadiabatic trapped electron phase space density response is derived and used to calculate the nonlinear particle flux along with an ansatz for the turbulently broadened frequency spectrum. In the lower temperature end of this regime, trapped electrons are collisional and all components of the quasilinear particle flux are outward (i.e., in the direction of the gradients). Nonlinear effects can alter the phase between the nonadiabatic trapped electron phase space density and the electrostatic potential, producing inward components in the particle flux. Specifically, both turbulent shifting of the peak of the frequency spectrum and nonlinear source terms in the trapped electron response can give rise to inward components. However, in the dissipative regime these terms are small and the trapped electron response remains dominantly laminar. When the trapped electrons are collisionless, there is a temperature threshold above which the electron temperature gradient driven component of the quasilinear particle flux changes sign and becomes inward. For finite amplitude turbulence, however, turbulent broadening of both the electron collisional resonance and the frequency spectrum removes tills threshold., and the temperature gradient driven component remains outward

MR-based field-of-view extension in MR/PET: B0 homogenization using gradient enhancement (HUGE).

Science.gov (United States)

Blumhagen, Jan O; Ladebeck, Ralf; Fenchel, Matthias; Scheffler, Klaus

2013-10-01

In whole-body MR/PET, the human attenuation correction can be based on the MR data. However, an MR-based field-of-view (FoV) is limited due to physical restrictions such as B0 inhomogeneities and gradient nonlinearities. Therefore, for large patients, the MR image and the attenuation map might be truncated and the attenuation correction might be biased. The aim of this work is to explore extending the MR FoV through B0 homogenization using gradient enhancement in which an optimal readout gradient field is determined to locally compensate B0 inhomogeneities and gradient nonlinearities. A spin-echo-based sequence was developed that computes an optimal gradient for certain regions of interest, for example, the patient's arms. A significant distortion reduction was achieved outside the normal MR-based FoV. This FoV extension was achieved without any hardware modifications. In-plane distortions in a transaxially extended FoV of up to 600 mm were analyzed in phantom studies. In vivo measurements of the patient's arms lying outside the normal specified FoV were compared with and without the use of B0 homogenization using gradient enhancement. In summary, we designed a sequence that provides data for reducing the image distortions due to B0 inhomogeneities and gradient nonlinearities and used the data to extend the MR FoV. Copyright © 2011 Wiley Periodicals, Inc.

Fluid simulation of tokamak ion temperature gradient turbulence with zonal flow closure model

Energy Technology Data Exchange (ETDEWEB)

Yamagishi, Osamu, E-mail: yamagisi@nifs.ac.jp; Sugama, Hideo [National Institute for Fusion Science, Toki, Gifu 509-5292 (Japan)

2016-03-15

Nonlinear fluid simulation of turbulence driven by ion temperature gradient modes in the tokamak fluxtube configuration is performed by combining two different closure models. One model is a gyrofluid model by Beer and Hammett [Phys. Plasmas 3, 4046 (1996)], and the other is a closure model to reproduce the kinetic zonal flow response [Sugama et al., Phys. Plasmas 14, 022502 (2007)]. By including the zonal flow closure, generation of zonal flows, significant reduction in energy transport, reproduction of the gyrokinetic transport level, and nonlinear upshift on the critical value of gradient scale length are observed.

Fluid simulation of tokamak ion temperature gradient turbulence with zonal flow closure model

Science.gov (United States)

Yamagishi, Osamu; Sugama, Hideo

2016-03-01

Nonlinear fluid simulation of turbulence driven by ion temperature gradient modes in the tokamak fluxtube configuration is performed by combining two different closure models. One model is a gyrofluid model by Beer and Hammett [Phys. Plasmas 3, 4046 (1996)], and the other is a closure model to reproduce the kinetic zonal flow response [Sugama et al., Phys. Plasmas 14, 022502 (2007)]. By including the zonal flow closure, generation of zonal flows, significant reduction in energy transport, reproduction of the gyrokinetic transport level, and nonlinear upshift on the critical value of gradient scale length are observed.

Characterization of two-scale gradient Young measures and application to homogenization

OpenAIRE

Babadjian, Jean-Francois; Baia, Margarida; Santos, Pedro M.

2006-01-01

This work is devoted to the study of two-scale gradient Young measures naturally arising in nonlinear elasticity homogenization problems. Precisely, a characterization of this class of measures is derived and an integral representation formula for homogenized energies, whose integrands satisfy very weak regularity assumptions, is obtained in terms of two-scale gradient Young measures.

Numerical solution of large nonlinear boundary value problems by quadratic minimization techniques

International Nuclear Information System (INIS)

Glowinski, R.; Le Tallec, P.

1984-01-01

The objective of this paper is to describe the numerical treatment of large highly nonlinear two or three dimensional boundary value problems by quadratic minimization techniques. In all the different situations where these techniques were applied, the methodology remains the same and is organized as follows: 1) derive a variational formulation of the original boundary value problem, and approximate it by Galerkin methods; 2) transform this variational formulation into a quadratic minimization problem (least squares methods) or into a sequence of quadratic minimization problems (augmented lagrangian decomposition); 3) solve each quadratic minimization problem by a conjugate gradient method with preconditioning, the preconditioning matrix being sparse, positive definite, and fixed once for all in the iterative process. This paper will illustrate the methodology above on two different examples: the description of least squares solution methods and their application to the solution of the unsteady Navier-Stokes equations for incompressible viscous fluids; the description of augmented lagrangian decomposition techniques and their application to the solution of equilibrium problems in finite elasticity

Conjugated Molecules for the Smart Filtering of Intense Radiations

Directory of Open Access Journals (Sweden)

Danilo Dini

2003-04-01

Full Text Available Abstract: The practical realization of smart optical filters, i.e. devices which change their optical transmission in a suitable way to keep a working state for a general light sensitive element , can involve the use of conjugated molecules whose light absorption properties are light- intensity dependent (nonlinear optical effect. The verification of optical limiting displayed by some particular conjugated molecules, e.g. phthalocyanines, is quite noteworthy and can be successfully exploited for the realization of such smart optical devices. In the present contribution the analysis of the relevant molecular feature of a phthalocyanine are analyzed with the aim of determining useful correlations between optical limiting performance and phthalocyanine chemical structure. In particular , the electronic nature of the substituent is considered as a key factor for the explanation of some observed optical limiting trends.

Fluid simulations of toroidal ion temperature gradient turbulence

International Nuclear Information System (INIS)

Sandberg, I.; Isliker, H.; Pavlenko, V.P.; Hizanidis, K.; Vlahos, L.

2006-01-01

The evolution of the toroidal ion temperature gradient mode instability is numerically studied by using the equations based on the standard reactive fluid model. The long-term dynamics of the instability are investigated using random-phase, small-amplitude fluctuations for initial conditions. The main events during the evolution of the instability that lead to the formation of large-scale coherent structures are described and the role of the dominant nonlinearities is clarified. The polarization drift nonlinearity leads to the inverse energy cascade while the convective ion heat nonlinearity is responsible for the saturation of the instability. Finally, the sensitivity of the saturated state to the initial plasma conditions is examined

Performance evaluation of matrix gradient coils.

Science.gov (United States)

Jia, Feng; Schultz, Gerrit; Testud, Frederik; Welz, Anna Masako; Weber, Hans; Littin, Sebastian; Yu, Huijun; Hennig, Jürgen; Zaitsev, Maxim

2016-02-01

In this paper, we present a new performance measure of a matrix coil (also known as multi-coil) from the perspective of efficient, local, non-linear encoding without explicitly considering target encoding fields. An optimization problem based on a joint optimization for the non-linear encoding fields is formulated. Based on the derived objective function, a figure of merit of a matrix coil is defined, which is a generalization of a previously known resistive figure of merit for traditional gradient coils. A cylindrical matrix coil design with a high number of elements is used to illustrate the proposed performance measure. The results are analyzed to reveal novel features of matrix coil designs, which allowed us to optimize coil parameters, such as number of coil elements. A comparison to a scaled, existing multi-coil is also provided to demonstrate the use of the proposed performance parameter. The assessment of a matrix gradient coil profits from using a single performance parameter that takes the local encoding performance of the coil into account in relation to the dissipated power.

Fast gradient-based methods for Bayesian reconstruction of transmission and emission PET images

International Nuclear Information System (INIS)

Mumcuglu, E.U.; Leahy, R.; Zhou, Z.; Cherry, S.R.

1994-01-01

The authors describe conjugate gradient algorithms for reconstruction of transmission and emission PET images. The reconstructions are based on a Bayesian formulation, where the data are modeled as a collection of independent Poisson random variables and the image is modeled using a Markov random field. A conjugate gradient algorithm is used to compute a maximum a posteriori (MAP) estimate of the image by maximizing over the posterior density. To ensure nonnegativity of the solution, a penalty function is used to convert the problem to one of unconstrained optimization. Preconditioners are used to enhance convergence rates. These methods generally achieve effective convergence in 15--25 iterations. Reconstructions are presented of an 18 FDG whole body scan from data collected using a Siemens/CTI ECAT931 whole body system. These results indicate significant improvements in emission image quality using the Bayesian approach, in comparison to filtered backprojection, particularly when reprojections of the MAP transmission image are used in place of the standard attenuation correction factors

Layer-oriented multigrid wavefront reconstruction algorithms for multi-conjugate adaptive optics

Science.gov (United States)

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.

Geometrical relaxation of excitations in one-dimensional conjugated polymers; Giichijigen kyoeki kobunshi reiki jotai no shusa kozo kanwa

Energy Technology Data Exchange (ETDEWEB)

Yoshizawa, M. [Tohoku University, Sendai (Japan). Faculty of Engineering

1995-12-15

Large ultrafast optical nonlinearities in conjugated polymers have attracted much attention because of possible applications to nonlinear optical devices. One-dimensional systems such as conjugated polymers have localized excited states with geometrical relaxation. In this study, photoexcited states in polydiacetylene has been investigated by femtosecond Raman gain spectroscopy with 300-fs resolution. A new photoinduced Raman peak with lifetime of 1.5 ps has been observed at 1200cm{sup -1} for the first time. This peak indicates acetylene-like structure of the main chain relaxes to butatriene-like structure due to the formation of self-trapped exciting with the geometrical relaxation. The formation and decay kinetics of the Raman signals is consistent with the relaxation processes of exciting observed by femtosecond absorption spectroscopy. 8 refs., 5 figs.

MINPACK-1, Subroutine Library for Nonlinear Equation System

International Nuclear Information System (INIS)

Garbow, Burton S.

1984-01-01

1 - Description of problem or function: MINPACK1 is a package of FORTRAN subprograms for the numerical solution of systems of non- linear equations and nonlinear least-squares problems. The individual programs are: Identification/Description: - CHKDER: Check gradients for consistency with functions, - DOGLEG: Determine combination of Gauss-Newton and gradient directions, - DPMPAR: Provide double precision machine parameters, - ENORM: Calculate Euclidean norm of vector, - FDJAC1: Calculate difference approximation to Jacobian (nonlinear equations), - FDJAC2: Calculate difference approximation to Jacobian (least squares), - HYBRD: Solve system of nonlinear equations (approximate Jacobian), - HYBRD1: Easy-to-use driver for HYBRD, - HYBRJ: Solve system of nonlinear equations (analytic Jacobian), - HYBRJ1: Easy-to-use driver for HYBRJ, - LMDER: Solve nonlinear least squares problem (analytic Jacobian), - LMDER1: Easy-to-use driver for LMDER, - LMDIF: Solve nonlinear least squares problem (approximate Jacobian), - LMDIF1: Easy-to-use driver for LMDIF, - LMPAR: Determine Levenberg-Marquardt parameter - LMSTR: Solve nonlinear least squares problem (analytic Jacobian, storage conserving), - LMSTR1: Easy-to-use driver for LMSTR, - QFORM: Accumulate orthogonal matrix from QR factorization QRFAC Compute QR factorization of rectangular matrix, - QRSOLV: Complete solution of least squares problem, - RWUPDT: Update QR factorization after row addition, - R1MPYQ: Apply orthogonal transformations from QR factorization, - R1UPDT: Update QR factorization after rank-1 addition, - SPMPAR: Provide single precision machine parameters. 4. Method of solution - MINPACK1 uses the modified Powell hybrid method and the Levenberg-Marquardt algorithm

Preliminary training of a self-pumped loop phase-conjugate mirror based on a photorefractive crystal

International Nuclear Information System (INIS)

Mogaddam, Mehran Wahdani; Shuvalov, Vladimir V

2006-01-01

It is shown by the example of a loop self-pumped phase-conjugate (SPPC) mirror based on a photorefractive crystal (PRC) BaTiO 3 that formation of a phase-conjugate (PC) wave in a SPPC mirror can be considerably accelerated by using a preliminary training of the mirror. For this purpose, it is necessary to direct preliminary an auxiliary (training) optical field on the SPPC mirror, which contains some information on the properties of the input signal whose wave front will be conjugated later. This procedure provides the writing of static refractive-index gratings in the PRC already at the training stage. The presence of these gratings ensures a much more rapid (by 6-20 times) production of volume refractive-index gratings required for the efficient conjugation of the signal radiation. Several variants of static and dynamic SPPC mirror training procedures are simulated and their efficiencies are compared. (nonlinear optical phenomena)

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

Science.gov (United States)

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.

Geometric Structure-Preserving Discretization Schemes for Nonlinear Elasticity

Science.gov (United States)

2015-08-13

sufficient conditions for the compatibility of displacement gradient and the existence of stress functions on non-contractible bodies. The main...conditions. 15.  SUBJECT TERMS geometric theory for nonlinear elasticity, discrete exterior calculus 16.  SECURITY CLASSIFICATION OF: 17.  LIMITATION...complex allows one to readily derive the necessary and sufficient conditions for the compatibility of displacement gradient and the existence of stress

Numerical simulation of nonlinear continuity equations by evolving diffeomorphisms

KAUST Repository

Carrillo, José A.

2016-09-22

In this paper we present a numerical scheme for nonlinear continuity equations, which is based on the gradient flow formulation of an energy functional with respect to the quadratic transportation distance. It can be applied to a large class of nonlinear continuity equations, whose dynamics are driven by internal energies, given external potentials and/or interaction energies. The solver is based on its variational formulation as a gradient flow with respect to the Wasserstein distance. Positivity of solutions as well as energy decrease of the semi-discrete scheme are guaranteed by its construction. We illustrate this property with various examples in spatial dimension one and two.

On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems

Directory of Open Access Journals (Sweden)

El-Sayed M. E. Mostafa

2017-01-01

Full Text Available The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.

A Projected Conjugate Gradient Method for Sparse Minimax Problems

DEFF Research Database (Denmark)

Madsen, Kaj; Jonasson, Kristjan

1993-01-01

A new method for nonlinear minimax problems is presented. The method is of the trust region type and based on sequential linear programming. It is a first order method that only uses first derivatives and does not approximate Hessians. The new method is well suited for large sparse problems...... as it only requires that software for sparse linear programming and a sparse symmetric positive definite equation solver are available. On each iteration a special linear/quadratic model of the function is minimized, but contrary to the usual practice in trust region methods the quadratic model is only...... with the method are presented. In fact, we find that the number of iterations required is comparable to that of state-of-the-art quasi-Newton codes....

Optimization Formulations for the Maximum Nonlinear Buckling Load of Composite Structures

DEFF Research Database (Denmark)

Lindgaard, Esben; Lund, Erik

2011-01-01

This paper focuses on criterion functions for gradient based optimization of the buckling load of laminated composite structures considering different types of buckling behaviour. A local criterion is developed, and is, together with a range of local and global criterion functions from literature......, benchmarked on a number of numerical examples of laminated composite structures for the maximization of the buckling load considering fiber angle design variables. The optimization formulations are based on either linear or geometrically nonlinear analysis and formulated as mathematical programming problems...... solved using gradient based techniques. The developed local criterion is formulated such it captures nonlinear effects upon loading and proves useful for both analysis purposes and as a criterion for use in nonlinear buckling optimization. © 2010 Springer-Verlag....

Purification of SUMO conjugating enzymes and kinetic analysis of substrate conjugation

Science.gov (United States)

Yunus, Ali A.; Lima, Christopher D.

2009-01-01

SUMO conjugation to protein substrates requires the concerted action of a dedicated E2 ubiquitin conjugation enzyme (Ubc9) and associated E3 ligases. Although Ubc9 can directly recognize and modify substrate lysine residues that occur within a consensus site for SUMO modification, E3 ligases can redirect specificity and enhance conjugation rates during SUMO conjugation in vitro and in vivo. In this chapter, we will describe methods utilized to purify SUMO conjugating enzymes and model substrates which can be used for analysis of SUMO conjugation in vitro. We will also describe methods to extract kinetic parameters during E3-dependent or E3-independent substrate conjugation. PMID:19107417

Degenerate four-wave mixing and phase conjugation in a collisional plasma

International Nuclear Information System (INIS)

Federici, J.F.; Mansfield, D.K.

1986-06-01

Although degenerate four-wave mixing (DFWM) has many practical applications in the visible regime, no successful attempt has been made to study or demonstrate DFWM for wavelengths longer than 10μm. Recently, Steel and Lam established plasma as a viable DFWM and phase conjugation (PC) medium for infrared, far-infrared, and microwaves. However, their analysis is incomplete since collisional effects were not included. Using a fluid description, our results demonstrate that when collisional absorption is small and the collisional mean-free path is shorter than the nonlinear density grating scale length, collisional heating generates a thermal force which substantially enhances the phase conjugate reflectivity. When the collisional attenuation length becomes comparable to the length of the plasma, the dominant effect is collisional absorption of the pump waves. Numerical estimates of the phase conjugate reflectivity indicate that for modest power levels, gains greater than or equal to1 are possible in the submillimeter to centimeter wavelength range. This suggests that a plasma is a viable PC medium at those long wavelengths. In addition, doubly DFWM is discussed

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

International Nuclear Information System (INIS)

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

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

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)

Rigid Bodies in Contact

DEFF Research Database (Denmark)

Niebe, Sarah Maria

. A contact point determination method, based on boolean surface maps, is developed to handle collisions between tetrahedral meshes. The novel nonsmooth nonlinear conjugate gradient (NNCG) method is presented. The NNCG method is comparable in terms of accuracy to the state-of-the-art method, projected Gauss...

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

Science.gov (United States)

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.

Estimating nonlinear selection gradients using quadratic regression coefficients: double or nothing?

Science.gov (United States)

Stinchcombe, John R; Agrawal, Aneil F; Hohenlohe, Paul A; Arnold, Stevan J; Blows, Mark W

2008-09-01

The use of regression analysis has been instrumental in allowing evolutionary biologists to estimate the strength and mode of natural selection. Although directional and correlational selection gradients are equal to their corresponding regression coefficients, quadratic regression coefficients must be doubled to estimate stabilizing/disruptive selection gradients. Based on a sample of 33 papers published in Evolution between 2002 and 2007, at least 78% of papers have not doubled quadratic regression coefficients, leading to an appreciable underestimate of the strength of stabilizing and disruptive selection. Proper treatment of quadratic regression coefficients is necessary for estimation of fitness surfaces and contour plots, canonical analysis of the gamma matrix, and modeling the evolution of populations on an adaptive landscape.

Gradient Dynamics and Entropy Production Maximization

Science.gov (United States)

Janečka, Adam; Pavelka, Michal

2018-01-01

We compare two methods for modeling dissipative processes, namely gradient dynamics and entropy production maximization. Both methods require similar physical inputs-how energy (or entropy) is stored and how it is dissipated. Gradient dynamics describes irreversible evolution by means of dissipation potential and entropy, it automatically satisfies Onsager reciprocal relations as well as their nonlinear generalization (Maxwell-Onsager relations), and it has statistical interpretation. Entropy production maximization is based on knowledge of free energy (or another thermodynamic potential) and entropy production. It also leads to the linear Onsager reciprocal relations and it has proven successful in thermodynamics of complex materials. Both methods are thermodynamically sound as they ensure approach to equilibrium, and we compare them and discuss their advantages and shortcomings. In particular, conditions under which the two approaches coincide and are capable of providing the same constitutive relations are identified. Besides, a commonly used but not often mentioned step in the entropy production maximization is pinpointed and the condition of incompressibility is incorporated into gradient dynamics.

Curve Evolution in Subspaces and Exploring the Metameric Class of Histogram of Gradient Orientation based Features using Nonlinear Projection Methods

DEFF Research Database (Denmark)

Tatu, Aditya Jayant

This thesis deals with two unrelated issues, restricting curve evolution to subspaces and computing image patches in the equivalence class of Histogram of Gradient orientation based features using nonlinear projection methods. Curve evolution is a well known method used in various applications like...... tracking interfaces, active contour based segmentation methods and others. It can also be used to study shape spaces, as deforming a shape can be thought of as evolving its boundary curve. During curve evolution a curve traces out a path in the infinite dimensional space of curves. Due to application...... specific requirements like shape priors or a given data model, and due to limitations of the computer, the computed curve evolution forms a path in some finite dimensional subspace of the space of curves. We give methods to restrict the curve evolution to a finite dimensional linear or implicitly defined...

Optimization of nonlinear wave function parameters

International Nuclear Information System (INIS)

Shepard, R.; Minkoff, M.; Chemistry

2006-01-01

An energy-based optimization method is presented for our recently developed nonlinear wave function expansion form for electronic wave functions. This expansion form is based on spin eigenfunctions, using the graphical unitary group approach (GUGA). The wave function is expanded in a basis of product functions, allowing application to closed-shell and open-shell systems and to ground and excited electronic states. Each product basis function is itself a multiconfigurational function that depends on a relatively small number of nonlinear parameters called arc factors. The energy-based optimization is formulated in terms of analytic arc factor gradients and orbital-level Hamiltonian matrices that correspond to a specific kind of uncontraction of each of the product basis functions. These orbital-level Hamiltonian matrices give an intuitive representation of the energy in terms of disjoint subsets of the arc factors, they provide for an efficient computation of gradients of the energy with respect to the arc factors, and they allow optimal arc factors to be determined in closed form for subspaces of the full variation problem. Timings for energy and arc factor gradient computations involving expansion spaces of > 10 24 configuration state functions are reported. Preliminary convergence studies and molecular dissociation curves are presented for some small molecules

Parametric Amplification, Wavelength Conversion, and Phase Conjugation of a 2.048-Tbit/s WDM PDM 16-QAM Signal

DEFF Research Database (Denmark)

Hu, Hao; Jopson, R. M.; Gnauck, A. H.

2015-01-01

We demonstrate polarization-independent parametric amplification of a 2.048-Tbit/s 8-WDM PDM 16-QAM signal and simultaneous wavelength conversion and phase conjugation in a highly nonlinear fiber. Two high-power continuous-wave pumps with orthogonal polarizations and counter-phase modulation are ...

Enhancement of phase-conjugate reflectivity using Zeeman coherence in highly degenerate molecular systems

International Nuclear Information System (INIS)

Mukherjee, Nandini

2010-01-01

A comprehensive theoretical analysis is developed for the vectorial phase conjugation using resonant four-wave mixing (FWM) in a highly degenerate rotational vibrational molecular system. The dynamic Stark shifts, saturation, and Doppler broadening are included for a realistic analysis. It is shown that the electromagnetically induced multilevel coherence controls the nonlinear wave mixing yielding interesting results for the phase conjugate (PC) reflectivity. It turns out that the efficiency of the PC reflectivity is decided by the relative phase of the Zeeman coherence and the population grating. When these two contributions are aligned in phase by a small detuning of the pump frequency, a large PC reflectivity (∼20%) is obtained with moderate pump intensity (∼500 mW/cm 2 ).

A deep belief network with PLSR for nonlinear system modeling.

Science.gov (United States)

Qiao, Junfei; Wang, Gongming; Li, Wenjing; Li, Xiaoli

2017-10-31

Nonlinear system modeling plays an important role in practical engineering, and deep learning-based deep belief network (DBN) is now popular in nonlinear system modeling and identification because of the strong learning ability. However, the existing weights optimization for DBN is based on gradient, which always leads to a local optimum and a poor training result. In this paper, a DBN with partial least square regression (PLSR-DBN) is proposed for nonlinear system modeling, which focuses on the problem of weights optimization for DBN using PLSR. Firstly, unsupervised contrastive divergence (CD) algorithm is used in weights initialization. Secondly, initial weights derived from CD algorithm are optimized through layer-by-layer PLSR modeling from top layer to bottom layer. Instead of gradient method, PLSR-DBN can determine the optimal weights using several PLSR models, so that a better performance of PLSR-DBN is achieved. Then, the analysis of convergence is theoretically given to guarantee the effectiveness of the proposed PLSR-DBN model. Finally, the proposed PLSR-DBN is tested on two benchmark nonlinear systems and an actual wastewater treatment system as well as a handwritten digit recognition (nonlinear mapping and modeling) with high-dimension input data. The experiment results show that the proposed PLSR-DBN has better performances of time and accuracy on nonlinear system modeling than that of other methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Thermal rectification in nonlinear quantum circuits

DEFF Research Database (Denmark)

Ruokola, T.; Ojanen, T.; Jauho, Antti-Pekka

2009-01-01

We present a theoretical study of radiative heat transport in nonlinear solid-state quantum circuits. We give a detailed account of heat rectification effects, i.e., the asymmetry of heat current with respect to a reversal of the thermal gradient, in a system consisting of two reservoirs at finit...

Nonlinear neoclassical transport in toroidal edge plasmas

International Nuclear Information System (INIS)

Fueloep, T.; Helander, P.

2001-01-01

In conventional neoclassical theory, the density and temperature gradients are not allowed to be as steep as frequently observed in the tokamak edge. In this paper the theory of neoclassical transport in a collisional, impure plasma is extended to allow for steeper profiles than normally assumed. The dynamics of highly charged impurity ions then becomes nonlinear, which affects the transport of all species. As earlier found in the banana regime, when the bulk plasma gradients are large the impurity ions undergo a poloidal redistribution, which reduces their parallel friction with the bulk ions and suppresses the neoclassical ion particle flux. The neoclassical confinement is thus improved in regions with large radial gradients. When the plasma is collisional and the gradients are large, the impurities accumulate on the inboard side of the torus

Chaos in toroidal ion-temperature-gradient-driven modes in dust-contaminated magnetoplasma

Energy Technology Data Exchange (ETDEWEB)

Qamar, Anisa; Atta-Ullah-Shah [Theoretical Plasma Physics Group, Institute of Physics and Electronics, University of Peshawar Khyber Pakhtunkhwa 25000 (Pakistan); Yaqub Khan, M; Ayub, M [Department of Mathematics, Quaid-i-Azam University, Islamabad 45320 (Pakistan); Mirza, Arshad M, E-mail: anisaqamar@gmail.com [Theoretical Plasma Physics Group, Department of Physics, Quaid-i-Azam University, Islamabad 45320 (Pakistan)

2011-06-01

A new set of nonlinear equations for toroidal ion-temperature-gradient-driven (ITGD) drift-dissipative waves is derived by using Braginskii's transport model of the ion dynamics and the Boltzmann distribution of electrons in the presence of negatively charged dust grains. The temporal behaviour of the nonlinear ITGD mode is found to be governed by three nonlinear equations for the amplitudes, which is a generalization of Lorenz- and Stenflo-type equations admitting chaotic trajectories. The linear stability analysis has been presented and stationary points for our generalized mode coupling equations are also derived.

Reproducing the nonlinear dynamic behavior of a structured beam with a generalized continuum model

Science.gov (United States)

Vila, J.; Fernández-Sáez, J.; Zaera, R.

2018-04-01

In this paper we study the coupled axial-transverse nonlinear vibrations of a kind of one dimensional structured solids by application of the so called Inertia Gradient Nonlinear continuum model. To show the accuracy of this axiomatic model, previously proposed by the authors, its predictions are compared with numeric results from a previously defined finite discrete chain of lumped masses and springs, for several number of particles. A continualization of the discrete model equations based on Taylor series allowed us to set equivalent values of the mechanical properties in both discrete and axiomatic continuum models. Contrary to the classical continuum model, the inertia gradient nonlinear continuum model used herein is able to capture scale effects, which arise for modes in which the wavelength is comparable to the characteristic distance of the structured solid. The main conclusion of the work is that the proposed generalized continuum model captures the scale effects in both linear and nonlinear regimes, reproducing the behavior of the 1D nonlinear discrete model adequately.

New recursive-least-squares algorithms for nonlinear active control of sound and vibration using neural networks.

Science.gov (United States)

Bouchard, M

2001-01-01

In recent years, a few articles describing the use of neural networks for nonlinear active control of sound and vibration were published. Using a control structure with two multilayer feedforward neural networks (one as a nonlinear controller and one as a nonlinear plant model), steepest descent algorithms based on two distinct gradient approaches were introduced for the training of the controller network. The two gradient approaches were sometimes called the filtered-x approach and the adjoint approach. Some recursive-least-squares algorithms were also introduced, using the adjoint approach. In this paper, an heuristic procedure is introduced for the development of recursive-least-squares algorithms based on the filtered-x and the adjoint gradient approaches. This leads to the development of new recursive-least-squares algorithms for the training of the controller neural network in the two networks structure. These new algorithms produce a better convergence performance than previously published algorithms. Differences in the performance of algorithms using the filtered-x and the adjoint gradient approaches are discussed in the paper. The computational load of the algorithms discussed in the paper is evaluated for multichannel systems of nonlinear active control. Simulation results are presented to compare the convergence performance of the algorithms, showing the convergence gain provided by the new algorithms.

Nonlinear saturation of the slab ITG instability and zonal flow generation with fully kinetic ions

Science.gov (United States)

Miecnikowski, Matthew T.; Sturdevant, Benjamin J.; Chen, Yang; Parker, Scott E.

2018-05-01

Fully kinetic turbulence models are of interest for their potential to validate or replace gyrokinetic models in plasma regimes where the gyrokinetic expansion parameters are marginal. Here, we demonstrate fully kinetic ion capability by simulating the growth and nonlinear saturation of the ion-temperature-gradient instability in shearless slab geometry assuming adiabatic electrons and including zonal flow dynamics. The ion trajectories are integrated using the Lorentz force, and the cyclotron motion is fully resolved. Linear growth and nonlinear saturation characteristics show excellent agreement with analogous gyrokinetic simulations across a wide range of parameters. The fully kinetic simulation accurately reproduces the nonlinearly generated zonal flow. This work demonstrates nonlinear capability, resolution of weak gradient drive, and zonal flow physics, which are critical aspects of modeling plasma turbulence with full ion dynamics.

Effects of bunch density gradient in high-gain free-electron lasers

International Nuclear Information System (INIS)

Huang, Z.; Kim, K.-J.

1999-01-01

The authors investigate effects of the bunch density gradient in self-amplified spontaneous emission (SASE), including the role of coherent spontaneous emission (CSE) in the evolution of the free-electron laser (FEL) process. In the exponential gain regime, the authors solve the coupled Maxwell-Vlasov equations and extend the linear theory to a bunched beam with energy spread. A time-dependent, nonlinear simulation algorithm is used to study the CSE effect and the nonlinear evolution of the radiation pulse

Nonlinear features of the electron temperature gradient mode and electron thermal transport in tokamaks

International Nuclear Information System (INIS)

Kaw, P.K.; Singh, R.; Weiland, J.G.

2001-01-01

Analytical investigations of several linear and nonlinear features of ETG turbulence are reported. The linear theory includes effects such as finite beta induced electromagnetic shielding, coupling to electron magnetohydrodynamic modes like whistlers etc. It is argued that nonlinearly, turbulence and transport are dominated by radially extended modes called 'streamers'. A nonlinear mechanism generating streamers based on a modulational instability theory of the ETG turbulence is also presented. The saturation levels of the streamers using a Kelvin Helmholtz secondary instability mechanism are calculated and levels of the electron thermal transport due to streamers are estimated. (author)

Ultrafast intersystem-crossing in platinum containing π-conjugated polymers with tunable spin-orbit coupling.

Science.gov (United States)

Sheng, C-X; Singh, S; Gambetta, A; Drori, T; Tong, M; Tretiak, S; Vardeny, Z V

2013-01-01

The development of efficient organic light-emitting diodes (OLED) and organic photovoltaic cells requires control over the dynamics of spin sensitive excitations. Embedding heavy metal atoms in π-conjugated polymer chains enhances the spin-orbit coupling (SOC), and thus facilitates intersystem crossing (ISC) from the singlet to triplet manifolds. Here we use various nonlinear optical spectroscopies such as two-photon absorption and electroabsorption in conjunction with electronic structure calculations, for studying the energies, emission bands and ultrafast dynamics of spin photoexcitations in two newly synthesized π-conjugated polymers that contain intrachain platinum (Pt) atoms separated by one (Pt-1) or three (Pt-3) organic spacer units. The controllable SOC in these polymers leads to a record ISC time of white OLEDs.

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

Science.gov (United States)

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.

Direct approach for solving nonlinear evolution and two-point ...

Indian Academy of Sciences (India)

2013-12-01

Dec 1, 2013 ... 1School of Mathematics and Applied Statistics, University of Wollongong, Wollongong,. NSW 2522 ... the nonlinear phenomena as well as their further applications in the real-life situations, it is ... concentration gradient. Thus ...

The existence of periodic solutions for nonlinear beam equations on Td by a para-differential method

Science.gov (United States)

Chen, Bochao; Li, Yong; Gao, Yixian

2018-05-01

This paper focuses on the construction of periodic solutions of nonlinear beam equations on the $d$-dimensional tori. For a large set of frequencies, we demonstrate that an equivalent form of the nonlinear equations can be obtained by a para-differential conjugation. Given the non-resonant conditions on each finite dimensional subspaces, it is shown that the periodic solutions can be constructed for the block diagonal equation by a classical iteration scheme.

Conjugated heat transfer and temperature distributions in a gas turbine combustion liner under base-load operation

International Nuclear Information System (INIS)

Kim, Kyung Min; Yun, Nam Geon; Jeon, Yun Heung; Lee, Dong Hyun; Cho, Yung Hee

2010-01-01

Prediction of temperature distributions on hot components is important in development of a gas turbine combustion liner. The present study investigated conjugated heat transfer to obtain temperature distributions in a combustion liner with six combustion nozzles. 3D numerical simulations using FVM commercial codes, Fluent and CFX were performed to calculate combustion and heat transfer distributions. The temperature distributions in the combustor liner were calculated by conjugation of conduction and convection (heat transfer coefficients) obtained by combustion and cooling flow analysis. The wall temperature was the highest on the attachment points of the combustion gas from combustion nozzles, but the temperature gradient was high at the after shell section with low wall temperature

Nonlinear dynamics of the m=1 kink-tearing instability in a modified magnetohydrodynamic model

International Nuclear Information System (INIS)

Wang, X.; Bhattacharjee, A.

1995-01-01

A theory is given for the nonlinear dynamical evolution of the collisionless m=1 kink-tearing instability, including the effects of electron inertia and electron pressure gradient in a generalized Ohm's law. It is demonstrated that electron pressure gradients can cause near-explosive growth in the nonlinear regime of a thin m=1 island. This near-explosive phase is followed by a rapid decay phase as the island width becomes comparable to the radius of the sawtooth region. An island equation is derived for the entire nonlinear evolution of the instability, extending recent work on the subject [X. Wang and A. Bhattacharjee, Phys. Rev. Lett. 70, 1627 (1993)] to include the effects of both electron inertia and electron pressure gradient. Comparisons are made with experimental data from present-day tokamaks. It is suggested that the present model not only accounts for fast sawtooth crashes, but also provides possible explanations for the problems of sudden onset and incomplete reconnection that have been, heretofore, unexplained features of observations. copyright 1995 American Institute of Physics

Brain tumor magnetic targeting and biodistribution of superparamagnetic iron oxide nanoparticles linked with 70-kDa heat shock protein study by nonlinear longitudinal response

Energy Technology Data Exchange (ETDEWEB)

Shevtsov, Maxim A., E-mail: shevtsov-max@mail.ru [Institute of Cytology of the Russian Academy of Sciences (RAS), Tikhoretsky Ave. 4, St. Petersburg 194064 (Russian Federation); A.L. Polenov Russian Research Scientific Institute of Neurosurgery, Mayakovsky str. 12, St. Petersburg 191014 (Russian Federation); Nikolaev, Boris P. [Research Institute of Highly Pure Biopreparations, Pudozhskaya str. 12, St. Petersburg 197110 (Russian Federation); Ryzhov, Vyacheslav A. [Petersburg Nuclear Physics Institute, NRC Kurchatov Institute, Gatchina 188300 (Russian Federation); Yakovleva, Ludmila Y. [Research Institute of Highly Pure Biopreparations, Pudozhskaya str. 12, St. Petersburg 197110 (Russian Federation); Dobrodumov, Anatolii V. [Institute of Macromolecular Compounds of the Russian Academy of Sciences (RAS), Bolshoi pr. 31, St. Petersburg 199004 (Russian Federation); Marchenko, Yaroslav Y. [Research Institute of Highly Pure Biopreparations, Pudozhskaya str. 12, St. Petersburg 197110 (Russian Federation); Margulis, Boris A. [Institute of Cytology of the Russian Academy of Sciences (RAS), Tikhoretsky Ave. 4, St. Petersburg 194064 (Russian Federation); Pitkin, Emil [The Wharton School, University of Pennsylvania, 3730 Walnut St., Philadelphia, PA 19104 (United States); Guzhova, Irina V. [Institute of Cytology of the Russian Academy of Sciences (RAS), Tikhoretsky Ave. 4, St. Petersburg 194064 (Russian Federation)

2015-08-15

Brain tumor targeting efficiency and biodistribution of the superparamagnetic nanoparticles conjugated with heat shock protein Hsp70 (SPION–Hsp70) were evaluated in experimental glioma model. Synthesized conjugates were characterized using the method of longitudinal nonlinear response of magnetic nanoparticles to a weak ac magnetic field with measurements of second harmonic of magnetization (NLR-M{sub 2}). Cellular interaction of magnetic conjugates was analyzed in 9L glioma cell culture. The biodistribution of the nanoparticles and their accumulation in tumors was assessed by the latter approach as well. The efficacy of Hsp70-conjugates for contrast enhancement in the orthotopic model of 9L glioma was assessed by MR imaging (11 T). Magnetic nanoparticles conjugated with Hsp70 had the relaxivity properties of the MR-negative contrast agents. Morphological observation and cell viability test demonstrated good biocompatibility of Hsp70-conjugates. Analysis of the T{sub 2}-weighted MR scans in tumor-bearing rats demonstrated the high efficacy of Hsp70-conjugates in contrast enhancement of the glioma in comparison to non-conjugated nanoparticles. High contrast enhancement of the glioma was provided by the accumulation of the SPION–Hsp70 particles in the glioma tissue (as shown by the histological assay). Biodistribution analysis by NLR-M{sub 2} measurements evidenced the many-fold increase (~40) in the tumor-to-normal brain uptake ratio in the Hsp70-conjugates treated animals. Biodistribution pattern of Hsp70-decorated nanoparticles differed from that of non-conjugated SPIONs. Coating of the magnetic nanoparticles with Hsp70 protein enhances the tumor-targeting ability of the conjugates that could be applied in the MR imaging of the malignant brain tumors. - Highlights: • Second-harmonic nonlinear magnetic response is used for biodistribution analysis. • NLR-M{sub 2} ensures high sensibility in detection of SPIONs in tissue. • SPION–Hsp70 conjugates

Brain tumor magnetic targeting and biodistribution of superparamagnetic iron oxide nanoparticles linked with 70-kDa heat shock protein study by nonlinear longitudinal response

International Nuclear Information System (INIS)

Shevtsov, Maxim A.; Nikolaev, Boris P.; Ryzhov, Vyacheslav A.; Yakovleva, Ludmila Y.; Dobrodumov, Anatolii V.; Marchenko, Yaroslav Y.; Margulis, Boris A.; Pitkin, Emil; Guzhova, Irina V.

2015-01-01

Brain tumor targeting efficiency and biodistribution of the superparamagnetic nanoparticles conjugated with heat shock protein Hsp70 (SPION–Hsp70) were evaluated in experimental glioma model. Synthesized conjugates were characterized using the method of longitudinal nonlinear response of magnetic nanoparticles to a weak ac magnetic field with measurements of second harmonic of magnetization (NLR-M 2 ). Cellular interaction of magnetic conjugates was analyzed in 9L glioma cell culture. The biodistribution of the nanoparticles and their accumulation in tumors was assessed by the latter approach as well. The efficacy of Hsp70-conjugates for contrast enhancement in the orthotopic model of 9L glioma was assessed by MR imaging (11 T). Magnetic nanoparticles conjugated with Hsp70 had the relaxivity properties of the MR-negative contrast agents. Morphological observation and cell viability test demonstrated good biocompatibility of Hsp70-conjugates. Analysis of the T 2 -weighted MR scans in tumor-bearing rats demonstrated the high efficacy of Hsp70-conjugates in contrast enhancement of the glioma in comparison to non-conjugated nanoparticles. High contrast enhancement of the glioma was provided by the accumulation of the SPION–Hsp70 particles in the glioma tissue (as shown by the histological assay). Biodistribution analysis by NLR-M 2 measurements evidenced the many-fold increase (~40) in the tumor-to-normal brain uptake ratio in the Hsp70-conjugates treated animals. Biodistribution pattern of Hsp70-decorated nanoparticles differed from that of non-conjugated SPIONs. Coating of the magnetic nanoparticles with Hsp70 protein enhances the tumor-targeting ability of the conjugates that could be applied in the MR imaging of the malignant brain tumors. - Highlights: • Second-harmonic nonlinear magnetic response is used for biodistribution analysis. • NLR-M 2 ensures high sensibility in detection of SPIONs in tissue. • SPION–Hsp70 conjugates effectively target the

Ion temperature gradient mode driven solitons and shocks

Science.gov (United States)

Zakir, U.; Adnan, Muhammad; Haque, Q.; Qamar, Anisa; Mirza, Arshad M.

2016-04-01

Ion temperature gradient (ITG) driven solitons and shocks are studied in a plasma having gradients in the equilibrium number density and equilibrium ion temperature. In the linear regime, it is found that the ion temperature and the ratio of the gradient scale lengths, ηi=Ln/LT , affect both the real frequency and the growth rate of the ITG driven wave instability. In the nonlinear regime, for the first time we derive a Korteweg de Vries-type equation for the ITG mode, which admits solitary wave solution. It is found that the ITG mode supports only compressive solitons. Further, it is noticed that the soliton amplitude and width are sensitive to the parameter ηi=Ln/LT . Second, in the presence of dissipation in the system, we obtain a Burger type equation, which admits the shock wave solution. This work may be useful to understand the low frequency electrostatic modes in inhomogeneous electron-ion plasma having density and ion temperature gradients. For illustration, the model has been applied to tokamak plasma.

Implementation of non-linear filters for iterative penalized maximum likelihood image reconstruction

International Nuclear Information System (INIS)

Liang, Z.; Gilland, D.; Jaszczak, R.; Coleman, R.

1990-01-01

In this paper, the authors report on the implementation of six edge-preserving, noise-smoothing, non-linear filters applied in image space for iterative penalized maximum-likelihood (ML) SPECT image reconstruction. The non-linear smoothing filters implemented were the median filter, the E 6 filter, the sigma filter, the edge-line filter, the gradient-inverse filter, and the 3-point edge filter with gradient-inverse filter, and the 3-point edge filter with gradient-inverse weight. A 3 x 3 window was used for all these filters. The best image obtained, by viewing the profiles through the image in terms of noise-smoothing, edge-sharpening, and contrast, was the one smoothed with the 3-point edge filter. The computation time for the smoothing was less than 1% of one iteration, and the memory space for the smoothing was negligible. These images were compared with the results obtained using Bayesian analysis

Phase conjugation of speckle-inhomogeneous radiation in a holographic Nd:YAG laser with a short thermal hologram

International Nuclear Information System (INIS)

Yarovoi, V V; Kirsanov, A V

2002-01-01

A model of the so-called short hologram, which does not exhibit in-depth diffraction deformation of the fine speckle pattern of the recording fields, is studied. The investigation is performed by the example of a thermal hologram recorded by two speckle waves, which is the output mirror of a ring laser produced as a result of this recording. It is shown that the ability of this short hologram to select a wave conjugated to a speckle signal in the mode of the holographic laser depends both on the degree of mutual mixing of the speckles of recording beams in the hologram volume and on the effects of its saturation by the beams. The maximum accuracy of phase conjugation of speckle radiation in the holographic Nd:YAG laser achieved upon the best selection of the conjugate wave by the short thermal hologram was 93%. (nonlinear optical phenomena)

Hybrid Projected Gradient-Evolutionary Search Algorithm for Mixed Integer Nonlinear Optimization Problems

National Research Council Canada - National Science Library

Homaifar, Abdollah; Esterline, Albert; Kimiaghalam, Bahram

2005-01-01

The Hybrid Projected Gradient-Evolutionary Search Algorithm (HPGES) algorithm uses a specially designed evolutionary-based global search strategy to efficiently create candidate solutions in the solution space...

Double diffusive conjugate heat transfer: Part I

Science.gov (United States)

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.

Laser cavities with self-pumped phase conjugation by mixing of four waves in an amplifier

International Nuclear Information System (INIS)

Sillard, Pierre

1998-01-01

The purpose of this research thesis is to characterise a new type of cavities with self-pumped phase conjugation which uses a mixing of four waves degenerated in a solid amplifier. After a definition of phase conjugation and a brief overview of the history of this technique, the author describes and compares the different laser architectures with phase conjugation. He explains benefits and perspectives related to cavities with self-pumped phase conjugation using a mixing of four waves in an amplifier. He develops the necessary formalism for the resolution of the coupled equations of four wave mixing in transient regime for a resonant and saturated non-linearity. He shows how these results can be applied to solid amplifiers, in particularly to the Nd:YAG amplifier which is used in all experiments. In the next part, the author describes the principle and characteristics of cavity with self-pumped phase conjugation injected by another laser. An experiment is performed with two conventional Nd:YAG amplifiers pumped by flash lamps. The excellent performance of the cavity allows the study of cavity without this injection, but self-oscillating is to be envisaged, and a modelling of self-oscillating cavities is proposed and studied. Results are compared with those obtained with two N:YAG amplifiers pumped by flash lamps. Polarisation properties of the self-oscillating cavity are also studied. Finally, the author reports an experimental validation of a cavity with self-pumped phase conjugation all in solid state, pumped by laser diodes (a more efficient pumping) [fr

Nonlinear neoclassical transport in toroidal edge plasmas

International Nuclear Information System (INIS)

Fueloep, T.

2002-01-01

Edge plasma processes play a critical role for the global confinement of the plasma in a tokamak. In the edge region, where impurity ions are abundant and the temperature and density gradients are large, the assumptions of standard neoclassical theory break down. This paper reviews recent extensions of neoclassical theory to treat this problem, in particular our own work, which focuses on the nonlinear aspects of transport in a plasma with heavy impurity ions. In this theory, the pressure and temperature gradients are allowed to be steeper than in conventional theory neoclassical theory, so that the friction force between the bulk ions and heavy impurities is comparable to the parallel impurity pressure gradient. The impurity ions are then found to undergo a spontaneous rearrangement on each flux surface. This reduces their parallel friction with the bulk ions and causes the neoclassical ion flux to become a non-monotonic function of the gradients for plasma parameters typical of the tokamak edge. Thus, the neoclassical confinement is improved in regions where the gradients are large, such as in the edge pedestal. (orig.)

A unified nonlocal strain gradient plate model for nonlinear axial instability of functionally graded porous micro/nano-plates reinforced with graphene platelets

Science.gov (United States)

Sahmani, Saeid; Aghdam, Mohammad Mohammadi; Rabczuk, Timon

2018-04-01

By gradually changing of the porosity across a specific direction, functionally graded porous materials (FGPMs) are produced which can impart desirable mechanical properties. To enhance these properties, it is common to reinforce FGPMs with nanofillers. The main aim of the current study is to investigate the size-dependent nonlinear axial postbuckling characteristics of FGPM micro/nano-plates reinforced with graphene platelets. For this purpose, the theory of nonlocal strain gradient elasticity incorporating the both stiffness reduction and stiffness enhancement mechanisms of size effects is applied to the refined exponential shear deformation plate theory. Three different patterns of porosity dispersion across the plate thickness in conjunction with the uniform one are assumed for FGPM as an open-cell metal foam is utilized associated with the coefficients of the relative density and porosity. With the aid of the virtual work’s principle, the non-classical governing differential equations are constructed. Thereafter, an improved perturbation technique is employed to capture the size dependencies in the nonlinear load-deflection and load-shortening responses of the reinforced FGPM micro/nano-plates with and without initial geometric imperfection. It is indicated that by increasing the value of porosity coefficient, the size-dependent critical buckling loads of reinforced FGPM micro/nano-plates with all types of porosity dispersion pattern reduce, but the associated shortening may increase or decrease which depends on the type of dispersion pattern.

Nonlinear responses of chiral fluids from kinetic theory

Science.gov (United States)

Hidaka, Yoshimasa; Pu, Shi; Yang, Di-Lun

2018-01-01

The second-order nonlinear responses of inviscid chiral fluids near local equilibrium are investigated by applying the chiral kinetic theory (CKT) incorporating side-jump effects. It is shown that the local equilibrium distribution function can be nontrivially introduced in a comoving frame with respect to the fluid velocity when the quantum corrections in collisions are involved. For the study of anomalous transport, contributions from both quantum corrections in anomalous hydrodynamic equations of motion and those from the CKT and Wigner functions are considered under the relaxation-time (RT) approximation, which result in anomalous charge Hall currents propagating along the cross product of the background electric field and the temperature (or chemical-potential) gradient and of the temperature and chemical-potential gradients. On the other hand, the nonlinear quantum correction on the charge density vanishes in the classical RT approximation, which in fact satisfies the matching condition given by the anomalous equation obtained from the CKT.

Study on the temperature gradient evolution of large size nonlinear crystal based on the fluid-solid coupling theory

Science.gov (United States)

Sun, F. Z.; Zhang, P.; Liang, Y. C.; Lu, L. H.

2014-09-01

In the non-critical phase-matching (NCPM) along the Θ =90° direction, ADP and DKDP crystals which have many advantages, including a large effective nonlinear optical coefficient, a small PM angular sensitivity and non beam walk-off, at the non-critical phase-matching become the competitive candidates in the inertial confinement fusion(ICF) facility, so the reasonable temperature control of crystals has become more and more important .In this paper, the fluid-solid coupling models of ADP crystal and DKDP crystal which both have anisotropic thermal conductivity in the states of vacuum and non-vacuum were established firstly, and then simulated using the fluid analysis software Fluent. The results through the analysis show that the crystal surface temperature distribution is a ring shape, the temperature gradients in the direction of the optical axis both the crystals are 0.02°C and 0.01°C due to the air, the lowest temperature points of the crystals are both at the center of surface, and the temperatures are lower than 0.09°C and 0.05°C compared in the vacuum and non-vacuum environment, then propose two designs for heating apparatus.

Nonlinear Motion Tracking by Deep Learning Architecture

Science.gov (United States)

Verma, Arnav; Samaiya, Devesh; Gupta, Karunesh K.

2018-03-01

In the world of Artificial Intelligence, object motion tracking is one of the major problems. The extensive research is being carried out to track people in crowd. This paper presents a unique technique for nonlinear motion tracking in the absence of prior knowledge of nature of nonlinear path that the object being tracked may follow. We achieve this by first obtaining the centroid of the object and then using the centroid as the current example for a recurrent neural network trained using real-time recurrent learning. We have tweaked the standard algorithm slightly and have accumulated the gradient for few previous iterations instead of using just the current iteration as is the norm. We show that for a single object, such a recurrent neural network is highly capable of approximating the nonlinearity of its path.

Evaluation of iodovinyl antibody conjugates: Comparison with a p-iodobenzoyl conjugate and direct radioiodination

International Nuclear Information System (INIS)

Hadley, S.W.; Wilbur, D.S.

1990-01-01

The preparations and conjugations of 2,3,5,6-tetrafluorophenyl 5-[125I/131I]iodo-4-pentenoate (7a) and 2,3,5,6-tetrafluorophenyl 3,3-dimethyl-5-[125I/131I]iodo-4-pentenoate (7b) to monoclonal antibodies are reported. Reagents 7a and 7b were prepared in high radiochemical yield by iododestannylation of their corresponding 5-tri-n-butylstannyl precursors. Radioiodinated antibody conjugates were prepared by reaction of 7a or 7b with the protein at basic pH. Evaluation of these conjugates by several in vitro procedures demonstrated that the radiolabel was attached to the antibody in a stable manner and that the conjugates maintained immunoreactivity. Comparative dual-isotope biodistribution studies of a monoclonal antibody Fab fragment conjugate of 7a and 7b with the same Fab fragment labeled with N-succinimidyl p-[131I]iodobenzoate (PIB, p-iodobenzoate, 2) or directly radioiodinated have been carried out in tumor-bearing nude mice. Coinjection of the Fab conjugate of 7a with the Fab conjugate of 2 demonstrated that the biodistributions were similar in most organs, except the neck tissue (thyroid-containing) and the stomach, which contained substantially increased levels of the 7a label. Coinjection of the Fab conjugate of 7a with the Fab fragment radioiodinated by using the chloramine-T method demonstrated that the biodistributions were remarkably similar, suggesting roughly equivalent in vivo deiodination of these labeled antibody fragments. Coinjection of the Fab conjugate of 7a with the Fab conjugate of 7b indicated that there was ∼ a 2-fold reduction in the amount of in vivo deiodination of the 7b conjugate as compared to the 7a conjugate

Development of {sup 177}Lu-DTPA-SPIO conjugates for potential use as a dual contrast SPECT/MRI imaging agent

Energy Technology Data Exchange (ETDEWEB)

Shanehsazzadeh, Saeed; Yousefnia, Hassan [Nuclear Science and Technology Research Institute (NSTRI), Tehran (Iran, Islamic Republic of); Gruettner, Cordula [Micromod Partikeltechnologie GmbH, Rostock (Germany); and others

2016-08-01

This study describes the preparation, biodistribution of {sup 177}Lu-DTPA-SPIO after intravenous injection in rats. The chelator DTPA dianhydride was conjugated to SPIO NPs using a small modification of the well-known cyclic anhydride method. Conjugation was done at a 1:2 (SPIO:ccDTPA) molar ratio. Conjugation reaction was purified with Magnetic assorting column (MACs) using high gradient magnetic field following incubation, the radio labeled conjugate was checked using RTLC method for labeling and purity checked. The RTLC showed that labeling yield was above 99% after purification and the compound have good in-vitro stabilities until 48 h post injection in the presence of human serum. The biodistribution of {sup 177}Lu-DTPA-SPIO in rats showed dramatic uptake in the reticuloendothelial system (RES) and their clearance is so fast in other organs especially in the blood. In conclusion, due to high uptakes of this radiotracer in the liver and spleen and their fast clearance from other tissues, especially in blood, it is suggested that this radiotracer would be suitable for RES studies.

Gradient-based estimation of Manning's friction coefficient from noisy data

KAUST Repository

Calo, Victor M.

2013-01-01

We study the numerical recovery of Manning\\'s roughness coefficient for the diffusive wave approximation of the shallow water equation. We describe a conjugate gradient method for the numerical inversion. Numerical results for one-dimensional models are presented to illustrate the feasibility of the approach. Also we provide a proof of the differentiability of the weak form with respect to the coefficient as well as the continuity and boundedness of the linearized operator under reasonable assumptions using the maximal parabolic regularity theory. © 2012 Elsevier B.V. All rights reserved.

Gradient-based estimation of Manning's friction coefficient from noisy data

KAUST Repository

Calo, Victor M.; Collier, Nathan; Gehre, Matthias; Jin, Bangti; Radwan, Hany G.; Santillana, Mauricio

2013-01-01

We study the numerical recovery of Manning's roughness coefficient for the diffusive wave approximation of the shallow water equation. We describe a conjugate gradient method for the numerical inversion. Numerical results for one-dimensional models are presented to illustrate the feasibility of the approach. Also we provide a proof of the differentiability of the weak form with respect to the coefficient as well as the continuity and boundedness of the linearized operator under reasonable assumptions using the maximal parabolic regularity theory. © 2012 Elsevier B.V. All rights reserved.

Bayesian inversion analysis of nonlinear dynamics in surface heterogeneous reactions.

Science.gov (United States)

Omori, Toshiaki; Kuwatani, Tatsu; Okamoto, Atsushi; Hukushima, Koji

2016-09-01

It is essential to extract nonlinear dynamics from time-series data as an inverse problem in natural sciences. We propose a Bayesian statistical framework for extracting nonlinear dynamics of surface heterogeneous reactions from sparse and noisy observable data. Surface heterogeneous reactions are chemical reactions with conjugation of multiple phases, and they have the intrinsic nonlinearity of their dynamics caused by the effect of surface-area between different phases. We adapt a belief propagation method and an expectation-maximization (EM) algorithm to partial observation problem, in order to simultaneously estimate the time course of hidden variables and the kinetic parameters underlying dynamics. The proposed belief propagation method is performed by using sequential Monte Carlo algorithm in order to estimate nonlinear dynamical system. Using our proposed method, we show that the rate constants of dissolution and precipitation reactions, which are typical examples of surface heterogeneous reactions, as well as the temporal changes of solid reactants and products, were successfully estimated only from the observable temporal changes in the concentration of the dissolved intermediate product.

TU-F-CAMPUS-I-04: Head-Only Asymmetric Gradient System Evaluation: ACR Image Quality and Acoustic Noise

Energy Technology Data Exchange (ETDEWEB)

Weavers, P; Shu, Y; Tao, S; Bernstein, M [Mayo Clinic, Rochester, Minnesota (United States); Lee, S; Piel, J; Foo, T [GE Global Research, Niskayuna, NY (United States); Mathieu, J-B [GE Healthcare, Florence, SC (Italy)

2015-06-15

Purpose: A high-performance head-only magnetic resonance imaging gradient system with an acquisition volume of 26 cm employing an asymmetric design for the transverse coils has been developed. It is able to reach a magnitude of 85 mT/m at a slew rate of 700 T/m/s, but operated at 80 mT/m and 500 T/m/s for this test. A challenge resulting from this asymmetric design is that the gradient nonlinearly exhibits both odd- and even-ordered terms, and as the full imaging field of view is often used, the nonlinearity is pronounced. The purpose of this work is to show the system can produce clinically useful images after an on-site gradient nonlinearity calibration and correction, and show that acoustic noise levels fall within non-significant risk (NSR) limits for standard clinical pulse sequences. Methods: The head-only gradient system was inserted into a standard 3T wide-bore scanner without acoustic damping. The ACR phantom was scanned in an 8-channel receive-only head coil and the standard American College of Radiology (ACR) MRI quality control (QC) test was performed. Acoustic noise levels were measured for several standard pulse sequences. Results: Images acquired with the head-only gradient system passed all ACR MR image quality tests; Both even and odd-order gradient distortion correction terms were required for the asymmetric gradients to pass. Acoustic noise measurements were within FDA NSR guidelines of 99 dBA (with assumed 20 dBA hearing protection) A-weighted and 140 dB for peak for all but one sequence. Note the gradient system was installed without any shroud or acoustic batting. We expect final system integration to greatly reduce noise experienced by the patient. Conclusion: A high-performance head-only asymmetric gradient system operating at 80 mT/m and 500 T/m/s conforms to FDA acoustic noise limits in all but one case, and passes all the ACR MR image quality control tests. This work was supported in part by the NIH grant 5R01EB010065.

TU-F-CAMPUS-I-04: Head-Only Asymmetric Gradient System Evaluation: ACR Image Quality and Acoustic Noise

International Nuclear Information System (INIS)

Weavers, P; Shu, Y; Tao, S; Bernstein, M; Lee, S; Piel, J; Foo, T; Mathieu, J-B

2015-01-01

Purpose: A high-performance head-only magnetic resonance imaging gradient system with an acquisition volume of 26 cm employing an asymmetric design for the transverse coils has been developed. It is able to reach a magnitude of 85 mT/m at a slew rate of 700 T/m/s, but operated at 80 mT/m and 500 T/m/s for this test. A challenge resulting from this asymmetric design is that the gradient nonlinearly exhibits both odd- and even-ordered terms, and as the full imaging field of view is often used, the nonlinearity is pronounced. The purpose of this work is to show the system can produce clinically useful images after an on-site gradient nonlinearity calibration and correction, and show that acoustic noise levels fall within non-significant risk (NSR) limits for standard clinical pulse sequences. Methods: The head-only gradient system was inserted into a standard 3T wide-bore scanner without acoustic damping. The ACR phantom was scanned in an 8-channel receive-only head coil and the standard American College of Radiology (ACR) MRI quality control (QC) test was performed. Acoustic noise levels were measured for several standard pulse sequences. Results: Images acquired with the head-only gradient system passed all ACR MR image quality tests; Both even and odd-order gradient distortion correction terms were required for the asymmetric gradients to pass. Acoustic noise measurements were within FDA NSR guidelines of 99 dBA (with assumed 20 dBA hearing protection) A-weighted and 140 dB for peak for all but one sequence. Note the gradient system was installed without any shroud or acoustic batting. We expect final system integration to greatly reduce noise experienced by the patient. Conclusion: A high-performance head-only asymmetric gradient system operating at 80 mT/m and 500 T/m/s conforms to FDA acoustic noise limits in all but one case, and passes all the ACR MR image quality control tests. This work was supported in part by the NIH grant 5R01EB010065

Theory of neoclassical resistivity-gradient-driven turbulence

International Nuclear Information System (INIS)

Kwon, O.J.; Diamond, P.H.; Hahm, T.S.

1988-12-01

It is shown that rippling instabilities can tap the density gradient expansion free energy source through the density dependence of the neoclassical resistivity. Linear analyses show that the region where neoclassical rippling modes are significantly excited extends from the edge of the plasma to the region where ν/sub *e/ ≤ 1. Since these modes are non-dispersive, diamagnetic effects are negligible in comparison to the nonlinear decorrelation rate at saturation. Thus, the relevant regime is the 'strong turbulence' regime. The turbulent radial diffusivities of the temperature and the density are obtained as eigenvalues of the renormalized eigenmode equations at steady state. The density gradient acts to enhance the level of turbulence, compared to that driven by the temperature gradient alone. The saturated turbulent state is characterized by: current decoupling, the breakdown of Boltzmann relation, a radial mode scale of density fluctuations exceeding that of temperature fluctuations, implying that density diffusivity exceeds temperature diffusivity, and that density fluctuation levels exceed temperature fluctuation levels. Magnetic fluctuation levels are negligible. 29 refs., 1 fig

Spatiotemporal behavior and nonlinear dynamics in a phase conjugate resonator

Science.gov (United States)

Liu, Siuying Raymond

1993-01-01

The work described can be divided into two parts. The first part is an investigation of the transient behavior and stability property of a phase conjugate resonator (PCR) below threshold. The second part is an experimental and theoretical study of the PCR's spatiotemporal dynamics above threshold. The time-dependent coupled wave equations for four-wave mixing (FWM) in a photorefractive crystal, with two distinct interaction regions caused by feedback from an ordinary mirror, was used to model the transient dynamics of a PCR below threshold. The conditions for self-oscillation were determined and the solutions were used to define the PCR's transfer function and analyze its stability. Experimental results for the buildup and decay times confirmed qualitatively the predicted behavior. Experiments were carried out above threshold to study the spatiotemporal dynamics of the PCR as a function of Pragg detuning and the resonator's Fresnel number. The existence of optical vortices in the wavefront were identified by optical interferometry. It was possible to describe the transverse dynamics and the spatiotemporal instabilities by modeling the three-dimensional-coupled wave equations in photorefractive FWM using a truncated modal expansion approach.

Co-conjugation vis-à-vis individual conjugation of α-amylase and glucoamylase for hydrolysis of starch.

Science.gov (United States)

Jadhav, Swati B; Singhal, Rekha S

2013-10-15

Two enzymes, α-amylase and glucoamylase have been individually and co-conjugated to pectin by covalent binding. Both the enzyme systems showed better thermal and pH stability over the free enzyme system with the complete retention of original activities. Mixture of individually conjugated enzymes showed lower inactivation rate constant with longer half life than the co-conjugated enzyme system. Individually conjugated enzymes showed an increase of 56.48 kJ/mole and 38.22 kJ/mole in activation energy for denaturation than the free enzymes and co-conjugated enzymes, respectively. Km as well as Vmax of individually and co-conjugated enzymes was found to be higher than the free enzymes. SDS-polyacrylamide gel electrophoresis confirmed the formation of conjugate and co-conjugate as evident by increased molecular weight. Both the enzyme systems were used for starch hydrolysis where individually conjugated enzymes showed highest release of glucose at 60 °C and pH 5.0 as compared to free and co-conjugated enzyme. Copyright © 2013 Elsevier Ltd. All rights reserved.

General approach for solving the density gradient theory in the interfacial tension calculations

DEFF Research Database (Denmark)

Liang, Xiaodong; Michelsen, Michael Locht

2017-01-01

Within the framework of the density gradient theory, the interfacial tension can be calculated by finding the density profiles that minimize an integral of two terms over the system of infinite width. It is found that the two integrands exhibit a constant difference along the interface for a finite...... property evaluations compared to other methods. The performance of the algorithm with recommended parameters is analyzed for various systems, and the efficiency is further compared with the geometric-mean density gradient theory, which only needs to solve nonlinear algebraic equations. The results show...... that the algorithm is only 5-10 times less efficient than solving the geometric-mean density gradient theory....

High-precision numerical simulation with autoadaptative grid technique in nonlinear thermal diffusion

International Nuclear Information System (INIS)

Chambarel, A.; Pumborios, M.

1992-01-01

This paper reports that many engineering problems concern the determination of a steady state solution in the case with strong thermal gradients, and results obtained using the finite-element technique are sometimes inaccurate, particularly for nonlinear problems with unadapted meshes. Building on previous results in linear problems, we propose an autoadaptive technique for nonlinear cases that uses quasi-Newtonian iterations to reevaluate an interpolation error estimation. The authors perfected an automatic refinement technique to solve the nonlinear thermal problem of temperature calculus in a cast-iron cylinder head of a diesel engine

Optimization of hardening/softening behavior of plane frame structures using nonlinear normal modes

DEFF Research Database (Denmark)

Dou, Suguang; Jensen, Jakob Søndergaard

2016-01-01

Devices that exploit essential nonlinear behavior such as hardening/softening and inter-modal coupling effects are increasingly used in engineering and fundamental studies. Based on nonlinear normal modes, we present a gradient-based structural optimization method for tailoring the hardening...... involving plane frame structures where the hardening/softening behavior is qualitatively and quantitatively tuned by simple changes in the geometry of the structures....

Nonlinear Microwave Imaging for Breast-Cancer Screening Using Gauss–Newton's Method and the CGLS Inversion Algorithm

DEFF Research Database (Denmark)

Rubæk, Tonny; Meaney, P. M.; Meincke, Peter

2007-01-01

is presented which is based on the conjugate gradient least squares (CGLS) algorithm. The iterative CGLS algorithm is capable of solving the update problem by operating on just the Jacobian and the regularizing effects of the algorithm can easily be controlled by adjusting the number of iterations. The new...

A reduced model for ion temperature gradient turbulent transport in helical plasmas

International Nuclear Information System (INIS)

Nunami, M.; Watanabe, T.-H.; Sugama, H.

2013-07-01

A novel reduced model for ion temperature gradient (ITG) turbulent transport in helical plasmas is presented. The model enables one to predict nonlinear gyrokinetic simulation results from linear gyrokinetic analyses. It is shown from nonlinear gyrokinetic simulations of the ITG turbulence in helical plasmas that the transport coefficient can be expressed as a function of the turbulent fluctuation level and the averaged zonal flow amplitude. Then, the reduced model for the turbulent ion heat diffusivity is derived by representing the nonlinear turbulent fluctuations and zonal flow amplitude in terms of the linear growth rate of the ITG instability and the linear response of the zonal flow potentials. It is confirmed that the reduced transport model results are in good agreement with those from nonlinear gyrokinetic simulations for high ion temperature plasmas in the Large Helical Device. (author)

Model predictive control for wind power gradients

DEFF Research Database (Denmark)

Hovgaard, Tobias Gybel; Boyd, Stephen; Jørgensen, John Bagterp

2015-01-01

We consider the operation of a wind turbine and a connected local battery or other electrical storage device, taking into account varying wind speed, with the goal of maximizing the total energy generated while respecting limits on the time derivative (gradient) of power delivered to the grid. We...... ranges. The system dynamics are quite non-linear, and the constraints and objectives are not convex functions of the control inputs, so the resulting optimal control problem is difficult to solve globally. In this paper, we show that by a novel change of variables, which focuses on power flows, we can...... wind data and modern wind forecasting methods. The simulation results using real wind data demonstrate the ability to reject the disturbances from fast changes in wind speed, ensuring certain power gradients, with an insignificant loss in energy production....

Nonlinear Flow Generation By Electrostatic Turbulence In Tokamaks

International Nuclear Information System (INIS)

Wang, W.X.; Diamond, P.H.; Hahm, T.S.; Ethier, S.; Rewoldt, G.; Tang, W.M.

2010-01-01

Global gyrokinetic simulations have revealed an important nonlinear flow generation process due to the residual stress produced by electrostatic turbulence of ion temperature gradient (ITG) modes and trapped electron modes (TEM). In collisionless TEM (CTEM) turbulence, nonlinear residual stress generation by both the fluctuation intensity and the intensity gradient in the presence of broken symmetry in the parallel wave number spectrum is identified for the first time. Concerning the origin of the symmetry breaking, turbulence self-generated low frequency zonal flow shear has been identified to be a key, universal mechanism in various turbulence regimes. Simulations reported here also indicate the existence of other mechanisms beyond E - B shear. The ITG turbulence driven 'intrinsic' torque associated with residual stress is shown to increase close to linearly with the ion temperature gradient, in qualitative agreement with experimental observations in various devices. In CTEM dominated regimes, a net toroidal rotation is driven in the cocurrent direction by 'intrinsic' torque, consistent with the experimental trend of observed intrinsic rotation. The finding of a 'flow pinch' in CTEM turbulence may offer an interesting new insight into the underlying dynamics governing the radial penetration of modulated flows in perturbation experiments. Finally, simulations also reveal highly distinct phase space structures between CTEM and ITG turbulence driven momentum, energy and particle fluxes, elucidating the roles of resonant and non-resonant particles.

Silicon Waveguide with Lateral p-i-n Diode for Nonlinearity Compensation by On-Chip Optical Phase Conjugation

DEFF Research Database (Denmark)

Gajda, A.; Da Ros, Francesco; Porto da Silva, Edson

2018-01-01

A 1-dB Q-factor improvement through optical phase conjugation in a silicon waveguide with a lateral p-i-n diode enables BER

Composite Beam Theory with Material Nonlinearities and Progressive Damage

Science.gov (United States)

Jiang, Fang

Beam has historically found its broad applications. Nowadays, many engineering constructions still rely on this type of structure which could be made of anisotropic and heterogeneous materials. These applications motivate the development of beam theory in which the impact of material nonlinearities and damage on the global constitutive behavior has been a focus in recent years. Reliable predictions of these nonlinear beam responses depend on not only the quality of the material description but also a comprehensively generalized multiscale methodology which fills the theoretical gaps between the scales in an efficient yet high-fidelity manner. The conventional beam modeling methodologies which are built upon ad hoc assumptions are in lack of such reliability in need. Therefore, the focus of this dissertation is to create a reliable yet efficient method and the corresponding tool for composite beam modeling. A nonlinear beam theory is developed based on the Mechanics of Structure Genome (MSG) using the variational asymptotic method (VAM). The three-dimensional (3D) nonlinear continuum problem is rigorously reduced to a one-dimensional (1D) beam model and a two-dimensional (2D) cross-sectional analysis featuring both geometric and material nonlinearities by exploiting the small geometric parameter which is an inherent geometric characteristic of the beam. The 2D nonlinear cross-sectional analysis utilizes the 3D material models to homogenize the beam cross-sectional constitutive responses considering the nonlinear elasticity and progressive damage. The results from such a homogenization are inputs as constitutive laws into the global nonlinear 1D beam analysis. The theoretical foundation is formulated without unnecessary kinematic assumptions. Curvilinear coordinates and vector calculus are utilized to build the 3D deformation gradient tensor, of which the components are formulated in terms of cross-sectional coordinates, generalized beam strains, unknown warping

Gradient-Type Magnetoelectric Current Sensor with Strong Multisource Noise Suppression.

Science.gov (United States)

Zhang, Mingji; Or, Siu Wing

2018-02-14

A novel gradient-type magnetoelectric (ME) current sensor operating in magnetic field gradient (MFG) detection and conversion mode is developed based on a pair of ME composites that have a back-to-back capacitor configuration under a baseline separation and a magnetic biasing in an electrically-shielded and mechanically-enclosed housing. The physics behind the current sensing process is the product effect of the current-induced MFG effect associated with vortex magnetic fields of current-carrying cables (i.e., MFG detection) and the MFG-induced ME effect in the ME composite pair (i.e., MFG conversion). The sensor output voltage is directly obtained from the gradient ME voltage of the ME composite pair and is calibrated against cable current to give the current sensitivity. The current sensing performance of the sensor is evaluated, both theoretically and experimentally, under multisource noises of electric fields, magnetic fields, vibrations, and thermals. The sensor combines the merits of small nonlinearity in the current-induced MFG effect with those of high sensitivity and high common-mode noise rejection rate in the MFG-induced ME effect to achieve a high current sensitivity of 0.65-12.55 mV/A in the frequency range of 10 Hz-170 kHz, a small input-output nonlinearity of <500 ppm, a small thermal drift of <0.2%/℃ in the current range of 0-20 A, and a high common-mode noise rejection rate of 17-28 dB from multisource noises.

Feedforward Nonlinear Control Using Neural Gas Network

Directory of Open Access Journals (Sweden)

Iván Machón-González

2017-01-01

Full Text Available Nonlinear systems control is a main issue in control theory. Many developed applications suffer from a mathematical foundation not as general as the theory of linear systems. This paper proposes a control strategy of nonlinear systems with unknown dynamics by means of a set of local linear models obtained by a supervised neural gas network. The proposed approach takes advantage of the neural gas feature by which the algorithm yields a very robust clustering procedure. The direct model of the plant constitutes a piece-wise linear approximation of the nonlinear system and each neuron represents a local linear model for which a linear controller is designed. The neural gas model works as an observer and a controller at the same time. A state feedback control is implemented by estimation of the state variables based on the local transfer function that was provided by the local linear model. The gradient vectors obtained by the supervised neural gas algorithm provide a robust procedure for feedforward nonlinear control, that is, supposing the inexistence of disturbances.

A fourth gradient to overcome slice dependent phase effects of voxel-sized coils in planar arrays.

Science.gov (United States)

Bosshard, John C; Eigenbrodt, Edwin P; McDougall, Mary P; Wright, Steven M

2010-01-01

The signals from an array of densely spaced long and narrow receive coils for MRI are complicated when the voxel size is of comparable dimension to the coil size. The RF coil causes a phase gradient across each voxel, which is dependent on the distance from the coil, resulting in a slice dependent shift of k-space. A fourth gradient coil has been implemented and used with the system's gradient set to create a gradient field which varies with slice. The gradients are pulsed together to impart a slice dependent phase gradient to compensate for the slice dependent phase due to the RF coils. However the non-linearity in the fourth gradient which creates the desired slice dependency also results in a through-slice phase ramp, which disturbs normal slice refocusing and leads to additional signal cancelation and reduced field of view. This paper discusses the benefits and limitations of using a fourth gradient coil to compensate for the phase due to RF coils.

Observer-based design of set-point tracking adaptive controllers for nonlinear chaotic systems

International Nuclear Information System (INIS)

Khaki-Sedigh, A.; Yazdanpanah-Goharrizi, A.

2006-01-01

A gradient based approach for the design of set-point tracking adaptive controllers for nonlinear chaotic systems is presented. In this approach, Lyapunov exponents are used to select the controller gain. In the case of unknown or time varying chaotic plants, the Lyapunov exponents may vary during the plant operation. In this paper, an effective adaptive strategy is used for online identification of Lyapunov exponents and adaptive control of nonlinear chaotic plants. Also, a nonlinear observer for estimation of the states is proposed. Simulation results are provided to show the effectiveness of the proposed methodology

Observer-based design of set-point tracking adaptive controllers for nonlinear chaotic systems

Energy Technology Data Exchange (ETDEWEB)

Khaki-Sedigh, A. [Department of Electrical Engineering, K.N. Toosi University of Technology, Sayyed Khandan Bridge, Shariati Street, Tehran 16314 (Iran, Islamic Republic of)]. E-mail: sedigh@kntu.ac.ir; Yazdanpanah-Goharrizi, A. [Department of Electrical Engineering, K.N. Toosi University of Technology, Sayyed Khandan Bridge, Shariati Street, Tehran 16314 (Iran, Islamic Republic of)]. E-mail: yazdanpanah@ee.kntu.ac.ir

2006-09-15

A gradient based approach for the design of set-point tracking adaptive controllers for nonlinear chaotic systems is presented. In this approach, Lyapunov exponents are used to select the controller gain. In the case of unknown or time varying chaotic plants, the Lyapunov exponents may vary during the plant operation. In this paper, an effective adaptive strategy is used for online identification of Lyapunov exponents and adaptive control of nonlinear chaotic plants. Also, a nonlinear observer for estimation of the states is proposed. Simulation results are provided to show the effectiveness of the proposed methodology.

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

Science.gov (United States)

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

2010-01-01

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

Bacteriophytochromes control conjugation in Agrobacterium fabrum.

Science.gov (United States)

Bai, Yingnan; Rottwinkel, Gregor; Feng, Juan; Liu, Yiyao; Lamparter, Tilman

2016-08-01

Bacterial conjugation, the transfer of single stranded plasmid DNA from donor to recipient cell, is mediated through the type IV secretion system. We performed conjugation assays using a transmissible artificial plasmid as reporter. With this assay, conjugation in Agrobacterium fabrum was modulated by the phytochromes Agp1 and Agp2, photoreceptors that are most sensitive in the red region of visible light. In conjugation studies with wild-type donor cells carrying a pBIN-GUSINT plasmid as reporter that lacked the Ti (tumor inducing) plasmid, no conjugation was observed. When either agp1(-) or agp2(-) knockout donor strains were used, plasmid DNA was delivered to the recipient, indicating that both phytochromes suppress conjugation in the wild type donor. In the recipient strains, the loss of Agp1 or Agp2 led to diminished conjugation. When wild type cells with Ti plasmid and pBIN-GUS reporter plasmid were used as donor, a high rate of conjugation was observed. The DNA transfer was down regulated by red or far-red light by a factor of 3.5. With agp1(-) or agp2(-) knockout donor cells, conjugation in the dark was about 10 times lower than with the wild type donor, and with the double knockout donor no conjugation was observed. These results imply that the phytochrome system has evolved to inhibit conjugation in the light. The decrease of conjugation under different temperature correlated with the decrease of phytochrome autophosphorylation. Copyright © 2015 Elsevier B.V. All rights reserved.

Analyses of Lattice Traffic Flow Model on a Gradient Highway

International Nuclear Information System (INIS)

Gupta Arvind Kumar; Redhu Poonam; Sharma Sapna

2014-01-01

The optimal current difference lattice hydrodynamic model is extended to investigate the traffic flow dynamics on a unidirectional single lane gradient highway. The effect of slope on uphill/downhill highway is examined through linear stability analysis and shown that the slope significantly affects the stability region on the phase diagram. Using nonlinear stability analysis, the Burgers, Korteweg-deVries (KdV) and modified Korteweg-deVries (mKdV) equations are derived in stable, metastable and unstable region, respectively. The effect of reaction coefficient is examined and concluded that it plays an important role in suppressing the traffic jams on a gradient highway. The theoretical findings have been verified through numerical simulation which confirm that the slope on a gradient highway significantly influence the traffic dynamics and traffic jam can be suppressed efficiently by considering the optimal current difference effect in the new lattice model. (nuclear physics)

A Gradient Weighted Moving Finite-Element Method with Polynomial Approximation of Any Degree

Directory of Open Access Journals (Sweden)

Ali R. Soheili

2009-01-01

Full Text Available A gradient weighted moving finite element method (GWMFE based on piecewise polynomial of any degree is developed to solve time-dependent problems in two space dimensions. Numerical experiments are employed to test the accuracy and effciency of the proposed method with nonlinear Burger equation.

Full-waveform inversion using a nonlinearly smoothed wavefield

KAUST Repository

Li, Yuanyuan

2017-12-08

Conventional full-waveform inversion (FWI) based on the least-squares misfit function faces problems in converging to the global minimum when using gradient methods because of the cycle-skipping phenomena. An initial model producing data that are at most a half-cycle away from the observed data is needed for convergence to the global minimum. Low frequencies are helpful in updating low-wavenumber components of the velocity model to avoid cycle skipping. However, low enough frequencies are usually unavailable in field cases. The multiplication of wavefields of slightly different frequencies adds artificial low-frequency components in the data, which can be used for FWI to generate a convergent result and avoid cycle skipping. We generalize this process by multiplying the wavefield with itself and then applying a smoothing operator to the multiplied wavefield or its square to derive the nonlinearly smoothed wavefield, which is rich in low frequencies. The global correlation-norm-based objective function can mitigate the dependence on the amplitude information of the nonlinearly smoothed wavefield. Therefore, we have evaluated the use of this objective function when using the nonlinearly smoothed wavefield. The proposed objective function has much larger convexity than the conventional objective functions. We calculate the gradient of the objective function using the adjoint-state technique, which is similar to that of the conventional FWI except for the adjoint source. We progressively reduce the smoothing width applied to the nonlinear wavefield to naturally adopt the multiscale strategy. Using examples on the Marmousi 2 model, we determine that the proposed FWI helps to generate convergent results without the need for low-frequency information.

Polymers for Protein Conjugation

Directory of Open Access Journals (Sweden)

Gianfranco Pasut

2014-01-01

Full Text Available Polyethylene glycol (PEG at the moment is considered the leading polymer for protein conjugation in view of its unique properties, as well as to its low toxicity in humans, qualities which have been confirmed by its extensive use in clinical practice. Other polymers that are safe, biodegradable and custom-designed have, nevertheless, also been investigated as potential candidates for protein conjugation. This review will focus on natural polymers and synthetic linear polymers that have been used for protein delivery and the results associated with their use. Genetic fusion approaches for the preparation of protein-polypeptide conjugates will be also reviewed and compared with the best known chemical conjugation ones.

Nonlinear oscillation regime of electromagnetic disturbances in the equatorial F region

International Nuclear Information System (INIS)

Sazonov, S.V.

1990-01-01

Nonlinear oscillation regime of electromagnetic dicturbances within equatorial ionosphere F-region resulted from Rayleigh-Taylor instability, gradient-drift instability and recombination processes is investigated on the basis of two-liquid quasihydrodynamics equations. It is shown, that at positive linear increment the oscillations are developing in regime with aggregation and are terminated by increment the effect of threshold destabilization, when under certain initial conditions underlgoes oscillation nonlinear swinging, resulting, as well, in bubble formation in contrast to small damping oscillations, is detected

A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix

Directory of Open Access Journals (Sweden)

Jianchao Bai

2015-01-01

Full Text Available We consider the weighted low rank approximation of the positive semidefinite Hankel matrix problem arising in signal processing. By using the Vandermonde representation, we firstly transform the problem into an unconstrained optimization problem and then use the nonlinear conjugate gradient algorithm with the Armijo line search to solve the equivalent unconstrained optimization problem. Numerical examples illustrate that the new method is feasible and effective.

Generation of zonal flows by ion-temperature-gradient and related modes in the presence of neoclassical viscosity

International Nuclear Information System (INIS)

Mikhailovskii, A.B.; Smolyakov, A.I.; Kovalishen, E.A.; Shirokov, M.S.; Tsypin, V.S.; Galvao, R.M.O.

2006-01-01

Generation of zonal flows by primary waves that are more complex than those considered in the standard drift-wave model is studied. The effects of parallel ion velocity and ion perturbed temperature and the part of the nonlinear mode interaction proportional to the ion pressure are taken into account. This generalization of the standard model allows the analysis of generation of zonal flows by a rather wide variety of primary modes, including ion temperature gradients, ion sound, electron drift, and drift-sound modes. All the listed effects, which are present in the slab geometry model, are complemented by effects of neoclassical viscosity inherent to toroidal geometry. We show that the electrostatic potential of secondary small-scale modes is expressed in terms of a nonlinear shift of the mode frequency and interpret this shift in terms of the perpendicular and parallel Doppler, nonlinear Kelvin-Helmholtz (KH), and nonlinear ion-pressure-gradient effects. A basic assumption of our model is that the primary modes form a nondispersive monochromatic wave packet. The analysis of zonal-flow generation is performed following an approach similar to that of convective-cell theory. Neoclassical zonal-flow instabilities are separated into fast and slow ones, and these are divided into two varieties. The first of them is independent of the nonlinear KH effect, while the second one is sensitive to it

Antibiotic Conjugated Fluorescent Carbon Dots as a Theranostic Agent for Controlled Drug Release, Bioimaging, and Enhanced Antimicrobial Activity

Directory of Open Access Journals (Sweden)

Mukeshchand Thakur

2014-01-01

Full Text Available A novel report on microwave assisted synthesis of bright carbon dots (C-dots using gum arabic (GA and its use as molecular vehicle to ferry ciprofloxacin hydrochloride, a broad spectrum antibiotic, is reported in the present work. Density gradient centrifugation (DGC was used to separate different types of C-dots. After careful analysis of the fractions obtained after centrifugation, ciprofloxacin was attached to synthesize ciprofloxacin conjugated with C-dots (Cipro@C-dots conjugate. Release of ciprofloxacin was found to be extremely regulated under physiological conditions. Cipro@C-dots were found to be biocompatible on Vero cells as compared to free ciprofloxacin (1.2 mM even at very high concentrations. Bare C-dots (∼13 mg mL−1 were used for microbial imaging of the simplest eukaryotic model—Saccharomyces cerevisiae (yeast. Bright green fluorescent was obtained when live imaging was performed to view yeast cells under fluorescent microscope suggesting C-dots incorporation inside the cells. Cipro@C-dots conjugate also showed enhanced antimicrobial activity against both model gram positive and gram negative microorganisms. Thus, the Cipro@C-dots conjugate paves not only a way for bioimaging but also an efficient new nanocarrier for controlled drug release with high antimicrobial activity, thereby serving potential tool for theranostics.

Myocardial perfusion magnetic resonance imaging using sliding-window conjugate-gradient highly constrained back-projection reconstruction for detection of coronary artery disease.

Science.gov (United States)

Ma, Heng; Yang, Jun; Liu, Jing; Ge, Lan; An, Jing; Tang, Qing; Li, Han; Zhang, Yu; Chen, David; Wang, Yong; Liu, Jiabin; Liang, Zhigang; Lin, Kai; Jin, Lixin; Bi, Xiaoming; Li, Kuncheng; Li, Debiao

2012-04-15

Myocardial perfusion magnetic resonance imaging (MRI) with sliding-window conjugate-gradient highly constrained back-projection reconstruction (SW-CG-HYPR) allows whole left ventricular coverage, improved temporal and spatial resolution and signal/noise ratio, and reduced cardiac motion-related image artifacts. The accuracy of this technique for detecting coronary artery disease (CAD) has not been determined in a large number of patients. We prospectively evaluated the diagnostic performance of myocardial perfusion MRI with SW-CG-HYPR in patients with suspected CAD. A total of 50 consecutive patients who were scheduled for coronary angiography with suspected CAD underwent myocardial perfusion MRI with SW-CG-HYPR at 3.0 T. The perfusion defects were interpreted qualitatively by 2 blinded observers and were correlated with x-ray angiographic stenoses ≥50%. The prevalence of CAD was 56%. In the per-patient analysis, the sensitivity, specificity, positive predictive value, negative predictive value, and accuracy of SW-CG-HYPR was 96% (95% confidence interval 82% to 100%), 82% (95% confidence interval 60% to 95%), 87% (95% confidence interval 70% to 96%), 95% (95% confidence interval 74% to100%), and 90% (95% confidence interval 82% to 98%), respectively. In the per-vessel analysis, the corresponding values were 98% (95% confidence interval 91% to 100%), 89% (95% confidence interval 80% to 94%), 86% (95% confidence interval 76% to 93%), 99% (95% confidence interval 93% to 100%), and 93% (95% confidence interval 89% to 97%), respectively. In conclusion, myocardial perfusion MRI using SW-CG-HYPR allows whole left ventricular coverage and high resolution and has high diagnostic accuracy in patients with suspected CAD. Copyright © 2012 Elsevier Inc. All rights reserved.

A New Theory of Non-Linear Thermo-Elastic Constitutive Equation of Isotropic Hyperelastic Materials

Science.gov (United States)

Li, Chen; Liao, Yufei

2018-03-01

Considering the influence of temperature and strain variables on materials. According to the relationship of conjugate stress-strain, a complete and irreducible non-linear constitutive equation of isotropic hyperelastic materials is derived and the constitutive equations of 16 types of isotropic hyperelastic materials are given we study the transformation methods and routes of 16 kinds of constitutive equations and the study proves that transformation of two forms of constitutive equation. As an example of application, the non-linear thermo-elastic constitutive equation of isotropic hyperelastic materials is combined with the natural vulcanized rubber experimental data in the existing literature base on MATLAB, The results show that the fitting accuracy is satisfactory.

Single shot trajectory design for region-specific imaging using linear and nonlinear magnetic encoding fields.

Science.gov (United States)

Layton, Kelvin J; Gallichan, Daniel; Testud, Frederik; Cocosco, Chris A; Welz, Anna M; Barmet, Christoph; Pruessmann, Klaas P; Hennig, Jürgen; Zaitsev, Maxim

2013-09-01

It has recently been demonstrated that nonlinear encoding fields result in a spatially varying resolution. This work develops an automated procedure to design single-shot trajectories that create a local resolution improvement in a region of interest. The technique is based on the design of optimized local k-space trajectories and can be applied to arbitrary hardware configurations that employ any number of linear and nonlinear encoding fields. The trajectories designed in this work are tested with the currently available hardware setup consisting of three standard linear gradients and two quadrupolar encoding fields generated from a custom-built gradient insert. A field camera is used to measure the actual encoding trajectories up to third-order terms, enabling accurate reconstructions of these demanding single-shot trajectories, although the eddy current and concomitant field terms of the gradient insert have not been completely characterized. The local resolution improvement is demonstrated in phantom and in vivo experiments. Copyright © 2012 Wiley Periodicals, Inc.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Radar observations of density gradients, electric fields, and plasma irregularities near polar cap patches in the context of the gradient-drift instability

Science.gov (United States)

Lamarche, Leslie J.; Makarevich, Roman A.

2017-03-01

We present observations of plasma density gradients, electric fields, and small-scale plasma irregularities near a polar cap patch made by the Super Dual Auroral Radar Network radar at Rankin Inlet (RKN) and the northern face of Resolute Bay Incoherent Scatter Radar (RISR-N). RKN echo power and occurrence are analyzed in the context of gradient-drift instability (GDI) theory, with a particular focus on the previously uninvestigated 2-D dependencies on wave propagation, electric field, and gradient vectors, with the latter two quantities evaluated directly from RISR-N measurements. It is shown that higher gradient and electric field components along the wave vector generally lead to the higher observed echo occurrence, which is consistent with the expected higher GDI growth rate, but the relationship with echo power is far less straightforward. The RKN echo power increases monotonically as the predicted linear growth rate approaches zero from negative values but does not continue this trend into positive growth rate values, in contrast with GDI predictions. The observed greater consistency of echo occurrence with GDI predictions suggests that GDI operating in the linear regime can control basic plasma structuring, but measured echo strength may be affected by other processes and factors, such as multistep or nonlinear processes or a shear-driven instability.

Gradient-Type Magnetoelectric Current Sensor with Strong Multisource Noise Suppression

Science.gov (United States)

2018-01-01

A novel gradient-type magnetoelectric (ME) current sensor operating in magnetic field gradient (MFG) detection and conversion mode is developed based on a pair of ME composites that have a back-to-back capacitor configuration under a baseline separation and a magnetic biasing in an electrically-shielded and mechanically-enclosed housing. The physics behind the current sensing process is the product effect of the current-induced MFG effect associated with vortex magnetic fields of current-carrying cables (i.e., MFG detection) and the MFG-induced ME effect in the ME composite pair (i.e., MFG conversion). The sensor output voltage is directly obtained from the gradient ME voltage of the ME composite pair and is calibrated against cable current to give the current sensitivity. The current sensing performance of the sensor is evaluated, both theoretically and experimentally, under multisource noises of electric fields, magnetic fields, vibrations, and thermals. The sensor combines the merits of small nonlinearity in the current-induced MFG effect with those of high sensitivity and high common-mode noise rejection rate in the MFG-induced ME effect to achieve a high current sensitivity of 0.65–12.55 mV/A in the frequency range of 10 Hz–170 kHz, a small input-output nonlinearity of <500 ppm, a small thermal drift of <0.2%/℃ in the current range of 0–20 A, and a high common-mode noise rejection rate of 17–28 dB from multisource noises. PMID:29443920

Nonlinear Elasticity

Science.gov (United States)

Fu, Y. B.; Ogden, R. W.

2001-05-01

This collection of papers by leading researchers in the field of finite, nonlinear elasticity concerns itself with the behavior of objects that deform when external forces or temperature gradients are applied. This process is extremely important in many industrial settings, such as aerospace and rubber industries. This book covers the various aspects of the subject comprehensively with careful explanations of the basic theories and individual chapters each covering a different research direction. The authors discuss the use of symbolic manipulation software as well as computer algorithm issues. The emphasis is placed firmly on covering modern, recent developments, rather than the very theoretical approach often found. The book will be an excellent reference for both beginners and specialists in engineering, applied mathematics and physics.

Management and Nonlinear Analysis of Disinfection System of Water Distribution Networks Using Data Driven Methods

Directory of Open Access Journals (Sweden)

Mohammad Zounemat-Kermani

2018-03-01

Full Text Available Chlorination unit is widely used to supply safe drinking water and removal of pathogens from water distribution networks. Data-driven approach is one appropriate method for analyzing performance of chlorine in water supply network. In this study, multi-layer perceptron neural network (MLP with three training algorithms (gradient descent, conjugate gradient and BFGS and support vector machine (SVM with RBF kernel function were used to predict the concentration of residual chlorine in water supply networks of Ahmadabad Dafeh and Ahruiyeh villages in Kerman Province. Daily data including discharge (flow, chlorine consumption and residual chlorine were employed from the beginning of 1391 Hijri until the end of 1393 Hijri (for 3 years. To assess the performance of studied models, the criteria such as Nash-Sutcliffe efficiency (NS, root mean square error (RMSE, mean absolute percentage error (MAPE and correlation coefficient (CORR were used that in best modeling situation were 0.9484, 0.0255, 1.081, and 0.974 respectively which resulted from BFGS algorithm. The criteria indicated that MLP model with BFGS and conjugate gradient algorithms were better than all other models in 90 and 10 percent of cases respectively; while the MLP model based on gradient descent algorithm and the SVM model were better in none of the cases. According to the results of this study, proper management of chlorine concentration can be implemented by predicted values of residual chlorine in water supply network. Thus, decreased performance of perceptron network and support vector machine in water supply network of Ahruiyeh in comparison to Ahmadabad Dafeh can be inferred from improper management of chlorination.