An algorithm for computing the 2D structure of fast rotating stars

TL;DR

This paper introduces the ESTER code, a novel 2D modeling tool for fast rotating stars that incorporates large-scale flows and complex microphysics, surpassing traditional 1D models in accuracy.

Contribution

The paper presents the first 2D stellar modeling code that includes large-scale flows and complex microphysics, using advanced spectral methods and efficient nonlinear solvers.

Findings

ESTER code successfully models 2D structures of fast rotating stars.

Spectral discretization effectively represents 2D axisymmetric fields.

Newton iteration method outperforms Picard scheme for complex microphysics.

Abstract

Stars may be understood as self-gravitating masses of a compressible fluid whose radiative cooling is compensated by nuclear reactions or gravitational contraction. The understanding of their time evolution requires the use of detailed models that account for a complex microphysics including that of opacities, equation of state and nuclear reactions. The present stellar models are essentially one-dimensional, namely spherically symmetric. However, the interpretation of recent data like the surface abundances of elements or the distribution of internal rotation have reached the limits of validity of one-dimensional models because of their very simplified representation of large-scale fluid flows. In this article, we describe the ESTER code, which is the first code able to compute in a consistent way a two-dimensional model of a fast rotating star including its large-scale flows. Compared to classical 1D stellar evolution codes, many numerical innovations have been introduced to deal with this complex problem. First, the spectral discretization based on spherical harmonics and Chebyshev polynomials is used to represent the 2D axisymmetric fields. A nonlinear mapping maps the spheroidal star and allows a smooth spectral representation of the fields. The properties of Picard and Newton iterations for solving the nonlinear partial differential equations of the problem are discussed. It turns out that the Picard scheme is efficient on the computation of the simple polytropic stars, but Newton algorithm is unsurpassed when stellar models include complex microphysics. Finally, we discuss the numerical efficiency of our solver of Newton iterations. This linear solver combines the iterative Conjugate Gradient Squared algorithm together with an LU-factorization serving as a preconditionner of the Jacobian matrix.