Results 1 to 10 of about 145 (110)

Lanczos algorithm explained in statistics

Results in Applied Mathematics
The Lanczos algorithm is a well-known three-term recurrence that can be used to generate an orthogonal basis for a Krylov subspace derived by a symmetric matrix.
Qiang Niu, Mianmian Chen, Jinheng Wu
doaj   +2 more sources

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   +3 more sources

Cauchy-Lanczos Algorithm for Effective Dimension Reduction

IEEE Access
The aim of dimension reduction techniques is to eliminate unnecessary information from extensive datasets, thereby enhancing the effectiveness of data analysis.
Xuansheng Wang, Linzhong Xia, Changwei Lv   +2 more
doaj   +2 more sources

Exact and efficient Lanczos method on a quantum computer [PDF]

Quantum, 2023
We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space, which can be used as the basis for the Lanczos method to estimate extremal eigenvalues of Hamiltonians.
William Kirby, Mario Motta, Antonio Mezzacapo   +2 more
doaj   +1 more source

Krylov complexity of many-body localization: Operator localization in Krylov basis

SciPost Physics, 2022
We study the operator growth problem and its complexity in the many-body localization (MBL) system from the Lanczos algorithm perspective. Using the Krylov basis, the operator growth problem can be viewed as a single-particle hopping problem on a semi ...
Fabian Ballar Trigueros, Cheng-Ju Lin
doaj   +1 more source

Broadband S-Parameter Simulation Based on the Mixed Finite-Element Method and Symmetric Lanczos Algorithm

IEEE Access, 2023
In this paper, the symmetric Lanczos algorithm and mixed finite element method are combined to improve the efficiency and accuracy of S-parameter simulation in a broad frequency band.
Ke Chen, Junhui Chen, Xuanying Hou, Mingwei Zhuang, Qing Huo Liu   +4 more
doaj   +1 more source

Operator growth and Krylov complexity in Bose-Hubbard model

Journal of High Energy Physics, 2023
We study Krylov complexity of a one-dimensional Bosonic system, the celebrated Bose-Hubbard Model. The Bose-Hubbard Hamiltonian consists of interacting bosons on a lattice, describing ultra-cold atoms.
Arpan Bhattacharyya, Debodirna Ghosh, Poulami Nandi   +2 more
doaj   +1 more source

Lanczos Algorithm for 2DPCA

Journal of Physics: Conference Series, 2021
Abstract The traditional PCA algorithm (Principle Component Analysis) can obtain the feature space of face image and realize face recognition by expanding the face image matrix into vectors in face recognition. 2DPCA (Two-dimensional Principle Component Analysis) doesn’t need to spread the image matrix into one-dimensional vectors.
Xuansheng Wang, Huazhong Li, Yanbing Zhou, Hongying Zheng   +3 more
openaire   +1 more source

Ground Settlement-Induced Building Damage Assessment With Modified Lanczos Algorithm and Extreme Learning Machine

Frontiers in Environmental Science, 2022
Construction, tunneling, and other urban anthropogenic activities strain neighboring buildings through distortion and rotation on both the surface and underground, resulting in instability of the local geological structure.
Weiqi Yang, Lingling Wang, Yuran Feng, Ting Zeng   +3 more
doaj   +1 more source

On Krylov complexity in open systems: an approach via bi-Lanczos algorithm

Journal of High Energy Physics, 2023
Continuing the previous initiatives [1, 2], we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which ...
Aranya Bhattacharya, Pratik Nandy, Pingal Pratyush Nath, Himanshu Sahu   +3 more
doaj   +1 more source