{
  "annotation_id": "7cf18688-39c9-4494-a3b0-226985337261",
  "date_created": "2026-03-02T18:00:32.765000Z",
  "date_modified": "2026-03-02T18:00:32.765000Z",
  "file_hash": "1efd57c3df65bb005346cd403a24d6a179b19e805b43132ff9f4a7ef8837672c",
  "private": false,
  "record": {
    "abstract": "The discrete-dipole approximation (DDA) is a flexible technique for computing\nscattering and absorption by targets of arbitrary geometry. In this paper we\nperform systematic study of various non-stationary iterative (conjugate\ngradient) methods in search for the most efficient one in order to solve the\nsystem of equations arising in DDA. We document implementation of these methods\nin our public domain code DDSCAT.5a",
    "arxiv_id": "physics/0006064",
    "authors": [
      "Piotr J. Flatau"
    ],
    "categories": [
      "physics.ao-ph"
    ],
    "journal_ref": "Optics Letters 1997, volume 22, number 16, 1205-1207",
    "title": "Improvements of the Discrete Dipole Approximation method",
    "url": "https://arxiv.org/abs/physics/0006064"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "608fe127-eedb-4122-806f-eca319b1fb61",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}