| 1. |
- Bellm, Eric C., et al.
(författare)
-
The Zwicky Transient Facility : System Overview, Performance, and First Results
- 2019
-
Ingår i: Publications of the Astronomical Society of the Pacific. - : IOP Publishing. - 0004-6280 .- 1538-3873. ; 131:995
-
Tidskriftsartikel (refereegranskat)abstract
- The Zwicky Transient Facility (ZTF) is a new optical time-domain survey that uses the Palomar 48 inch Schmidt telescope. A custom-built wide-field camera provides a 47 deg(2) field of view and 8 s readout time, yielding more than an order of magnitude improvement in survey speed relative to its predecessor survey, the Palomar Transient Factory. We describe the design and implementation of the camera and observing system. The ZTF data system at the Infrared Processing and Analysis Center provides near-real-time reduction to identify moving and varying objects. We outline the analysis pipelines, data products, and associated archive. Finally, we present on-sky performance analysis and first scientific results from commissioning and the early survey. ZTF's public alert stream will serve as a useful precursor for that of the Large Synoptic Survey Telescope.
|
|
| 2. |
- Kaye, Jason, et al.
(författare)
-
A fast time domain solver for the equilibrium Dyson equation
- 2023
-
Ingår i: Advances in Computational Mathematics. - : Springer. - 1019-7168 .- 1572-9044. ; 49:4
-
Tidskriftsartikel (refereegranskat)abstract
- We consider the numerical solution of the real-time equilibrium Dyson equation, which is used in calculations of the dynamical properties of quantum many-body systems. We show that this equation can be written as a system of coupled, nonlinear, convolutional Volterra integro-differential equations, for which the kernel depends self-consistently on the solution. As is typical in the numerical solution of Volterra-type equations, the computational bottleneck is the quadratic-scaling cost of history integration. However, the structure of the nonlinear Volterra integral operator precludes the use of standard fast algorithms. We propose a quasilinear-scaling FFT-based algorithm which respects the structure of the nonlinear integral operator. The resulting method can reach large propagation times and is thus well-suited to explore quantum many-body phenomena at low energy scales. We demonstrate the solver with two standard model systems: the Bethe graph and the Sachdev-Ye-Kitaev model.
|
|
| 3. |
- Kaye, Jason, et al.
(författare)
-
libdlr : Efficient imaginary time calculations using the discrete Lehmann representation
- 2022
-
Ingår i: Computer Physics Communications. - : Elsevier. - 0010-4655 .- 1879-2944. ; 280
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce libdlr, a library implementing the recently introduced discrete Lehmann representation (DLR) of imaginary time Green's functions. The DLR basis consists of a collection of exponentials chosen by the interpolative decomposition to ensure stable and efficient recovery of Green's functions from imaginary time or Matsubara frequency samples. The library provides subroutines to build the DLR basis and grids, and to carry out various standard operations. The simplicity of the DLR makes it straightforward to incorporate into existing codes as a replacement for less efficient representations of imaginary time Green's functions, and libdlr is intended to facilitate this process. libdlr is written in Fortran, provides a C header interface, and contains a Python module pydlr. We also introduce a stand-alone Julia implementation, Lehmann.jl. Program summary Program Title: libdlr CPC Library link to program files: https://doi .org /10 .17632 /56z594pzsj .1 Developer's repository link: https://github .com /jasonkaye /libdlr Licensing provisions: Apache-2.0 Programming language: Fortran, C, Python, Julia Nature of problem: Discretization and compression of functions (Green's functions and self-energies) with an imaginary time variable. Solution method: Explicit basis functions and discretization points obtained by low rank compression of the analytical continuation kernel.
|
|
| 4. |
-
- 2019
-
Tidskriftsartikel (refereegranskat)
|
|
