Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matrix equations”

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 OSTI2025

Gauge-fixing quantum density operators at scale

We provide a theory, algorithms, and simulations of nonequilibrium quantum systems using a one-dimensional (1D) completely positive (CP), matrix-product (MP) density-operator (𝜌) representation. By generalizing the matrix product state's orthogonality center, to additionally store positive classical mixture correlations, the MP⁢𝜌 factorization naturally emerges. In this setting, we analytically and numerically examine the virtual gauge freedoms associated with the representation of quantum density operators. Based on this perspective, we simplify algorithms in certain limits to speed up the integration of the canonical-form master-equation dynamics. This enables us to quickly evolve under the dynamics of two-body quantum channels without resorting to optimization-based methods. In addition to this technical advance, we also scale up numerical examples and discuss implications for accurately modeling hardware architectures and predicting their performance in the near term. This includes an example of the quantum to classical transition of informationally leaky, i.e., decohering, qubits. In this setting, because of loss from environmental interactions, nonlocal complex coherence correlations are converted into global incoherent classical statistical mixture correlations. Lastly, the representation of both global and local correlations is discussed. We expect this work to have applications in additional nonequilibrium settings, beyond qubit engineering.

Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗
DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A Review of the Influence of Processing Parameters on ODS Steels Produced via Additive Manufacturing Techniques

Abstract This paper reviews current observations regarding processing conditions for oxide dispersion-strengthened steels consolidated through additive manufacturing techniques. Variations in ODS steels observed across process parameters include changes in grain size, grain texture, oxide size, density of oxides, porosity, melt pool characteristics, and mechanical properties. These properties were then compared across techniques to understand which techniques and processing conditions lead to the highest strength, ductility, and oxide density. Current literature suggests that a mix of grain types, in the form of either morphology or phase, can significantly increase the strength of printed ODS steels. Meanwhile, the most ductile samples, regardless of consolidation technique or matrix material, were made from feedstock with oxide additions located on the powder surface. Reported grain and oxide sizes were plotted against the ratio of laser power to scan speed, volumetric energy density, and normalized enthalpy. No strong correlation between these values and microstructural features was observed. The plots that were made suggest that a larger data set, more in-depth representative equations, and more defined material properties as a function of specific feedstock used are necessary to determine a value that can be correlated to the printed ODS steel microstructure.

deJong, Matthew↗
DOE OSTI2024

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2024

Impact of dark matter on tidal signatures in neutron star mergers with the Einstein Telescope

If dark matter (DM) accumulates inside neutron stars (NS), it changes their internal structure and causes a shift of the tidal deformability from the value predicted by the dense-matter equation of state (EOS). In principle, this shift could be observable in the gravitational-wave (GW) signal of binary neutron star (BNS) mergers. We investigate the effect of fermionic, noninteracting DM when observing a large number of GW events from DM-admixed BNSs with the precision of the proposed Einstein telescope (ET). Specifically, we study the impact on the recovery of the baryonic EOS and whether DM properties can be constrained. For this purpose, we create event catalogs of BNS mock events with DM fraction up to 1%, from which we reconstruct the posterior uncertainties with the Fisher matrix approach. Using this data, we perform joint Bayesian inference on the baryonic EOS, DM particle mass, and DM particle fraction in each event. Here, our results reveal that when falsely ignoring DM effects, the EOS posterior is biased toward softer EOSs, though the offset is rather small. Further, we find that within our assumptions of our DM model and population, ET will likely not be able to test the presence of DM in BNSs, even when combining many events and adding Cosmic Explorer (CE) to the next-generation detector network. Likewise, the potential constraints on the DM particle mass will remain weak because of degeneracies with the fraction and EOS.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Dark energy survey year 3 results: cosmology from galaxy clustering and galaxy–galaxy lensing in harmonic space

We present the joint tomographic analysis of galaxy-galaxy lensing and galaxy clustering in harmonic space (HS), using galaxy catalogues from the first three years of observations by the Dark Energy Survey (DES Y3). We utilize the redMaGiC and MagLim catalogues as lens galaxies and the metacalibration catalogue as source galaxies. The measurements of angular power spectra are performed using the pseudo-$C_\ell$ method, and our theoretical modelling follows the fiducial analyses performed by DES Y3 in configuration space, accounting for galaxy bias, intrinsic alignments, magnification bias, shear magnification bias and photometric redshift uncertainties. We explore different approaches for scale cuts based on non-linear galaxy bias and baryonic effects contamination. Our fiducial covariance matrix is computed analytically, accounting for mask geometry in the Gaussian term, and including non-Gaussian contributions and super-sample covariance terms. To validate our HS pipelines and covariance matrix, we used a suite of 1800 log-normal simulations. We also perform a series of stress tests to gauge the robustness of our HS analysis. In the $\Lambda$CDM model, the clustering amplitude $S_8 =\sigma _8(\Omega _m/0.3)^{0.5}$ is constrained to $S_8 = 0.704\pm 0.029$ and $S_8 = 0.753\pm 0.024$ (68 per cent C.L.) for the redMaGiC and MagLim catalogues, respectively. For the wCDM, the dark energy equation of state is constrained to $w = -1.28 \pm 0.29$ and $w = -1.26^{+0.34}_{-0.27}$, for redMaGiC and MagLim catalogues, respectively. These results are compatible with the corresponding DES Y3 results in configuration space and pave the way for HS analyses using the DES Y6 data.

(cosmology:) cosmological parameters↗
DOE OSTI2025

Fluid-like shock compression of dilute polymer nanocomposites

The shock Hugoniot of heterogenous mixtures of discrete particles has been experimentally investigated for porous agglomerates and fluids, while the study of full-density solids has been primarily limited to compressed powders and high-dimensional composites. By dispersing ceria nanoparticles in a polyethylene matrix, we are able to examine the hydrodynamic behavior of a nonporous, heterogenous solid in thermal equilibrium during weak shock compression. Phase-driven discontinuities in the Hugoniot particle velocity–shock velocity (u−D) relationship of pure polyethylene are replicated in the nanocomposites but are shifted to lower velocity and to higher pressure with higher particle concentration. The results are explained using an isothermal, two-velocity fluid model under the hydrodynamic approximation. The model, which assumes a theoretical equation-of-state for ceria and either a low-order or high-order fit to the measured polyethylene Hugoniot, reasonably predicts the Hugoniot for two different polyethylene/ceria nanocomposites. Using the model, the mixture Hugoniot is shown to be insensitive to the Hugoniot of the stiffer constituent when the moduli are sufficiently disparate, while dependence on particle density and volume fraction is preserved through fluid-like motion.

Moore, Nathan W. [Sandia National Laboratories (SN↗
DOE OSTI2025

Predicting nonequilibrium Green’s function dynamics and photoemission spectra via nonlinear integral operator learning

Understanding the dynamics of nonequilibrium quantum many-body systems is an important research topic in a wide range of fields across condensed matter physics, quantum optics, and high-energy physics. However, numerical studies of large-scale nonequilibrium phenomena in realistic materials face serious challenges due to intrinsic high-dimensionality of quantum many-body problems and the absence of time-invariance. The nonequilibrium properties of many-body systems can be described by the dynamics of the correlator, or the Green's function of the system, whose time evolution is given by a high-dimensional system of integro-differential equations, known as the Kadanoff–Baym equations (KBEs). The time-convolution term in KBEs, which needs to be recalculated at each time step, makes it difficult to perform long-time numerical simulation. In this paper, we develop an operator-learning framework based on recurrent neural networks (RNNs) to address this challenge. We utilize RNNs to learn the nonlinear mapping between Green's functions and convolution integrals in KBEs. By using the learned operators as a surrogate model in the KBE solver, we obtain a general machine-learning scheme for predicting the dynamics of nonequilibrium Green's functions. Besides significant savings per each time step, the new methodology reduces the temporal computational complexity from $O(N_t^3)$ to $O(N_t)$ where N t is the number of steps taken in a simulation, thereby making it possible to study large many-body problems which are currently infeasible with conventional KBE solvers. Through various numerical examples, we demonstrate the effectiveness of the operator-learning based approach in providing accurate predictions of physical observables such as the reduced density matrix and time-resolved photoemission spectra. Moreover, our framework exhibits clear numerical convergence and can be easily parallelized, thereby facilitating many possible further developments and applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Simplified Universal Equations for Ionic Conductivity and Transference Number

Nernst-Einstein equation can provide a reasonable estimate of the ionic conductivity of dilute solutions. For concentrated solutions, alternate methods such as Green–Kubo relations and Einstein relations are more suitable to account for ion-ion interactions. Such computations can be expensive for multicomponent systems. Simplified mathematical expressions like the Nernst-Einstein equation do not exist for concentrated multicomponent mixtures. Newman’s treatment of multicomponent concentrated solutions yields a conductivity relation in terms of species concentration and Onsager phenomenological coefficients. However, the estimation of these phenomenological coefficients is not straightforward. Here, mathematical formulations that relate the phenomenological coefficients with the friction coefficients are developed, leading to simplified, ready-to-use expressions of conductivity and transference numbers that can be used for a wide range of ionic mixtures. This approach involves spectral decomposition of the matrix of Onsager phenomenological coefficients. The general analytical expressions for conductivity and transference number are simplified for binary electrolytes, and numerical solutions are provided for ternary and quaternary mixtures with ion dissociation.

Electrochemistry↗
DOE OSTI2026

Active operator learning with predictive uncertainty quantification for partial differential equations

With the increased prevalence of neural operators being used to provide rapid solutions to partial differential equations (PDEs), understanding the accuracy of model predictions and the associated error levels is necessary for deploying reliable surrogate models in scientific applications. Existing uncertainty quantification (UQ) frameworks employ ensembles or Bayesian methods, which can incur substantial computational costs during both training and inference. Here, we propose a lightweight predictive UQ method tailored for Deep operator networks (DeepONets) that also generalizes to other operator networks. Numerical experiments on linear and nonlinear PDEs demonstrate that the framework’s uncertainty estimates are unbiased and provide accurate out-of-distribution uncertainty predictions with a sufficiently large training dataset. Our framework provides fast inference and uncertainty estimates that can efficiently drive outer-loop analyses that would be prohibitively expensive with conventional solvers. We demonstrate how predictive uncertainties can be used in the context of Bayesian optimization and active learning problems to yield improvements in accuracy and data-efficiency for outer-loop optimization procedures. In the active learning setup, we extend the framework to Fourier Neural Operators (FNO) and describe a generalized method for other operator networks. To enable real-time deployment, we introduce an inference strategy based on precomputed trunk outputs and a sparse placement matrix, reducing evaluation time by more than a factor of five. Our method provides a practical route to uncertainty-aware operator learning in time-sensitive settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Thermal quasiparticle theory

The widely used thermal Hartree–Fock (HF) theory is generalized to include the effect of electron correlation while maintaining its quasi-independent-particle framework. An electron-correlated internal energy (or grand potential) is postulated in consultation with the second-order finite-temperature many-body perturbation theory (MBPT), which then dictates the corresponding thermal orbital (quasiparticle) energies in such a way that all fundamental thermodynamic relations are obeyed. The associated density matrix is of a one-electron type, whose diagonal elements take the form of the Fermi–Dirac distribution functions, when the grand potential is minimized. The formulas for the entropy and chemical potential are unchanged from those of Fermi–Dirac or thermal HF theory. The theory thus stipulates a finite-temperature extension of the second-order Dyson self-energy of one-particle many-body Green’s function theory and can be viewed as a second-order, diagonal, frequency-independent, thermal inverse Dyson equation. At low temperatures, the theory approaches finite-temperature MBPT of the same order, but it may outperform the latter at intermediate temperatures by including additional electron-correlation effects through orbital energies. Here, a physical meaning of these thermal orbital energies is proposed (encompassing that of thermal HF orbital energies, which has been elusive) as a finite-temperature version of Janak’s theorem.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
DOE OSTI2024

ASGarD: Adaptive Sparse Grid Discretization

Many areas of science exhibit physical processes that are described by high dimensional partial differential equations (PDEs), e.g., the 4D, 5D and 6D models describing magnetized fusion plasmas, models describing quantum chemistry, or derivatives pricing. Such problems are affected by the so-called “curse of dimensionality” where the number of degrees of freedom (or unknowns) required to be solved for scales as N D where N is the number of grid points in any given dimension D. A simple, albeit naive, 6D example is demonstrated in the left panel of Figure 1. With N = 1000 grid points in each dimension, the memory required just to store the solution vector, not to mention forming the matrix required to advance such a system in time, would exceed an exabyte - and also the available memory on the largest of supercomputers available today. The right panel of Figure 1 demonstrates potential savings for a range of problem dimensionalities and grid resolution. While there are methods to simulate such high-dimensional systems, they are mostly based on Monte-Carlo methods, which rely on a statistical sampling such that the resulting solutions include noise. Since the noise in such methods can only be reduced at a rate proportional to $\sqrt{N_p}$ where N p is the number of Monte-Carlo samples, there is a need for continuum, or grid/mesh-based methods for high-dimensional problems, which both do not suffer from noise and bypass the curse of dimensionality. We present a simulation framework that provides such a method using adaptive sparse grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Finite- and infinite-volume study of DDπ scattering

We develop a comprehensive framework for extracting the pole position and properties of the doubly-charmed tetraquark $T$$^{+}_{cc}$(3875) from lattice QCD data using the relativistic three-particle formalism. This approach incorporates the effect of the one-pion exchange diagram in DDπ and DD ∗ scattering, making it applicable at energies coinciding with the left-hand cut in the partial-wave projected DD ∗ amplitude. We present an example application of this framework to existing lattice QCD data at mπ = 280 MeV. We solve the integral equations describing the DDπ reaction, use LSZ reduction to determine the corresponding DD ∗ amplitude, and find the values of the infinite-volume two- and three-body K matrices that lead to agreement with lattice DD ∗ phase shifts within their uncertainties. Using these K matrices in the three-particle quantization condition, we describe the finite- volume DD ∗ spectrum and find good agreement with the lattice QCD energies. Our results suggest that, at this pion mass, the tetraquark appears as a pair of subthreshold complex poles whose precise location strongly depends on the value of the DDπ three-particle K matrix.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Dual-unitary shadow tomography

We introduce a classical shadow tomography scheme based on dual-unitary brick-wall circuits termed "dual-unitary shadow tomography" (DUST). For this we study operator spreading and Pauli weight dynamics in one-dimensional qubit systems, evolved by random two-local dual-unitary gates arranged in a brick-wall structure, ending with a final measurement layer. We do this by deriving general constraints on the Pauli weight transfer matrix and specializing to the case of dual-unitarity. We first show that dual-unitaries must have a minimal amount of entropy production. Remarkably, we find that operator spreading in these circuits have a rich structure resembling that of relativistic quantum field theories, with massless chiral excitations that can decay or fuse into each other, which we call left- or right-movers. We develop a mean-field description of the Pauli weight in terms of $\rho(x,t)$, which represents the probability of having nontrivial support at site $x$ and depth $t$ starting from a fixed weight distribution. We develop an equation of state for $\rho(x,t)$, and simulate it numerically using Monte Carlo simulations. Lastly, we demonstrate that the fast-thermalizing properties of dual-unitary circuits make them better at predicting large operators than shallow brick-wall Clifford circuits. Our results are robust to finite-size effects due to the chirality of dual-unitary brick-wall circuits.

97 MATHEMATICS AND COMPUTING↗