56th EAEG Meeting 1994
DOI: 10.3997/2214-4609.201409897
|View full text |Cite
|
Sign up to set email alerts
|

Removal of inhomogeneous internal multiples

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2005
2005
2018
2018

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…does give the expected supersymmetric ground state for L = 2 but not for L = 4, 5 and higher. We have observed that modified definitions of the supercharges can be tuned such as to produce supersymmetric ground states on small-sized lattices, suggesting an iterative procedure to define these charges [33]. The algebraic structure of the spin-full case is considerably more complicated than that of the spin-less case, both in the CFT and on the lattice.…”
Section: Spin-full Lattice Modelsmentioning
confidence: 99%
“…does give the expected supersymmetric ground state for L = 2 but not for L = 4, 5 and higher. We have observed that modified definitions of the supercharges can be tuned such as to produce supersymmetric ground states on small-sized lattices, suggesting an iterative procedure to define these charges [33]. The algebraic structure of the spin-full case is considerably more complicated than that of the spin-less case, both in the CFT and on the lattice.…”
Section: Spin-full Lattice Modelsmentioning
confidence: 99%
“…For example, using Rayleigh's reciprocity theorem, Fokkema et al (1994) derive equations to remove multiples from a known subsurface interface. Weglein et al (1997) use a Lippmann-Schwinger scattering series to remove internal multiples without knowledge of subsurface reflectors.…”
Section: Introductionmentioning
confidence: 99%
“…The numerical approach we were using previously for determining the eigenvalues of a large matrix (the implementation of the Davidson algorithm by Stathopoulos and Froese Fischer [13]) was suitable for the computation of just the lowest (highest) matrix eigenvalues. In the present work, we use the Jacobi-Davidson algorithm as implemented within the JDQZ package [14,15]. The JDQZ package, although significantly slower than the one by Stathopoulos and Froese Fischer, was able to provide us with eigenvalues and the corresponding eigenvectors around an arbitrary energy target far from the lowest eigenvalue.…”
Section: A Dirac-coulomb-breit Energymentioning
confidence: 99%