28 resultados para Elliptic Variational Inequatilies
Resumo:
Brown's model for the relaxation of the magnetization of a single domain ferromagnetic particle is considered. This model results in the Fokker-Planck equation of the process. The solution of this equation in the cases of most interest is non- trivial. The probability density of orientations of the magnetization in the Fokker-Planck equation can be expanded in terms of an infinite set of eigenfunctions and their corresponding eigenvalues where these obey a Sturm-Liouville type equation. A variational principle is applied to the solution of this equation in the case of an axially symmetric potential. The first (non-zero) eigenvalue, corresponding to the largest time constant, is considered. From this we obtain two new results. Firstly, an approximate minimising trial function is obtained which allows calculation of a rigorous upper bound. Secondly, a new upper bound formula is derived based on the Euler-Lagrange condition. This leads to very accurate calculation of the eigenvalue but also, interestingly, from this, use of the simplest trial function yields an equivalent result to the correlation time of Coffey et at. and the integral relaxation time of Garanin. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
A new inline coupling topology for narrowband helical resonator filters is proposed that allows to introduce selectively located transmission zeros (TZs) in the stopband. We show that a pair of helical resonators arranged in an interdigital configuration can realize a large range of in-band coupling coefficient values and also selectively position a TZ in the stopband. The proposed technique dispenses the need for auxiliary elements, so that the size, complexity, power handling and insertion loss of the filter are not compromised. A second order prototype filter with dimensions of the order of 0.05 lambda, power handling capability up to 90 W, measured insertion loss of 0.18 dB and improved selectivity is presented.
Resumo:
A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applications. © 2006 IEEE.
Resumo:
In this paper, we report a fully ab initio variational Monte Carlo study of the linear and periodic chain of hydrogen atoms, a prototype system providing the simplest example of strong electronic correlation in low dimensions. In particular, we prove that numerical accuracy comparable to that of benchmark density-matrix renormalization-group calculations can be achieved by using a highly correlated Jastrow-antisymmetrized geminal power variational wave function. Furthermore, by using the so-called "modern theory of polarization" and by studying the spin-spin and dimer-dimer correlations functions, we have characterized in detail the crossover between the weakly and strongly correlated regimes of this atomic chain. Our results show that variational Monte Carlo provides an accurate and flexible alternative to highly correlated methods of quantum chemistry which, at variance with these methods, can be also applied to a strongly correlated solid in low dimensions close to a crossover or a phase transition.
Resumo:
We report results for e(+/-)-Ps(Is) scattering in the energy range up to 80 eV calculated in 9-state and 30-state coupled pseudostate approximations. Cross-sections are presented for elastic scattering, ortho-para conversion, discrete excitation, ionization and total scattering. Resonances associated with the Ps(n = 2) threshold are also examined and their positions and widths determined. Very good agreement is obtained with the variational calculations of Ward et al. [J. Phys. B 20 (1987) 127] below 5.1 eV. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
A many-body theory approach is developed for the problem of positron-atom scattering and annihilation. Strong electron- positron correlations are included nonperturbatively through the calculation of the electron-positron vertex function. It corresponds to the sum of an infinite series of ladder diagrams, and describes the physical effect of virtual positronium formation. The vertex function is used to calculate the positron-atom correlation potential and nonlocal corrections to the electron-positron annihilation vertex. Numerically, we make use of B-spline basis sets, which ensures rapid convergence of the sums over intermediate states. We have also devised an extrapolation procedure that allows one to achieve convergence with respect to the number of intermediate- state orbital angular momenta included in the calculations. As a test, the present formalism is applied to positron scattering and annihilation on hydrogen, where it is exact. Our results agree with those of accurate variational calculations. We also examine in detail the properties of the large correlation corrections to the annihilation vertex.
Resumo:
Near-threshold ionization of He has been studied by using a uniform semiclassical wavefunction for the two outgoing electrons in the final channel. The quantum mechanical transition amplitude for the direct and exchange scattering derived earlier by using the Kohn variational principle has been used to calculate the triple differential cross sections. Contributions from singlets and triplets are critically examined near the threshold for coplanar asymmetric geometry with equal energy sharing by the two outgoing electrons. It is found that in general the tripler contribution is much smaller compared to its singlet counterpart. However, at unequal scattering angles such as theta (1) = 60 degrees, theta (2) = 120 degrees the smaller peaks in the triplet contribution enhance both primary and secondary TDCS peaks. Significant improvements of the primary peak in the TDCS are obtained for the singlet results both in symmetric and asymmetric geometry indicating the need to treat the classical action variables without any approximation. Convergence of these cross sections are also achieved against the higher partial waves. Present results are compared with absolute and relative measurements of Rosel et al (1992 Phys. Rev. A 46 2539) and Selles et al (1987 J. Phys. B. At. Mel. Phys. 20 5195) respectively.
Resumo:
An efficient method for calculating the electronic structure of systems that need a very fine sampling of the Brillouin zone is presented. The method is based on the variational optimization of a single (i.e., common to all points in the Brillouin zone) basis set for the expansion of the electronic orbitals. Considerations from k.p-approximation theory help to understand the efficiency of the method. The accuracy and the convergence properties of the method as a function of the optimal basis set size are analyzed for a test calculation on a 16-atom Na supercell.
Resumo:
Ab initio nonlocal pseudopotential variational quantum Monte Carlo techniques are used to compute the correlation effects on the valence momentum density and Compton profile of silicon. Our results for this case are in excellent agreement with the Lam-Platzman correction computed within the local density approximation. Within the approximations used, we rule out valence electron correlations as the dominant source of discrepancies between calculated and measured Compton profiles of silicon.
Resumo:
In this paper a novel scalable public-key processor architecture is presented that supports modular exponentiation and Elliptic Curve Cryptography over both prime GF(p) and binary GF(2) extension fields. This is achieved by a high performance instruction set that provides a comprehensive range of integer and polynomial basis field arithmetic. The instruction set and associated hardware are generic in nature and do not specifically support any cryptographic algorithms or protocols. Firmware within the device is used to efficiently implement complex and data intensive arithmetic. A firmware library has been developed in order to demonstrate support for numerous exponentiation and ECC approaches, such as different coordinate systems and integer recoding methods. The processor has been developed as a high-performance asymmetric cryptography platform in the form of a scalable Verilog RTL core. Various features of the processor may be scaled, such as the pipeline width and local memory subsystem, in order to suit area, speed and power requirements. The processor is evaluated and compares favourably with previous work in terms of performance while offering an unparalleled degree of flexibility. © 2006 IEEE.
Resumo:
New FPGA architectures for the ordinary Montgomery multiplication algorithm and the FIOS modular multiplication algorithm are presented. The embedded 18×18-bit multipliers and fast carry look-ahead logic located on the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions/subtractions required by these two algorithms. The architectures are developed for use in Elliptic Curve Cryptosystems over GF(p), which require modular field multiplication to perform elliptic curve point addition and doubling. Field sizes of 128-bits and 256-bits are chosen but other field sizes can easily be accommodated, by rapidly reprogramming the FPGA. Overall, the larger the word size of the multiplier, the more efficiently it performs in terms of area/time product. Also, the FIOS algorithm is flexible in that one can tailor the multiplier architecture is to be area efficient, time efficient or a mixture of both by choosing a particular word size. It is estimated that the computation of a 256-bit scalar point multiplication over GF(p) would take about 4.8 ms.