International Journal of Applied Mathematics and Computer Science, 2015 The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix.
Feuerriegel Stefan, Bücker H. Martin
doaj +1 more source
Scattering in the Ising model with the quantum Lanczos algorithm
New Journal of Physics, 2021 Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories.
Kübra Yeter-Aydeniz +2 more
doaj +1 more source
Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm [PDF]
, 2006 In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in this paper, it
Aharonov +32 more
core +2 more sources
BFGS method based variable projection approach for image restoration
IET Image Processing, 2021 In this paper, a variable projection approach based on the BFGS (Broyden–Fletcher–Goldfarb–Shanno) method for image reconstruction problems is proposed, which is an alternative to the common alternating minimisation scheme.
Qiong‐Ying Chen +4 more
doaj +1 more source
On large-scale diagonalization techniques for the Anderson model of localization [PDF]
, 2005 We propose efficient preconditioning algorithms for an eigenvalue problem arising in quantum physics, namely the computation of a few interior eigenvalues and their associated eigenvectors for large-scale sparse real and symmetric indefinite matrices of ...
Brandes T. +6 more
core +5 more sources
A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform
Modelling and Simulation in Engineering, 2017 An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images.
Srinivas Koppu, V. Madhu Viswanatham
doaj +1 more source
A Comparison of Methods for Determining the Time Step When Propagating with the Lanczos Algorithm
Mathematics, 2019 To use the short iterative Lanczos algorithm to solve the time-dependent Schroedinger equation, one must choose, for a given Lanczos space size, a time step. We compare the derivation of the well-known Lubich and Hochbruck time step from SIAM J.
N. Mohankumar, Tucker Carrington
doaj +1 more source
Ab-initio self-consistent Gorkov-Green's function calculations of semi-magic nuclei - II. Numerical implementation at second order with a two-nucleon interaction [PDF]
, 2013 The newly developed Gorkov-Green's function approach represents a promising path to the ab initio description of medium-mass open-shell nuclei. We discuss the implementation of the method at second order with a two-body interaction, with particular ...
Barbieri, C., Duguet, T., Soma, V.
core +4 more sources
Lorentz Integral Transform for Inclusive and Exclusive Cross Sections with the Lanczos Method [PDF]
, 2002 The Lorentz Integral Transform (LIT) method is reformulated via the Lanczos algorithm both for inclusive and exclusive reactions. The new technique is tested for the total photoabsorption cross section of 3H and 4He.
Barnea, Nir +3 more
core +2 more sources
Numerical analysis of the spectrum of the Dirac operator in four-dimensional SU(2) gauge fields [PDF]
, 1995 Two numerical algorithms for the computation of eigenvalues of Dirac operators in lattice gauge theories are described: one is an accelerated conjugate gradient method, the other one a standard Lanczos method.
Alexandrou +28 more
core +2 more sources