1997
DOI: 10.1103/physreve.56.1222
|View full text |Cite
|
Sign up to set email alerts
|

Calculating the linear response functions of noninteracting electrons with a time-dependent Schrödinger equation

Abstract: An O(N) algorithm is proposed for calculating linear response functions of non-interacting electrons. This algorithm is simple and suitable to parallel-and vector-computation. Since it avoids O(N 3 ) computational effort of matrix diagonalization, it requires only O(N ) computational efforts where N is the dimension of the statevector. The use of this O(N ) algorithm is very effective since otherwise we have to calculate large number of eigenstates, i.e., the occupied one-electron states up to the Fermi energy… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
83
0

Year Published

1999
1999
2013
2013

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 79 publications
(83 citation statements)
references
References 59 publications
0
83
0
Order By: Relevance
“…In our simulations we use the spin-up-spin-down basis and use units such thath = 1 (hence, all quantities are dimensionless). Numerically, the real-time propagation by e −itH is carried out by means of the Chebyshev polynomial algorithm [22][23][24][25], thereby solving the TDSE for the whole system starting from the initial state | (0) . This algorithm yields results that are very accurate (close to machine precision), independent of the time step used [18].…”
Section: A Time Evolutionmentioning
confidence: 99%
“…In our simulations we use the spin-up-spin-down basis and use units such thath = 1 (hence, all quantities are dimensionless). Numerically, the real-time propagation by e −itH is carried out by means of the Chebyshev polynomial algorithm [22][23][24][25], thereby solving the TDSE for the whole system starting from the initial state | (0) . This algorithm yields results that are very accurate (close to machine precision), independent of the time step used [18].…”
Section: A Time Evolutionmentioning
confidence: 99%
“…The numerical solution of the TDSE is performed by the Chebyshev polynomial algorithm, which is known to be extremely accurate independent of the time step used. [15][16][17][18] We adopt open boundary conditions, not periodic boundary conditions, because the periodic boundary condition would introduce two DWs in the initial state. In this paper, we display the results at time intervals of = /5J and use units such that ប = 1 and J =1.…”
Section: Dynamically Stable Domain Wallsmentioning
confidence: 99%
“…(2) looks very similar to that of the linearresponse function, and that, therefore, we may calculate χ (3) by using the linear-scaling time-dependent method for the linear-response functions [7,8],…”
Section: Tpa Coefficientmentioning
confidence: 99%
“…In this paper, we develop a new algorithm for calculating TPA spectra by using semiempirical local pseudopotentials [3], finite difference method in real space [4], and a linearscaling time-dependent method which has been applied to the calculation of the linearresponse functions [5,6,7,8]. This efficient algorithm made it possible, for the first time, to calculate the size effect on the TPA spectra of very large nanocrystallites without using effective-mass approximation.…”
Section: Introductionmentioning
confidence: 99%