Results 11 to 20 of about 1,759 (181)
Introduction. The widespread use of piezoelectric materials in various industries stimulates the study of their physical characteristics and determines the urgency of such research.
P. A. Oganesyan, O. O. Shtein
doaj +1 more source
Operator growth and Krylov complexity in Bose-Hubbard model
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 +2 more
doaj +1 more source
A Lanczos method for approximating composite functions [PDF]
We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We present a Lanczos-based procedure that implicitly approximates g with a polynomial of f. By constructing a quadrature
Paul G. Constantine, Eric T. Phipps
openaire +2 more sources
Algorithmic Error Mitigation Scheme for Current Quantum Processors [PDF]
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
Double k-Grid Method for Solving the Bethe-Salpeter Equation via Lanczos Approaches
Convergence with respect to the size of the k-points sampling grid of the Brillouin zone is the main bottleneck in the calculation of optical spectra of periodic crystals via the Bethe-Salpeter equation (BSE).
Ignacio M. Alliati +2 more
doaj +1 more source
A new method to treat the inherent instability of Lanczos-type algorithms is introduced. It enables us to capture the properties of the sequence of iterates generated by a Lanczos-type algorithm by interpolating on this sequence of points.
Maharani +2 more
doaj +1 more source
Low Complexity Precoding Based on Lanczos Method in Massive MIMO System [PDF]
Aiming at the problem that the computational complexity of the required matrix inversion of Zero Forcing(ZF) precoding matrix is very high due to the large number of antennas and users in large-scale MIMO systems,a low complexity ZF precoding scheme ...
CAO Haiyan,ZHOU Dong,FANG Xin,WANG Xiumin
doaj +1 more source
Nuclear shell model is a powerful approach to investigate nuclear structure microscopically. However, the computational cost of shell-model calculations becomes huge in medium-heavy nuclei.
Noritaka Shimizu
doaj +1 more source
SoftNet: A Package for the Analysis of Complex Networks
Identifying the most important nodes according to specific centrality indices is an important issue in network analysis. Node metrics based on the computation of functions of the adjacency matrix of a network were defined by Estrada and his collaborators
Caterina Fenu +2 more
doaj +1 more source
The Short-Term Rational Lanczos Method and Applications
Rational Krylov subspaces have become a reference tool in dimension reduction procedures for several application problems. When data matrices are symmetric, a short-term recurrence can be used to generate an associated orthonormal basis. In the past this procedure was abandoned because it requires twice the number of linear system solves per iteration ...
Davide Palitta +2 more
openaire +4 more sources

