Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convergence”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Degenerate coupled-cluster theory

A size-extensive, converging, black-box, ab initio coupled-cluster (ΔCC) ansatz is introduced that computes the energies and wave functions of states from any degenerate or nondegenerate Slater-determinant references with any numbers of α- and β-spin electrons, any patterns of orbital occupancy, any spin multiplicities, and any spatial symmetries. For a nondegenerate reference, it reduces to the single-reference coupled-cluster ansatz. For a degenerate multireference, it is a natural coupled-cluster extension of degenerate Møller–Plesset perturbation (ΔMP) theory. For ionized and electron-attached references, it is a coupled-cluster Green’s function, although the present theory is convergent toward the full-configuration-interaction limits, while the Feynman–Dyson many-body Green’s function (MBGF) theory generally is not. Its single-excitation instance is a projection Hartree–Fock theory as per the Thouless theorem, which may be useful for core ionizations, high-spin states, and possibly electron affinities. Additionally, a new multireference coupled-cluster theory for a general model space is developed. This quasidegenerate coupled-cluster (QCC) theory is exactly converging, but not black-box, and intended for strong correlation. Determinant-based, general-order algorithms of ΔCC and QCC theories are implemented and compared with configuration-interaction (CI) and equation-of-motion coupled-cluster (EOM-CC) theories through octuple excitations and with ΔMP and MBGF theories up to the nineteenth order. An algebraic, optimal-scaling algorithm of the ΔCC theory is computer-synthesized at the levels of single excitations (ΔCCS) and of single and double excitations (ΔCCSD). As a result, the order of performance is QCC ≈ ΔCC > EOM-CC > CI at the same order or QCC ≈ ΔCC > ΔMP > MBGF at the same cost scaling.

Hirata, So [University of Illinois at Urbana-Champ↗
DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2025

Robust ab initio predictions for dimensionless ratios of 𝐸⁢2 and radius observables. I. Electric quadrupole moments and deformation

We report that converged results for 𝐸⁢2 observables are notoriously challenging to obtain in ab initio no-core configuration interaction approaches. Matrix elements of the 𝐸⁢2 operator are sensitive to the large-distance tails of the nuclear wave function, which converge slowly in an oscillator basis expansion. Similar convergence challenges beset ab initio prediction of the nuclear charge radius. However, we exploit systematic correlations between the calculated 𝐸⁢2 and radius observables to yield meaningful predictions for relations among these observables. In particular, we examine ab initio predictions for dimensionless ratios of the form 𝑄/𝑟 2 for nuclei throughout the 𝑝 shell. Meaningful predictions for electric quadrupole moments may then be made by calibrating to the ground-state charge radius, if experimentally known, or vice versa. Moreover, these dimensionless ratios provide ab initio insight into the nuclear quadrupole deformation.

ab initio calculations↗
DOE OSTI2025

Robust ab initio predictions for dimensionless ratios of 𝐸⁢2 and radius observables. II. Estimation of 𝐸⁢2 transition strengths by calibration to the charge radius

Converged results for 𝐸⁢2 observables are notoriously challenging to obtain in ab initio no-core configuration interaction approaches. Matrix elements of the 𝐸⁢2 operator are sensitive to the large-distance tails of the nuclear wave function, which converge slowly in an oscillator basis expansion. Similar convergence challenges beset ab initio prediction of the nuclear charge radius. However, we exploit systematic correlations between the calculated 𝐸⁢2 and radius observables to yield meaningful predictions for relations among these observables. In particular, we examine ab initio predictions for dimensionless ratios of the form 𝐵⁡(𝐸⁢2)/(𝑒 2 ⁢𝑟 4 ) for nuclei throughout the 𝑝 shell. Finally, meaningful predictions for 𝐸⁢2 transition strengths may then be made by calibrating to the ground-state charge radius if experimentally known.

ab initio calculations↗
DOE OSTI2024

Ensuring Solution Uniqueness in Three-Phase Power System State Estimation

This paper is concerned with the issue of potential non-unique solutions in three-phase state estimation. Theory of observability analysis for positive sequence power system state estimation is based on certain assumptions that avoid possibility of multiple solutions. Also, it is shown that observability of a positive sequence network remains independent of the network parameters or the operating state. When extending single-phase observability analysis directly to the three-phase case, this paper considers the possibility of converging to multiple solutions, i.e. solution non-uniqueness, even for cases where state estimator successfully converges. The study illustrates via numerical examples the likelihood of converging to entirely different solutions for certain network parameters. It also examines how the operating state, particularly under unbalanced loading, leads to solution non-uniqueness. The paper then describes an alternative approach to ensure a unique solution in three-phase state estimation. This method aims to accurately and uniquely estimate the state of any unbalanced three-phase system, irrespective of load imbalance, network configuration, existence of synchronous generators or transformers.

Power System State Estimation, Three-Phase, Distri↗
DOE OSTI2026

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Multilevel Conditional Disturbance Rejection Control for Satellite Attitude Tracking

Recently, the conditional disturbance rejection controller (CDRC) was proposed to improve control performance by leveraging disturbances that have beneficial effects on the system. However, it only considers disturbances acting on the state variable directly influenced by them. Although fast convergence of this state can be achieved with the CDRC, it may unintentionally affect the convergence of the output (i.e., the primary state). Here, in this article, a multilevel CDRC is proposed to enhance satellite attitude control performance by accounting for the effect of disturbances on both attitude (output) and angular velocity. The extended state observer is employed to estimate the lumped disturbance, including the modeling errors and external disturbances. Then, a backstepping-based controller with the multilevel disturbance rejection law (ML-DRL) is designed for attitude tracking. The ML-DRL is developed to improve the control performance by using a disturbance with a damping effect on both attitude and velocity. Faster convergence of attitude and velocity can be achieved by conditionally compensating for the disturbance. The stability of the proposed control method is analyzed by demonstrating that the errors are bounded as time tends to infinity. The attitude control performance of the proposed method is evaluated through numerical examples conducted using the MATLAB/Simulink Multibody tool.

Active disturbance rejection control (ADRC)↗
DOE OSTI2025

Fair Concurrent Training of Multiple Models in Federated Learning

Federated learning (FL) enables collaborative learning across multiple clients. In most FL work, all clients train a single learning task. However, the recent proliferation of FL applications may increasingly require multiple FL tasks to be trained simultaneously, sharing clients’ computing resources, which we call Multiple-Model Federated Learning (MMFL). Current MMFL algorithms use naïve average-based client-task allocation schemes that often lead to unfair performance when FL tasks have heterogeneous difficulty levels, as the more difficult tasks may need more client participation to train effectively. Furthermore, in the MMFL setting, we face a further challenge that some clients may prefer training specific tasks to others, and may not even be willing to train other tasks, e.g., due to high computational costs, which may exacerbate unfairness in training outcomes across tasks. We address both challenges by firstly designing FedFairMMFL, a difficulty-aware algorithm that dynamically allocates clients to tasks in each training round, based on the tasks’ current performance levels. We provide guarantees on the resulting task fairness and FedFairMMFL’s convergence rate. We then propose novel auction designs that incentivizes clients to train multiple tasks, so as to fairly distribute clients’ training efforts across the tasks, and extend our convergence guarantees to this setting. Here, we finally evaluate our algorithm with multiple sets of learning tasks on real world datasets, showing that our algorithm improves fairness by improving the final model accuracy and convergence speed of the worst performing tasks, while maintaining the average accuracy across tasks.

Federated learning↗
DOE OSTI2026

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗
DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
DOE OSTI2025

Subtropical Jet Regulates Arabian Winter Precipitation: A Viable Mechanism

The present study explores the mechanism governing wintertime (November–April) precipitation over the Arabian Peninsula (AP) using a 17-yr-long (2002–18) high-resolution WRF simulation. The composite analysis of strong precipitation events suggests that the equatorward extension of the upper-level jet together with the embedded upper-level trough creates a positive (cyclonic) midlevel vorticity and subsequently generates an anomalous lower-level convergence through Ekman pumping. This leads to the development of an anomalous surface low, which is further enhanced in the presence of the existing Red Sea trough over the AP. This surface low weakens the persistent anticyclone over the AP, shifting it further eastward to the Arabian Sea. The eastward shift in the lower-level anticyclone contributes to the transport of warm, moist air from the Arabian Sea and the Red Sea toward the AP. This warm, moist air converges with the cold and dry air advected by the midlatitude jet and creates a moisture convergence zone, leading to the initiation of convection. We test the proposed mechanism through numerical experiments with modified upper-level wind and demonstrate that a strong, southward intrusion of the jet can indeed lead to precipitation over the AP. The above mechanism also explains the interannual variability of precipitation over the AP. During wet years, we notice approximately 3 m s -1 stronger jet core magnitude and about a 2° equatorward shift of the jet compared to dry years. While the equatorward extension of the jet explains about 21% of the interannual variability, the jet magnitude explains around 7% of the variability during wet years.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Modeling In-Reactor Temperature Gradients in Lithium Aluminate Ceramic Pellets

In reactor thermal performance of lithium aluminate ceramic pellets are calculated to determine operating temperatures if internal components shift during irradiation. A 2D conduction model was setup to model this scenario with additional physics, including thermal expansion of components to reactor temperatures, creep down of the cladding due to differential pressure between the inside of the rod and reactor coolant system, and net radiation exchange between components. The non-linear coupling of the governing equations presented convergence challenges due to the very different effects from a small temperature change on the radiation vs radial and circumferential conduction equations. Initial temperature guesses for the multidimensional solution were provided from conservative 1D models simulating bounding scenarios. Convergence was greatly improved by taking small steps towards the root solutions and averaging with initial guesses. The final method robustly converged all 132 points at an axial plane after a few dozen iterations. The temperature results show that the additional physics have a secondary effect as the dominant heat transfer mechanism is radial conduction across the gas gap followed by circumferential conduction around components. Circumferential conduction in the lithium aluminate pellets is enhanced by the relatively high thermal conductivity of this ceramic.

Carstens, Nathan A.↗
DOE OSTI2024

Subsurface microbial community structure shifts along the geological features of the Central American Volcanic Arc

Subduction of the Cocos and Nazca oceanic plates beneath the Caribbean plate drives the upward movement of deep fluids enriched in carbon, nitrogen, sulfur, and iron along the Central American Volcanic Arc (CAVA). These compounds fuel diverse subsurface microbial communities that in turn alter the distribution, redox state, and isotopic composition of these compounds. Microbial community structure and functions vary according to deep fluid delivery across the arc, but less is known about how microbial communities differ along the axis of a convergent margin as geological features (e.g., extent of volcanism and subduction geometry) shift. Here, we investigate changes in bacterial 16S rRNA gene amplicons and geochemical analysis of deeply-sourced seeps along the southern CAVA, where subduction of the Cocos Ridge alters the geological setting. We find shifts in community composition along the convergent margin, with communities in similar geological settings clustering together independently of the proximity of sample sites. Microbial community composition correlates with geological variables such as host rock type, maturity of hydrothermal fluid and slab depth along different segments of the CAVA. This reveals tight coupling between deep Earth processes and subsurface microbial activity, controlling community distribution, structure and composition along a convergent margin.

Science & Technology - Other Topics↗
DOE OSTI2024

Assessment of the Impact of Realistic Sensor Physics and the Integration of Ex-Core Sensors on Reactor Power Synthesis

In the work documented in this report, a weighting function–based core power synthesis method was applied to multiple Monte Carlo N-Particle (MCNP) reactor models, which are informed based on simulated self-powered neutron detector (SPND) responses. The weighting function method used has been coined the point-based iterative (PBI) method. The goal of this application is to assess the impact of considering realistic sensor physics in the generation of the simulated SPND outputs as well as to consider how the synthesis is impacted based on the inclusion of ex-core detectors in the model. The NuScale small modular reactor (SMR) and Westinghouse AP1000 pressurized water reactor (PWR) are the models that served as the testbeds for the assessment of realistic sensor physics; this was achieved by using Geant4 SPND models in comparison with analytical models, such that the effect of electron transport in realistic SPND geometries in the Geant4 model can be understood in terms of synthesis error and convergence time. The comparison was considered for fuel burnup–induced perturbations, for a range of sensor string densities and synthesized power distribution axial fidelities. The Texas A&M Testing, Research, Isotopes, General Atomics Reactor (TAMU TRIGA) reactor MCNP model was used to assess the impact of ex-core sensors; this was done by performing synthesis with and without the ex-core detectors and by quantifying the synthesis error and number of iterations associated with Gaussian-type perturbations in many locations in the core. The TAMU TRIGA model was particularly pertinent for this study because of the interest in future experimental tests with SPNDs in this reactor, as well as the ease of modifying the MCNP model to include ex-core detectors with heterogeneously described response functions. Results from the comparison between the Geant4 and analytical SPND models indicate that similar average and maximum synthesis errors were obtained for burnup-induced perturbations in both the NuScale SMR and the AP1000. This was true for a range of sensor string densities and axial fidelities. However, there were marked differences between both the Geant4 and analytically informed models in terms of the iterations required to converge on the synthesized power distribution. Namely, the Geant4-informed models tended to lead to fewer iterations, except for a few sensor–core configurations that had particularly numerous iterations. Results from the ex-core sensor assessment with the TAMU TRIGA model indicate that the inclusion of ex-core sensors drastically reduces the synthesis error of Gaussian-type perturbations close to the edge of the core, and it slightly reduces synthesis errors for perturbations closer to the center of the core. This was achieved with a minimal increase in computational cost—that is, the number of iterations required for convergence. The errors were identified to be in the same location as the perturbation in the core, indicating that the methodology remains robust for unperturbed regions of the core. A secondary result from this study with the TAMU TRIGA was yielded by analysis of the neutron flux levels in the in-core and ex-core sensor locations of the core; these flux levels indicate that SPNDs could be used as both in-core and ex-core sensors, so long as the emitter material is sensitive to thermal neutrons. The results from these studies provide a quantitative understanding of the importance of considering realistic sensor physics and including ex-core sensors to perform accurate and timely power distribution synthesis of a reactor core.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗
DOE OSTI2024

Tensor Network Space-Time Spectral Collocation Method for Time-Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of partial differential equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultra-fast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for the solution of the time-dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time-dependent PDEs often used finite difference for time, and a spectral scheme for the spatial dimensions, which led to a slow linear convergence. Spectral collocation space-time methods show exponential convergence; however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach, as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to a very high compression of linear operators from terabytes to kilobytes in TT-format, and a speedup of tens of thousands of times when compared to a full-grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

97 MATHEMATICS AND COMPUTING↗