Parametric Matrix Models for Emulation in Nuclear and Many-Body Physics

Patrick Cook

REVIEW 3 major objections 5 minor 204 references

Parametric Matrix Models for Emulation in Nuclear and Many-Body Physics

T0 review · 3 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Parametric matrix models train a reduced-space, structure-preserving version of a system's own equations from scalar data, aiming to emulate eigenvalue problems, nonlinear dynamics, and regression without constructing snapshots.

desk verdict A well-built thesis that formalizes PMMs as implicit reduced-basis emulators, but its headline data-efficiency guarantee rests on an unproven hidden-snapshot decay assumption; soften that claim and the paper is still solid and worth refereeing. read the letter →

arxiv 2608.12837 v1 pith:UEGLHCV6 submitted 2026-08-13 nucl-th physics.comp-ph

Patrick Cook This is my paper · ORCID

classification nucl-thphysics.comp-ph

keywords parametricmatrixmodelsimplicitreducedbasismethodsemulationeigenvectorcontinuationnuclearmany-bodyphysicsnonlineardynamicsmachinelearninguncertaintyquantification

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The thesis contends that parametric matrix models (PMMs) offer a single emulation framework that can replace explicit snapshot-based reduced basis emulators for parametric eigenvalue problems, nonlinear dynamics, and data-driven regression. Instead of choosing a reduced subspace and projecting the full equations onto it, a PMM starts from the known or assumed form of the governing equations, derives the form its Galerkin projection would take, and replaces every unknown projected operator with a trainable matrix or tensor that respects known structure such as Hermiticity. The trained reduced model runs entirely in a low-dimensional space, so the cost of evaluation and fitting is independent of the full model size. If correct, PMMs would make uncertainty quantification and parameter fitting feasible for expensive many-body models while retaining the interpretability of reduced basis methods. The thesis also positions PMMs as 'implicit reduced basis methods' and develops the accompanying open-source pyPMM package.

What carries the argument

The load-bearing object is the parametric matrix model itself: a reduced-space matrix or tensor model whose form is derived from the Galerkin projection of the known or supposed full model, with all unknown projected objects replaced by trainable parameters. The training is carried by effective parameterizations that enforce constraints in closed form, such as Hermiticity via $H=(\Theta+\Theta^\dagger)/2$, unitarity via matrix exponentials, and rank via sums of rank-one terms. For elementwise nonlinearities, a canonical matrix-valued map $Y(A)=V_A\,\mathrm{diag}(y(\lambda_A))\,V_A^{-1}$ reduces the nonlinearity to the same third-order tensor $G^{(2)}$ that handles quadratic products, preserving the exact nonlinear form without hyper-reduction. The optimization itself uses complex-valued gradient descent (a Wirtinger-modified Adam) with automatic differentiation, and uncertainty can be added through bootstrap aggregation or conformal prediction.

What would settle it

Construct a parametric family whose scalar outputs come from a high-dimensional response with a flat, non-decaying singular-value spectrum (for example, random i.i.d. Gaussian output vectors at each parameter value), train PMMs of increasing size and data count, and check whether the relative error follows $O(\min(m,n)^{-\beta})$; if the error stalls or converges only logarithmically, the assumed hidden-vector decay is violated.

Watch

Extended reading notes

Core claim

The central discovery is that an emulator need not construct the reduced basis at all. For any system whose equations have a known parametric form, one can write down the reduced-space problem exactly as Galerkin projection would produce it, then treat the projected operators as free parameters constrained only by properties the projection would preserve (Hermiticity, vector normalization, unitarity, and the like). Training these parameters on scalar or vector data yields a numerically parametric emulator that inherits the interpretability and physical consistency of the explicit reduced basis method but does not require full-space snapshots. The thesis demonstrates the framework on affine and nonlinear eigenproblems, nonlinear dynamics, data-driven regression, and emulation of in-medium similarity renormalization group nuclear matter calculations, and it argues that for typical data the error scales as $O(\min(m,n)^{-\beta})$ with the number $m$ of training examples and reduced dimension $n$. This makes PMMs, in the thesis's framing, the first adaptive emulation method: it can be fully intrusive, fully data-driven, or any hybrid in between.

Load-bearing premise

The data-efficiency guarantee rests on the unproven assumption that scalar training data always hide an underlying set of snapshot vectors whose singular values decay exponentially or as a power law, so that a small reduced space can capture almost all of the information.

Editorial extensions

If this is right

PMMs can emulate parametric eigenvalue problems from scalar energies alone, matching or beating explicit eigenvector-continuation emulators without storing or computing full eigenvectors.
Nonlinear dynamics can be emulated at reduced-space cost without hyper-reduction, because the canonical matrix-valued nonlinearity preserves the exact elementwise analytic form.
A single PMM framework covers intrusive, hybrid, and fully data-driven settings, so it remains applicable when the full model is only partially known or when snapshots are too large to store.
Because PMMs are numerically parametric, new training data can be incorporated by further gradient steps without retraining from scratch.
Attaching conformal prediction to PMMs yields calibrated prediction intervals, making the emulator usable for uncertainty-quantified parameter fitting.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Beyond the paper, the hidden-snapshot argument implies that PMM-style training should be tested as a general regression method on non-physics datasets with known singular-value decay, such as image or sensor datasets, to see whether the $O(\min(m,n)^{-\beta})$ scaling holds there too.
The canonical matrix-valued nonlinearity suggests PMMs could serve as structure-preserving surrogates for any elementwise analytic term in large PDE solvers, for instance Gross-Pitaevskii or Hartree-Fock mean fields, with the same $G^{(2)}$ tensor overhead, a connection the thesis does not develop.
Interpreting every explicit reduced-basis method as a particular PMM parameterization opens the possibility of unifying POD, eigenvector continuation, and DMD under one training objective, which the thesis only gestures at.
A direct empirical test of the central claim would compare PMM error curves with explicit emulators on the same problems while monitoring the actual singular-value decay of the underlying snapshots, where available; the thesis reports individual examples but no systematic benchmark.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Colleague, the useful thing here is the formal packaging. The thesis takes the PMM idea from the author's earlier paper and builds a genuine framework around it: implicit reduced basis methods, a Galerkin-style derivation, a canonical matrix-valued treatment of elementwise nonlinearities, tensor hypernetwork parameterizations, and worked examples that look internally consistent. The toy model in Section 3.1 clearly shows a case where an eRBM fails and a PMM succeeds. That is real content, not just a survey. The pyPMM package is a plus, though I would want a commit hash before treating results as reproducible.

The soft spot is exactly where the stress-test note lands. Section 3.4.4 claims an O(min(m,n)^-beta) error scaling from the singular values of a hidden matrix of snapshot vectors. Those vectors are never constructed. For data-driven regression they are not even unique: different completions of the same scalar data can have completely different singular spectra. For eigenvalue problems, the decay is an empirical regularity, not a consequence of the PMM construction. The step from n-dependence to min(m,n)^-beta is also not derived; rank deficiency for n>m does not automatically produce that exponent. The thesis itself flags the decay as "overwhelmingly true in practice" rather than proven, so this is not a fraud, but the abstract's "nearly unparalleled trustworthiness" claim inherits the gap. If the author recasts this as a heuristic with caveats, the paper's core value barely changes.

A few smaller items: training has no convergence guarantees, but that is normal for gradient-based ML emulators and not a disqualifier. The empirics on held-out data are the right kind of evidence, and the examples are evaluated against high-fidelity data rather than fitted values. The citation pattern is fine; citing your own prior method is not a flaw when the extension is real.

Who is this for? Nuclear and many-body practitioners who want a self-contained bridge between reduced-basis methods and trainable emulators. It deserves a serious referee. I would send it out, but with a clear request to rewrite Section 3.4.4 so that the data-efficiency claim is stated as an observed regularity with identified failure modes, not a proven bound. That revision is within reach.

Referee Report

3 major / 5 minor

Summary. The manuscript develops parametric matrix models (PMMs) as a class of emulators that combine reduced-basis structure with trainable reduced-space operators. The thesis positions PMMs as implicit reduced basis methods: instead of constructing an explicit projection from full-space snapshots, one specifies only the reduced dimension and structural constraints (e.g., Hermiticity) and optimizes the reduced operators against scalar or vector training data. The paper claims that PMMs inherit the interpretability, physical consistency, and systematic improvability of explicit reduced basis methods while being numerically parametric and data efficient, with an approximate error scaling O(min(m,n)^(-beta)) derived from the singular-value decay of an assumed hidden snapshot matrix. The manuscript also surveys existing emulation methods, details training via gradient-based optimization and effective parameterizations, and describes an open-source implementation (pyPMM).

Significance. If the central claims were established, PMMs would be a valuable new tool for nuclear and many-body emulation: they promise a numerically parametric, adaptive framework that can exploit partial knowledge of the governing equations while avoiding explicit full-space snapshots. The conceptual unification of reduced-basis methods and parametric machine learning, together with the open-source package, could lower the barrier to adoption. The toy example in Eqs. (3.4)-(3.5) is a clear and instructive demonstration that explicit reduced basis methods can fail while an implicit reduced model exists. The review of existing methods and the property tables are useful contributions. However, the theoretical support for the headline data-efficiency and trustworthiness claims is not yet rigorous: the error bound rests on an unproven and, in data-driven settings, non-unique hidden-snapshot construction, and the training procedure carries no convergence or generalization guarantee. The work is promising but requires substantial clarification and, in places, a downgrade of the strength of the claims.

major comments (3)

[Section 3.4.4 and Eqs. (2.31)-(2.33)] The claimed error scaling O(min(m,n)^(-beta)) is the sole quantitative support for the data-efficiency and 'at least as well as the associated eRBM' claims, but it is not derived from the training data. The argument postulates hidden snapshot vectors that are never constructed; for data-driven regression (Sections 3.9 and 3.13) no underlying full-space state is specified, so the hidden snapshot matrix is not unique and different completions can have completely different singular spectra. Even where eigenvectors exist, the decay assumption in Eq. (2.33) is acknowledged in the manuscript itself as 'overwhelmingly true in practice' rather than proven, and random-matrix counterexamples are admitted. Furthermore, Eq. (2.31) bounds the projection error by sigma_{n+1}; the conversion of this to a rate in the number of training examples m is not shown, and the rank-deficiency step for n > m conflates the number of training examples with the rank of the hidden snapshot matrix. The bound should either be proven under stated assumptions or replaced by a clearly empirical claim, with the data-efficiency property reworded accordingly.
[Section 3.4.4, first paragraph; Section 3.5] The statement 'By construction, the resulting PMM—if trained properly—will perform at least as well as the associated eRBM' conditions the central inheritance claim on training that the manuscript does not guarantee. Section 3.5 describes gradient descent on a generally nonconvex loss, with only heuristic arguments (e.g., prevalence of near-global local minima for high-dimensional parameter spaces) and no convergence or generalization theorem. The toy example in Eqs. (3.4)-(3.5) exhibits a family of implicit models that reproduce the exact energies, but it does not show that the training procedure in Section 3.5 can locate such a family from scalar data. The property tables and the abstract present data efficiency and trustworthiness as intrinsic PMM properties; without an operational criterion for 'trained properly' or empirical certification, these claims are stronger than what is established.
[Section 3.4.4 and Section 3.6.6] The inheritance of eRBM error bounds and physical-consistency properties is claimed for PMMs, but the effective parameterizations used in practice introduce approximations whose errors are not analyzed. In particular, Eq. (3.49) replaces the POD projector P in the tensor hypernetwork expression by a trainable matrix Theta, and the resulting truncation error is not bounded. Consequently, the 'at least as well as the associated eRBM' statement does not automatically extend to the implemented PMMs for nonlinear problems; the relationship between the trained PMM and the corresponding eRBM solution is not quantified. The manuscript should either provide error estimates for these parameterizations or restrict the inheritance claims to the exactly parameterized cases.

minor comments (5)

[Section 2.11.1.1, Eq. (2.32)] The expected relative error formula is presented without stating the sample distribution or normalization of the test vectors; specify the assumptions under which this expectation is taken.
[Section 3.4.4, last paragraph] The notation O(min(m,n)^(-beta)) mixes asymptotic notation in m with a problem-dependent exponent beta; clarify whether beta is a constant or a quantity that may depend on the data distribution.
[Section 3.6.6] The term 'tensor hypernetwork' is nonstandard in machine learning, where 'hypernetwork' commonly refers to a network generating weights; consider renaming to 'high-order tensor contraction' or another descriptive term to avoid confusion.
[Table 2.10] The legend line 'IIntrusive' appears to be a formatting artifact; the column header is missing and should be corrected.
[Abstract and Section 3.4] Phrases such as 'nearly unparalleled adaptability' are more evaluative than a formal property statement; consider rewriting these as concrete, testable claims.

Circularity Check

1 steps flagged · score 2.0 of 10

One definitional 'by construction' claim in the data-efficiency argument; otherwise the derivation is self-contained and evaluated on held-out data.

self definitional [Section 3.4.4 (Data Efficiency), resting on Eq. (3.7) in Section 3.1]
"There is no unique solution to Eq. (3.7), and by construction the less-desirable eRBM is a solution. ... By construction, the resulting PMM—if trained properly—will perform at least as well as the associated eRBM."

The performance guarantee is the training objective restated. Eq. (3.7) defines the PMM reduced operators as the argmin of a loss that compares PMM predictions to training data, and the text states that the eRBM is itself a feasible solution of that same minimization. Therefore any properly trained PMM matches the eRBM on the training data by construction; 'at least as well as the associated eRBM' is not an independent result about generalization or data efficiency. The paper then uses this definitional property to transfer eRBM convergence rates to PMMs.

full rationale

Most of the paper's derivation chain is self-contained. PMMs are trained on one set of data and evaluated on held-out high-fidelity data, so the headline performance claims are not fitted values renamed as predictions. The hidden-snapshot singular-value argument in Section 3.4.4 is a rigor gap rather than a circularity: the paper assumes that every scalar dataset has an associated hidden snapshot matrix whose singular values decay exponentially or as a power law, and the O(min(m,n)^(-beta)) bound is inherited from that empirical heuristic, not derived from observable PMM quantities. An unproven or unfalsifiable assumption is not, by itself, a circular reduction unless the target result is the assumption itself. Self-citations to Ref. [62] are historical and descriptive, not load-bearing: the thesis does not invoke an external uniqueness theorem from the authors' prior work to forbid alternatives. The only identifiable circular step is the 'by construction' claim that a properly trained PMM performs at least as well as the eRBM, which is definitional given that the eRBM is a feasible point of the same loss minimization. This is minor and does not undermine the held-out empirical evaluations, so the overall circularity score is 2.

Assumptions & free parameters 3 free parameters · 4 assumptions · 1 invented entities

The central claim rests on standard linear algebra plus three unproven inputs: a known algebraic form for the reduced equations, a hidden-snapshot singular-value decay assumption, and the empirical reliability of gradient descent. The reduced dimension n and training hyperparameters are free choices that directly control accuracy.

free parameters (3)

Reduced space dimension n = e.g., 5, 8, 10 in examples
Core hyperparameter of every PMM; accuracy and cost scale with it, and the thesis offers heuristics but no automatic selection.
Training hyperparameters (learning rate, Adam beta1/beta2/epsilon, initialization scale) = learning rate 1e-2 to 1e-4, beta1=0.9, beta2=0.999, epsilon=1e-8
Chosen by hand following common ML practice; Section 3.5.2 states typical initialization scales 1e-1 to 1e-2.
Hidden snapshot singular-value decay constants alpha/beta = unspecified
Introduced in Section 3.4.4 to claim O(n^-beta) error scaling; not measured or derived.

assumptions (4)

standard math Galerkin projection and Poincare separation theorem provide the reduced forms and error bounds used throughout.
Used in Chapter 2 and Chapter 3 to derive the algebraic form of reduced models and to argue preservation of eigenvalues and inner products.
domain assumption The high-fidelity model is parametric and its algebraic form is known or can be supposed, so the reduced model can mirror it.
Section 3.1 step 0 and Section 3.3 require this to write down the PMM form; without it the method reduces to generic regression.
ad hoc to paper Typical real-world data have exponentially or polynomially decaying singular values.
Section 3.4.4 uses this to assert PMMs are data efficient; the text calls it an in-practice truth rather than a theorem.
ad hoc to paper Gradient descent on the PMM loss reaches a parameter configuration that generalizes.
Section 3.5 treats this as inherited from deep learning practice; no convergence or generalization theorem is provided.

invented entities (1)

Hidden snapshot vectors
purpose: Justify the claimed data-efficiency error scaling for PMMs.
Postulated in Section 3.4.4 as the unknown vectors behind scalar data; never constructed, and their singular-value decay is assumed.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Parametric Matrix Models for Emulation in Nuclear and Many-Body Physics." pith.science (2026). https://pith.science/paper/UEGLHCV6

@misc{pith2026260812837,
  author       = {Pith},
  title        = {Pith review of: Parametric Matrix Models for Emulation in Nuclear and Many-Body Physics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UEGLHCV6}},
  note         = {Machine review of arXiv:2608.12837}
}

read the original abstract

Progress in nuclear and many-body physics today is predicated on the ability to solve large-scale, strongly correlated quantum many-body problems. As the theoretical models become more sophisticated, they also become more computationally complex. Simultaneously, quantifying uncertainty in model predictions and fitting free parameters to experimental observations requires repeated evaluation of these expensive models. Surrogate models---known as emulators---provide the means of accomplishing these goals. This thesis provides an introduction into the current state of emulation in nuclear and many-body physics. The motivations, goals, and origins of currently popular emulation methods are discussed along with selected examples. We see how many methods are closely mathematically related and how trade-offs are made to optimize specific properties or applications. The central work in this thesis is the method of parametric matrix models (PMMs), an emulation and general machine learning framework which combines aspects of traditional reduced basis method with modern parametric machine learning. PMMs are able to retain as much or as little physical information about the underlying system as desired, yielding not only excellent performance but also nearly unparalleled adaptability, interpretability, and trustworthiness as an emulation method. A formal mathematical framework for PMMs is developed and accompanied by practical step-by-step procedures for the application of the method. As part of this thesis, the open-source pyPMM package was developed. This package enables any researcher to construct, train, share, and deploy PMM-based emulators with modular, extendable, and graphics processing unit (GPU)-optimized code. All PMM examples in this thesis were created using this package.

Figures

Figures reproduced from arXiv: 2608.12837 by the authors.

**Figure 2.** Illustration of various classes of emulation techniques. The left circle contains [PITH_FULL_IMAGE:figures/full_fig_p022_2.png] view at source ↗

**Figure 2.** Illustration of varying amounts of UQ for a model which is inaccurate on the left [PITH_FULL_IMAGE:figures/full_fig_p024_2.png] view at source ↗

Figures from the paper (27 more)

**Figure 2.** Figure 2: Singular values and cumulative explained variance for four real-world datasets: [PITH_FULL_IMAGE:figures/full_fig_p041_2.png]

**Figure 2.** Figure 2: (a) shows the results of the high-fidelity [PITH_FULL_IMAGE:figures/full_fig_p043_2.png]

**Figure 2.** Figure 2: (d). The rapid exponential decay of the singular values is not specific to this example [PITH_FULL_IMAGE:figures/full_fig_p044_2.png]

**Figure 2.** Figure 2: Results of applying the POD-Galerkin method to the problem of 1D diffusion. (a) [PITH_FULL_IMAGE:figures/full_fig_p045_2.png]

**Figure 2.** Figure 2: Results of applying parametric DMD to the problem of 1D diffusion. (a) The [PITH_FULL_IMAGE:figures/full_fig_p052_2.png]

**Figure 2.** Figure 2: shows the squared magnitude of the components of the exact and optimal ap [PITH_FULL_IMAGE:figures/full_fig_p059_2.png]

**Figure 2.** Figure 2: shows these dynamics along with the relative error in the observable. The relative [PITH_FULL_IMAGE:figures/full_fig_p060_2.png]

**Figure 2.** Figure 2: Numerically computed (solid blue) [PITH_FULL_IMAGE:figures/full_fig_p061_2.png]

**Figure 2.** Figure 2: , demonstrating the predictive power of EC for parametric Hamiltonian problems [PITH_FULL_IMAGE:figures/full_fig_p066_2.png]

**Figure 2.** Figure 2: Exact and EC-predicted results for the ground state energy (left) and expectation [PITH_FULL_IMAGE:figures/full_fig_p067_2.png]

**Figure 2.** Figure 2: Schematic illustration of a multi-layer perceptron with two inputs [PITH_FULL_IMAGE:figures/full_fig_p071_2.png]

**Figure 3.** Figure 3: Ground state energy as a function of [PITH_FULL_IMAGE:figures/full_fig_p081_3.png]

**Figure 3.** Figure 3: Illustrative example of three steps of the steepest descent method in 1D. Two [PITH_FULL_IMAGE:figures/full_fig_p096_3.png]

**Figure 3.** Figure 3: Illustration of the logistic function in Eq. (3.43) applied to the problem of con [PITH_FULL_IMAGE:figures/full_fig_p114_3.png]

**Figure 3.** Figure 3: Exact and PMM-predicted results for the ground state energy (left) and expec [PITH_FULL_IMAGE:figures/full_fig_p121_3.png]

**Figure 3.** Figure 3: Demonstration of the smoothing term in Eq. (3.63) on the eigenvalues of a para [PITH_FULL_IMAGE:figures/full_fig_p124_3.png]

**Figure 3.** Figure 3: Demonstration of the smoothing term in Eq. (3.63) on a Hermitian form of the [PITH_FULL_IMAGE:figures/full_fig_p125_3.png]

**Figure 3.** Figure 3: (Left column) high-fidelity calculations of the ground state ( [PITH_FULL_IMAGE:figures/full_fig_p134_3.png]

**Figure 3.** Figure 3: Results for the overlap error, [PITH_FULL_IMAGE:figures/full_fig_p135_3.png]

**Figure 3.** Figure 3: shows the results of using this trained emulator to predict the dynamics for a [PITH_FULL_IMAGE:figures/full_fig_p140_3.png]

**Figure 3.** Figure 3: High-fidelity and emulator-predicted results for the dynamics of the system [PITH_FULL_IMAGE:figures/full_fig_p141_3.png]

**Figure 3.** Figure 3: High-fidelity (markers) and PMM-emulated (lines) ground state energy per par [PITH_FULL_IMAGE:figures/full_fig_p145_3.png]

**Figure 3.** Figure 3: Comprehensive diagram of the PMM–IMSRG emulator. Inputs are shown on [PITH_FULL_IMAGE:figures/full_fig_p152_3.png]

**Figure 3.** Figure 3: The stratified partitioning of the IMSRG samples used for training, validating, [PITH_FULL_IMAGE:figures/full_fig_p154_3.png]

**Figure 3.** Figure 3: Comparison of PMM-predicted energies at the [PITH_FULL_IMAGE:figures/full_fig_p157_3.png]

**Figure 3.** Figure 3: Actual coverage versus requested confidence level for the PMM emulator on [PITH_FULL_IMAGE:figures/full_fig_p158_3.png]

**Figure 3.** Figure 3: Median expectation values of each term in the emulated Hamiltonian with [PITH_FULL_IMAGE:figures/full_fig_p160_3.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

204 extracted references · 75 canonical work pages

[1]

Ver- sion 0.0.0+dev

Patrick Cook.pyPMM: The Python Package for Parametric Matrix Models. Ver- sion 0.0.0+dev. June 2026.url: https://github.com/Parametric-Matrix- Models/pyPMM (cit. on pp. ii, 147, 161, 162)

2026
[2]

Moderntheoryofnuclearforces

E.Epelbaum, H.-W.Hammer, andUlf-G.Meißner. “Moderntheoryofnuclearforces”. In:Rev. Mod. Phys.81 (4 Dec. 2009), pp. 1773–1825.doi: 10.1103/RevModPhys.8 1.1773.url: https://link.aps.org/doi/10.1103/RevModPhys.81.1773 (cit. on p. 3)

work page doi:10.1103/revmodphys.8 2009
[3]

Improved nuclear matter calculations from chiral low-momentum interactions

K. Hebeler, S. K. Bogner, et al. “Improved nuclear matter calculations from chiral low-momentum interactions”. In:Phys. Rev. C83 (3 Mar. 2011), p. 031301.doi: 10.1103/PhysRevC.83.031301.url: https://link.aps.org/doi/10.1103/PhysRevC.83 .031301 (cit. on p. 3)

work page doi:10.1103/physrevc.83.031301.url: 2011
[4]

Turning the nuclear energy density functional method into a proper effective field theory: reflections

R. J. Furnstahl. “Turning the nuclear energy density functional method into a proper effective field theory: reflections”. In:The European Physical Journal A56.3 (Mar. 2020), p. 85.issn: 1434-601X.doi: 10.1140/epja/s10050-020-00095-y.url: https://doi.org/10.1140/epja/s10050-020-00095-y (cit. on p. 3)

work page doi:10.1140/epja/s10050-020-00095-y.url: 2020
[5]

Nuclear energy density functionals grounded in ab initio calculations

F. Marino, C. Barbieri, et al. “Nuclear energy density functionals grounded in ab initio calculations”. In:Phys. Rev. C104 (2 Aug. 2021), p. 024315.doi: 10.1103/Phys RevC.104.024315.url: https://link.aps.org/doi/10.1103/PhysRevC.104.024315 (cit. on p. 3)

doi:10.1103/phys 2021
[6]

Factorized approximation to the in-medium similarity renormalization group IMSRG(3)

B. C. He and S. R. Stroberg. “Factorized approximation to the in-medium similarity renormalization group IMSRG(3)”. In:Phys. Rev. C110 (4 Oct. 2024), p. 044317. doi: 10.1103/PhysRevC.110.044317.url: https://link.aps.org/doi/10.1103/PhysR evC.110.044317 (cit. on p. 3)

work page doi:10.1103/physrevc.110.044317.url: 2024
[7]

Magnus expansion and in- medium similarity renormalization group

T. D. Morris, N. M. Parzuchowski, and S. K. Bogner. “Magnus expansion and in- medium similarity renormalization group”. In:Phys. Rev. C92 (3 Sept. 2015), p. 034331.doi: 10.1103/PhysRevC.92.034331.url: https://link.aps.org/doi/10.11 03/PhysRevC.92.034331 (cit. on p. 3)

work page doi:10.1103/physrevc.92.034331.url: 2015
[8]

IMSRG-Net: A machine-learning-based solver for the in-medium similarity renormalization group method

Sota Yoshida. “IMSRG-Net: A machine-learning-based solver for the in-medium similarity renormalization group method”. In:Phys. Rev. C108 (4 Oct. 2023), p. 044303.doi: 10.1103/PhysRevC.108.044303.url: https://link.aps.org/doi/10. 1103/PhysRevC.108.044303 (cit. on p. 3)

work page doi:10.1103/physrevc.108.044303.url: 2023

Show all 204 references

[9]

Converged ab initio calculations of heavy nuclei

T. Miyagi, S. R. Stroberg, et al. “Converged ab initio calculations of heavy nuclei”. In:Phys. Rev. C105 (1 Jan. 2022), p. 014302.doi: 10.1103/PhysRevC.105.014302. url: https://link.aps.org/doi/10.1103/PhysRevC.105.014302 (cit. on p. 3). 164

2022 doi
[10]

Solution of the Skyrme-Hartree-Fock-Bogolyubov equations in the Cartesian deformed harmonic-oscillator basis. (VII) HFODD (v2.49s): a new version of the program

N. Schunck, J. Dobaczewski, et al. “Solution of the Skyrme-Hartree-Fock-Bogolyubov equations in the Cartesian deformed harmonic-oscillator basis. (VII) HFODD (v2.49s): a new version of the program”. In:Comput. Phys. Commun.183 (2012), pp. 166–192.doi: 10.1016/j.cpc.2011.08.013...

2012 arXiv
[11]

Symmetry breaking in nuclear mean-field models

W. Ryssens. “Symmetry breaking in nuclear mean-field models”. PhD thesis. Uni- versité Libre de Bruxelles, 2016.url: http://hdl.handle.net/2013/ULB-DIPOT:oai: dipot.ulb.ac.be:2013/235692 (cit. on p. 3)

2016
[12]

Future of nuclear fission theory

Michael Bender, Rémi Bernard, et al. “Future of nuclear fission theory”. In:Journal of Physics G: Nuclear and Particle Physics47.11 (Oct. 2020), p. 113002.doi: 10.1 088/1361-6471/abab4f.url: https://doi.org/10.1088/1361-6471/abab4f (cit. on p. 3)

2020 doi
[13]

Microscopic theory of nuclear fission: a review

N. Schunck and L. M. Robledo. “Microscopic theory of nuclear fission: a review”. In: Reports on Progress in Physics79.11 (Oct. 2016), p. 116301.doi: 10.1088/0034- 4885/79/11/116301.url: https://doi.org/10.1088/0034-4885/79/11/116301 (cit. on p. 3)

2016 doi
[14]

Theory of nuclear fission

Nicolas Schunck and David Regnier. “Theory of nuclear fission”. In:Progress in Particle and Nuclear Physics125 (2022), p. 103963.issn: 0146-6410.doi: 10.1016/ j.ppnp.2022.103963.url: https://doi.org/10.1016/j.ppnp.2022.103963 (cit. on p. 3)

2022
[15]

ImageNet Large Scale Visual Recognition Chal- lenge

Olga Russakovsky, Jia Deng, et al. “ImageNet Large Scale Visual Recognition Chal- lenge”. In:International Journal of Computer Vision (IJCV)115.3 (2015), pp. 211– 252.doi: 10.1007/s11263-015-0816-y (cit. on p. 4)

2015 doi
[16]

Model reduction methods for nuclear emulators

J. A. Melendez, C. Drischler, et al. “Model reduction methods for nuclear emulators”. In:Journal of Physics G: Nuclear and Particle Physics49.10 (Sept. 2022), p. 102001. doi: 10.1088/1361-6471/ac83dd.url: https://doi.org/10.1088/1361-6471/ac83dd (cit. on p. 4)

2022 doi
[17]

Michael Sipser.Introduction to the Theory of Computation. Third. Boston, MA: Course Technology, 2013.isbn: 113318779X (cit. on p. 7)

2013
[18]

Gaussian elimination is not optimal

Volker Strassen. “Gaussian elimination is not optimal”. In:Numerische Mathematik 13.4 (Aug. 1969), pp. 354–356.issn: 0945-3245.doi: 10.1007/BF02165411.url: https://doi.org/10.1007/BF02165411 (cit. on p. 8)

1969 doi
[19]

Jared Kaplan, Sam McCandlish, et al.Scaling Laws for Neural Language Models
[20]

Non-equilibrium critical scaling and universality in a quantum simulator

Arinjoy De, Patrick Cook, et al. “Non-equilibrium critical scaling and universality in a quantum simulator”. In:Nature Communications16.1 (Aug. 2025), p. 7939.issn: 2041-1723.doi: 10.1038/s41467-025-63398-y.url: https://doi.org/10.1038/s41467- 025-63398-y (cit. on pp. 11, 52, ...

2025 doi
[21]

Nishimori and G

H. Nishimori and G. Ortiz.Elements of Phase Transitions and Critical Phenomena. Oxford Graduate Texts. OUP Oxford, 2011.isbn: 9780199577224.url: https: //books.google.com/books?id=qiEUDAAAQBAJ (cit. on p. 11)

2011
[22]

Colloquium: Eigenvector continuation and projection-based emulators

Thomas Duguet, Andreas Ekström, et al. “Colloquium: Eigenvector continuation and projection-based emulators”. In:Rev. Mod. Phys.96 (3 Aug. 2024), p. 031002.doi: 10.1103/RevModPhys.96.031002.url: https://link.aps.org/doi/10.1103/RevModP hys.96.031002 (cit. on pp. 13, 15, 56, 57)

2024 doi
[23]

Inferring three-nucleon couplings from multi-messenger neutron-star observations

Rahul Somasundaram, Isak Svensson, et al. “Inferring three-nucleon couplings from multi-messenger neutron-star observations”. In:Nature Communications16.1 (Nov. 2025), p. 9819.issn: 2041-1723.doi: 10.1038/s41467-025-64756-6.url: https: //doi.org/10.1038/s41467-025-64756-6 (cit...

2025 doi
[24]

Physics-informed machine learning for reduced- order modeling of nonlinear problems

Wenqian Chen, Qian Wang, et al. “Physics-informed machine learning for reduced- order modeling of nonlinear problems”. In:Journal of Computational Physics446 (2021), p. 110666.issn: 0021-9991.doi: 10.1016/j.jcp.2021.110666.url: https: //doi.org/10.1016/j.jcp.2021.110666 (cit. ...

2021
[25]

Rods and Plates, Series Occurring in Various Questions Concerning the Elastic Equilibrium of Rods and Plates

B. G. Galerkin. “Rods and Plates, Series Occurring in Various Questions Concerning the Elastic Equilibrium of Rods and Plates”. Russian. In:Vestnik Inzhenerov i Tekhnikov (Engineers and Technologists Bulletin)19 (1915), pp. 897–908 (cit. on p. 17)

1915
[26]

W. J. Duncan.Galerkin’s method in mechanics and differential equations. Research Report Reports and Memoranda No. 1798. National Advisory Committee for Aero- nautics, United Kingdom, Aug. 1937.url: https://reports.aerade.cranfield.ac.uk/h andle/1826.2/1428 (cit. on p. 17)

1937
[27]

Contractor Report NASA-CR-92216

Mathematical Research, Inc.Methods of the Galerkin Type. Contractor Report NASA-CR-92216. Houston, Texas: National Aeronautics and Space Administration, United States, Jan. 1967.url: https://ntrs.nasa.gov/api/citations/19680021795/do wnloads/19680021795.pdf (cit. on pp. 17, 19)

1967
[28]

Texts in Computational Science and Engineering

Hans Petter Langtangen and Kent-Andre Mardal.Introduction to Numerical Methods for Variational Problems. Texts in Computational Science and Engineering. Springer Cham, 2019.isbn: 978-3-030-23787-5.doi: 10.1007/978-3-030-23788-2.url: https://doi.org/10.1007/978-3-030-23788-2 (c...

2019 doi
[29]

Special Topics in SVD-Based Approximation Methods

A. C. Antoulas. “Special Topics in SVD-Based Approximation Methods”. In:Approx- imation of Large-Scale Dynamical Systems. Advances in Design and Control. Society for Industrial and Applied Mathematics, 2009. Chap. 9.isbn: 9780898716580.doi: 10.1137/1.9780898718713.ch9.url: htt...

2009 doi
[30]

Model Reduction for Flow Analysis and Con- trol

Clarence Rowley and Scott Dawson. “Model Reduction for Flow Analysis and Con- trol”. In:Annual Review of Fluid Mechanics49 (Jan. 2017).doi: 10.1146/annurev- fluid-010816-060042 (cit. on pp. 18, 20)

2017 doi
[31]

Approximation variationnelle des problèmes aux limites

Jean Céa. “Approximation variationnelle des problèmes aux limites”. French. In: Annales de l’Institut Fourier14.2 (1964), pp. 345–444.doi: 10.5802/aif.181.url: https://www.numdam.org/articles/10.5802/aif.181/ (cit. on p. 20)

1964 doi
[32]

Galerkin proper orthogonal decomposition methods for parameter dependent elliptic systems

Stefan Volkwein Martin Kahlbacher. “Galerkin proper orthogonal decomposition methods for parameter dependent elliptic systems”. eng. In:Discussiones Mathe- maticae, Differential Inclusions, Control and Optimization27.1 (2007), pp. 95–117. url: http://eudml.org/doc/271156 (cit....

2007
[33]

The Proper Orthogonal Decomposition in the Analysis of Turbulent Flows

G. Berkooz, P. Holmes, and J. L. Lumley. “The Proper Orthogonal Decomposition in the Analysis of Turbulent Flows”. In:Annual Review of Fluid Mechanics25.Volume 25, 1993 (1993), pp. 539–575.issn: 1545-4479.doi: 10.1146/annurev.fl.25.010193. 002543.url: https://doi.org/10.1146/a...

1993
[34]

The Approximation of One Matrix by Another of Lower Rank

Carl Eckart and Gale Young. “The Approximation of One Matrix by Another of Lower Rank”. In:Psychometrika1.3 (1936), pp. 211–218.doi: 10.1007/BF02288367 (cit. on p. 26)

1936 doi
[35]

Symmetric Gauge Functions And Unitarily Invariant Norms

L. Mirsky. “Symmetric Gauge Functions And Unitarily Invariant Norms”. In:The Quarterly Journal of Mathematics11.1 (Jan. 1960), pp. 50–59.issn: 0033-5606. doi: 10.1093/qmath/11.1.50. eprint: https://academic.oup.com/qjmath/article- pdf/11/1/50/7295335/11-1-50.pdf.url: https://d...

1960 doi
[36]

2nded.Wiley series in probability and statistics

C.RadhakrishnaRao.Linear Statistical Inference and Its Applications. 2nded.Wiley series in probability and statistics. Wiley Eastern, 1973.isbn: 9780471708230.doi: 10.1002/9780470316436.url: https://books.google.com/books?id=wCvH0QEACA AJ (cit. on p. 26). 167

1973 doi
[37]

Separation theorems for singular values of matrices and their applications in multivariate analysis

C. Radhakrishna Rao. “Separation theorems for singular values of matrices and their applications in multivariate analysis”. In:Journal of Multivariate Analysis9.3 (1979), pp. 362–377.issn: 0047-259X.doi: https://doi.org/10.1016/0047-259X(79)90094-0. url: https://www.sciencedir...

1979
[38]

Bellman.Introduction to Matrix Analysis: Second Edition

R. Bellman.Introduction to Matrix Analysis: Second Edition. Classics in Ap- plied Mathematics. Society for Industrial and Applied Mathematics, 1997.isbn: 9780898713992 (cit. on p. 26)

1997
[39]

On the interlacing property for singular values and eigenvalues

João Filipe Queiró. “On the interlacing property for singular values and eigenvalues”. In:Linear Algebra and its Applications97 (1987), pp. 23–28.issn: 0024-3795.doi: https://doi.org/10.1016/0024-3795(87)90136-4.url: https://www.sciencedirect.co m/science/article/pii/002437958...

1987
[40]

Schatten.Norm Ideals of Completely Continuous Operators

R. Schatten.Norm Ideals of Completely Continuous Operators. Ergebnisse der Mathematik und ihrer Grenzgebiete. 2. Folge. Springer Berlin Heidelberg, 2012. isbn: 978-3-642-87654-7.doi: 10.1007/978-3-642-87652-3.url: https: //doi.org/10.1007/978-3-642-87652-3 (cit. on p. 27)

2012 doi
[41]

Discrete Empirical Interpolation for nonlinear model reduction

Saifon Chaturantabut and Danny C. Sorensen. “Discrete Empirical Interpolation for nonlinear model reduction”. In:Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference. 2009, pp. 4316–4321.doi: 10.1109/CDC.20...

2009
[42]

Prediction Accuracy of Dynamic Mode Decomposition

Hannah Lu and Daniel M. Tartakovsky. “Prediction Accuracy of Dynamic Mode Decomposition”. In:SIAM Journal on Scientific Computing42.3 (2020), A1639– A1662.doi: 10.1137/19M1259948. eprint: https://doi.org/10.1137/19M1259948. url: https://doi.org/10.1137/19M1259948 (cit. on p. 27)

2020 doi
[43]

Nonlinear Model Order Reduction via Lifting Transformations and Proper Orthogonal Decomposition

Boris Kramer and Karen E. Willcox. “Nonlinear Model Order Reduction via Lifting Transformations and Proper Orthogonal Decomposition”. In:AIAA Journal57.6 (2019), pp. 2297–2307.doi: 10.2514/1.J057791. eprint: https://doi.org/10.2514/1. J057791.url: https://doi.org/10.2514/1.J05...

2019 doi
[44]

Exploration of Reduced-Order Models for Rocket Combustion Applications

Cheng Huang, Jiayang Xu, et al. “Exploration of Reduced-Order Models for Rocket Combustion Applications”. In: Jan. 2018.doi: 10.2514/6.2018-1183 (cit. on p. 29)

2018 doi
[45]

QLMOR: A Projection-Based Nonlinear Model Order Reduction Ap- proach Using Quadratic-Linear Representation of Nonlinear Systems

Chenjie Gu. “QLMOR: A Projection-Based Nonlinear Model Order Reduction Ap- proach Using Quadratic-Linear Representation of Nonlinear Systems”. In:Trans. Comp.-Aided Des. Integ. Cir. Sys.30.9 (Sept. 2011), pp. 1307–1320.issn: 0278- 0070.doi: 10.1109/TCAD.2011.2142184.url: https...

2011
[46]

A Novel Framework for Machine Learning: Parametric Matrix Models and Their Application in Nuclear Physics, Scientific Computing, and General AI

Danny Jammooa. “A Novel Framework for Machine Learning: Parametric Matrix Models and Their Application in Nuclear Physics, Scientific Computing, and General AI”. PhD thesis. Michigan State University, 2025.doi: 10.25335/drnc-5685.url: https://doi.org/10.25335/drnc-5685 (cit. on p. 32)

2025 doi
[47]

Parameter Adaptation of Reduced Order Models for Three-Dimensional Flutter Analysis

Thuan Lieu and Michel Lesoinne. “Parameter Adaptation of Reduced Order Models for Three-Dimensional Flutter Analysis”. In:42nd AIAA Aerospace Sciences Meeting and Exhibit.doi: 10.2514/6.2004-888. eprint: https://arc.aiaa.org/doi/pdf/10.2514 /6.2004-888.url: https://arc.aiaa.or...

2004 doi
[48]

Adaptation of Aeroelastic Reduced-Order Models and Application to an F-16 Configuration

Thuan Lieu and Charbel Farhat. “Adaptation of Aeroelastic Reduced-Order Models and Application to an F-16 Configuration”. In:AIAA Journal45.6 (2007), pp. 1244– 1257.doi: 10.2514/1.24512. eprint: https://doi.org/10.2514/1.24512.url: https://doi.org/10.2514/1.24512 (cit. on pp. ...

2007 doi
[49]

Aeroelastic Analysis of F-16 and F-18/A Configurations Using Adapted CFD-Based Reduced-Order Models

David Amsallem, Charbel Farhat, and Thuan Lieu. “Aeroelastic Analysis of F-16 and F-18/A Configurations Using Adapted CFD-Based Reduced-Order Models”. In: 48th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materi- als Conference.doi: 10.2514/6.2007-2364. eprint: ...

doi
[50]

Multi-point Extended Reduced Order Modeling For Design Optimization and Uncertainty Analysis

Gary Weickum, Mike Eldred, and Kurt Maute. “Multi-point Extended Reduced Order Modeling For Design Optimization and Uncertainty Analysis”. In:47th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference.doi: 10.2514/6.2006-2145. eprint: https://arc.aia...

doi
[51]

Low-order modelling of laminar flow regimes past a confined square cylinder

B. Galletti, C. H. Bruneau, et al. “Low-order modelling of laminar flow regimes past a confined square cylinder”. In:Journal of Fluid Mechanics503 (2004), pp. 161–170. doi: 10.1017/S0022112004007906 (cit. on pp. 33, 77)

2004 doi
[52]

A posteriori error bounds for reduced- basis approximations of parametrized parabolic partial differential equations

Martin A. Grepl and Anthony T. Patera. “A posteriori error bounds for reduced- basis approximations of parametrized parabolic partial differential equations”. en. In:ESAIM : Modélisation mathématique et analyse numérique39.1 (2005), pp. 157– 181.doi: 10.1051/m2an:2005006.url: ...

2005 doi
[53]

Ghattas, Tan Bui-Thanh, and Karen E

O. Ghattas, Tan Bui-Thanh, and Karen E. Willcox.Model reduction for large-scale systems with high-dimensional parametric input space. Oct. 2008.url: http://hdl. handle.net/1721.1/52410 (cit. on pp. 33, 77). 169

2008
[54]

Modeling and control of physical processes using proper orthogonal decomposition

Hung V. Ly and Hien T. Tran. “Modeling and control of physical processes using proper orthogonal decomposition”. In:Mathematical and Computer Modelling33.1 (2001). Computation and control VI proceedings of the sixth Bozeman conference, pp. 223–236.issn: 0895-7177.doi: https://...

2001 doi
[55]

Interpolation among reduced- order matrices to obtain parameterized models for design, optimization and proba- bilistic analysis

Joris Degroote, Jan Vierendeels, and Karen Willcox. “Interpolation among reduced- order matrices to obtain parameterized models for design, optimization and proba- bilistic analysis”. eng. In:International Journal For Numerical Methods In Fluids 63.2 (2010), pp. 207–230.issn: ...

2010 doi
[56]

Holmes.Introduction to Scientific Computing and Data Analysis

Mark H. Holmes.Introduction to Scientific Computing and Data Analysis. Texts in Computational Science and Engineering. Springer Cham, 2023.isbn: 978-3-031- 22430-0.doi: 10.1007/978-3-031-22430-0. eprint: https://doi.org/10.1007/978-3- 031-22430-0.url: https://doi.org/10.1007/9...

2023 doi
[57]

Calibrated reduced-order POD-Galerkin system for fluid flow modelling

M. Couplet, C. Basdevant, and P. Sagaut. “Calibrated reduced-order POD-Galerkin system for fluid flow modelling”. In:Journal of Computational Physics207.1 (2005), pp. 192–220.issn: 0021-9991.doi: https://doi.org/10.1016/j.jcp.2005.01.008.url: https://www.sciencedirect.com/scie...

2005 doi
[58]

Gradient-basedlearningappliedtodocumentrecognition

Y.Lecun, L.Bottou, etal.“Gradient-basedlearningappliedtodocumentrecognition”. In:Proceedings of the IEEE86.11 (1998), pp. 2278–2324.doi: 10.1109/5.726791 (cit. on p. 34)

1998 doi
[59]

UCI Machine Learning Repository

Jock Blackard.Covertype. UCI Machine Learning Repository. 1998.doi: 10.24432 /C50K5N (cit. on p. 34)

1998
[60]

https://kagg le.com/competitions/bioresponse

Ben Hamner, dcthompson, and Jorg.Predicting a Biological Response. https://kagg le.com/competitions/bioresponse. Kaggle. 2012 (cit. on p. 34)

2012
[61]

Excited-state quantum phase transitions in the anharmonic Lipkin-Meshkov-Glick model: Static aspects

J. Gamito, J. Khalouf-Rivera, et al. “Excited-state quantum phase transitions in the anharmonic Lipkin-Meshkov-Glick model: Static aspects”. In:Phys. Rev. E 106 (4 Oct. 2022), p. 044125.doi: 10.1103/PhysRevE.106.044125.url: https: //link.aps.org/doi/10.1103/PhysRevE.106.044125...

2022 doi
[62]

Parametric matrix models

Patrick Cook, Danny Jammooa, et al. “Parametric matrix models”. In:Nature Com- munications16.1 (July 2025), p. 5929.issn: 2041-1723.doi: 10.1038/s41467-025- 61362-4.url: https://doi.org/10.1038/s41467-025-61362-4 (cit. on pp. 34, 70, 73, 74, 80, 85, 86, 118–120). 170

2025 doi
[63]

Dynamic mode decomposition of numerical and experimental data

Peter J. Schmid. “Dynamic mode decomposition of numerical and experimental data”. In:Journal of Fluid Mechanics656 (2010), pp. 5–28.doi: 10.1017/S0022112010001 217 (cit. on p. 41)

2010 doi
[64]

Dynamic mode decomposition: Theory and applications

Jonathan H. Tu. “Dynamic mode decomposition: Theory and applications”. PhD thesis. Princeton University, 2013 (cit. on p. 41)

2013
[65]

Parametric dynamic mode decompo- sition for reduced order modeling

Quincy A. Huhn, Mauricio E. Tano, et al. “Parametric dynamic mode decompo- sition for reduced order modeling”. In:Journal of Computational Physics475 (2023), p. 111852.issn: 0021-9991.doi: 10.1016/j.jcp.2022.111852.url: https://doi.org/10.1016/j.jcp.2022.111852 (cit. on pp. 41...

2023
[66]

A Dynamic Mode Decom- position Extension for the Forecasting of Parametric Dynamical Systems

Francesco Andreuzzi, Nicola Demo, and Gianluigi Rozza. “A Dynamic Mode Decom- position Extension for the Forecasting of Parametric Dynamical Systems”. In:SIAM Journal on Applied Dynamical Systems22.3 (Aug. 2023), pp. 2432–2458.issn: 1536- 0040.doi: 10.1137/22m1481658.url: http...

2023 doi
[67]

Discovering governing equations from data by sparse identification of nonlinear dynamical systems

Steven L. Brunton, Joshua L. Proctor, and J. Nathan Kutz. “Discovering governing equations from data by sparse identification of nonlinear dynamical systems”. In: Proceedings of the National Academy of Sciences113.15 (2016), pp. 3932–3937.doi: 10.1073/pnas.1517384113. eprint: ...

2016 doi
[68]

Brunton and J

Steven L. Brunton and J. Nathan Kutz.Data-Driven Science and Engineering: Ma- chine Learning, Dynamical Systems, and Control. 2nd ed. Cambridge University Press, 2022 (cit. on p. 42)

2022
[69]

Data-driven discovery of coordinates and governing equations

Kathleen Champion, Bethany Lusch, et al. “Data-driven discovery of coordinates and governing equations”. In:Proceedings of the National Academy of Sciences116.45 (2019), pp. 22445–22451.doi: 10.1073/pnas.1906995116. eprint: https://www.pnas .org/doi/pdf/10.1073/pnas.1906995116...

2019 doi
[70]

SINDy-RL for interpretable and effi- cient model-based reinforcement learning

Nicholas Zolman, Christian Lagemann, et al. “SINDy-RL for interpretable and effi- cient model-based reinforcement learning”. In:Nature Communications16.1 (Nov. 2025), p. 10714.issn: 2041-1723.doi: 10.1038/s41467-025-65738-4.url: https://doi.org/10.1038/s41467-025-65738-4 (cit....

2025 doi
[71]

ADAM-SINDy: An efficient optimization frame- work for parameterized nonlinear dynamical system identification

Siva Viknesh, Younes Tatari, et al. “ADAM-SINDy: An efficient optimization frame- work for parameterized nonlinear dynamical system identification”. In:Phys. Rev. Res.8 (1 Jan. 2026), p. 013040.doi: 10.1103/dwkk-5g2h.url: https: //link.aps.org/doi/10.1103/dwkk-5g2h (cit. on p. 43)

2026 doi
[72]

A tutorial on data-driven eigenvalue identification: Prony analysis, matrix pencil, and eigensystem realization algorithm

Anas Almunif, Lingling Fan, and Zhixin Miao. “A tutorial on data-driven eigenvalue identification: Prony analysis, matrix pencil, and eigensystem realization algorithm”. In:International Transactions on Electrical Energy Systems30.4 (2020). e12283 2050-7038.12283, e12283.doi: ...

2020
[73]

Aneigensystemrealizationalgorithmformodalparam- eter identification and model reduction

J.-N.JuangandR.S.Pappa. “Aneigensystemrealizationalgorithmformodalparam- eter identification and model reduction”. In:Journal of Guidance Control Dynamics 8.5 (Sept. 1985), pp. 620–627.doi: 10.2514/3.20031 (cit. on p. 43)

1985 doi
[74]

Ergodic Theory, Dynamic Mode Decomposition, and Computation of Spectral Properties of the Koopman Operator

Hassan Arbabi and Igor Mezić. “Ergodic Theory, Dynamic Mode Decomposition, and Computation of Spectral Properties of the Koopman Operator”. In:SIAM Journal on Applied Dynamical Systems16.4 (2017), pp. 2096–2126.doi: 10.1137/17M1125236. eprint: https://doi.org/10.1137/17M112523...

2017 doi
[75]

Detecting strange attractors in turbulence

Floris Takens. “Detecting strange attractors in turbulence”. In:Dynamical Systems and Turbulence, Warwick 1980. Ed. by David Rand and Lai-Sang Young. Berlin, Heidelberg: Springer Berlin Heidelberg, 1981, pp. 366–381.isbn: 978-3-540-38945-3 (cit. on p. 43)

1980
[76]

PyDMD: A Python Package for Robust Dynamic Mode Decomposition

Sara M. Ichinaga, Francesco Andreuzzi, et al. “PyDMD: A Python Package for Robust Dynamic Mode Decomposition”. In:Journal of Machine Learning Research25.417 (2024), pp. 1–9.url: http://jmlr.org/papers/v25/24-0739.html (cit. on p. 43)

2024
[77]

Patrick Cook.Tractable a priori Dimensionality Reduction for Quantum Dynamics
[78]

Nineteen Dubious Ways to Compute the Expo- nential of a Matrix, Twenty-Five Years Later

Cleve Moler and Charles Van Loan. “Nineteen Dubious Ways to Compute the Expo- nential of a Matrix, Twenty-Five Years Later”. In:SIAM Review45.1 (2003), pp. 3– 49.doi: 10.1137/S00361445024180. eprint: https://doi.org/10.1137/S00361445024 180.url: https://doi.org/10.1137/S003614...

2003 doi
[79]

Wilde.Quantum Information Theory

Mark M. Wilde.Quantum Information Theory. Cambridge University Press, Nov. 2016.isbn: 9781316809976.doi: 10.1017/9781316809976.url: http://dx.doi.org /10.1017/9781316809976 (cit. on p. 50). 172

2016 doi
[80]

R. B. Lehoucq, D. C. Sorensen, and C. Yang.ARPACK Users’ Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. Software, Environments, and Tools. Society for Industrial and Applied Mathematics, 1998. isbn: 9780898714074.url: https://book...

1998
[81]

A Jacobi-Davidson iteration method for linear eigenvalue problems

Gerard L. G. Sleijpen and Henk A. Van der Vorst. “A Jacobi-Davidson iteration method for linear eigenvalue problems”. In:SIAM Review42.2 (2000), pp. 267–293. issn: 0036-1445 (cit. on p. 50)

2000
[82]

The Jacobi-Davidson algorithm for solving large sparse symmetric eigenvalue problems with application to the design of accelerator cavities

Roman Geus. “The Jacobi-Davidson algorithm for solving large sparse symmetric eigenvalue problems with application to the design of accelerator cavities”. Diss., Technische Wissenschaften ETH Zürich, Nr. 14734, 2002. Doctoral Thesis. Zürich: ETH Zürich, 2002.doi: 10.3929/ethz-...

2002 doi
[83]

Targeting specific eigenvectors and eigenvalues of a given Hamiltonian using arbitrary selection criteria

Alan R. Tackett and Massimiliano Di Ventra. “Targeting specific eigenvectors and eigenvalues of a given Hamiltonian using arbitrary selection criteria”. In:Phys. Rev. B66 (24 Dec. 2002), p. 245104.doi: 10.1103/PhysRevB.66.245104.url: https: //link.aps.org/doi/10.1103/PhysRevB....

2002 doi
[84]

Eigenvector Continuation with Subspace Learn- ing

Dillon Frame, Rongzheng He, et al. “Eigenvector Continuation with Subspace Learn- ing”. In:Phys. Rev. Lett.121 (3 July 2018), p. 032501.doi: 10.1103/PhysRevLett. 121.032501.url: https://link.aps.org/doi/10.1103/PhysRevLett.121.032501 (cit. on pp. 56, 57)

2018 doi
[85]

Convergence of Eigenvector Continuation

Avik Sarkar and Dean Lee. “Convergence of Eigenvector Continuation”. In:Phys. Rev. Lett.126 (3 Jan. 2021), p. 032501.doi: 10.1103/PhysRevLett.126.032501. url: https://link.aps.org/doi/10.1103/PhysRevLett.126.032501 (cit. on pp. 56, 57)

2021 doi
[86]

Eigenvector continuation as an efficient and accurate emulator for uncertainty quantification

S. König, A. Ekström, et al. “Eigenvector continuation as an efficient and accurate emulator for uncertainty quantification”. In:Physics Letters B810 (2020), p. 135814. issn: 0370-2693.doi: 10.1016/j.physletb.2020.135814.url: https://doi.org/10.101 6/j.physletb.2020.135814 (ci...

2020
[87]

Improvedmany-bodyexpansionsfromeigenvectorcontin- uation

P.Demol, T.Duguet, etal.“Improvedmany-bodyexpansionsfromeigenvectorcontin- uation”. In:Physical Review C101.4(Apr.2020).doi: 10.1103/physrevc.101.041302. url: https://doi.org/10.1103%2Fphysrevc.101.041302 (cit. on pp. 56, 57)

2020 doi
[88]

Efficient emulators for scattering using eigen- vector continuation

R. J. Furnstahl, A. J. Garcia, et al. “Efficient emulators for scattering using eigen- vector continuation”. In:Physics Letters B809 (2020), p. 135719.issn: 0370-2693. doi: 10.1016/j.physletb.2020.135719.url: https://doi.org/10.1016/j.physletb.2020. 135719 (cit. on pp. 56, 57). 173

2020
[89]

Toward emulating nuclear reactions using eigen- vector continuation

C. Drischler, M. Quinonez, et al. “Toward emulating nuclear reactions using eigen- vector continuation”. In:Physics Letters B823 (2021), p. 136777.issn: 0370-2693. doi: 10.1016/j.physletb.2021.136777.url: https://doi.org/10.1016/j.physletb.2021. 136777 (cit. on pp. 56, 57, 139)

2021
[90]

Generalizing the calculableR-matrix theory and eigenvector continuation to the incoming-wave boundary condition

Dong Bai and Zhongzhou Ren. “Generalizing the calculableR-matrix theory and eigenvector continuation to the incoming-wave boundary condition”. In:Phys. Rev. C103 (1 Jan. 2021), p. 014612.doi: 10.1103/PhysRevC.103.014612.url: https: //link.aps.org/doi/10.1103/PhysRevC.103.01461...

2021 doi
[91]

Convergence of Eigenvector Continuation

Avik Sarkar and Dean Lee. “Convergence of Eigenvector Continuation”. In:Phys. Rev. Lett.126.3 (2021), p. 032501.doi: 10.1103/PhysRevLett.126.032501. arXiv: 2004.07651 [nucl-th] (cit. on pp. 56, 57)

2021 arXiv
[92]

Excited states from eigenvector continuation: Theanharmonicoscillator

M. Companys Franzke, Alexander Tichai, et al. “Excited states from eigenvector continuation: Theanharmonicoscillator”. In:Physics Letters B830(2022), p.137101 (cit. on pp. 56, 57)

2022
[93]

Eigenvector Continuation: Convergence and Emulators

Avik Sarkar. “Eigenvector Continuation: Convergence and Emulators”. PhD thesis. Michigan State University, 2022.doi: 10.25335/94pa-7819.url: https://doi.org/ doi:10.25335/94pa-7819 (cit. on pp. 56, 57)

2022 doi
[94]

ab initiosimulations of light nuclear systems using eigenvector continuationandauxiliaryfieldMonteCarlo

Dillon Kyle Frame. “ab initiosimulations of light nuclear systems using eigenvector continuationandauxiliaryfieldMonteCarlo”. PhDthesis. MichiganStateUniversity, 2019.doi: 10.25335/dprp-bx55.url: https://doi.org/doi:10.25335/dprp-bx55 (cit. on pp. 56, 57)

2019 doi
[95]

Training and projecting: A reduced basis method emulator for many-body physics

Edgard Bonilla, Pablo Giuliani, et al. “Training and projecting: A reduced basis method emulator for many-body physics”. In:Phys. Rev. C106 (5 Nov. 2022), p. 054322.doi: 10.1103/PhysRevC.106.054322.url: https://link.aps.org/doi/10. 1103/PhysRevC.106.054322 (cit. on p. 56)

2022 doi
[96]

Constructing approximate shell-model wave- functions by eigenvector continuation

Sota Yoshida and Noritaka Shimizu. “Constructing approximate shell-model wave- functions by eigenvector continuation”. In:Progress of Theoretical and Experimental Physics2022.5 (Apr. 2022), p. 053D02.issn: 2050-3911.doi: 10.1093/ptep/ptac057. eprint: https://academic.oup.com/p...

2022 doi
[97]

Volume extrapolation via eigenvector continua- tion

Nuwan Yapa and Sebastian König. “Volume extrapolation via eigenvector continua- tion”. In:Phys. Rev. C106 (1 July 2022), p. 014309.doi: 10.1103/PhysRevC.106.0 14309.url: https://link.aps.org/doi/10.1103/PhysRevC.106.014309 (cit. on p. 57). 174

2022 doi
[98]

Eigenvector continuation for emulating and extrapolating two-body resonances

Nuwan Yapa, Kévin Fossez, and Sebastian König. “Eigenvector continuation for emulating and extrapolating two-body resonances”. In:Phys. Rev. C107 (6 June 2023), p. 064316.doi: 10.1103/PhysRevC.107.064316.url: https://link.aps.org/d oi/10.1103/PhysRevC.107.064316 (cit. on p. 57)

2023 doi
[99]

Rigorous constraints on three-nucleon forces in chi- ral effective field theory from fast and accurate calculations of few-body observables

S. Wesolowski, I. Svensson, et al. “Rigorous constraints on three-nucleon forces in chi- ral effective field theory from fast and accurate calculations of few-body observables”. In:Phys. Rev. C104 (6 Dec. 2021), p. 064001.doi: 10.1103/PhysRevC.104.064001. url: https://link.aps...

2021 doi
[100]

Fast emulation of quantum three-body scattering

Xilin Zhang and R. J. Furnstahl. “Fast emulation of quantum three-body scattering”. In:Phys. Rev. C105 (6 June 2022), p. 064004.doi: 10.1103/PhysRevC.105.064004. url: https://link.aps.org/doi/10.1103/PhysRevC.105.064004 (cit. on p. 57)

2022 doi
[101]

Bayesian predictions forA= 6nuclei using eigenvector continuation emulators

T. Djärv, A. Ekström, et al. “Bayesian predictions forA= 6nuclei using eigenvector continuation emulators”. In:Phys. Rev. C105 (1 Jan. 2022), p. 014005.doi: 10.1103/PhysRevC.105.014005.url: https://link.aps.org/doi/10.1103/PhysRevC. 105.014005 (cit. on pp. 57, 61)

2022 doi
[102]

Carl Edward Rasmussen and Christopher K. I. Williams.Gaussian Processes for Machine Learning. The MIT Press, Nov. 2005.isbn: 9780262256834.doi: 10.755 1/mitpress/3206.001.0001. eprint: https://direct.mit.edu/book-pdf/2514321/book _9780262256834.pdf.url: https://doi.org/10.7551...

2005
[103]

Kernel methods in machine learning

Thomas Hofmann, Bernhard Schölkopf, and Alexander J. Smola. “Kernel methods in machine learning”. In:The Annals of Statistics36.3 (June 2008), pp. 1171–1220.doi: 10.1214/009053607000000677.url: https://doi.org/10.1214/009053607000000677 (cit. on p. 62)

2008 doi
[104]

Barber.Bayesian Reasoning and Machine Learning

D. Barber.Bayesian Reasoning and Machine Learning. Cambridge University Press, 2012 (cit. on p. 62)

2012
[105]

Thomas Beckers.An Introduction to Gaussian Process Models. 2021. arXiv: 2102.0 5497 [eess.SY].url: https://arxiv.org/abs/2102.05497 (cit. on p. 62)

2021 arXiv
[106]

How Well Do We Know the Neutron-Matter Equation of State at the Densities Inside Neutron Stars? A Bayesian Approach with Correlated Uncertainties

C. Drischler, R. J. Furnstahl, et al. “How Well Do We Know the Neutron-Matter Equation of State at the Densities Inside Neutron Stars? A Bayesian Approach with Correlated Uncertainties”. In:Phys. Rev. Lett.125 (20 Nov. 2020), p. 202702.doi: 10.1103/PhysRevLett.125.202702.url: ...

2020 doi
[107]

From chiral effective field theory to perturbative QCD: A Bayesian model mixing approach to symmetric nuclear matter

A. C. Semposki, C. Drischler, et al. “From chiral effective field theory to perturbative QCD: A Bayesian model mixing approach to symmetric nuclear matter”. In:Phys. Rev. C111 (3 Mar. 2025), p. 035804.doi: 10.1103/PhysRevC.111.035804.url: https://link.aps.org/doi/10.1103/PhysR...

2025 doi
[108]

Assessing correlated truncation errors in modern nucleon-nucleon potentials

P. J. Millican, R. J. Furnstahl, et al. “Assessing correlated truncation errors in modern nucleon-nucleon potentials”. In:Phys. Rev. C110 (4 Oct. 2024), p. 044002.doi: 10.1103/PhysRevC.110.044002.url: https://link.aps.org/doi/10.1103/PhysRevC. 110.044002 (cit. on p. 62)

2024 doi
[109]

P. J. Millican, R. J. Furnstahl, et al.Assessing Convergence Patterns Across Modern Nucleon-Nucleon Potentials. 2025. arXiv: 2508.17558 [nucl-th].url: https://arxiv. org/abs/2508.17558 (cit. on p. 62)

2025 arXiv
[110]

Interpolating between small- and large-gexpansions using Bayesian model mixing

A. C. Semposki, R. J. Furnstahl, and D. R. Phillips. “Interpolating between small- and large-gexpansions using Bayesian model mixing”. In:Phys. Rev. C106 (4 Oct. 2022), p. 044002.doi: 10.1103/PhysRevC.106.044002.url: https://link.aps.org/d oi/10.1103/PhysRevC.106.044002 (cit. ...

2022 doi
[111]

Colloquium: Machine learning in nuclear physics

Amber Boehnlein, Markus Diefenthaler, et al. “Colloquium: Machine learning in nuclear physics”. In:Rev. Mod. Phys.94 (3 Sept. 2022), p. 031003.doi: 10.1103/ RevModPhys.94.031003.url: https://link.aps.org/doi/10.1103/RevModPhys.94.0 31003 (cit. on p. 62)

2022 doi
[112]

Motonobu Kanagawa, Philipp Hennig, et al.Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences. 2018. arXiv: 1807.02582 [stat.ML].url: https://arxiv.org/abs/1807.02582 (cit. on p. 62)

2018 arXiv
[113]

Exact Inference for Gaussian Process Regression in case of Big Data with the Cartesian Product Struc- ture

Mikhail Belyaev, Evgeny V. Burnaev, and Yermek Kapushev. “Exact Inference for Gaussian Process Regression in case of Big Data with the Cartesian Product Struc- ture”. In:arXiv: Methodology(2014).url: https://api.semanticscholar.org/Corpus ID:88512895 (cit. on p. 63)

2014
[114]

Decomposed Gaussian Processes for Efficient Regression Models with Low Complexity

Anis Fradi, Tien-Tam Tran, and Chafik Samir. “Decomposed Gaussian Processes for Efficient Regression Models with Low Complexity”. In:Entropy27.4 (2025). issn: 1099-4300.doi: 10.3390/e27040393.url: https://www.mdpi.com/1099- 4300/27/4/393 (cit. on p. 63)

2025 doi
[115]

Géron.Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow

A. Géron.Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow. 3rd ed. O’Reilly Media, 2022.isbn: 9781098122461.url: https://books.google.com /books?id=X5ySEAAAQBAJ (cit. on pp. 63, 95, 96, 99, 100, 120). 176

2022
[116]

Lipton, et al.Dive into Deep Learning

Aston Zhang, Zachary C. Lipton, et al.Dive into Deep Learning. https://D2L.ai. Cambridge University Press, 2023 (cit. on pp. 63, 91–95, 99, 100, 120)

2023
[117]

Physics-informed machine learning

George Em Karniadakis, Ioannis G. Kevrekidis, et al. “Physics-informed machine learning”. In:Nature Reviews Physics3.6 (June 2021), pp. 422–440.issn: 2522- 5820.doi: 10.1038/s42254-021-00314-5.url: https://doi.org/10.1038/s42254-021- 00314-5 (cit. on pp. 64, 77)

2021 doi
[118]

A hands-on introduction to physics-informed neural networks for solv- ing partial differential equations with benchmark tests taken from astrophysics and plasma physics

Hubert Baty. “A hands-on introduction to physics-informed neural networks for solv- ing partial differential equations with benchmark tests taken from astrophysics and plasma physics”. In:arXiv preprint arXiv:2403.00599(2024) (cit. on p. 64)

2024 arXiv
[119]

PINNacle: Acomprehensivebenchmarkofphysics- informed neural networks for solving pdes

ZhongkaiHao, JiachenYao, etal.“PINNacle: Acomprehensivebenchmarkofphysics- informed neural networks for solving pdes”. In:Advances in Neural Information Processing Systems37 (2024), pp. 76721–76774 (cit. on p. 66)

2024
[120]

Can physics-informed neu- ral networks beat the finite element method?

Tamara G. Grossmann, Urszula Julia Komorowska, et al. “Can physics-informed neu- ral networks beat the finite element method?” In:IMA Journal of Applied Mathemat- ics89.1 (Jan. 2024), pp. 143–174.issn: 0272-4960.doi: 10.1093/imamat/hxae011. eprint: https://academic.oup.com/ima...

2024 doi
[121]

Weak baselines and reporting biases lead to overoptimism in machine learning for fluid-related partial differential equations

Nick McGreivy and Ammar Hakim. “Weak baselines and reporting biases lead to overoptimism in machine learning for fluid-related partial differential equations”. In: Nature Machine Intelligence6.10 (Oct. 2024), pp. 1256–1269.issn: 2522-5839.doi: 10.1038/s42256-024-00897-5.url: h...

2024 doi
[122]

Lattice Boltzmann Method For Fluid Flows

Shiyi Chen and Gary D. Doolen. “Lattice Boltzmann Method For Fluid Flows”. In: Annual Review of Fluid Mechanics30 (1998), pp. 329–364.issn: 1545-4479.doi: https://doi.org/10.1146/annurev.fluid.30.1.329.url: https://www.annualreviews.or g/content/journals/10.1146/annurev.fluid....

1998 doi
[123]

Data-Driven Model Re- duction via Non-intrusive Optimization of Projection Operators and Reduced-Order Dynamics

Alberto Padovan, Blaine Vollmer, and Daniel J. Bodony. “Data-Driven Model Re- duction via Non-intrusive Optimization of Projection Operators and Reduced-Order Dynamics”. In:SIAM Journal on Applied Dynamical Systems23.4 (2024), pp. 3052– 3076.doi: 10.1137/24M1628414. eprint: ht...

2024 doi
[124]

From Data to Reduced-Order Models via Generalized Balanced Truncation

Azka Muji Burohman, Bart Besselink, et al. “From Data to Reduced-Order Models via Generalized Balanced Truncation”. In:IEEE Transactions on Automatic Control 68.10 (2023), pp. 6160–6175.doi: 10.1109/TAC.2023.3238856 (cit. on pp. 77, 78). 177

2023
[125]

Data-Driven Extraction of Uni- formly Stable and Passive Parameterized Macromodels

Tommaso Bradde, Stefano Grivet-Talocia, et al. “Data-Driven Extraction of Uni- formly Stable and Passive Parameterized Macromodels”. In:IEEE Access10 (2022), pp. 15786–15804.doi: 10.1109/ACCESS.2022.3147034 (cit. on p. 77)

2022
[126]

C. K. Sanathanan and J. Koerner.Transfer Function Synthesis as a Ratio of Two Complex Polynomials. Tech. rep. Argonne National Lab., Ill., May 1963.doi: 10.2 172/4690788.url: https://www.osti.gov/biblio/4690788 (cit. on p. 77)

1963
[127]

Data-Driven Identi- fication of Nonlinear Power System Dynamics Using Output-Only Measurements

Pranav Sharma, Venkataramana Ajjarapu, and Umesh Vaidya. “Data-Driven Identi- fication of Nonlinear Power System Dynamics Using Output-Only Measurements”. In:IEEE Transactions on Power Systems37.5 (2022), pp. 3458–3468.doi: 10.1109/TPWRS.2021.3131639 (cit. on p. 77)

2022
[128]

Computational Nuclear Physics and Post Hartree-Fock Methods

Justin G. Lietz, Samuel Novario, et al. “Computational Nuclear Physics and Post Hartree-Fock Methods”. In:An Advanced Course in Computational Nuclear Physics: Bridging the Scales from Quarks to Neutron Stars. Ed. by Morten Hjorth-Jensen, Maria Paola Lombardo, and Ubirajara van...

2017 doi
[129]

Nuclear Fission and Tunneling Phenomena

Eric Douglas Flynn. “Nuclear Fission and Tunneling Phenomena”. PhD thesis. Michigan State University, 2025.doi: 10.25335/pdnw-zq48.url: https: //doi.org/10.25335/pdnw-zq48 (cit. on p. 82)

2025 doi
[130]

C. J. Foot.Atomic Physics. Oxford Master Series in Physics. OUP Oxford, 2005. isbn: 9780198506959.url: https://books.google.com/books?id=kXYpAQAAMA AJ (cit. on p. 82)

2005
[131]

Multivariate fitting and the error matrix in global analysis of data

J. Pumplin, D. R. Stump, and W. K. Tung. “Multivariate fitting and the error matrix in global analysis of data”. In:Phys. Rev. D65 (1 Dec. 2001), p. 014011. doi: 10.1103/PhysRevD.65.014011.url: https://link.aps.org/doi/10.1103/PhysR evD.65.014011 (cit. on p. 87)

2001 doi
[132]

Identifying and attacking the saddle point problem in high-dimensional non-convex optimization

Yann N. Dauphin, Razvan Pascanu, et al. “Identifying and attacking the saddle point problem in high-dimensional non-convex optimization”. In:Advances in Neural In- formation Processing Systems. Ed. by Z. Ghahramani, M. Welling, et al. Vol. 27. Curran Associates, Inc., 2014.url...

2014
[133]

Zur formalen Theorie der Funktionen von mehr komplexen Veränder- lichen

W. Wirtinger. “Zur formalen Theorie der Funktionen von mehr komplexen Veränder- lichen”. In:Mathematische Annalen97.1 (Dec. 1927), pp. 357–375.issn: 1432-1807. doi: 10.1007/BF01447872.url: https://doi.org/10.1007/BF01447872 (cit. on p. 90)

1927 doi
[134]

Christoph Boeddeker, Patrick Hanebrink, et al.On the Computation of Complex- valued Gradients with Application to Statistically Optimum Beamforming. 2019. arXiv: 1701.00392 [math.NA].url: https://arxiv.org/abs/1701.00392 (cit. on pp. 90, 94)

2019 arXiv
[135]

Hirose.Complex-Valued Neural Networks: Advances and Applications

A. Hirose.Complex-Valued Neural Networks: Advances and Applications. IEEE Press Series on Computational Intelligence. Wiley, 2013.isbn: 9781118590065. url: https://books.google.com/books?id=B2_bucoS5VAC (cit. on p. 91)

2013
[136]

Version 0.9.0+

James Bradbury, Roy Frostig, et al.JAX: composable transformations of Python+NumPy programs. Version 0.9.0+. 2018.url: http://github.com/jax- ml/jax (cit. on pp. 91, 93, 94, 163)

2018
[137]

PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation

Jason Ansel, Edward Yang, et al. “PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation”. In:29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 (ASPLOS ’24). ACM...

2024 doi
[138]

Software available from tensorflow.org

Martín Abadi, Ashish Agarwal, et al.TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems. Software available from tensorflow.org. 2015.url: https: //www.tensorflow.org/ (cit. on pp. 91, 93, 94)

2015
[139]

The MIT Press, Cambridge, Massachusetts, 2016.url: https://www.deeplearningbook.org/ (cit

Ian Goodfellow, Yoshua Bengio, and Aaron Courville.Deep Learning. The MIT Press, Cambridge, Massachusetts, 2016.url: https://www.deeplearningbook.org/ (cit. on pp. 91, 95, 99, 120, 156, 157)

2016
[140]

Kingma and Jimmy Ba.Adam: A Method for Stochastic Optimization

Diederik P. Kingma and Jimmy Ba.Adam: A Method for Stochastic Optimization. Preprint at https://arxiv.org/abs/1412.6980. 2017.url: https://arxiv.org/abs/14 12.6980 (cit. on p. 91)

2017 arXiv
[141]

Learning repre- sentationsbyback-propagatingerrors

David E. Rumelhart, Geoffrey E. Hinton, and Ronald J. Williams. “Learning repre- sentationsbyback-propagatingerrors”. In:Nature323.6088(Oct.1986), pp.533–536. issn: 1476-4687.doi: 10.1038/323533a0.url: https://doi.org/10.1038/323533a0 (cit. on p. 93). 179

1986 doi
[142]

Automatic Differentiation in Machine Learning: a Survey

Atilim Gunes Baydin, Barak A. Pearlmutter, et al. “Automatic Differentiation in Machine Learning: a Survey”. In:Journal of Machine Learning Research18.153 (2018), pp. 1–43.url: http://jmlr.org/papers/v18/17-468.html (cit. on p. 93)

2018
[143]

Learning long-term dependencies with gra- dient descent is difficult

Y. Bengio, P. Simard, and P. Frasconi. “Learning long-term dependencies with gra- dient descent is difficult”. In:IEEE Transactions on Neural Networks5.2 (1994), pp. 157–166.doi: 10.1109/72.279181 (cit. on p. 94)

1994 doi
[144]

Razvan Pascanu, Tomas Mikolov, and Yoshua Bengio.On the difficulty of training Recurrent Neural Networks. 2013. arXiv: 1211.5063 [cs.LG].url: https://arxiv.or g/abs/1211.5063 (cit. on p. 94)

2013 arXiv
[145]

Das Verhalten von Atomen im magnetischen Drehfeld

P. Güttinger. “Das Verhalten von Atomen im magnetischen Drehfeld”. German. In:Zeitschrift für Physik73.3 (Mar. 1932), pp. 169–184.issn: 1434-601X.doi: 10.1007/BF01351211.url: https://doi.org/10.1007/BF01351211 (cit. on p. 94)

1932 doi
[146]

https://github.com/EmilHvitfeldt/featu re-engineering-az

Emil Hvitfeldt.Feature Engineering A–Z. https://github.com/EmilHvitfeldt/featu re-engineering-az. 2024.url: https://feaz-book.com/ (cit. on p. 96)

2024
[147]

V. Vovk, A. Gammerman, and G. Shafer.Algorithmic Learning in a Random World. Springer US, 2005.isbn: 9780387001524.url: https://books.google.com/books?i d=pEXc4C1ymakC (cit. on pp. 98, 158)

2005
[148]

Conformal Prediction: A Gentle Introduction

Anastasios N. Angelopoulos and Stephen Bates. “Conformal Prediction: A Gentle Introduction”. In:Foundations and Trends in Machine Learning16.4 (Mar. 2023), pp. 494–591.issn: 1935-8237.doi: 10.1561/2200000101.url: https://doi.org/10.1 561/2200000101 (cit. on pp. 98, 158, 159)

2023 doi
[149]

Mario Lezcano-Casado and David Martínez-Rubio.Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Group
[150]

Hand-waving and interpretive dance: An introductory course on tensor networks

Jacob C. Bridgeman and Christopher T. Chubb. “Hand-waving and interpretive dance: An introductory course on tensor networks”. In:Journal of Physics A: Mathematical and Theoretical50.22 (May 2017), p. 223001.doi: 10.1088/1751- 8121/aa6dc3.url: https://doi.org/10.1088/1751-8121/...

2017 doi
[151]

Lang.Algebra

S. Lang.Algebra. Graduate Texts in Mathematics. Springer New York, 2005.isbn: 9780387953854.url: https://books.google.com/books?id=Fge-BwqhqIYC (cit. on p. 111). 180

2005
[152]

L. D. Landau and E. M. Lifshitz.Quantum Mechanics: Non-Relativistic Theory. Course of theoretical physics. Butterworth-Heinemann, 1991.isbn: 9780750635394 (cit. on p. 115)

1991
[153]

Self-consistent mean-field models for nuclear structure

Michael Bender, Paul-Henri Heenen, and Paul-Gerhard Reinhard. “Self-consistent mean-field models for nuclear structure”. In:Rev. Mod. Phys.75 (1 Jan. 2003), pp. 121–180.doi: 10.1103/RevModPhys.75.121.url: https://link.aps.org/doi/10. 1103/RevModPhys.75.121 (cit. on pp. 121, 122)

2003 doi
[154]

Dobaczewski, A

J. Dobaczewski, A. Idini, et al.TALENT Course: Density functional theory and self- consistent methods. https://www.fuw.edu.pl/~dobaczew/TALENT_DFT_2016/ma in.pdf. TALENT Course https://fribtheoryalliance.org/TALENT/courses/course_0 4.php. Aug. 2016 (cit. on pp. 121, 122)

2016
[155]

Nicolas Schunck, ed.Energy Density Functional Methods for Atomic Nuclei. 2053-
[156]

Time-dependent density functional the- ory

Aurel Bulgac and Michael McNeil Forbes. “Time-dependent density functional the- ory”. In:Energy Density Functional Methods for Atomic Nuclei. Ed. by Nicolas Schunck. 2053-2563. IOP Publishing, 2019, 4-1 to 4–34.isbn: 978-0-7503-1422- 0.doi: 10.1088/2053-2563/aae0edch4.url: htt...

2019 doi
[157]

The LISE package: Solvers for static and time- dependent superfluid local density approximation equations in three dimensions

Shi Jin, Kenneth J. Roche, et al. “The LISE package: Solvers for static and time- dependent superfluid local density approximation equations in three dimensions”. In: Computer Physics Communications269 (2021), p. 108130.issn: 0010-4655.doi: https://doi.org/10.1016/j.cpc.2021.1...

2021
[158]

Induced Fission of 240Puwithin a Real-Time Microscopic Framework

Aurel Bulgac, Piotr Magierski, et al. “Induced Fission of 240Puwithin a Real-Time Microscopic Framework”. In:Phys. Rev. Lett.116 (12 Mar. 2016), p. 122504.doi: 10.1103/PhysRevLett.116.122504.url: https://link.aps.org/doi/10.1103/PhysRev Lett.116.122504 (cit. on p. 129)

2016 doi
[159]

Antonio Bjelčić, Ibrahim Abdurrahman, and Kyle Godbey.Angular and Kinetic Properties of Scission Neutrons within Time-dependent Density Functional Theory
[160]

Structure of a quantized vortex in boson systems

E. P. Gross. “Structure of a quantized vortex in boson systems”. In:Nuovo Cimento 20 (1961), pp. 454–477.doi: 10.1007/BF02731494.url: https://cds.cern.ch/record /343403 (cit. on p. 131). 181

1961 doi
[161]

Vortex lines in an imperfect Bose gas

L. P. Pitaevskii. “Vortex lines in an imperfect Bose gas”. In:Sov. Phys. JETP13 (2 1961). Translated from Zh. Eksp. Teor. Fiz. 40, 646 (1961), pp. 451–454.url: https://www.jetp.ras.ru/cgi-bin/e/index/e/13/2/p451?a=list (cit. on p. 131)

1961
[162]

Patrick Cook, Kang Yu, et al.PMM–IMSRG emulator for the nuclear equation of state with quantified uncertainties. 2026. arXiv: 2607.19773 [nucl-th].url: https: //arxiv.org/abs/2607.19773 (cit. on pp. 139, 140, 150, 152, 153)

2026 arXiv
[163]

Dense nuclear matter equation of state from heavy-ion collisions

Agnieszka Sorensen et al. “Dense nuclear matter equation of state from heavy-ion collisions”. In:Prog. Part. Nucl. Phys.134 (2024), p. 104080.doi: 10.1016/j.ppnp .2023.104080. arXiv: 2301.13253 (cit. on p. 139)

2024
[164]

Theoretical and experimental constraints for the equation of state of dense and hot matter

Rajesh Kumar, Veronica Dexheimer, et al. “Theoretical and experimental constraints for the equation of state of dense and hot matter”. In:Living Reviews in Relativity 27.1 (June 2024).issn: 1433-8351.doi: 10.1007/s41114-024-00049-6.url: http://dx.doi.org/10.1007/s41114-024-000...

2024 doi
[165]

Neutron stars and the dense matter equation of state

Katerina Chatziioannou, H. Thankful Cromartie, et al. “Neutron stars and the dense matter equation of state”. In:Rev. Mod. Phys.97.4 (2025), p. 045007.doi: 10.110 3/ymsq-cfcw. arXiv: 2407.11153 (cit. on p. 139)

2025
[166]

Toward a unified understanding of the dense- matter equation of state

Kshitij Agarwal, Johannes Jahan, et al. “Toward a unified understanding of the dense- matter equation of state”. In:The European Physical Journal Special Topics(June 2026).issn: 1951-6401.doi: 10.1140/epjs/s11734-026-02414-8.url: http: //dx.doi.org/10.1140/epjs/s11734-026-0241...

2026 doi
[167]

Extending the In-Medium Similarity Renormalization Group to Nuclear Matter with Novel Insights on Unitary Coupled-Cluster Theory

Omokuyani Chibuzor Udiani. “Extending the In-Medium Similarity Renormalization Group to Nuclear Matter with Novel Insights on Unitary Coupled-Cluster Theory”. PhD thesis. East Lansing, MI: Michigan State University, 2025.url: https://d.lib. msu.edu/etd/52303 (cit. on pp. 139, 141)

2025
[168]

Chiral interactions up to next-to-next- to-next-to-leading order and nuclear saturation

C. Drischler, K. Hebeler, and A. Schwenk. “Chiral interactions up to next-to-next- to-next-to-leading order and nuclear saturation”. In:Phys. Rev. Lett.122.4 (2019), p. 042501.doi: 10.1103/PhysRevLett.122.042501. arXiv: 1710.08220 (cit. on p. 140)

2019 arXiv
[169]

High-quality two-nucleon potentials up to fifth order of the chiral expansion

D. R. Entem, R. Machleidt, and Y. Nosyk. “High-quality two-nucleon potentials up to fifth order of the chiral expansion”. In:Phys. Rev. C96.2 (2017), p. 024004.doi: 10.1103/PhysRevC.96.024004. arXiv: 1703.05454 (cit. on p. 140). 182

2017 arXiv
[170]

Power counting in chiral effective field theory and nuclear binding

C.-J. Yang, A. Ekström, et al. “Power counting in chiral effective field theory and nuclear binding”. In:Phys. Rev. C103 (5 May 2021), p. 054304.doi: 10.1103/Ph ysRevC.103.054304.url: https://link.aps.org/doi/10.1103/PhysRevC.103.054304 (cit. on p. 140)

2021 doi
[171]

Chiral three-nucleon forces and neutron matter

K. Hebeler and A. Schwenk. “Chiral three-nucleon forces and neutron matter”. In: Phys. Rev. C82 (2010), p. 014314.doi: http://dx.doi.org/10.1103/PhysRevC.82.0 14314. arXiv: 0911.0483 (cit. on p. 141)

2010 arXiv
[172]

The In-Medium Similarity Renormalization Group: A novel ab initio method for nuclei

H. Hergert, S. K. Bogner, et al. “The In-Medium Similarity Renormalization Group: A novel ab initio method for nuclei”. In:Physics Reports621 (2016). Memorial Volume in Honor of Gerald E. Brown, pp. 165–222.issn: 0370-1573.doi: https: //doi.org/10.1016/j.physrep.2015.12.007.ur...

2016 doi
[173]

In-Medium Similarity Renormalization Group Approach to the Nuclear Many-Body Problem

Heiko Hergert, Scott K. Bogner, et al. “In-Medium Similarity Renormalization Group Approach to the Nuclear Many-Body Problem”. In:An Advanced Course in Com- putational Nuclear Physics: Bridging the Scales from Quarks to Neutron Stars. Ed. by Morten Hjorth-Jensen, Maria Paola L...

2017 doi
[174]

In-Medium Similarity Renormalization Group for Closed and Open- Shell Nuclei

H. Hergert. “In-Medium Similarity Renormalization Group for Closed and Open- Shell Nuclei”. In:Phys. Scripta92.2 (2017), p. 023002.doi: 10.1088/1402-4896/9 2/2/023002. arXiv: 1607.06882 (cit. on p. 141)

2017 arXiv
[175]

Non-Empirical Interactions for the Nu- clear Shell Model: An Update

S. Ragnar Stroberg, Scott K. Bogner, et al. “Non-Empirical Interactions for the Nu- clear Shell Model: An Update”. In:Annu. Rev. Nucl. Part. Sci.69 (2019), pp. 307– 362.doi: 10.1146/annurev-nucl-101917-021120. arXiv: 1902.06154 (cit. on p. 141)

2019 arXiv
[176]

Non-perturbative calculations of nuclear matter us- ing in-medium similarity renormalization group

Xin Zhen, Rongzhe Hu, et al. “Non-perturbative calculations of nuclear matter us- ing in-medium similarity renormalization group”. In:Phys. Lett. B862 (2025), p. 139350.doi: 10.1016/j.physletb.2025.139350. arXiv: 2501.02479 (cit. on p. 141)

2025
[177]

Exploring quark mass dependent three-nucleon forces in medium-mass nuclei

Urban Vernik, Kai Hebeler, and Achim Schwenk. “Exploring quark mass dependent three-nucleon forces in medium-mass nuclei”. In: (Dec. 2025). arXiv: 2512.20454 (cit. on p. 152)

2025 arXiv
[178]

Surrogate models for linear response

L. Jin, A. Ravlić, et al. “Surrogate models for linear response”. In:Phys. Rev. Res. 7 (4 Dec. 2025), p. 043347.doi: 10.1103/vvxs-3mnk.url: https://link.aps.org/doi /10.1103/vvxs-3mnk (cit. on p. 153). 183

2025 doi
[179]

Armstrong, Brendan T

Cassandra L. Armstrong, Brendan T. Reed, et al.Constraining Hamiltonians from chiral effective field theory with neutron-star data. 2026. arXiv: 2601.05999 [nucl-th]. url: https://arxiv.org/abs/2601.05999 (cit. on pp. 153, 154)

2026 arXiv
[180]

Munoz, Antoine Belley, et al.Linking Electromagnetic Moments to Nuclear Interactions with a Global Physics-Driven Machine-Learning Emulator

Jose M. Munoz, Antoine Belley, et al.Linking Electromagnetic Moments to Nuclear Interactions with a Global Physics-Driven Machine-Learning Emulator. 2026. arXiv: 2603.26905 [nucl-th].url: https://arxiv.org/abs/2603.26905 (cit. on pp. 153, 154)

2026 arXiv
[181]

Efficient Learning Method to Connect Observables

Hang Yu and Takayuki Miyagi. “Efficient Learning Method to Connect Observables”. In:Phys. Rev. Lett.136 (20 May 2026), p. 202502.doi: 10.1103/33q9-76qp.url: https://link.aps.org/doi/10.1103/33q9-76qp (cit. on p. 153)

2026 doi
[182]

Ryan Curry, Kai Hebeler, et al.Quantum Monte Carlo Calculations of Light Nuclei with Fully Propagated Theoretical Uncertainties. 2025. arXiv: 2510.15860 [nucl-th]. url: https://arxiv.org/abs/2510.15860 (cit. on p. 153)

2025
[183]

Ab initio study of the neutron and Fermi polarons on the lattice

Ryan Curry, Jasmine Kozar, and Alexandros Gezerlis. “Ab initio study of the neutron and Fermi polarons on the lattice”. In:Phys. Rev. C113 (4 Apr. 2026), p. 044002. doi: 10.1103/s24h-lq8f.url: https://link.aps.org/doi/10.1103/s24h-lq8f (cit. on p. 153)

2026 doi
[184]

Emulators for Scarce and Noisy Data: Application to Auxiliary-Field Diffusion Monte Carlo for Neutron Matter

Cassandra L. Armstrong, Pablo Giuliani, et al. “Emulators for Scarce and Noisy Data: Application to Auxiliary-Field Diffusion Monte Carlo for Neutron Matter”. In: Phys. Rev. Lett.135 (14 Oct. 2025), p. 142501.doi: 10.1103/9928-wyjm.url: https://link.aps.org/doi/10.1103/9928-wy...

2025 doi
[185]

Emulators for scarce and noisy data: Application to auxiliary field diffusion Monte Carlo for the deuteron

Rahul Somasundaram, Cassandra L. Armstrong, et al. “Emulators for scarce and noisy data: Application to auxiliary field diffusion Monte Carlo for the deuteron”. In: Physics Letters B866 (2025), p. 139558.issn: 0370-2693.doi: https://doi.org/10.1 016/j.physletb.2025.139558.url:...

2025
[186]

Reed, Rahul Somasundaram, et al.Towards accelerated nuclear-physics parameter estimation from binary neutron star mergers: Emulators for the Tolman- Oppenheimer-Volkoff equations

Brendan T. Reed, Rahul Somasundaram, et al.Towards accelerated nuclear-physics parameter estimation from binary neutron star mergers: Emulators for the Tolman- Oppenheimer-Volkoff equations. Preprint at https://arxiv.org/abs/2405.20558. May 2024 (cit. on p. 153)

2024 arXiv
[187]

Bagging predictors

Leo Breiman. “Bagging predictors”. In:Machine Learning24.2 (Aug. 1996), pp. 123– 140.issn: 1573-0565.doi: 10.1007/BF00058655.url: https://doi.org/10.1007/BF 00058655 (cit. on pp. 156, 157). 184

1996 doi
[188]

Bootstrap Methods: Another Look at the Jackknife

B. Efron. “Bootstrap Methods: Another Look at the Jackknife”. In:The Annals of Statistics7.1 (1979), pp. 1–26.doi: 10.1214/aos/1176344552.url: https: //doi.org/10.1214/aos/1176344552 (cit. on p. 156)

1979
[189]

Roel Hulsman.Distribution-Free Finite-Sample Guarantees and Split Conformal Pre- diction. 2022. arXiv: 2210.14735 [stat.ML].url: https://arxiv.org/abs/2210.14735 (cit. on p. 158)

2022 arXiv
[190]

A General Coefficient of Similarity and Some of Its Properties

J. C. Gower. “A General Coefficient of Similarity and Some of Its Properties”. In: Biometrics27.4 (1971), pp. 857–871.issn: 0006341X, 15410420.url: http://www. jstor.org/stable/2528823 (visited on 03/25/2026) (cit. on p. 160)

1971
[191]

Mount.Analysis of approximate nearest neighbor searching with clustered point sets

Songrit Maneewongvatana and David M. Mount.Analysis of approximate nearest neighbor searching with clustered point sets. 1999. arXiv: cs/9901013 [cs.CG].url: https://arxiv.org/abs/cs/9901013 (cit. on p. 161)

1999 arXiv
[192]

SciPy 1.0: Fundamental Algorithms for Sci- entific Computing in Python

Pauli Virtanen, Ralf Gommers, et al. “SciPy 1.0: Fundamental Algorithms for Sci- entific Computing in Python”. In:Nature Methods17 (2020), pp. 261–272.doi: 10.1038/s41592-019-0686-2 (cit. on pp. 161, 187)

2020 doi
[193]

Methods of conjugate gradients for solving linear systems

Magnus R. Hestenes and Eduard Stiefel. “Methods of conjugate gradients for solving linear systems”. In:Journal of research of the National Bureau of Standards49 (1952), pp. 409–435.url: https://api.semanticscholar.org/CorpusID:2207234 (cit. on p. 187)

1952
[194]

OnthelimitedmemoryBFGSmethodforlargescale optimization

DongC.LiuandJorgeNocedal. “OnthelimitedmemoryBFGSmethodforlargescale optimization”. In:Mathematical Programming45.1 (Aug. 1989), pp. 503–528.issn: 1436-4646.doi: 10.1007/BF01589116.url: https://doi.org/10.1007/BF01589116 (cit. on p. 187)

1989 doi
[195]

Jacobian-free Newton–Krylov methods: a survey of approaches and applications

D. A. Knoll and D. E. Keyes. “Jacobian-free Newton–Krylov methods: a survey of approaches and applications”. In:Journal of Computational Physics193.2 (2004), pp. 357–397.issn: 0021-9991.doi: https://doi.org/10.1016/j.jcp.2003.08.010.url: https://www.sciencedirect.com/science/a...

2004 doi
[196]

Gradients of functions of large matri- ces

Nicholas Krämer, Pablo Moreno-Muñoz, et al. “Gradients of functions of large matri- ces”. In:Advances in Neural Information Processing Systems37 (2024), pp. 49484– 49518 (cit. on p. 192)

2024
[197]

version v0.6.1

Nicholas Krämer.Matfree: Matrix-free linear algebra in JAX. version v0.6.1. 2026. url: https://github.com/pnkraemer/matfree (cit. on p. 192). 185

2026
[198]

Validity of many-body approximation methods for a solvable model: (I). Exact solutions and perturbation theory

H. J. Lipkin, N. Meshkov, and A. J. Glick. “Validity of many-body approximation methods for a solvable model: (I). Exact solutions and perturbation theory”. In: Nuclear Physics62.2 (1965), pp. 188–198.issn: 0029-5582.doi: https://doi.org/10 .1016/0029-5582(65)90862-X.url: http...

1965
[199]

Nonequilibrium Criticality in Quench Dynamics of Long-Range Spin Models

Paraj Titum and Mohammad F. Maghrebi. “Nonequilibrium Criticality in Quench Dynamics of Long-Range Spin Models”. In:Phys. Rev. Lett.125 (4 July 2020), p. 040602.doi: 10.1103/PhysRevLett.125.040602.url: https://link.aps.org/doi/1 0.1103/PhysRevLett.125.040602 (cit. on p. 195). ...

2020 doi
[2019]

arXiv: 1901.08428 [cs.LG].url: https://arxiv.org/abs/1901.08428 (cit. on p. 104)

1901 arXiv
[2020]

arXiv: 2001.08361 [cs.LG].url: https://arxiv.org/abs/2001.08361 (cit. on p. 11). 165

2001 arXiv
[2025]

arXiv: 2407.06340 [quant-ph].url: https://arxiv.org/abs/2407.06340 (cit. on pp. 47, 52)

arXiv
[2026]

arXiv: 2606.09656 [nucl-th].url: https://arxiv.org/abs/2606.09656 (cit. on p. 129)

arXiv
[2563]

IOP Publishing, 2019.isbn: 978-0-7503-1422-0.doi: 10.1088/2053-2563/aae 0ed.url: https://doi.org/10.1088/2053-2563/aae0ed (cit. on pp. 121, 122)

2019 doi

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

Ver- sion 0.0.0+dev

Patrick Cook.pyPMM: The Python Package for Parametric Matrix Models. Ver- sion 0.0.0+dev. June 2026.url: https://github.com/Parametric-Matrix- Models/pyPMM (cit. on pp. ii, 147, 161, 162)

2026

[2] [2]

Moderntheoryofnuclearforces

E.Epelbaum, H.-W.Hammer, andUlf-G.Meißner. “Moderntheoryofnuclearforces”. In:Rev. Mod. Phys.81 (4 Dec. 2009), pp. 1773–1825.doi: 10.1103/RevModPhys.8 1.1773.url: https://link.aps.org/doi/10.1103/RevModPhys.81.1773 (cit. on p. 3)

work page doi:10.1103/revmodphys.8 2009

[3] [3]

Improved nuclear matter calculations from chiral low-momentum interactions

K. Hebeler, S. K. Bogner, et al. “Improved nuclear matter calculations from chiral low-momentum interactions”. In:Phys. Rev. C83 (3 Mar. 2011), p. 031301.doi: 10.1103/PhysRevC.83.031301.url: https://link.aps.org/doi/10.1103/PhysRevC.83 .031301 (cit. on p. 3)

work page doi:10.1103/physrevc.83.031301.url: 2011

[4] [4]

Turning the nuclear energy density functional method into a proper effective field theory: reflections

R. J. Furnstahl. “Turning the nuclear energy density functional method into a proper effective field theory: reflections”. In:The European Physical Journal A56.3 (Mar. 2020), p. 85.issn: 1434-601X.doi: 10.1140/epja/s10050-020-00095-y.url: https://doi.org/10.1140/epja/s10050-020-00095-y (cit. on p. 3)

work page doi:10.1140/epja/s10050-020-00095-y.url: 2020

[5] [5]

Nuclear energy density functionals grounded in ab initio calculations

F. Marino, C. Barbieri, et al. “Nuclear energy density functionals grounded in ab initio calculations”. In:Phys. Rev. C104 (2 Aug. 2021), p. 024315.doi: 10.1103/Phys RevC.104.024315.url: https://link.aps.org/doi/10.1103/PhysRevC.104.024315 (cit. on p. 3)

doi:10.1103/phys 2021

[6] [6]

Factorized approximation to the in-medium similarity renormalization group IMSRG(3)

B. C. He and S. R. Stroberg. “Factorized approximation to the in-medium similarity renormalization group IMSRG(3)”. In:Phys. Rev. C110 (4 Oct. 2024), p. 044317. doi: 10.1103/PhysRevC.110.044317.url: https://link.aps.org/doi/10.1103/PhysR evC.110.044317 (cit. on p. 3)

work page doi:10.1103/physrevc.110.044317.url: 2024

[7] [7]

Magnus expansion and in- medium similarity renormalization group

T. D. Morris, N. M. Parzuchowski, and S. K. Bogner. “Magnus expansion and in- medium similarity renormalization group”. In:Phys. Rev. C92 (3 Sept. 2015), p. 034331.doi: 10.1103/PhysRevC.92.034331.url: https://link.aps.org/doi/10.11 03/PhysRevC.92.034331 (cit. on p. 3)

work page doi:10.1103/physrevc.92.034331.url: 2015

[8] [8]

IMSRG-Net: A machine-learning-based solver for the in-medium similarity renormalization group method

Sota Yoshida. “IMSRG-Net: A machine-learning-based solver for the in-medium similarity renormalization group method”. In:Phys. Rev. C108 (4 Oct. 2023), p. 044303.doi: 10.1103/PhysRevC.108.044303.url: https://link.aps.org/doi/10. 1103/PhysRevC.108.044303 (cit. on p. 3)

work page doi:10.1103/physrevc.108.044303.url: 2023