Results 71 to 80 of about 18,434 (156)
The Block Preconditioned SOR Method for Solving Indefinite Complex Linear Systems
Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.ABSTRACT In this paper we extend the theory of a block preconditioned SOR method studied by Hezari, Edalaptour, and Salkuyeh (2015) for the solution of indefinite complex linear systems. In particular, we consider the case where the key matrix S$$ S $$ has real eigenvalues which lie in (−∞,+∞)$$ \left(-\infty, +\infty \right) $$ and not only in [0,+∞)$$
M. A. Louka, N. M. Missirlis
wiley +1 more source
, 2019 Pipelined Krylov subspace methods (also referred to as communication-hiding methods) have been proposed in the literature as a scalable alternative to classic Krylov subspace algorithms for iteratively computing the solution to a large linear system in ...
Cools, Siegfried +2 more
core
Physics Letters B, 2016 We introduce a novel method to obtain level densities in large-scale shell-model calculations. Our method is a stochastic estimation of eigenvalue count based on a shifted Krylov-subspace method, which enables us to obtain level densities of huge ...
Noritaka Shimizu +5 more
doaj +1 more source
Shortcuts to Adiabaticity in Krylov Space
Physical Review XShortcuts to adiabaticity provide fast protocols for quantum state preparation in which the use of auxiliary counterdiabatic controls circumvents the requirement of slow driving in adiabatic strategies.
Kazutaka Takahashi, Adolfo del Campo
doaj +1 more source
Applied SciencesAfter nearly two decades of development, transient electromagnetic (TEM) 3D forward modeling technology has significantly improved both numerical precision and computational efficiency, primarily through advancements in mesh generation and the ...
Ya’nan Fan +3 more
doaj +1 more source
Extended block Hessenberg method for large-scale Sylvester differential matrix equations [PDF]
Journal of Mahani Mathematical ResearchIn this paper, we consider large-scale low-rank Sylvester differential matrix equations. We present two iterative methods for the approximate solution of such differential matrix equations. In the first method, exploiting the extended block Krylov method,
Azita Tajaddini
doaj +1 more source
Developing Hessian–Free Second–Order Adversarial Examples for Adversarial Training
International Journal of Applied Mathematics and Computer ScienceRecent studies show that deep neural networks (DNNs) are extremely vulnerable to elaborately designed adversarial examples. Adversarial training, which uses adversarial examples as training data, has been proven to be one of the most effective methods of
Qian Yaguan +5 more
doaj +1 more source
A Flexible Coding Scheme Based on Block Krylov Subspace Approximation for Light Field Displays with Stacked Multiplicative Layers. [PDF]
Sensors (Basel), 2021 Ravishankar J +2 more
europepmc +1 more source
Krylov complexity in the Schrödinger field theory
Journal of High Energy PhysicsWe investigate the Krylov complexity of Schrödinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble which includes a chemical potential.
Peng-Zhang He, Hai-Qing Zhang
doaj +1 more source
A Class of Preconditioners for Large Indefinite Linear Systems, as by-product of Krylov subspace Methods: Part II [PDF]
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the companion paper The latter was constructed by using information from a Krylov subspace method, adopted to solve the large symmetric linear system Ax = b ...
Giovanni Fasano, Massimo Roma
core