Results 1  10
of
104
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil
Seismic Ray Theory
, 2001
"... Introduction T he propagation of seismic body waves in complex, laterally varying 3D layered structures is a complicated process. Analytical solutions of the elastodynamic equations for such types of media are not known. The most common approaches to the investigation of seismic wavefields in such ..."
Abstract

Cited by 131 (4 self)
 Add to MetaCart
Introduction T he propagation of seismic body waves in complex, laterally varying 3D layered structures is a complicated process. Analytical solutions of the elastodynamic equations for such types of media are not known. The most common approaches to the investigation of seismic wavefields
An Implementation Of The Dual Affine Scaling Algorithm For Minimum Cost Flow On Bipartite Uncapacitated Networks
 SIAM Journal on Optimization
, 1993
"... . We describe an implementation of the dual affine scaling algorithm for linear programming specialized to solve minimum cost flow problems on bipartite uncapacitated networks. This implementation uses a preconditioned conjugate gradient algorithm to solve the system of linear equations that determi ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
. We describe an implementation of the dual affine scaling algorithm for linear programming specialized to solve minimum cost flow problems on bipartite uncapacitated networks. This implementation uses a preconditioned conjugate gradient algorithm to solve the system of linear equations
2 NONMONOTONE BARZILAIBORWEIN GRADIENT ALGORITHM FOR ℓ1REGULARIZED NONSMOOTH MINIMIZATION IN COMPRESSIVE SENSING
"... ar ..."
Simple "ResidualNorm" Based Algorithms 303
, 1998
"... drawbacks such as local convergence, being sensitive to the initial guess of solution, and the timepenalty involved in finding the inversion of the Jacobian matrix ∂Fi/∂x j. Basedon an invariant manifold defined in the space of (x, t) in terms of the residualnorm of the vector F(x), we can deriv ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
derive a gradientflow system of nonlinear ordinary differential equations (ODEs) governing the evolution of x with a fictitious timelike variable t as an independent variable. We can prove that in the present novel ResidualNorm Based Algorithms (RNBAs), the residualerror is automatically decreased
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
UNITU–THEP–3/1998 FAU–TP3–98/2 Solving a Coupled Set of Truncated QCD Dyson–Schwinger Equations
, 1998
"... Truncated Dyson–Schwinger equations represent finite subsets of the equations of motion for Green’s functions. Solutions to these non–linear integral equations can account for non–perturbative correlations. A closed set of coupled Dyson–Schwinger equations for the propagators of gluons and ghosts in ..."
Abstract
 Add to MetaCart
in Landau gauge QCD is obtained by neglecting all contributions from irreducible 4–point correlations and by implementing the Slavnov–Taylor identities for the 3–point vertex functions. We solve this coupled set in an one–dimensional approximation which allows for an analytic infrared expansion necessary
NOTATION Cijkl incremental stress–strain tensor H Hamiltonian + Lagrangian
"... Hamilton equation based symplectic nite element ..."
Matrixfree multiGPU Implementation of Elliptic Solvers for strongly
, 2013
"... Manycore chip architectures such as Graphics Processing Units (GPUs) have been shown to be highly e cient both in terms of total performance and small power consumption in many areas of Scientific Computing. However, implementing memorybound applications such as elliptic solvers for large partial d ..."
Abstract
 Add to MetaCart
computational challenges as forecasts have to be delivered on operational timescales. Optimised “matrixfree ” GPU implementation. We developed an optimised GPU implementation of a preconditioned conjugate gradient (PCG) algorithm which deals with the strong vertical anisotropy by relaxing all degrees
Results 1  10
of
104