Fast macroscopic forcing method
From MaRDI portal
Publication:6196620
DOI10.1016/j.jcp.2023.112721arXiv2306.13625MaRDI QIDQ6196620
No author found.
Publication date: 14 March 2024
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.13625
Algorithms in computer science (68Wxx) Numerical linear algebra (65Fxx) Numerical methods for partial differential equations, boundary value problems (65Nxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- The Random Feature Model for Input-Output Maps between Banach Spaces
- Nonlocal expression for scalar flux in turbulent shear flow
- Nonlocal analysis of the Reynolds stress in turbulent shear flow
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- Compressing Rank-Structured Matrices via Randomized Sampling
- Numerical homogenization beyond scale separation
- Convergence Rates for Learning Linear Operators from Noisy Data
This page was built for publication: Fast macroscopic forcing method