Skip to article frontmatterSkip to article content

Overview

All models are wrong, but some are useful.

- George Box

Welcome to ASTR 513!

This course introduce basic computational methods for solving problems numerically in astrophysics and the foundations of modern statistical methods that are used in current research problems, with emphasis on big-data science. The topics will include basic scientific algorithms to solve integrals and simple differential equations frequently encountered in astrophysics, frequentist and Bayesian inference methods, non-linear regressions methods, modeling of data, Monte Carlo techniques, error estimation, and model selection.

The course website is: https://ua-2025q3-astr501-513.github.io. All lecture notes and links to homework will be posted here.

This course is recommended in conjunction with ASTR 501 Introduction to Computing, which is every Tuesday 2-3:35pm. Feel free to sit-in if you just want to get more hands-on experience with scientific computing.

Also, every Thursday 2-3:30pm, we will have the weekly TAP Computation & Data Initiative meeting in SO N305. Please feel free to stop by as well.

Instructor and Contact Information

Instructor: Chi-kwan Chan
Email: chanc@arizona.edu (please include “ASTR 513” in subjects of emails)
Office: Steward Observatory N332
Office Hours: TBD

Instructor: Shuo Kong
Email: shuokong@arizona.edu (please include “ASTR 513” in subjects of emails)
Office: Steward Observatory N328
Office Hours: TBD

Science Paradigms

  1. Empirical evidence

  2. Scientific theory

  3. Computational science

  4. Data science

Modern science is complex. The last two require computing.

Computational Science

Physical Models \rightarrow Data and Results

Data Science

Data and ML \rightarrow Result

Expected Learning Outcomes

A recent core class homogenization effort suggested covering the following topics:

  • Computational Methods:

    • Unix, C, and Python

    • Introduction to numerical analysis; errors, accuracy, stable and unstable computations

    • Root Finding: Bisection and Newton-Raphson

    • Numerical Integration

    • Ordinary Differential Equations (e.g., Runge-Kutta method)

  • Statistical Methods:

    • Intro and Definitions: The Normal Distribution, Detection of Signal, Correlation, Data

    • Modeling, Sample Comparison

    • Random Numbers

    • Distribution Functions I; Exponential & Gaussian Distributions

    • Distribution Functions II; Bivariate Gaussians; Binomial; Poisson

    • Markov Chain Monte Carlo

    • Error Propagation - Transformation of Random Variables

    • Frequentist Statistics - Confidence Intervals

    • Frequentist and Bayesian Statistics

    • Frequentist Parameter Estimation; Pearson’s chi2 test

    • Bayesian parameter estimation for linear models

    • Inferring Distributions

    • Fast Fourier Transforms

Scheduled Topics/Activities

#WeekMondayWednesday
1Aug 24-Aug 30Overview (Proj brainstorm)Data Representation and Round-Off Errors (HW1 assigned)
2Aug 31-Sep 6No class (Labor Day)Numerical Linear Algebra (HW1 Q&A)
3Sep 7-Sep 13Fourier Transform and Spectral Analyses (Proj selection)Interpolation and Extrapolation (HW1 due, HW2 assigned)
4Sep 14-Sep 20Numerical and Automatic DerivativesNumerical Integration of Functions (HW2 Q&A)
5Sep 21-Sep 27Root Finding and Optimization Methods (Proj feedback)ODE Integrators I: Explicit Methods (HW2 due, HW3 assigned)
6Sep 28-Oct 4ODE integrators II: implicit and symplectic methodsNumerical PDE I: Finite Difference (HW3 Q&A)
7Oct 5-Oct 11Numerical PDE II: Spectral MethodsNumerical PDE III: Finite Volume Methods (HW3 due, HW4 assigned)
8Oct 12-Oct 18Project PresentationsProjects Presentations (HW4 Q&A)
9Oct 19-Oct 25ProbabilityRandom Variable (HW4 due)
10Oct 26-Nov 1StatisticsSampling Distribution
11Nov 2-Nov 8Classical inference (point estimation)Classical inference (interval estimation)
12Nov 9-Nov 15Classical inference (hypothesis test)Structure analysis
13Nov 16-Nov 22Principle componentsRegression
14Nov 23-Nov 29Bayesian inferenceMachine-learning
15Nov 30-Dec 6MCMCHierarchical Bayesian
16Dec 7-Dec 13Review (Q&A)Final exams

Grading Scale and Policies

The course includes 10 homework assignments, 1 project, and 1 final exam. Each homework is worth 5 points, the project is worth 20 points, and the final exam is worth 30 points. The total is 100 points.

This course provides regular letter grades (A-E), which are based on a simple point system:

  • A: 90-100 points

  • B: 80-89.9 points

  • C: 70-79.9 points

  • D: 60-69.9 points

  • E: 0-59.9 points

No scaling will be applied. However, there are multiple opportunities to obtain extra credits.

Project Brainstorming

Based on your introduction, please start filling your research interest in the ua-2025q3-astr501-513 Google Sheet that we sent out in D2L. Please start forming groups (3 to 6 members) and brainstorm on project ideas. Previous projects including solving the many-pendulum problem, time-dependent Schrodingers equation, Zambie model, gravitational lensing, fluid dynamics, etc.

Usage of Generative AI

Homework, projects, and exams in this course are designed to help students apply class concepts, test their understanding, and develop skills in software development and scientific communication. Generative AI tools such as ChatGPT, Google Gemini, and GitHub Copilot can be valuable for brainstorming, exploring alternative approaches, clarifying confusing concepts, and debugging code. Students may also use these tools to clarify difficult concepts and to generate examples that aid their learning.

However, students must write their own code, take full responsibility for their work, and demonstrate a clear understanding of the underlying concepts. While AI tools can support learning, they may produce inaccurate, incomplete, or biased results. Students are responsible for verifying facts, testing code, and critically assessing all submitted material.

Any use of generative AI must be acknowledged or cited (see guidelines from UA library). Failure to disclose such use, or submitting work that is not original, will be considered a violation of academic integrity.

For questions, contact your instructor.