Results 91 to 100 of about 16,479 (201)

Krylov complexity for Jacobi coherent states

Journal of High Energy Physics
We develop computational tools necessary to extend the application of Krylov complexity beyond the simple Hamiltonian systems considered thus far in the literature.
S. Shajidul Haque, Jeff Murugan, Mpho Tladi, Hendrik J. R. Van Zyl   +3 more
doaj   +1 more source

New recurrence relationships between orthogonal polynomials which lead to new Lanczos-type algorithms [PDF]

, 2012
Lanczos methods for solving Ax = b consist in constructing a sequence of vectors (Xk),k = 1,... such that rk = b-AXk= Pk(A)r0, where Pk is the orthogonal polynomial of degree at most k with respect to the linear functional c defined as c(εi) = (y, Air0).
Farooq, M, Salhi, A
core  

Nested Lanczos: implicitly restarting a Lanczos algorithm

, 1997
In this text, we present a generalisation of the idea of the Implicitly Restarted Arnoldi method to the nonsymmetric Lanczos algorithm, using the two-sided Gram-Schmidt process or using a full Lanczos tridiagonalisation. The Implicitly Restarted Lanczos method can be combined with an implicit filter.
De Samblanx, Gorik, Bultheel, Adhemar
openaire   +1 more source

Solving Maxwell eigenvalue problems for accelerating cavities

Physical Review Special Topics. Accelerators and Beams, 2001
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell equations for the strength of the electric field are solved by a mixed method with quadratic finite edge (Nédélec) elements for the field values and ...
Peter Arbenz, Roman Geus, Stefan Adam
doaj   +1 more source

Inflationary Krylov complexity

Journal of High Energy Physics
In this work, we have systematically investigated the Krylov complexity of curvature perturbation for the modified dispersion relation in inflation, using the algorithm in closed system and open system.
Tao Li, Lei-Hua Liu
doaj   +1 more source

Low-Rank Modification of the Unsymmetric Lanczos Algorithm [PDF]

Mathematics of Computation, 1995
The unsymmetric Lanczos algorithm is an important method for eigenvalue estimation and for solving linear equations. Unfortunately, the algorithm may break down without providing useful information; this is referred to as a serious breakdown in the literature.
openaire   +1 more source

Efficient Calculation of the Negative Thermal Expansion in ZrW2O8

Frontiers in Chemistry, 2018
We present a study of the origin of the negative thermal expansion (NTE) on ZrW2O8 by combining an efficient approach for computing the dynamical matrix with the Lanczos algorithm for generating the phonon density of states in the quasi-harmonic ...
Fernando D. Vila, Scott T. Hayashi, John J. Rehr   +2 more
doaj   +1 more source

Krylov complexity in a natural basis for the Schrödinger algebra

SciPost Physics Core
We investigate operator growth in quantum systems with two-dimensional Schrödinger group symmetry by studying the Krylov complexity. While feasible for semisimple Lie algebras, cases such as the Schrödinger algebra which is characterized by a semi-direct
Dimitrios Patramanis, Watse Sybesma
doaj   +1 more source

Block Lanczos algorithm.

, 1989
We use a block Lanczos algorithm for computing a few of the smallest eigenvalues and the corresponding eigenvectors of a large symmetric matrix rather than computing all the eigenvalue-eigenvector pairs. The basic Lanczos algorithm generates a similar matrix which is block tridiagonal from a given large symmetric matrix.
openaire   +1 more source

Spread complexity for measurement-induced non-unitary dynamics and Zeno effect

Journal of High Energy Physics
Using spread complexity and spread entropy, we study non-unitary quantum dynamics. For non-hermitian Hamiltonians, we extend the bi-Lanczos construction for the Krylov basis to the Schrödinger picture.
Aranya Bhattacharya, Rathindra Nath Das, Bidyut Dey, Johanna Erdmenger   +3 more
doaj   +1 more source