Results 21 to 30 of about 12,661,880 (175)
Quantum Power Method by a Superposition of Time-Evolved States
PRX Quantum, 2021 We propose a quantum-classical hybrid algorithm of the power method, here dubbed as the quantum power method, to evaluate H[over ^]^{n}|ψ⟩ with quantum computers, where n is a non-negative integer, H[over ^] is a time-independent Hamiltonian of interest,
Kazuhiro Seki, Seiji Yunoki
doaj +1 more source
KRYLOV SUBSPACE METHODS FOR SOLVING LARGE LYAPUNOV EQUATIONS [PDF]
, 1994 Published ...
KASENALLY, EM, JAIMOUKHA, IM
core +1 more source
On Numerical Approximations of the Koopman Operator
Mathematics, 2022 We study numerical approaches to computation of spectral properties of composition operators. We provide a characterization of Koopman Modes in Banach spaces using Generalized Laplace Analysis.
Igor Mezić
doaj +1 more source
Krylov subspace split Bregman methods [PDF]
, 2023 Split Bregman methods are popular iterative methods for the solution of large-scale minimization problems that arise in image restoration and basis pursuit. This paper investigates the possibility of projecting large-scale problems into a Krylov subspace
Alotaibi, Majed +2 more
core +1 more source
Solving Coupled Cluster Equations by the Newton Krylov Method
Frontiers in Chemistry, 2020 We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude.
Chao Yang +4 more
doaj +1 more source
Krylov subspace methods for the Dirac equation [PDF]
Computer Physics Communications, 2015 The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Dirac equation with arbitrary electromagnetic fields. We demonstrate that the Lanczos algorithm can yield very precise eigenenergies and allows very precise time propagation of relativistic wave packets.
Randolf Beerwerth, Heiko Bauke
openaire +5 more sources
Krylov Subspace Solvers and Preconditioners
ESAIM: Proceedings and Surveys, 2018 In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. After a discretization of partial differential equations large, sparse systems of linear equations have to be solved.
Vuik C.
doaj +1 more source
Uzawa Algorithms for Fully Fuzzy Linear Systems
International Journal of Computational Intelligence Systems, 2016 Recently, there have been many studies on solving different kinds of fuzzy equations. In this paper, the solution of a trapezoidal fully fuzzy linear system (FFLS) is studied.
H. Zareamoghaddam +3 more
doaj +1 more source
S-Step BiCGStab Algorithms for Geoscience Dynamic Simulations
Oil & Gas Science and Technology, 2016 In basin and reservoir simulations, the most expensive and time consuming phase is solving systems of linear equations using Krylov subspace methods such as BiCGStab.
Anciaux-Sedrakian Ani +3 more
doaj +1 more source
Preserving Symmetry in Preconditioned Krylov Subspace Methods [PDF]
SIAM Journal on Scientific Computing, 1998 The authors consider the problem of solving linear systems of equations with coefficient matrices which are ``nearly'' (very close to be) symmetric and when symmetric positive definite preconditioners are used. They show that it is possible to improve upon the standard practice of using nonsymmetric preconditioners for that matrices along with a left ...
Tony F. Chan +3 more
openaire +3 more sources