Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 19 min ago
PreprintarXiv licencearXiv

A Tensor Neural Network Method for High-Order Homogenization of Locally Periodic Elliptic Problems

Abstract

We develop a high-order tensor neural network (TNN) method for locally periodic elliptic multiscale problems of the form −∇·(A(x,x/ε)∇ uε)=f. Because the coefficient depends on both the slow variable x and the fast periodic variable y=x/ε, the high-order cell problems and macroscopic corrector equations are more involved than in the classical case A=A(y), and the correctors depend parametrically on x. We derive a computable high-order two-scale expansion and prove an H1 convergence estimate for the partial expansion in boundary-layer-free settings, including periodic domains and ideal boundary-matching configurations. The proof uses the recursive compatibility structure of the corrector hierarchy and a zero-mean oscillation estimate in H−1. We then construct a TNN framework for the high-dimensional corrector problems. Its tensor-product structure permits deterministic one-dimensional quadrature for the cell problems, homogenized coefficients, macroscopic source terms, and loss functions, avoiding Monte Carlo integration error. The numerical realization assumes that the coefficient entries and assembled data admit finite or controlled tensor-product representations; this computational assumption is separate from the general matrix-valued coefficient class used in the analysis. Experiments with scalar locally periodic coefficients show accurate high-order correctors. The H1 semi-norm errors are consistent with the proved estimate, while point-normalized L2 errors display the nominal high-order behavior predicted by the formal expansion.

Related

  1. A Locally Conservative Enriched Linearized Neural Network Approximation to Elliptic PDEs
    Seungil Kim, Gwanghyun Jo, Young Ju Lee
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. A Domain-specific adaptation network for elliptic interface problems
    Jiaqi Luo, Hongmei Kang, Xingye Yue +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. An H-convergence-based implicit function theorem for homogenization of nonlinear non-smooth elliptic systems
    Lutz Recke
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  4. On regularity of averaged Green's functions in homogenization of elliptic PDE
    Joseph G. Conlon, Michael Dabkowski
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  5. Quantitative periodic homogenization and uniform regularity for nonlocal equations
    Kyeongbae Kim, Simon Nowak, Marvin Weidner
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{zhang2026tensor,
  title = {{A Tensor Neural Network Method for High-Order Homogenization of Locally Periodic Elliptic Problems}},
  author = {Huaijia Zhang and Haochen Liu and Xia Ji and Hehu Xie},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.29176},
  eprint = {2608.29176},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.29176},
}
RIS
TY  - UNPB
TI  - A Tensor Neural Network Method for High-Order Homogenization of Locally Periodic Elliptic Problems
AU  - Huaijia Zhang
AU  - Haochen Liu
AU  - Xia Ji
AU  - Hehu Xie
PY  - 2026
DA  - 2026/08/29
PB  - arXiv
DO  - 10.48550/arxiv.2608.29176
UR  - https://arxiv.org/abs/2608.29176
AB  - We develop a high-order tensor neural network (TNN) method for locally periodic elliptic multiscale problems of the form −∇·(A(x,x/ε)∇ u_ε)=f. Because the coefficient depends on both the slow variable x and the fast periodic variable y=x/ε, the high-order cell problems and macroscopic corrector equations are more involved than in the classical case A=A(y), and the correctors depend parametrically on x. We derive a computable high-order two-scale expansion and prove an H^1 convergence estimate for the partial expansion in boundary-layer-free settings, including periodic domains and ideal boundary-matching configurations. The proof uses the recursive compatibility structure of the corrector hierarchy and a zero-mean oscillation estimate in H^−1. We then construct a TNN framework for the high-dimensional corrector problems. Its tensor-product structure permits deterministic one-dimensional quadrature for the cell problems, homogenized coefficients, macroscopic source terms, and loss functions, avoiding Monte Carlo integration error. The numerical realization assumes that the coefficient entries and assembled data admit finite or controlled tensor-product representations; this computational assumption is separate from the general matrix-valued coefficient class used in the analysis. Experiments with scalar locally periodic coefficients show accurate high-order correctors. The H^1 semi-norm errors are consistent with the proved estimate, while point-normalized L^2 errors display the nominal high-order behavior predicted by the formal expansion.
ER  -