Jiale Linghu

Yifei Ding, Hao Dong, Jiale Linghu et al.

This paper presents a novel higher-order multi-scale (HOMS) computational framework for efficient, high-accuracy, and low-cost simulation of nonlinear hygro-thermo-mechanical (H-T-M) coupling problems in heterogeneous structures. The inherent nonlinearity in the investigated model stems primarily from temperature- or moisture-dependent material properties, and this model also accounts for temperature-dependent internal heat source and moisture sink terms induced by exothermic, moisture-consuming chemical reactions (e.g., hydration). The main contributions of this work are as follows. First, a high-accuracy multi-scale asymptotic model incorporating higher-order correction terms is constructed for nonlinear H-T-M coupling problems in heterogeneous structures with highly spatial inhomogeneity, using the multi-scale asymptotic approach together with Taylor series expansions. Second, rigorous error estimates in both point-wise and integral senses are derived for the multi-scale asymptotic solutions, which theoretically demonstrate the necessity and superiority of the proposed HOMS method. Third, an efficient two-stage numerical algorithm with off-line and on-line stages is developed, based on finite difference and finite element methods, and its convergence is also proved rigorously. Finally, two- and three-dimensional numerical experiments are performed to assess the computational performance of the proposed HOMS approach, showing excellent numerical accuracy and robustness with low computational overhead.

Jiale Linghu, Yangshuai Wang

Random feature collocation fixes a randomly generated trial space and determines its coefficients from a linear least-squares system. Stability then depends on whether the sampled residual equations represent the geometry induced by the differential operator. We construct an operator-aware discretization in which the operator-applied features determine both the collocation measure and a coefficient whitening map. The randomized scheme combines a residual-Christoffel density with inverse-density weights, while a deterministic scalar-row alternative maximizes successive regularized log-determinant increments. Conditional on the realized trial space, the sampled whitened interior Gram is a spectral approximation to the reference Gram on the retained residual space, with sample complexity linear in the retained dimension up to a logarithmic factor. For uniformly analytic residual kernels, the associated operator has stretched-exponentially decaying eigenvalues and ridge effective dimension that is polylogarithmic in the inverse ridge scale. Experiments on scalar and vector equations, varied geometries, and one to three spatial dimensions show that residual-space sampling and whitening produce numerically full-rank transformed systems with substantially smaller condition numbers and iteration counts. The deterministic construction attains the lowest errors at the smallest scalar sample sizes. Residual-space geometry therefore yields a principled design for stable strong-form random feature collocation.

Hao Dong, Yongfei Hu, Jiale Linghu et al.

Accurate prediction of the nonlinear radiation thermal transfer in composite structures with temperature-dependent properties is significant in high-temperature applications of the materials. This study establishes a high-accuracy multi-scale computational model incorporating novel high-order correction terms for the high-fidelity simulation of nonlinear thermal radiation in composite structures, enabling local balance preserving of heat quantity. Moreover, an explicit convergence rate is also derived for the resulting high-order multi-scale solutions. Furthermore, an efficient multi-scale algorithm consisting of off-line and on-line computation stages is developed for high-accuracy simulation of nonlinear thermal radiation behavior in composite structures, and corresponding convergence analysis is also obtained. Two- and three-dimensional numerical examples are presented to validate the competitive advantages of the proposed multi-scale approach, not only exceptional numerical accuracy, but also reduced computational cost in both storage requirements and computational time.

Jiale Linghu, Hao Dong, Yangshuai Wang

Random-feature methods reduce high-dimensional elliptic PDE collocation to linear coefficient problems, but full-dimensional trial spaces overlook lower-dimensional structure. We introduce the Hierarchical Analysis-of-Variance Random Feature Method (HA-RFM), which selects coordinate blocks using closed Sobol indices of the PDE residual, identifies oblique low-rank features from fitted-predictor gradients, and couples all retained features in one regularized least-squares solve. Under structural and stability hypotheses, we establish an $L^2$ error bound that links solution and residual truncation to finite-width approximation and regularized finite-sample fitting, and we derive guarantees for width and structure recovery. The resulting width is polynomial in the dimension at fixed interaction order, with dimension-independent higher-order contributions under uniform structural control. Residual screening achieves exact recovery of the prescribed three-pair support, while fitted-predictor gradients recover oblique directions through dimension $50$. In random-ridge tests, less than $1\%$ additional width reduces errors by factors of $14$-$39$ over coordinate blocks and $34$-$100$ over equal-width full-dimensional RFM. Semilinear computations extend HA-RFM through dimension $100$, while dense and distributed interactions delineate the coordinate families required for broader structure.

Jiale Linghu, Hao Dong, Yangshuai Wang

Photonic quantum machine learning offers a route to trainable physical representations built from phase, interference and measurement. However, its role in scientific machine learning remains largely unexplored. Physics-informed neural fields provide a natural setting, because differential equations require trial spaces that preserve phase, frequency and derivative structure. Here we introduce a photonic quantum neural field in which coordinates become trainable optical phases, are mixed by multi-photon Fock-space interference and are decoded from photon-number measurements. The photonic circuit is optimized as the neural-field representation itself, not as a fixed feature map or hardware accelerator. Photonic measurement is therefore a trainable representation on which the physics-informed residual is minimized. Across seven elliptic, wave, nonlinear dispersive and inverse PDE benchmarks, we observe a phase-complexity transition: classical coordinate and Fourier-feature networks suffice in smooth regimes, whereas the photonic field is most accurate when residual derivatives amplify phase mismatch. In the hardest regimes it gives the lowest errors, with margins reaching an order of magnitude and about one quarter of the trainable parameters of classical baselines. Frozen and shuffled controls, together with noise stress tests, attribute this gain to learned interference and stable Fock-probability readout under compound perturbations. These results identify photonic quantum measurement as a representation-learning principle for scientific machine learning.

Xi'an Li, Jiale Linghu, Yangshuai Wang

Data assimilation for time-dependent partial differential equations (PDEs) requires Bayesian updates of an evolving field from streaming, sparse, and noisy observations, while keeping the filtering state finite dimensional. We introduce a random-feature Kalman filtering framework for linear PDE data assimilation. Once the random features are frozen and the linear PDE is Galerkin discretized, the coefficient vector satisfies a finite-dimensional linear-Gaussian state-space model, so the Kalman recursion gives the exact posterior for the chosen coefficient model. For non-orthogonal random-feature draws, we construct a mass-whitened effective-rank coordinate system that removes near-null mass directions and identifies the posterior dimension $r$. For the heat equation with implicit-Euler time stepping, we prove a high-probability posterior-contraction and PDE-consistency theorem in these mass-whitened coordinates. The mean-square $L^2$ reconstruction error separates into an effective-rank feature approximation term, a deterministic time-consistency term, and a Bayesian estimation term. In the high-information regime, the leading posterior contribution scales as $rσ^2/N_o$, where $σ^2$ is the observation-noise variance and $N_o$ is the number of observations per analysis time. Thus the analysis distinguishes the exact coefficient-space posterior from deterministic PDE approximation errors, and gives a checkable uncertainty-quantification guarantee for random-feature filtering of a representative parabolic PDE.

Jiale Linghu, Yangshuai Wang

A central challenge in mesh-free space--time approximation for time-dependent partial differential equations is to represent evolving temporal scales while keeping residual minimization computationally tractable. Random feature methods simplify this algebraic problem by freezing nonlinear trial functions and fitting only a linear readout, but standard static space--time activations provide no explicit relaxation-scale mechanism, making temporal-scale resolution a finite-dimensional bottleneck in stiff, dispersive, or multi-scale regimes. We introduce liquid random feature methods (L-RFM), which replace static temporal activations by closed-form liquid time-constant responses with sampled relaxation scales. The resulting frozen features form temporally structured local or global trial spaces with analytic space--time derivatives for residual least-squares assembly. A density theorem proves density of the deterministic trial spaces in the continuous space--time function class, and a temporal-rank calculation clarifies the role of sampled relaxation scales. Ablation and finite-feature tests identify the liquid temporal response as the primary source of the observed accuracy improvement. Across stiff reaction--diffusion, nonlinear transport, dispersive, complex-valued, and multidimensional benchmarks, L-RFM improves finite-feature accuracy in regimes where temporal-scale representation controls the approximation. By embedding relaxation scales directly into frozen trial functions, L-RFM provides a route to high-accuracy continuous space--time surrogates for evolutionary PDEs while preserving the simplicity of linear least-squares solvers.