Results 81 to 90 of about 5,496,658 (160)

Measurement-efficient quantum Krylov subspace diagonalisation [PDF]

Quantum
The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing.
Zongkang Zhang, Anbang Wang, Xiaosi Xu, Ying Li   +3 more
doaj   +1 more source

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

A Lanczos algorithm for linear response

, 1998
12 pages including 3 figures ...
Johnson, C. W., Bertsch, G. F., Hazelton, W. D.   +2 more
openaire   +2 more sources

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

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. Here, we introduce a low-rank modification of the original matrix
openaire   +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

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

Solution of eigenproblems for damped structural systems by the Lanczos algorithm

Computers & Structures, 1988
A variant of the Lanczos algorithm is deduced to solve the eigenproblem arising in the analysis of viscously damped structural systems. Re- orthogonalization schemes are employed to restore the required orthogonality between the Lanczos vectors. A projection of the original eigenproblem onto the Krylov subspace spanned by the Lanczos vectors gives a ...
Chen, Harn-Ching, Taylor, Robert
openaire   +3 more sources

Krylov complexity for Lin-Maldacena geometries and their holographic duals

Journal of High Energy Physics
We compute the rate of growth of operator size in matrix models by probing the Lin-Maldacena class of geometries with classical probes. We consider massive point particle probes whose proper momentum equals the size of the gauge invariant operator in the
Dibakar Roychowdhury
doaj   +1 more source

Analysis of the symmetric Lanczos algorithm with reorthogonalization methods

, 1984
We present an error analysis of the symmetric Lanczos algorithm in finite precision arithmetic. The loss of orthogonality among the computed Lanczos vectors is explained with the help of a recurrence formula.
H. Simon
semanticscholar   +1 more source