3,189 research outputs found

    Simulation of an Axial Vircator

    Full text link
    An algorithm of particle-in-cell simulations is described and tested to aid further the actual design of simple vircators working on axially symmetric modes. The methods of correction of the numerical solution, have been chosen and jointly tested, allow the stable simulation of the fast nonlinear multiflow dynamics of virtual cathode formation and evolution, as well as the fields generated by the virtual cathode. The selected combination of the correction methods can be straightforwardly generalized to the case of axially nonsymmetric modes, while the parameters of these correction methods can be widely used to improve an agreement between the simulation predictions and the experimental data.Comment: 9 pages, 3 figure

    Numerical methods for coupled reconstruction and registration in digital breast tomosynthesis.

    Get PDF
    Digital Breast Tomosynthesis (DBT) provides an insight into the fine details of normal fibroglandular tissues and abnormal lesions by reconstructing a pseudo-3D image of the breast. In this respect, DBT overcomes a major limitation of conventional X-ray mam- mography by reducing the confounding effects caused by the superposition of breast tissue. In a breast cancer screening or diagnostic context, a radiologist is interested in detecting change, which might be indicative of malignant disease. To help automate this task image registration is required to establish spatial correspondence between time points. Typically, images, such as MRI or CT, are first reconstructed and then registered. This approach can be effective if reconstructing using a complete set of data. However, for ill-posed, limited-angle problems such as DBT, estimating the deformation is com- plicated by the significant artefacts associated with the reconstruction, leading to severe inaccuracies in the registration. This paper presents a mathematical framework, which couples the two tasks and jointly estimates both image intensities and the parameters of a transformation. Under this framework, we compare an iterative method and a simultaneous method, both of which tackle the problem of comparing DBT data by combining reconstruction of a pair of temporal volumes with their registration. We evaluate our methods using various computational digital phantoms, uncom- pressed breast MR images, and in-vivo DBT simulations. Firstly, we compare both iter- ative and simultaneous methods to the conventional, sequential method using an affine transformation model. We show that jointly estimating image intensities and parametric transformations gives superior results with respect to reconstruction fidelity and regis- tration accuracy. Also, we incorporate a non-rigid B-spline transformation model into our simultaneous method. The results demonstrate a visually plausible recovery of the deformation with preservation of the reconstruction fidelity

    Full potential solution of transonic quasi-3-D flow through a cascade using artificial compressability

    Get PDF
    The three-dimensional flow in a turbomachinery blade row was approximated by correcting for streamtube convergence and radius change in the throughflow direction. The method is a fully conservative solution of the full potential equation incorporating the finite volume technique on body fitted periodic mesh, with an artificial density imposed in the transonic region to insure stability and the capture of shock waves. Comparison of results for several supercritical blades shows good agreement with their hodograph solutions. Other calculations for these profiles as well as standard NACA blade sections indicate that this is a useful scheme analyzing both the design and off-design performance of turbomachinery blading

    Beam Extraction and Transport

    Full text link
    This chapter gives an introduction to low-energy beam transport systems, and discusses the typically used magnetostatic elements (solenoid, dipoles and quadrupoles) and electrostatic elements (einzel lens, dipoles and quadrupoles). The ion beam emittance, beam space-charge effects and the physics of ion source extraction are introduced. Typical computer codes for analysing and designing ion optical systems are mentioned, and the trajectory tracking method most often used for extraction simulations is described in more detail.Comment: presented at the CERN Accelerator School CAS 2012: Ion Sources, Senec, 29 May - 8 June 201

    Relaxation solution of the full Euler equations

    Get PDF
    A numerical procedure for the relaxation solution of the full steady Euler equations is described. By embedding the Euler system in a second order surrogate system, central differencing may be used in subsonic regions while retaining matrix forms well suited to iterative solution procedures and convergence acceleration techniques. Hence, this method allows the development of stable, fully conservative differencing schemes for the solution of quite general inviscid flow problems. Results are presented for both subcritical and shocked supercritical internal flows. Comparisons are made with a standard time dependent solution algorithm

    Provably Convergent Plug-and-Play Quasi-Newton Methods

    Get PDF
    Plug-and-Play (PnP) methods are a class of efficient iterative methods that aim to combine data fidelity terms and deep denoisers using classical optimization algorithms, such as ISTA or ADMM, with applications in inverse problems and imaging. Provable PnP methods are a subclass of PnP methods with convergence guarantees, such as fixed point convergence or convergence to critical points of some energy function. Many existing provable PnP methods impose heavy restrictions on the denoiser or fidelity function, such as non-expansiveness or strict convexity, respectively. In this work, we propose a novel algorithmic approach incorporating quasi-Newton steps into a provable PnP framework based on proximal denoisers, resulting in greatly accelerated convergence while retaining light assumptions on the denoiser. By characterizing the denoiser as the proximal operator of a weakly convex function, we show that the fixed points of the proposed quasi-Newton PnP algorithm are critical points of a weakly convex function. Numerical experiments on image deblurring and super-resolution demonstrate 2--8x faster convergence as compared to other provable PnP methods with similar reconstruction quality

    Provably Convergent Plug-and-Play Quasi-Newton Methods

    Get PDF
    Plug-and-Play (PnP) methods are a class of efficient iterative methods that aim to combine data fidelity terms and deep denoisers using classical optimization algorithms, such as ISTA or ADMM, with applications in inverse problems and imaging. Provable PnP methods are a subclass of PnP methods with convergence guarantees, such as fixed point convergence or convergence to critical points of some energy function. Many existing provable PnP methods impose heavy restrictions on the denoiser or fidelity function, such as non-expansiveness or strict convexity, respectively. In this work, we propose a novel algorithmic approach incorporating quasi-Newton steps into a provable PnP framework based on proximal denoisers, resulting in greatly accelerated convergence while retaining light assumptions on the denoiser. By characterizing the denoiser as the proximal operator of a weakly convex function, we show that the fixed points of the proposed quasi-Newton PnP algorithm are critical points of a weakly convex function. Numerical experiments on image deblurring and super-resolution demonstrate 2--8x faster convergence as compared to other provable PnP methods with similar reconstruction quality
    • ā€¦
    corecore