Results 11 to 20 of about 16,479 (201)
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 +3 more
openaire +1 more source
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 +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 +3 more
doaj +1 more source
Influence of Basis Set Composition on Metabolite Quantification of <sup>1</sup>H-MRS at 3 T: Combining In Silico, In Vivo and In Vitro Evidence. [PDF]
NMR BiomedWe use synthetic (Aim 1), human brain (Aim 2) and phantom (Aim 3) data to assess how basis set choice affects Glu, tCr, tNAA and tCho quantification, focusing on the bias–variance trade‐off under varying SNR conditions. Including GABA, GSH, NAAG and glucose improved Glu estimates, reducing bias and variance below 10%.
Emeliyanova P +3 more
europepmc +2 more sources
Operator growth and Krylov construction in dissipative open quantum systems
Journal of High Energy Physics, 2022 Inspired by the universal operator growth hypothesis, we extend the formalism of Krylov construction in dissipative open quantum systems connected to a Markovian bath.
Aranya Bhattacharya +3 more
doaj +1 more source
The Lanczos algorithm with selective orthogonalization [PDF]
Mathematics of Computation, 1979 The simple Lanczos process is very effective for finding a few extreme eigenvalues of a large symmetric matrix along with the associated eigenvectors. Unfortunately, the process computes redundant copies of the outermost eigenvectors and has to be used with some skill.
Parlett, B. N., Scott, D. S.
openaire +1 more source
Numerical Stability of Lanczos Methods [PDF]
, 1999 The Lanczos algorithm for matrix tridiagonalisation suffers from strong numerical instability in finite precision arithmetic when applied to evaluate matrix eigenvalues. The mechanism by which this instability arises is well documented in the literature.
Alan Irving +8 more
core +2 more sources
Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition [PDF]
, 2011 We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\em without restricting to variational ansatzes}. The lattice of size $N$ is partitioned into two subclusters.
/SLAC +5 more
core +2 more sources
Improvement of DOA Estimation based on Lanczos Algorithm [PDF]
Engineering and Technology Journal, 2014 In this paper, the problem of estimating the Direction Of Arrival (DOA) is presented. DOA based on Eigen Vector Decomposition (EVD) shows that the computational complexities are costly and high so that eigen structure algorithms suffer for limited ...
Sinan Majid Abdul Satar +1 more
doaj +1 more source
Algorithmic Error Mitigation Scheme for Current Quantum Processors [PDF]
Quantum, 2021 We present a hardware agnostic error mitigation algorithm for near term quantum processors inspired by the classical Lanczos method. This technique can reduce the impact of different sources of noise at the sole cost of an increase in the number of ...
Philippe Suchsland +5 more
doaj +1 more source