Search results for "Iterative method"
showing 10 items of 135 documents
Linear response strength functions with iterative Arnoldi diagonalization
2009
We report on an implementation of a new method to calculate RPA strength functions with iterative non-hermitian Arnoldi diagonalization method, which does not explicitly calculate and store the RPA matrix. We discuss the treatment of spurious modes, numerical stability, and how the method scales as the used model space is enlarged. We perform the particle-hole RPA benchmark calculations for double magic nucleus 132Sn and compare the resulting electromagnetic strength functions against those obtained within the standard RPA.
Transparent Boundary Condition for Oseen-Frank Model. Application for NLC Cells With Patterned Electrodes
2015
In the present work a novel application of Transparent Boundary Conditions (TBC) to nematic liquid crystal cells (NLCC) with planar alignment and a patterned electrode is studied. This device is attracting great interest since it allows soliton steering by optically and externally induced waveguides. We employ the continuum Oseen-Frank theory to find the tilt and twist angle distributions in the cell under the one-constant approximation. The electric field distribution takes into account the whole 2D permittivity tensor for the transverse coordinates. Standard finite difference time domain methods together with an iterative method is applied to find an approximate solution to our coupled pr…
Unitary time-dependent superconvergent technique for pulse-driven quantum dynamics
2003
We present a superconvergent Kolmogorov-Arnold-Moser type of perturbation theory for time-dependent Hamiltonians. It is strictly unitary upon truncation at an arbitrary order and not restricted to periodic or quasiperiodic Hamiltonians. Moreover, for pulse-driven systems we construct explicitly the KAM transformations involved in the iterative procedure. The technique is illustrated on a two-level model perturbed by a pulsed interaction for which we obtain convergence all the way from the sudden regime to the opposite adiabatic regime.
Three-state quantum systems: A procedure for the solution
1989
An iterative method to obtain a solution of the differential equation $$i\dot a = \hat H(t)a$$ , with Ĥ a 3×3 Hermitian matrix anda the unknown vector, is proposed. The procedure is particularly suitable for computer implementation and, as an example, has been applied to find the excitation probability of a three-level atom after the synchronous passage of two laser pulses each almost resonant with a pair of atomic levels.
One-dimensional iterative algorithm for three-dimensional point-spread function engineering.
2001
We present a new method with which to binarize pupil filters designed to control the three-dimensional irradiance distribution in the focal volume of an optical system. The method is based on a one-dimensional iterative algorithm, which results in efficient use of computation time and in simple, easy to fabricate binary filters. An acceptable degree of resemblance between the point-spread function of the annular binary filter and that of its gray-tone counterpart is obtained.
Analysis of negative-resistance oscillators with piecewise nonlinearity
1977
An iterative method of solution of negative-resistance oscillators with piecewise-analytical characteristics is presented. The method allows the determination of the frequency and the harmonic content of the waveform as a function of the circuit parameters and bias of the nonlinear device. An application of the method, extended to the second order, for a polynomial characteristic limited by two straight lines is also reported. The results are compared with those obtained by numerical integration.
Parallelization of the Wolff single-cluster algorithm.
2010
A parallel [open multiprocessing (OpenMP)] implementation of the Wolff single-cluster algorithm has been developed and tested for the three-dimensional (3D) Ising model. The developed procedure is generalizable to other lattice spin models and its effectiveness depends on the specific application at hand. The applicability of the developed methodology is discussed in the context of the applications, where a sophisticated shuffling scheme is used to generate pseudorandom numbers of high quality, and an iterative method is applied to find the critical temperature of the 3D Ising model with a great accuracy. For the lattice with linear size L=1024, we have reached the speedup about 1.79 times …
QR-Factorization Algorithm for Computed Tomography (CT): Comparison With FDK and Conjugate Gradient (CG) Algorithms
2018
[EN] Even though QR-factorization of the system matrix for tomographic devices has been already used for medical imaging, to date, no satisfactory solution has been found for solving large linear systems, such as those used in computed tomography (CT) (in the order of 106 equations). In CT, the Feldkamp, Davis, and Kress back projection algorithm (FDK) and iterative methods like conjugate gradient (CG) are the standard methods used for image reconstruction. As the image reconstruction problem can be modeled by a large linear system of equations, QR-factorization of the system matrix could be used to solve this system. Current advances in computer science enable the use of direct methods for…
Backward solution of PV nodes in radial distribution networks
2009
In this paper an iterative backward methodology to solve radial distribution networks with fixed voltage (PV) nodes and with constant power loads or mixed loads (with at least one component with constant power) is proposed. The method developed, although deriving conceptually from the backward/forward (b/f) methodology, presents only the backward phase in which all the network variables are evaluated. In themethods developed up until nowfor the solution of such systems, PV nodes are taken into account at the end of each iteration by evaluating, based on the known quantities of the network, the unknowns associated with PV nodes. In the methodology developed here the unknowns relevant to PV n…
SITA/G - Description and simulation tools for public utility systems on IBM PC
1991
Abstract Simulation is a powerful and universal systems research tool for the analysis of discrete event model's functional quality. The simulation is used very widely in different areas of our everyday life. Simulation system SITA/G is produced in the Latvia University Research Institute of Mathematics and Computer Science. SITA/G softwares is proposed for using on IBM PC. SITA/G offers the facilities to describe, build and edit graphic programs by means of specification language SITA. Also the proposed system allows: 1) the visual demonstration of the simulation process of the graphic simulation programs; 2) obtaining of the probability characteristics of the systems under research. SITA/…